{"meta":{"query_hash":"6222d1cbbe78","filters":{"topic":"Advanced Data Compression Techniques"},"cohort_total":855,"direct_labels_cover":0,"predictions_cover":855,"exported":855,"export_cap":100000,"truncated":false,"label_status":"direct model label, unvalidated","prediction_status":"machine_predicted_unvalidated (Codex and Gemma teacher distillation)","score_status":"score_only:v0-immature-baseline","snapshot":{"source":"OpenAlex, pinned release, all 482 partitions","release":"2026-06-24","frame_built":"2026-07-12"},"permalink":"https://metacan.xera.ac/q/6222d1cbbe78","api":"https://metacan.xera.ac/api/v1/cohort?topic=Advanced+Data+Compression+Techniques"},"results":[{"id":"W1018362173","doi":"10.1007/978-0-387-69216-6_12","title":"Image Compression The JPEG Standard","year":2008,"lang":"en","type":"book-chapter","venue":"Springer undergraduate texts in mathematics and technology","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"","keywords":"JPEG; JPEG 2000; Compression (physics); Computer science; Image compression; Lossless JPEG; Computer vision; Artificial intelligence; Data compression; Materials science; Image (mathematics); Image processing; Composite material","score_opus":0.015381444538342543,"score_gpt":0.256895179100971,"score_spread":0.24151373456262845,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1018362173","genre_codex":"other","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0073271026,0.12131455,0.22870049,0.0032923163,0.006456455,0.00025780997,0.0011950277,0.003430265,0.6280259],"genre_scores_gemma":[0.08101534,0.09622253,0.111371614,0.0020949668,0.0037089137,0.00018299489,0.0023840861,0.0008693724,0.70215017],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9997185,0.000018178984,0.000011113395,0.000035139627,0.00019624319,0.000020788986],"domain_scores_gemma":[0.9998103,0.00003368946,0.000008193021,0.000038371418,0.00009590591,0.000013504646],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020349468,0.00064675073,0.00034294018,0.0016312506,0.0002462535,0.0011918684,0.0004445204,0.00074660406,0.018374763],"category_scores_gemma":[0.00069637335,0.00028204967,0.00022486103,0.0019984276,0.00066760933,0.0013523832,0.0005851118,0.0014917544,0.011761531],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007298109,0.00003489277,0.00015045189,0.00037692534,0.000018207833,0.00013184667,0.00008532012,0.0012653966,0.026101422,0.094434015,0.16983248,0.7074961],"study_design_scores_gemma":[0.000020125068,0.00007650196,0.0011853991,0.00026803376,0.000017519647,0.0009813213,0.0000424547,0.0047782795,0.019981248,0.02926484,0.94334984,0.00003447868],"about_ca_topic_score_codex":0.00096105307,"about_ca_topic_score_gemma":0.0011765637,"teacher_disagreement_score":0.018374763,"about_ca_system_score_codex":0.00039285194,"about_ca_system_score_gemma":0.00047133185,"threshold_uncertainty_score":0.061469734},"labels":[],"label_agreement":null},{"id":"W1028270190","doi":"10.1007/978-3-319-05290-8_13","title":"Basic Audio Compression Techniques","year":2014,"lang":"en","type":"book-chapter","venue":"Texts in computer science","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Computer science; Compression (physics); Dynamic range compression; Telecommunications; Materials science","score_opus":0.018614880244119926,"score_gpt":0.2782939098635583,"score_spread":0.25967902961943834,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1028270190","genre_codex":"other","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005835164,0.055268396,0.44438672,0.0011697193,0.0034647458,0.00036924522,0.0011336107,0.0040478753,0.48432457],"genre_scores_gemma":[0.038993467,0.05154902,0.15326175,0.0009907708,0.0031331899,0.00031909076,0.0021844413,0.0009219985,0.74864626],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99967587,0.000010770837,0.000012259191,0.00004856869,0.0002305713,0.000021935555],"domain_scores_gemma":[0.9997708,0.00006157728,0.000010193936,0.000042102212,0.00010037965,0.000014910374],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019917249,0.0012330596,0.0005899944,0.0021559321,0.0005323782,0.0012963415,0.0009382974,0.00094005046,0.04743714],"category_scores_gemma":[0.0005842132,0.0004231405,0.00045598677,0.0018740399,0.0006671781,0.0015337258,0.00074921007,0.0016300506,0.03799123],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000058092926,0.000058665264,0.00008174233,0.0005764902,0.000013208921,0.00012186577,0.00012371984,0.00090400694,0.04924813,0.02120435,0.040283017,0.8873268],"study_design_scores_gemma":[0.000026077963,0.00014827117,0.0012138841,0.0004428088,0.000036700636,0.0018975642,0.00009167737,0.005631191,0.058553386,0.025590297,0.906311,0.000057065423],"about_ca_topic_score_codex":0.0003700439,"about_ca_topic_score_gemma":0.0005262849,"teacher_disagreement_score":0.04743714,"about_ca_system_score_codex":0.00035070797,"about_ca_system_score_gemma":0.00042387846,"threshold_uncertainty_score":0.15869302},"labels":[],"label_agreement":null},{"id":"W107089405","doi":"","title":"A Unified Framework for Image Set Compression.","year":2006,"lang":"en","type":"article","venue":"IPCV","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta; University of Lethbridge","funders":"","keywords":"Lossless compression; Lossy compression; Image compression; Redundancy (engineering); Data compression; Computer science; Algorithm; Spanning tree; Compression (physics); Image (mathematics); Texture compression; Set (abstract data type); Graph; Data compression ratio; Mathematics; Theoretical computer science; Artificial intelligence; Image processing; Discrete mathematics","score_opus":0.02221753158074233,"score_gpt":0.3216749199940123,"score_spread":0.29945738841326996,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W107089405","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0007659115,0.00082613237,0.9953259,0.00019119724,0.00009001817,0.000081866856,0.00007284709,0.0002678713,0.002378162],"genre_scores_gemma":[0.044372074,0.0030125866,0.94663906,0.00029248683,0.00036546,0.00038713688,0.00044812215,0.00015467528,0.0043284507],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984754,0.00028063136,0.000080069825,0.00016686537,0.0009257382,0.00007123018],"domain_scores_gemma":[0.99920696,0.00019058023,0.00006442375,0.00029088077,0.00020007123,0.000046998855],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012453567,0.00093489396,0.001025822,0.0029203435,0.00071694463,0.002142253,0.0020588238,0.0011310256,0.0029741784],"category_scores_gemma":[0.0025558346,0.00044691947,0.0012120255,0.0033918137,0.0015625465,0.0030298769,0.0025322528,0.0023929463,0.0013659514],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000055029992,0.00008643153,0.00016600623,0.00034098473,0.00008772677,0.00020815413,0.00015648326,0.06363973,0.012507026,0.69440365,0.01219997,0.21614878],"study_design_scores_gemma":[0.00003821335,0.00019226456,0.00034164087,0.00013814344,0.000061848834,0.0012654574,0.000094684365,0.52661616,0.01008823,0.3818075,0.079285644,0.00007027921],"about_ca_topic_score_codex":0.0011761021,"about_ca_topic_score_gemma":0.0016112262,"teacher_disagreement_score":0.0029741784,"about_ca_system_score_codex":0.0009766588,"about_ca_system_score_gemma":0.0012507454,"threshold_uncertainty_score":0.009949625},"labels":[],"label_agreement":null},{"id":"W11195272","doi":"","title":"Transmision Progresiva de imagenes JPEG2000","year":2003,"lang":"en","type":"article","venue":"","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Art","score_opus":0.008569974394037809,"score_gpt":0.266086717785805,"score_spread":0.2575167433917672,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W11195272","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16136321,0.0064838645,0.6992665,0.0019315346,0.0023547262,0.0012145021,0.0035389324,0.024439054,0.099407725],"genre_scores_gemma":[0.2870484,0.0051949904,0.55804247,0.0007895963,0.0007833164,0.0005818552,0.0042939554,0.0033454886,0.13991994],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990958,0.00010902467,0.000044799228,0.00013961567,0.0005319814,0.00007882104],"domain_scores_gemma":[0.99950635,0.000113857335,0.000044842905,0.00010321804,0.00020483788,0.000026990412],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00095074176,0.001112006,0.0003634388,0.0013955934,0.00046585762,0.002287516,0.00048935076,0.0005647576,0.020163719],"category_scores_gemma":[0.0018426216,0.00037472343,0.00044263367,0.00066508463,0.00043514936,0.0010102196,0.00070440094,0.002025902,0.009920426],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0013697081,0.00017983717,0.0012822027,0.00043214564,0.000081912294,0.0006989702,0.0004100238,0.0038616543,0.16070978,0.013286021,0.030179817,0.7875079],"study_design_scores_gemma":[0.00053686707,0.0006295655,0.013721219,0.0002875264,0.0000897423,0.006410572,0.00025787516,0.047732648,0.51124513,0.0049812496,0.41393957,0.00016797597],"about_ca_topic_score_codex":0.0035557922,"about_ca_topic_score_gemma":0.0034029053,"teacher_disagreement_score":0.020163719,"about_ca_system_score_codex":0.0006199982,"about_ca_system_score_gemma":0.000501283,"threshold_uncertainty_score":0.06745434},"labels":[],"label_agreement":null},{"id":"W12033547","doi":"10.1111/j.1552-6909.2002.tb00056.x","title":"Adaptive Image Transmission Scheme over Wavelet-Based OFDM System","year":2005,"lang":"en","type":"article","venue":"电子学报：英文版","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Wavelet; Computer science; Scheme (mathematics); Transmission (telecommunications); Image (mathematics); Artificial intelligence; Computer vision; Mathematics; Telecommunications","score_opus":0.011318890031622807,"score_gpt":0.25777847100890844,"score_spread":0.24645958097728562,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W12033547","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10126684,0.001207898,0.8865607,0.0006991884,0.00043315042,0.000109131186,0.00015965685,0.0009085208,0.008654888],"genre_scores_gemma":[0.734995,0.0015226492,0.24913852,0.00027732094,0.00029824724,0.00014855377,0.0003175031,0.00004038894,0.013261786],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99971944,0.00006388362,0.000017641767,0.000045012086,0.00010841867,0.00004556848],"domain_scores_gemma":[0.99968815,0.00011171092,0.000035877358,0.000045953704,0.00010323908,0.000015185925],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004181624,0.00042414968,0.00041250602,0.0004593236,0.0003424129,0.00045484872,0.0004906064,0.0006188417,0.0022484665],"category_scores_gemma":[0.0011708232,0.000103777194,0.00019777118,0.0005925704,0.00026798286,0.0005988,0.0003835089,0.0004272802,0.0007656975],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010028057,0.00021112403,0.0010938883,0.00025021986,0.000054479886,0.00051512214,0.00023501813,0.0607056,0.18023191,0.014736406,0.0063074646,0.734656],"study_design_scores_gemma":[0.00009174482,0.00042915682,0.0014440434,0.00005061337,0.000066284614,0.00072558445,0.00005985079,0.9336548,0.049407363,0.0033930538,0.0106397495,0.000037739537],"about_ca_topic_score_codex":0.0011412948,"about_ca_topic_score_gemma":0.0011937761,"teacher_disagreement_score":0.0022484665,"about_ca_system_score_codex":0.00023909344,"about_ca_system_score_gemma":0.0003175197,"threshold_uncertainty_score":0.0075218678},"labels":[],"label_agreement":null},{"id":"W128307627","doi":"10.1007/978-3-319-05290-8_11","title":"MPEG Video Coding: MPEG-1, 2, 4, and 7","year":2014,"lang":"en","type":"book-chapter","venue":"Texts in computer science","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"MPEG-4; Computer science; MPEG-2; Coding (social sciences); Computer hardware; Mathematics","score_opus":0.019994645343708758,"score_gpt":0.27141665328657977,"score_spread":0.251422007942871,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W128307627","genre_codex":"other","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005591816,0.15466754,0.33857948,0.0034385945,0.009641677,0.00052311836,0.0032622716,0.005083901,0.47921163],"genre_scores_gemma":[0.03190372,0.1119089,0.13533999,0.0023942222,0.0044619422,0.00039879335,0.008329588,0.0023891164,0.7028738],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9996754,0.000018224859,0.00001545892,0.0000253255,0.00024473772,0.000020758967],"domain_scores_gemma":[0.9996124,0.00006651858,0.000018612865,0.00003696125,0.0002420953,0.000023428378],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030676147,0.0011229899,0.0005452717,0.0021959937,0.00040750258,0.0012151354,0.0010663433,0.0010806477,0.03812132],"category_scores_gemma":[0.00091618404,0.00033833066,0.00027273723,0.0030543734,0.00059163873,0.0013222087,0.0005107842,0.0015296304,0.025805445],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006052097,0.000037953938,0.00010164948,0.0004399173,0.000012894582,0.00007830726,0.00010382647,0.0018064134,0.0117379315,0.03414474,0.23211233,0.71936345],"study_design_scores_gemma":[0.000012038723,0.00005098938,0.00056472165,0.00045833673,0.000016902457,0.0004948939,0.00005897422,0.0041035134,0.008084141,0.018545346,0.96757174,0.000038537655],"about_ca_topic_score_codex":0.003195378,"about_ca_topic_score_gemma":0.0038064448,"teacher_disagreement_score":0.03812132,"about_ca_system_score_codex":0.0007497972,"about_ca_system_score_gemma":0.00087179505,"threshold_uncertainty_score":0.12752849},"labels":[],"label_agreement":null},{"id":"W129115577","doi":"10.1007/978-1-4615-1527-2_9","title":"Parallel Processing for Image Restoration","year":2001,"lang":"en","type":"book-chapter","venue":"˜The œKluwer international series on Asian studies in computer and information science","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Computer science; Block (permutation group theory); Jump; Image (mathematics); Computation; Matching (statistics); Algorithm; Image restoration; Blossom algorithm; Coding (social sciences); Transmission (telecommunications); Image processing; Artificial intelligence; Mathematics","score_opus":0.03706614385815926,"score_gpt":0.33320199584445837,"score_spread":0.2961358519862991,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W129115577","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0021357227,0.02997299,0.8481157,0.0016482492,0.0028804333,0.00014129053,0.0004475386,0.005345387,0.10931265],"genre_scores_gemma":[0.055153508,0.031521637,0.5711792,0.00093019725,0.0026401423,0.0003708245,0.0016452539,0.0015274092,0.33503187],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996215,0.000060039856,0.000024557354,0.00008489446,0.00018579155,0.00002320547],"domain_scores_gemma":[0.9996773,0.00006393589,0.000017174276,0.00013271815,0.00009725919,0.000011639884],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036016677,0.001186297,0.0011646071,0.0009793409,0.0005061011,0.001698956,0.0010414509,0.0010368777,0.035414018],"category_scores_gemma":[0.00092973834,0.00056013203,0.0004935645,0.0021046714,0.0007511589,0.0016294647,0.0011460088,0.0016972206,0.018834451],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007079188,0.000050695457,0.00008671411,0.0005177127,0.00005152454,0.000116480245,0.00006419015,0.010736697,0.0077314246,0.12208897,0.1310804,0.7274045],"study_design_scores_gemma":[0.000039503397,0.00009057046,0.00040993775,0.00017357872,0.00006725415,0.00066363916,0.000037980917,0.1038267,0.013281276,0.24046105,0.6409052,0.000043287422],"about_ca_topic_score_codex":0.00086379144,"about_ca_topic_score_gemma":0.0010296578,"teacher_disagreement_score":0.035414018,"about_ca_system_score_codex":0.00043510683,"about_ca_system_score_gemma":0.00048589284,"threshold_uncertainty_score":0.11847168},"labels":[],"label_agreement":null},{"id":"W1483335260","doi":"10.1007/3-540-36228-2_64","title":"Inter-subband Redundancy Prediction Using Neural Network for Video Coding","year":2002,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Computer science; Codec; Redundancy (engineering); Wavelet; Coding (social sciences); Multiview Video Coding; Artificial neural network; Video compression picture types; Quality of service; Artificial intelligence; Real-time computing; Video quality; Video processing; Video tracking; Computer vision; Speech recognition; Computer network; Telecommunications","score_opus":0.036130753935369665,"score_gpt":0.2831169653874189,"score_spread":0.24698621145204921,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1483335260","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.060711868,0.0035735264,0.9277912,0.00022417893,0.00024720715,0.000046071425,0.00014299477,0.0010679496,0.006195011],"genre_scores_gemma":[0.6712145,0.00225405,0.3124465,0.000120824465,0.0001250052,0.00007027072,0.00029271314,0.000083983614,0.013392208],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9999434,0.0000094075585,0.000003525568,0.000012930289,0.000022444405,0.000008278329],"domain_scores_gemma":[0.99988616,0.000043291657,0.0000087811195,0.0000116705305,0.00004772161,0.0000023932344],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017884916,0.00030294913,0.00023700511,0.0002401123,0.0001345643,0.00022674288,0.00038428933,0.00041208687,0.0016175314],"category_scores_gemma":[0.00041756488,0.00013520842,0.00018622843,0.00036684563,0.0001224168,0.00041226094,0.00016434382,0.00046270434,0.0003096661],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019702809,0.00009559091,0.00046932514,0.00013275599,0.000045625515,0.00009443643,0.000030149464,0.21431822,0.06520127,0.005440006,0.0035302225,0.71044534],"study_design_scores_gemma":[0.0000035131538,0.000030170217,0.0002644617,0.000008081637,0.000013545675,0.00002604715,0.0000036441872,0.9852064,0.01299861,0.00076303066,0.00067713595,0.000005253509],"about_ca_topic_score_codex":0.0042265593,"about_ca_topic_score_gemma":0.0064695035,"teacher_disagreement_score":0.0042265593,"about_ca_system_score_codex":0.00030091114,"about_ca_system_score_gemma":0.00019597007,"threshold_uncertainty_score":0.008403957},"labels":[],"label_agreement":null},{"id":"W1484027999","doi":"10.1109/icassp.2000.861917","title":"Pitch-synchronous linear-prediction analysis by synthesis with reduced pulse densities","year":2002,"lang":"en","type":"article","venue":"","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Institut National de la Recherche Scientifique","funders":"","keywords":"Codebook; Code-excited linear prediction; Speech coding; Linear prediction; Computer science; Speech recognition; Residual; Linear predictive coding; Algorithm; Quantization (signal processing); Codec; Mathematics; Telecommunications","score_opus":0.012255184677055275,"score_gpt":0.2252702010694344,"score_spread":0.21301501639237913,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1484027999","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.055179283,0.00013242925,0.9419632,0.00005204197,0.000016783813,0.000027963804,0.000035309196,0.00058712,0.0020059997],"genre_scores_gemma":[0.58079773,0.00030760784,0.41495857,0.00003854186,0.000021699592,0.00007330258,0.00012166084,0.0001233403,0.0035575842],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998733,0.00002688649,0.0000059389827,0.0000126665545,0.00007112015,0.000010084223],"domain_scores_gemma":[0.9997371,0.00013993344,0.000027223146,0.000037844104,0.00005019888,0.000007755038],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027835878,0.0002735834,0.00019095386,0.00016971664,0.00008829366,0.00031160738,0.0002328322,0.00020961372,0.001894843],"category_scores_gemma":[0.0007498629,0.0001322808,0.00016677598,0.00016789671,0.00030959112,0.00031412634,0.00022439925,0.00031882737,0.0003999702],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005425096,0.00007549882,0.00067822146,0.00022757135,0.000039140454,0.00020758325,0.00017684155,0.37501118,0.38419452,0.03842785,0.00075674383,0.19966234],"study_design_scores_gemma":[0.000027081393,0.00011357297,0.0002715035,0.000013293677,0.000015352454,0.00009024635,0.000015304695,0.86762357,0.12636419,0.0032800913,0.0021720654,0.0000137591205],"about_ca_topic_score_codex":0.00066835,"about_ca_topic_score_gemma":0.00088793476,"teacher_disagreement_score":0.001894843,"about_ca_system_score_codex":0.00026889195,"about_ca_system_score_gemma":0.00030536522,"threshold_uncertainty_score":0.0063388348},"labels":[],"label_agreement":null},{"id":"W1484056439","doi":"10.1109/pacrim.2003.1235761","title":"Application of compression and satellite communications to cockpit video transmission","year":2004,"lang":"en","type":"article","venue":"","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"National Research Council Canada","funders":"","keywords":"Computer science; Communications satellite; Baud; Cockpit; Geostationary orbit; Data compression; Real-time computing; Videotelephony; Bandwidth (computing); Transmission (telecommunications); Satellite; Telecommunications; Engineering; Computer vision","score_opus":0.015808252236428257,"score_gpt":0.30099623898964206,"score_spread":0.28518798675321383,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1484056439","genre_codex":"empirical","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.50110537,0.005316504,0.44099352,0.00072916056,0.00033837915,0.0007158194,0.0001614436,0.0018232223,0.048816603],"genre_scores_gemma":[0.8658872,0.0026497748,0.11629145,0.00017406116,0.00021490693,0.00009917744,0.00024961305,0.00006576111,0.014368095],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99978596,0.000024789564,0.000008616543,0.000027570253,0.00013476715,0.000018328323],"domain_scores_gemma":[0.99971956,0.000103644525,0.000020051673,0.000036639758,0.00010452448,0.000015595942],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016335999,0.000293777,0.00021846691,0.0004960728,0.00025577247,0.00030406695,0.0003445855,0.000547419,0.0021134878],"category_scores_gemma":[0.0008953716,0.00010518425,0.00012726929,0.0005709768,0.0002765576,0.00034560027,0.00024661535,0.00030063756,0.0003106265],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00046933335,0.00016075044,0.0014177905,0.00032799935,0.000030276007,0.0015170355,0.0003346227,0.015403102,0.5962136,0.005504871,0.0023966904,0.37622395],"study_design_scores_gemma":[0.00012006019,0.002196281,0.006634241,0.00011650735,0.00006929902,0.005967574,0.00018263607,0.14588559,0.7989608,0.0030484635,0.03675294,0.00006551733],"about_ca_topic_score_codex":0.0016063023,"about_ca_topic_score_gemma":0.0011127202,"teacher_disagreement_score":0.0021134878,"about_ca_system_score_codex":0.00023141729,"about_ca_system_score_gemma":0.00017275216,"threshold_uncertainty_score":0.007070303},"labels":[],"label_agreement":null},{"id":"W1487470981","doi":"10.1109/icip.2004.1418804","title":"Lossless compression of color mosaic images","year":2005,"lang":"en","type":"article","venue":"","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":23,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Lossless compression; Golomb coding; Lossy compression; Computer science; Artificial intelligence; Data compression; Computer vision; Lossless JPEG; Arithmetic coding; Image compression; Wavelet transform; Context-adaptive binary arithmetic coding; Algorithm; Wavelet; Image processing; Image (mathematics)","score_opus":0.011656700675952364,"score_gpt":0.2815662978486681,"score_spread":0.26990959717271573,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1487470981","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11038623,0.0007263359,0.8840731,0.0001656382,0.00009378313,0.000086482054,0.00016446113,0.0009624837,0.0033414175],"genre_scores_gemma":[0.35839552,0.0006905484,0.63552636,0.000120002915,0.00010488204,0.00007423807,0.00041239406,0.00014581453,0.004530269],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9998951,0.000008343935,0.0000040918967,0.000011800909,0.00006990931,0.000010710422],"domain_scores_gemma":[0.9998455,0.000029815654,0.000016065052,0.00004265542,0.00005240076,0.000013421446],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015217284,0.00029648351,0.0002637785,0.00046820156,0.0001645985,0.0003272503,0.00035154397,0.0002425712,0.0011652891],"category_scores_gemma":[0.00053028506,0.000098817836,0.00013830194,0.00047220758,0.00021944141,0.00040787648,0.00036812227,0.00030704617,0.00043026273],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004040564,0.00007105928,0.0007140091,0.00012996468,0.00002166541,0.00031921346,0.00010323891,0.017720269,0.47917533,0.009524003,0.0029738452,0.48884332],"study_design_scores_gemma":[0.00007824319,0.00031557304,0.0038246901,0.000027049848,0.00003728716,0.0015185308,0.000045043307,0.4687658,0.50275284,0.006705841,0.01589427,0.000034807195],"about_ca_topic_score_codex":0.0004488424,"about_ca_topic_score_gemma":0.00061975623,"teacher_disagreement_score":0.0011652891,"about_ca_system_score_codex":0.00018346887,"about_ca_system_score_gemma":0.00021207453,"threshold_uncertainty_score":0.0038983226},"labels":[],"label_agreement":null},{"id":"W1487850637","doi":"10.1109/ccece.1995.526425","title":"Predictive vector quantization using neural networks","year":2002,"lang":"en","type":"article","venue":"","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Vector quantization; Learning vector quantization; Computer science; Artificial intelligence; Artificial neural network; Pattern recognition (psychology); Quantization (signal processing); Predictive coding; Predicative expression; Data compression; Image compression; Coding (social sciences); Computer vision; Image (mathematics); Image processing; Mathematics","score_opus":0.0392438678830693,"score_gpt":0.27732463293265225,"score_spread":0.23808076504958295,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1487850637","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0075373324,0.0024037827,0.9861325,0.00031249388,0.00019375246,0.000037706843,0.000048962,0.0004813031,0.0028523095],"genre_scores_gemma":[0.5256665,0.0053647812,0.4567787,0.00057446794,0.0005042027,0.0001921748,0.000358127,0.000107863336,0.010453217],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996153,0.000065993634,0.000028031358,0.000053843174,0.0002108862,0.000025840594],"domain_scores_gemma":[0.9995641,0.0001952387,0.00003574341,0.000056651756,0.00013768525,0.000010670498],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00065019255,0.0004006002,0.000544935,0.0005449306,0.0002802027,0.0007413692,0.0009242702,0.0007468758,0.0014536668],"category_scores_gemma":[0.0015630771,0.00025234115,0.000290975,0.0009203084,0.00056585466,0.00144631,0.00051717315,0.0010241244,0.00054145884],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014168554,0.00006551532,0.00064567337,0.00018426607,0.00007453739,0.000111025656,0.00007443248,0.20622526,0.015837109,0.059196677,0.0041786656,0.7132651],"study_design_scores_gemma":[0.00002007793,0.000091301095,0.00018023995,0.000026894106,0.00002386579,0.00007541725,0.000009180414,0.9695976,0.008434652,0.014669128,0.00685048,0.000021256332],"about_ca_topic_score_codex":0.002982917,"about_ca_topic_score_gemma":0.0029958966,"teacher_disagreement_score":0.002982917,"about_ca_system_score_codex":0.0004646261,"about_ca_system_score_gemma":0.00044539457,"threshold_uncertainty_score":0.0059310794},"labels":[],"label_agreement":null},{"id":"W1490366898","doi":"10.1109/icip.2003.1246669","title":"A new decoding algorithm based on range block mean and contrast scaling","year":2004,"lang":"en","type":"article","venue":"","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":21,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Decoding methods; Algorithm; Contrast (vision); Sequential decoding; Block (permutation group theory); Computer science; Scaling; Fractal; List decoding; Range (aeronautics); Berlekamp–Welch algorithm; Mathematics; Block code; Artificial intelligence; Concatenated error correction code; Combinatorics","score_opus":0.013937466217915834,"score_gpt":0.2633497287284444,"score_spread":0.2494122625105286,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1490366898","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005006076,0.00024594538,0.9925662,0.00006448349,0.00010135877,0.000030001624,0.00003795875,0.0006336162,0.0013143583],"genre_scores_gemma":[0.050921947,0.0003824898,0.94262874,0.00010414373,0.00013779431,0.0001108472,0.0002484379,0.00022763942,0.0052379095],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994467,0.00005170217,0.000039881917,0.00008710014,0.00034200778,0.000032567066],"domain_scores_gemma":[0.9992316,0.00023088197,0.000055514494,0.000120939636,0.0003233511,0.000037683112],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041922028,0.0006972698,0.0007517156,0.0011383074,0.00040981,0.00087615364,0.00074325793,0.0010407047,0.0024346877],"category_scores_gemma":[0.0021518224,0.00029265182,0.0004972495,0.00095616677,0.00052570534,0.0015084638,0.0007964631,0.0010814731,0.00183991],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016283111,0.000050611863,0.0007511641,0.00015851398,0.000053296277,0.00017412643,0.00012720846,0.03476586,0.13489448,0.02954403,0.0054409737,0.7938769],"study_design_scores_gemma":[0.00006144613,0.00012975153,0.0006902249,0.00003228979,0.000052854924,0.0014568856,0.000031335432,0.8513494,0.11306182,0.009796088,0.023255685,0.00008226487],"about_ca_topic_score_codex":0.0013253633,"about_ca_topic_score_gemma":0.0014647014,"teacher_disagreement_score":0.0024346877,"about_ca_system_score_codex":0.0004589949,"about_ca_system_score_gemma":0.0006332491,"threshold_uncertainty_score":0.008144915},"labels":[],"label_agreement":null},{"id":"W1492112506","doi":"10.1109/icupc.1995.497123","title":"ITU-T 8-kbit/s standard speech codec for personal communication services","year":2002,"lang":"en","type":"article","venue":"","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Sherbrooke","funders":"","keywords":"Computer science; Codebook; Codec; Speech coding; Quantization (signal processing); Speech recognition; Inter frame; Vector quantization; Pulse-code modulation; Code-excited linear prediction; Frame (networking); Telecommunications; Linear predictive coding; Algorithm; Reference frame","score_opus":0.027022715952943546,"score_gpt":0.2884163344745439,"score_spread":0.26139361852160037,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1492112506","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.030998997,0.011573006,0.5418719,0.0052330857,0.007553541,0.003918748,0.029355993,0.018232487,0.35126227],"genre_scores_gemma":[0.14602299,0.015131152,0.4304727,0.002926322,0.0029497065,0.0055280635,0.08915774,0.0036150003,0.30419627],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99755967,0.00065520237,0.0002583025,0.000145146,0.0011472037,0.00023444986],"domain_scores_gemma":[0.99708134,0.00026979944,0.00014159168,0.00039974824,0.0019905712,0.00011694272],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001784123,0.0012067569,0.00069971685,0.0023679503,0.000637136,0.0014034617,0.0009913992,0.0021897722,0.02620646],"category_scores_gemma":[0.00497625,0.00025181047,0.00033603964,0.0022481466,0.0006569715,0.0007668012,0.0011189678,0.0012481367,0.048866086],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0013352504,0.00031805362,0.0015970571,0.0013400433,0.00007155902,0.000937055,0.0005673569,0.007818829,0.09061183,0.04948887,0.33971837,0.5061956],"study_design_scores_gemma":[0.00014510547,0.00032723858,0.002888092,0.00035211738,0.000095883806,0.0011386359,0.00016157147,0.014907812,0.040927187,0.008653095,0.9303151,0.00008822176],"about_ca_topic_score_codex":0.0028563656,"about_ca_topic_score_gemma":0.0021527798,"teacher_disagreement_score":0.02620646,"about_ca_system_score_codex":0.0010736699,"about_ca_system_score_gemma":0.0021060319,"threshold_uncertainty_score":0.08766937},"labels":[],"label_agreement":null},{"id":"W1494881045","doi":"10.1109/iembs.2003.1279896","title":"ROI coding with integer wavelet transforms and unbalanced spatial orientation trees","year":2004,"lang":"en","type":"article","venue":"","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Set partitioning in hierarchical trees; Wavelet; Wavelet transform; Mathematics; Pattern recognition (psychology); Artificial intelligence; Coding (social sciences); Discrete wavelet transform; Stationary wavelet transform; Wavelet packet decomposition; Computer science; Algorithm; Second-generation wavelet transform; Statistics","score_opus":0.007420829757124692,"score_gpt":0.2404328845228956,"score_spread":0.23301205476577092,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1494881045","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011001513,0.00029251052,0.98757404,0.000057881112,0.00002889333,0.000028215512,0.00003447864,0.00026338466,0.00071910175],"genre_scores_gemma":[0.14510202,0.00069475104,0.85221016,0.000116993855,0.00007531141,0.000096225136,0.00019785792,0.00012168963,0.0013849776],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99955434,0.00009744497,0.000031880467,0.000042711254,0.00023555759,0.000037974052],"domain_scores_gemma":[0.9989532,0.00046687026,0.000149923,0.0001949713,0.00020485732,0.000030129324],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006426487,0.0004891843,0.0003892278,0.0008439023,0.00014545146,0.00052959454,0.0006646006,0.0005269872,0.0009768496],"category_scores_gemma":[0.0029793766,0.00018359332,0.00032885943,0.0008349506,0.00040477945,0.0014592619,0.00063326454,0.00068168057,0.000522077],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005700581,0.000064764725,0.00092440663,0.00028717544,0.000053070966,0.0007596345,0.00026449532,0.10143161,0.26760483,0.06902243,0.0026357286,0.55638176],"study_design_scores_gemma":[0.000037279184,0.00030358142,0.00086944236,0.000065754655,0.00004809007,0.0015531239,0.000058775942,0.8076601,0.16351287,0.013540646,0.012294796,0.000055541157],"about_ca_topic_score_codex":0.00052851514,"about_ca_topic_score_gemma":0.00070670084,"teacher_disagreement_score":0.0009768496,"about_ca_system_score_codex":0.00027762624,"about_ca_system_score_gemma":0.00035988243,"threshold_uncertainty_score":0.0033986568},"labels":[],"label_agreement":null},{"id":"W1497377008","doi":"10.1109/ccece.1995.528091","title":"Real-time VLSI architecture for video compression","year":2002,"lang":"en","type":"article","venue":"","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Computer science; Very-large-scale integration; Data compression; Vector quantization; Image compression; Signal compression; Cache; Computer architecture; Computer hardware; Real-time computing; Embedded system; Image processing; Artificial intelligence; Signal processing; Parallel computing; Digital signal processing; Image (mathematics)","score_opus":0.019349745729269657,"score_gpt":0.2716725665805028,"score_spread":0.25232282085123314,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1497377008","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.037898794,0.0060760584,0.9006223,0.00087173784,0.00061736046,0.00024922934,0.00027796833,0.008205579,0.045181002],"genre_scores_gemma":[0.522653,0.0030432728,0.4239412,0.00094713754,0.00030692306,0.00028348112,0.0009532733,0.0002314299,0.047640275],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998363,0.000020082416,0.000008977986,0.00001989006,0.00009650441,0.000018165943],"domain_scores_gemma":[0.99985707,0.00002350206,0.000009530638,0.000019981124,0.00008257072,0.0000072694147],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001506458,0.0002551735,0.00015975571,0.0002906886,0.00018192912,0.0004496132,0.00094642036,0.0003456433,0.0084208455],"category_scores_gemma":[0.00039095106,0.00010562419,0.00014036054,0.0003336326,0.00012613962,0.00047852937,0.00018472431,0.00042246844,0.0030648485],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022978173,0.00012045208,0.00055749353,0.0005320432,0.00006480117,0.00028409783,0.00013169082,0.012886026,0.36303902,0.039557762,0.023369193,0.5592277],"study_design_scores_gemma":[0.00032521345,0.0019829317,0.001630186,0.0002194314,0.00016798737,0.0021683597,0.00008248501,0.2870604,0.37494853,0.017857345,0.31346858,0.000088558496],"about_ca_topic_score_codex":0.0006321068,"about_ca_topic_score_gemma":0.0009693968,"teacher_disagreement_score":0.0084208455,"about_ca_system_score_codex":0.0003673053,"about_ca_system_score_gemma":0.00029160597,"threshold_uncertainty_score":0.028170586},"labels":[],"label_agreement":null},{"id":"W1497734534","doi":"10.1109/asap.2015.7245717","title":"Stochastic circuit design and performance evaluation of vector quantization","year":2015,"lang":"en","type":"article","venue":"","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Stochastic computing; Computer science; Binary number; Algorithm; Vector quantization; Scalability; Data compression; Quantization (signal processing); Binary code; Integrated circuit design; Theoretical computer science; Computer engineering; Computation; Mathematics; Arithmetic; Embedded system","score_opus":0.14687856910231917,"score_gpt":0.33073453697501615,"score_spread":0.18385596787269698,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1497734534","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4983681,0.0020004013,0.47988617,0.0006911053,0.00021538914,0.00024976226,0.00038041055,0.0020942746,0.016114343],"genre_scores_gemma":[0.9355658,0.00027604424,0.06240603,0.00007057597,0.000028003737,0.000064271175,0.00014821113,0.000044125187,0.0013968439],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99920875,0.00014410794,0.000051477346,0.00009861105,0.00042247848,0.00007459243],"domain_scores_gemma":[0.999129,0.00024325009,0.00013680027,0.00009938316,0.0003703589,0.000021077825],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047009005,0.0002685087,0.00024534983,0.00035927276,0.00022571938,0.0005287084,0.00067672424,0.00032220111,0.0015601128],"category_scores_gemma":[0.0018248474,0.00012378323,0.00015913966,0.0004811305,0.00024066053,0.0006176897,0.00021573681,0.0002448642,0.00022747672],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00059498765,0.00017727805,0.0035795807,0.0006844309,0.000118704644,0.0002473616,0.00018767273,0.21453467,0.5046762,0.040126167,0.0041927816,0.23088005],"study_design_scores_gemma":[0.000089047244,0.001864526,0.0021647564,0.000049676015,0.00007092116,0.00043127936,0.000057860765,0.60767597,0.36996937,0.0035996772,0.013977014,0.000049854174],"about_ca_topic_score_codex":0.0013903845,"about_ca_topic_score_gemma":0.0013867227,"teacher_disagreement_score":0.0015601128,"about_ca_system_score_codex":0.00085783284,"about_ca_system_score_gemma":0.00065600296,"threshold_uncertainty_score":0.006224036},"labels":[],"label_agreement":null},{"id":"W1497843320","doi":"10.1109/iscas.1994.409118","title":"Multiresolution image coding using IIR digital filters","year":2002,"lang":"en","type":"article","venue":"","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Decimation; Infinite impulse response; Coding (social sciences); Computer science; 2D Filters; Artificial intelligence; Computer vision; Digital image; Digital filter; Image processing; Filter (signal processing); Algorithm; Mathematics; Image (mathematics)","score_opus":0.04676974829018747,"score_gpt":0.27710267641697905,"score_spread":0.23033292812679157,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1497843320","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01258061,0.0011829862,0.98135984,0.00010469917,0.000058629845,0.000033581673,0.000024185872,0.00018105772,0.0044743363],"genre_scores_gemma":[0.2112614,0.0032825393,0.7775334,0.00027533737,0.00015038058,0.0000828163,0.000103542014,0.00011987646,0.007190675],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99969864,0.000053763408,0.000013856604,0.00004524648,0.00016142434,0.000027132242],"domain_scores_gemma":[0.99962294,0.0001982665,0.000038948798,0.000062283165,0.000065382344,0.00001204924],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045602955,0.00051133614,0.00039783912,0.00054150814,0.00017167348,0.0006663532,0.00030694637,0.0006128118,0.0022806625],"category_scores_gemma":[0.0012593607,0.00015559168,0.00041263664,0.0005188173,0.00039479986,0.0009527172,0.00027827176,0.00058337604,0.00091446115],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019685755,0.00009858232,0.0007491838,0.00056883687,0.00006667908,0.0003898995,0.0003555629,0.119107634,0.35070163,0.1393691,0.0025139248,0.3858821],"study_design_scores_gemma":[0.000025993302,0.00024843405,0.00081110094,0.00008157947,0.00004152977,0.0008635171,0.0000728989,0.8230892,0.12710202,0.020928133,0.026686482,0.000049110473],"about_ca_topic_score_codex":0.0004500315,"about_ca_topic_score_gemma":0.00043032525,"teacher_disagreement_score":0.0022806625,"about_ca_system_score_codex":0.00029688122,"about_ca_system_score_gemma":0.00016225252,"threshold_uncertainty_score":0.0076295137},"labels":[],"label_agreement":null},{"id":"W1500619896","doi":"10.5281/zenodo.41225","title":"Noise Shaping In An Itu-T G.711-Interoperable Embedded Codec","year":2008,"lang":"en","type":"article","venue":"","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"VoiceAge (Canada); Université de Sherbrooke","funders":"","keywords":"Computer science; Codec; Wideband; Narrowband; Encoder; Wideband audio; Coding (social sciences); Interoperability; Masking (illustration); Electronic engineering; Speech coding; Speech recognition; Telecommunications; Engineering; Mathematics","score_opus":0.07158356482871767,"score_gpt":0.31661019285201764,"score_spread":0.24502662802329997,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1500619896","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06779678,0.0008572294,0.91803217,0.00045396519,0.00023656889,0.00015460713,0.00017312834,0.0026555436,0.009639982],"genre_scores_gemma":[0.7120219,0.0007050424,0.27212974,0.0006094205,0.00017527555,0.00019342137,0.0006870999,0.0006644505,0.012813673],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9985536,0.0003912851,0.00007569185,0.00013669788,0.0007020801,0.00014061971],"domain_scores_gemma":[0.99811566,0.0005790747,0.000086676184,0.0002509181,0.0009275557,0.000040188068],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017755791,0.00068428874,0.00040028623,0.00086278206,0.00065411034,0.0010785465,0.00059439725,0.0013683022,0.0016121116],"category_scores_gemma":[0.0035738733,0.00021175954,0.00028344415,0.000635066,0.0005313648,0.0006350711,0.00066904497,0.0008933673,0.0012560992],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0022804355,0.00021837119,0.0041311905,0.00027881825,0.00009337505,0.00093867315,0.0005347689,0.12130591,0.3201551,0.058509514,0.006991284,0.48456255],"study_design_scores_gemma":[0.000060791073,0.00045361056,0.0017555989,0.0001314854,0.00011896242,0.0007194805,0.000063135776,0.6470702,0.32155022,0.0062224506,0.02178701,0.00006698769],"about_ca_topic_score_codex":0.0022182558,"about_ca_topic_score_gemma":0.002816633,"teacher_disagreement_score":0.0022182558,"about_ca_system_score_codex":0.00093949266,"about_ca_system_score_gemma":0.000976623,"threshold_uncertainty_score":0.009390235},"labels":[],"label_agreement":null},{"id":"W1505714377","doi":"","title":"Backward Linear Prediction for Lossless Coding of Stereo Audio","year":2004,"lang":"en","type":"article","venue":"Journal of the Audio Engineering Society","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Sherbrooke","funders":"","keywords":"Linear prediction; Lossless compression; Computer science; Speech coding; Entropy encoding; Audio signal; Quantization (signal processing); Vector quantization; Speech recognition; Algorithm; Data compression; Entropy (arrow of time); Residual; Decoding methods; Redundancy (engineering)","score_opus":0.012281706848078866,"score_gpt":0.24214160692534942,"score_spread":0.22985990007727056,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1505714377","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017055148,0.0005637311,0.9788897,0.00017014192,0.000058570124,0.000023789193,0.000055236567,0.0004712015,0.002712528],"genre_scores_gemma":[0.57784903,0.0013534807,0.41017532,0.0002448642,0.000103874125,0.00012634664,0.00029208,0.00013285462,0.00972218],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9997148,0.000060084298,0.000011254375,0.000023389654,0.00016682746,0.000023721086],"domain_scores_gemma":[0.99967015,0.00016620071,0.000035304736,0.000048800794,0.00006919409,0.000010345252],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040324932,0.0003332556,0.00023506365,0.0002237549,0.00020362297,0.00034443493,0.00043306805,0.0004346251,0.0019148398],"category_scores_gemma":[0.0012722362,0.00015864545,0.00014827837,0.0002865023,0.00035457933,0.00047713402,0.00059303484,0.0007884826,0.0007393545],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003849946,0.0001026689,0.00077656325,0.00021677189,0.000018666342,0.0004945127,0.0002058471,0.27946118,0.15842861,0.11311904,0.006613926,0.44017723],"study_design_scores_gemma":[0.000007828887,0.000023732224,0.00011076478,0.000012662606,0.0000026256016,0.00008313283,0.000005695826,0.97503895,0.01615328,0.0068780244,0.0016765762,0.0000067801975],"about_ca_topic_score_codex":0.0020627524,"about_ca_topic_score_gemma":0.0028823128,"teacher_disagreement_score":0.0020627524,"about_ca_system_score_codex":0.0004193754,"about_ca_system_score_gemma":0.00047862952,"threshold_uncertainty_score":0.006405771},"labels":[],"label_agreement":null},{"id":"W1507252525","doi":"10.1109/iscas.2004.1328878","title":"An embedded wavelet image coder with parallel encoding and sequential decoding of bit-planes","year":2004,"lang":"en","type":"article","venue":"","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Bit plane; Decoding methods; Encoder; Computer science; Encoding (memory); Wavelet; Data compression; Algorithm; Arithmetic coding; Bitstream; Coding (social sciences); Context-adaptive binary arithmetic coding; Artificial intelligence; Bit field; Mathematics","score_opus":0.015280421606637298,"score_gpt":0.2855703711691467,"score_spread":0.2702899495625094,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1507252525","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04209003,0.000453747,0.94876915,0.00029256934,0.00023225175,0.00018533491,0.00018357196,0.0039899736,0.0038032988],"genre_scores_gemma":[0.18833838,0.00041361176,0.8008644,0.0002558936,0.00014324437,0.00015678516,0.00037879118,0.00025261514,0.009196186],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99953306,0.000043616994,0.000033153465,0.00006894057,0.00028371363,0.000037624377],"domain_scores_gemma":[0.99922967,0.0001550083,0.000102668724,0.00019085666,0.0002709913,0.00005084308],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044707803,0.0005326574,0.00069945946,0.0006439089,0.00024031292,0.00056750525,0.0010049399,0.0007862763,0.0017418723],"category_scores_gemma":[0.0011796469,0.000273538,0.00032806088,0.00077926915,0.0003745833,0.0010849248,0.00063904736,0.00083141134,0.0010527876],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00073668925,0.0002553419,0.0007830859,0.0002482359,0.00007982572,0.00082838704,0.00013909495,0.017618684,0.5095485,0.022794887,0.00599666,0.4409706],"study_design_scores_gemma":[0.00021304902,0.00064070907,0.00094838423,0.000041533367,0.00010963414,0.0024175334,0.000024865763,0.41483808,0.54598033,0.002978023,0.031714913,0.000092917326],"about_ca_topic_score_codex":0.0007974804,"about_ca_topic_score_gemma":0.0010915602,"teacher_disagreement_score":0.0017418723,"about_ca_system_score_codex":0.00034524003,"about_ca_system_score_gemma":0.00058620865,"threshold_uncertainty_score":0.0058271885},"labels":[],"label_agreement":null},{"id":"W1512078650","doi":"10.1109/icip.2003.1246664","title":"Context-modeled wavelet difference reduction coding based on fractional bit-plane partitioning","year":2004,"lang":"en","type":"article","venue":"","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Wavelet; Wavelet transform; Algorithm; Set partitioning in hierarchical trees; Mathematics; Bit plane; Reduction (mathematics); Computer science; Discrete wavelet transform; Artificial intelligence","score_opus":0.025777313800428203,"score_gpt":0.2737195677455585,"score_spread":0.2479422539451303,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1512078650","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.043410305,0.0003395634,0.9546686,0.00005697313,0.000048775222,0.00004252985,0.000031898286,0.00023730952,0.0011641294],"genre_scores_gemma":[0.35937428,0.00050325115,0.6380795,0.00007040729,0.000049076047,0.00006945819,0.00011669237,0.000059578175,0.0016776855],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998735,0.00001946694,0.000008126056,0.000020332729,0.00006801891,0.000010488835],"domain_scores_gemma":[0.9998622,0.000046149384,0.000017441535,0.00003511369,0.000033399516,0.000005803589],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015125568,0.00027029664,0.00031864777,0.00029174893,0.00014332887,0.0002651835,0.0004491529,0.00021582695,0.0006068488],"category_scores_gemma":[0.0005695959,0.0001114156,0.00023143957,0.00029331888,0.00023242919,0.0005615697,0.00034683093,0.0004757017,0.00019481462],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00030679832,0.0000701468,0.00064176455,0.00015185066,0.000029922168,0.00023269287,0.00015349551,0.08089838,0.31332964,0.04013276,0.0012320197,0.5628205],"study_design_scores_gemma":[0.00002933915,0.00013506864,0.0006645776,0.000017322998,0.000026903868,0.00044197598,0.000023219007,0.88750577,0.09935365,0.004520181,0.007258214,0.000023826778],"about_ca_topic_score_codex":0.0006820868,"about_ca_topic_score_gemma":0.0011262397,"teacher_disagreement_score":0.0006820868,"about_ca_system_score_codex":0.00019367502,"about_ca_system_score_gemma":0.00024386236,"threshold_uncertainty_score":0.0020300746},"labels":[],"label_agreement":null},{"id":"W1514356334","doi":"10.1109/iscas.1998.698766","title":"A multi-transform approach to reversible embedded image compression","year":2002,"lang":"en","type":"article","venue":"","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Image compression; Wavelet transform; Top-hat transform; Computer science; Transform coding; Artificial intelligence; Data compression; Compression (physics); Texture compression; S transform; Image (mathematics); Algorithm; Computer vision; Discrete cosine transform; Image processing; Discrete wavelet transform; Wavelet; Digital image processing; Materials science","score_opus":0.03895820558282735,"score_gpt":0.2845973168722248,"score_spread":0.24563911128939742,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1514356334","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005705036,0.0013034838,0.98417896,0.00017617516,0.00012447558,0.00005887947,0.000038713984,0.00039582525,0.008018527],"genre_scores_gemma":[0.1740797,0.004608115,0.8025786,0.00028999947,0.00043318307,0.00015254393,0.00018180911,0.00015180207,0.017524255],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99979895,0.000021144766,0.0000099709105,0.00003225699,0.000120166624,0.000017508426],"domain_scores_gemma":[0.9998796,0.000030818712,0.000013109973,0.000035162622,0.00003487182,0.0000064164456],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000170777,0.00042974006,0.0003346185,0.0008960492,0.0002566646,0.00049656886,0.0006219065,0.0005085662,0.0031874734],"category_scores_gemma":[0.0004262418,0.0001847312,0.0004959674,0.00070562074,0.0006667401,0.00076127145,0.0006277469,0.0008791638,0.00095963984],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007795596,0.00007738346,0.00019905613,0.00027422354,0.000050648745,0.0006259026,0.000092207745,0.050886385,0.16337688,0.25821707,0.0038603812,0.5222618],"study_design_scores_gemma":[0.00002828199,0.00035648423,0.00066287786,0.00005835214,0.00005464671,0.0035421876,0.00006275388,0.6075423,0.18544221,0.12279319,0.07935829,0.00009853955],"about_ca_topic_score_codex":0.00026523232,"about_ca_topic_score_gemma":0.00050309935,"teacher_disagreement_score":0.0031874734,"about_ca_system_score_codex":0.00024073053,"about_ca_system_score_gemma":0.00029800876,"threshold_uncertainty_score":0.010663152},"labels":[],"label_agreement":null},{"id":"W1514896938","doi":"","title":"Notecode: a Tool for Asynchronous Quantitative Content Coding","year":2012,"lang":"en","type":"article","venue":"E-Learn: World Conference on E-Learning in Corporate, Government, Healthcare, and Higher Education","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Coding (social sciences); Asynchronous communication; Statistics; Mathematics; Telecommunications","score_opus":0.15230898937864112,"score_gpt":0.3461847519545906,"score_spread":0.19387576257594946,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1514896938","genre_codex":"methods","genre_gemma":"software","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"software","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0027352632,0.00006844043,0.82304555,0.0001829979,0.0005183702,0.0013223892,0.014996572,0.1486023,0.0085281525],"genre_scores_gemma":[0.04898705,0.00014884166,0.85536605,0.00030489895,0.0002044244,0.008732331,0.018278256,0.042069536,0.025908595],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9961014,0.001082234,0.00069484045,0.0006476703,0.0012367059,0.00023711895],"domain_scores_gemma":[0.97292894,0.016685814,0.0008235838,0.0034933763,0.005393003,0.00067521376],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005247357,0.0021700035,0.0006964171,0.004777217,0.00096592976,0.0024710183,0.0018896691,0.0013229821,0.13605364],"category_scores_gemma":[0.039907094,0.0008916954,0.00061090547,0.003347487,0.00076580513,0.0033666238,0.0037020203,0.0017071366,0.032581612],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0013121354,0.00018846401,0.0014199057,0.0012286021,0.000059201342,0.00026176192,0.0013776814,0.0019594661,0.02411118,0.021744797,0.20587575,0.740461],"study_design_scores_gemma":[0.0007386857,0.0003946249,0.005356922,0.0007189536,0.000073843315,0.0006398275,0.001278739,0.10734273,0.14012922,0.059708074,0.6831659,0.0004524021],"about_ca_topic_score_codex":0.0020734654,"about_ca_topic_score_gemma":0.0020811805,"teacher_disagreement_score":0.13605364,"about_ca_system_score_codex":0.0008628774,"about_ca_system_score_gemma":0.0019637025,"threshold_uncertainty_score":0.45514476},"labels":[],"label_agreement":null},{"id":"W1518423664","doi":"10.1109/glocom.1988.25850","title":"A vector ADPCM analysis-by-synthesis configuration for 16 kbit/s speech coding","year":2003,"lang":"en","type":"article","venue":"","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Computer science; Vector quantization; Coding (social sciences); Speech coding; Algorithm; Vector sum excited linear prediction; Quantization (signal processing); Speech recognition; Theoretical computer science; Linear predictive coding; Mathematics; Code-excited linear prediction","score_opus":0.021602480456668103,"score_gpt":0.2877910873465661,"score_spread":0.266188606889898,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1518423664","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0053951913,0.00027318212,0.97979546,0.00019753035,0.00023167359,0.0001701026,0.00025250835,0.0070050796,0.0066792727],"genre_scores_gemma":[0.112085186,0.00020041472,0.8728661,0.00026474483,0.00010512117,0.00029616524,0.000682723,0.00034859343,0.013150974],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99955434,0.00010512747,0.00003757956,0.00006800725,0.00020474245,0.000030291756],"domain_scores_gemma":[0.99966204,0.00009487798,0.000021795166,0.00006561866,0.00013343495,0.000022178225],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004545951,0.00060197734,0.00028794463,0.0008417331,0.0005494268,0.0009129477,0.00084311375,0.0006594493,0.01668386],"category_scores_gemma":[0.00093111553,0.00025996874,0.00020262595,0.0006827162,0.00033745723,0.00061927416,0.00057073846,0.0006540633,0.0060282056],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00056179846,0.00009897795,0.0006073343,0.00026252648,0.0000556067,0.0004080015,0.00015227265,0.015762825,0.22997163,0.030553704,0.022739433,0.69882596],"study_design_scores_gemma":[0.00022625415,0.0008770245,0.001270088,0.00012280671,0.00007758325,0.002365973,0.00008909865,0.47625992,0.34451434,0.016068552,0.15798225,0.0001460838],"about_ca_topic_score_codex":0.0011208081,"about_ca_topic_score_gemma":0.002230506,"teacher_disagreement_score":0.01668386,"about_ca_system_score_codex":0.0005665959,"about_ca_system_score_gemma":0.00055217964,"threshold_uncertainty_score":0.055813015},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.019485089714503023,"score_gpt":0.27309166286226033,"score_spread":0.2536065731477573,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1518500973","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.042315286,0.00045580938,0.9557599,0.00012728905,0.000016703696,0.00001145572,0.000021417476,0.00012132727,0.0011709051],"genre_scores_gemma":[0.7750025,0.00088835694,0.22165732,0.00016099533,0.00006356885,0.000044051045,0.00007369905,0.000058660247,0.0020509039],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99971706,0.00008117477,0.000009115899,0.000045543955,0.000121178775,0.000025976955],"domain_scores_gemma":[0.9992424,0.0004712833,0.00008586792,0.00010028996,0.00007483722,0.000025340449],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042468397,0.00043664212,0.00039862804,0.00021926826,0.00017714669,0.0004626971,0.0005816319,0.00052654906,0.0007504906],"category_scores_gemma":[0.0025303264,0.00017209552,0.00019453508,0.00034504067,0.0006007728,0.0013657556,0.00076104834,0.0009328369,0.00016556481],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022631515,0.00007008891,0.0008887339,0.00023024662,0.00004074393,0.00043542025,0.00017991354,0.6564132,0.1018757,0.08701447,0.0011202248,0.15150504],"study_design_scores_gemma":[0.000002938098,0.00003109313,0.00013113061,0.0000060584007,0.0000030515193,0.000084061205,0.000010037506,0.9862953,0.0090671675,0.003944407,0.0004185778,0.000006272391],"about_ca_topic_score_codex":0.0010324469,"about_ca_topic_score_gemma":0.001143003,"teacher_disagreement_score":0.0010324469,"about_ca_system_score_codex":0.0003316455,"about_ca_system_score_gemma":0.0002773146,"threshold_uncertainty_score":0.0025106072},"labels":[],"label_agreement":null},{"id":"W1519528253","doi":"10.1007/11422778_11","title":"An Energy-Efficient Image Representation for Secure Mobile Systems","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Encryption; Image compression; Energy (signal processing); Energy consumption; Transmission (telecommunications); Image quality; Image file formats; JPEG; Computation; Representation (politics); Data compression; Theoretical computer science; Image (mathematics); Algorithm; Real-time computing; Image processing; Computer vision; Computer network; Mathematics; Telecommunications","score_opus":0.01446164982040928,"score_gpt":0.2966752493291403,"score_spread":0.28221359950873104,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1519528253","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011555875,0.00048613414,0.98316646,0.0001600169,0.00007713502,0.000029240235,0.00010042014,0.00058139313,0.0038433864],"genre_scores_gemma":[0.31036025,0.0013860957,0.67087436,0.00016949186,0.000121710276,0.00008514178,0.0004503373,0.00026246256,0.016290192],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9998685,0.000019825913,0.000007659383,0.000018211731,0.00006809626,0.000017687984],"domain_scores_gemma":[0.9998821,0.000030823783,0.000010952442,0.000040215138,0.000030758445,0.00000512436],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015482314,0.0004496323,0.00039343679,0.0003456675,0.00019020971,0.00065779185,0.00057037576,0.0005510172,0.004560166],"category_scores_gemma":[0.00049743225,0.00018573295,0.0003267272,0.00052970817,0.00023570684,0.0010876454,0.00056590396,0.0005942717,0.0015669486],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003912235,0.00009978382,0.00017278134,0.00021068164,0.000034734483,0.0002171715,0.000071521376,0.10974913,0.19704968,0.06867612,0.008808853,0.6145183],"study_design_scores_gemma":[0.000021756161,0.00011467639,0.00021677285,0.00002619808,0.00002706919,0.00042602714,0.000030424146,0.8950901,0.07153122,0.018765075,0.0137305055,0.000020200894],"about_ca_topic_score_codex":0.00035018113,"about_ca_topic_score_gemma":0.0005357412,"teacher_disagreement_score":0.004560166,"about_ca_system_score_codex":0.00020635457,"about_ca_system_score_gemma":0.00018376845,"threshold_uncertainty_score":0.015255272},"labels":[],"label_agreement":null},{"id":"W1521324235","doi":"10.1109/scw.2002.1215752","title":"The adaptive multi-rate wideband codec: history and performance","year":2003,"lang":"en","type":"article","venue":"","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Sherbrooke; VoiceAge (Canada)","funders":"","keywords":"Codec; Full Rate; Adaptive Multi-Rate audio codec; Computer science; Speech coding; Codec2; Wideband; GSM; Speech recognition; Wideband audio; Telecommunications; Voice activity detection; Computer network; Speech processing; Linear predictive coding; Electronic engineering; Engineering; Audio signal","score_opus":0.03045901605406704,"score_gpt":0.2449812666896327,"score_spread":0.21452225063556565,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1521324235","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.054823644,0.33585763,0.50099146,0.0035291563,0.0028684204,0.0004133873,0.0006149486,0.003456219,0.09744515],"genre_scores_gemma":[0.53685886,0.15422654,0.24206589,0.0025464455,0.0046940786,0.0005280154,0.002333906,0.0011898754,0.055556286],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9983619,0.00024955603,0.00008884458,0.00016722569,0.0010265855,0.00010579138],"domain_scores_gemma":[0.9949681,0.0007045848,0.00023452731,0.00026960918,0.003713202,0.00010996918],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013392951,0.00060363574,0.0005950063,0.0024635822,0.00057863304,0.0015484344,0.00083236216,0.0017044158,0.001871995],"category_scores_gemma":[0.004454939,0.0002960271,0.00022280288,0.003291665,0.0011903895,0.0017134781,0.0010390324,0.0017093502,0.0023141846],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00050924125,0.000071166935,0.0029944845,0.0005460642,0.000049696835,0.00023941933,0.00030834938,0.020752186,0.02245212,0.02981178,0.015386564,0.906879],"study_design_scores_gemma":[0.00009083472,0.0013088714,0.009882417,0.0009710127,0.00014089647,0.0045582335,0.00026065452,0.19640958,0.10400481,0.015968109,0.6658527,0.00055179803],"about_ca_topic_score_codex":0.006044866,"about_ca_topic_score_gemma":0.0029764175,"teacher_disagreement_score":0.006044866,"about_ca_system_score_codex":0.0015174695,"about_ca_system_score_gemma":0.0011051517,"threshold_uncertainty_score":0.012019336},"labels":[],"label_agreement":null},{"id":"W1523820344","doi":"10.1109/mwscas.2002.1186841","title":"Multiple description image coding using pixel interleaving and wavelet transform","year":2003,"lang":"en","type":"article","venue":"","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Interleaving; Pixel; Bitstream; Computer science; Encoder; Artificial intelligence; Computer vision; Coding (social sciences); Wavelet; Image quality; Wavelet transform; Algorithm; Quantization (signal processing); Image (mathematics); Pattern recognition (psychology); Decoding methods; Mathematics","score_opus":0.03430065835188034,"score_gpt":0.2768928240940315,"score_spread":0.24259216574215114,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1523820344","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017322924,0.00036825714,0.98080575,0.00009201171,0.000027923008,0.000042118194,0.000032478732,0.00022154857,0.0010869731],"genre_scores_gemma":[0.37918562,0.0007157091,0.6169885,0.0000845507,0.000044431188,0.00010856225,0.00021214833,0.000046343623,0.0026142427],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99973124,0.000050459214,0.000016727827,0.000023084182,0.00015083184,0.000027584312],"domain_scores_gemma":[0.9995764,0.00018026256,0.00005160542,0.00008670334,0.00008594332,0.000019096176],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047146817,0.00026917076,0.00032205004,0.00046902767,0.0001548701,0.00041617738,0.0006605381,0.00045740532,0.0008309401],"category_scores_gemma":[0.001370343,0.00016231659,0.00028812807,0.00070889277,0.0003311959,0.00093642646,0.00071486854,0.0007036874,0.00022688712],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00043513067,0.00012433516,0.0011519555,0.00026748655,0.00006878309,0.0005842653,0.00018577155,0.1377554,0.1746184,0.10342115,0.0028898579,0.57849747],"study_design_scores_gemma":[0.000056141143,0.00015262302,0.00044732972,0.000029422967,0.000029109926,0.0005629031,0.000023835353,0.89764315,0.078980744,0.016023979,0.0060174735,0.000033289594],"about_ca_topic_score_codex":0.0009751646,"about_ca_topic_score_gemma":0.0009460611,"teacher_disagreement_score":0.0009751646,"about_ca_system_score_codex":0.0002896277,"about_ca_system_score_gemma":0.00034194475,"threshold_uncertainty_score":0.0027797818},"labels":[],"label_agreement":null},{"id":"W1526712021","doi":"10.1017/cbo9780511841453.018","title":"Source coding II: image and video coding","year":2010,"lang":"en","type":"book-chapter","venue":"Cambridge University Press eBooks","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Computer vision; Artificial intelligence; Binary image; Grayscale; Computer science; Color image; Digital image; Pixel; Computer graphics (images); Image processing; Image (mathematics)","score_opus":0.017940202537642315,"score_gpt":0.21580915457340413,"score_spread":0.19786895203576182,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1526712021","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0027755485,0.035261333,0.7233657,0.0019326917,0.0040218323,0.0010900501,0.0060348376,0.0054851063,0.22003289],"genre_scores_gemma":[0.07397526,0.05444103,0.4093926,0.0026730804,0.0032038277,0.0032616039,0.024550522,0.003216706,0.4252855],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9993794,0.0000885389,0.000043330623,0.000052394073,0.00037797625,0.00005822987],"domain_scores_gemma":[0.9992668,0.00014827673,0.000023795945,0.00016004534,0.00037834264,0.000022679482],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046132656,0.0011110886,0.00088759133,0.0021349601,0.0004533097,0.0015806773,0.00123253,0.0014261765,0.052650742],"category_scores_gemma":[0.0017605997,0.0003080049,0.0003787751,0.0036186238,0.0006680128,0.0013407009,0.0015080215,0.0015484293,0.03693111],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009598889,0.000044568584,0.00010370583,0.0007985299,0.00002350708,0.00020647747,0.000089262256,0.008547977,0.009303613,0.049152963,0.24577212,0.68586123],"study_design_scores_gemma":[0.000050570172,0.00009536902,0.000699993,0.00090873777,0.000019606885,0.0009991257,0.00010278526,0.036783114,0.01626416,0.065969266,0.8780296,0.000077587865],"about_ca_topic_score_codex":0.002290758,"about_ca_topic_score_gemma":0.001990924,"teacher_disagreement_score":0.052650742,"about_ca_system_score_codex":0.00080124906,"about_ca_system_score_gemma":0.0009863197,"threshold_uncertainty_score":0.17613429},"labels":[],"label_agreement":null},{"id":"W1527527213","doi":"10.1109/dcc.1991.213379","title":"Concentric-shell partition vector quantization with application to image coding","year":2002,"lang":"en","type":"article","venue":"","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Codebook; Vector quantization; Concentric; Partition (number theory); Coding (social sciences); Artificial intelligence; Computer science; Algorithm; Linde–Buzo–Gray algorithm; Pattern recognition (psychology); Mathematics; Vector space; Computer vision; Combinatorics; Geometry","score_opus":0.016241480860224262,"score_gpt":0.2609492601705525,"score_spread":0.24470777931032822,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1527527213","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0022650436,0.0004432505,0.9953589,0.00008588027,0.000044609373,0.000034766075,0.000024642917,0.0002452545,0.0014976942],"genre_scores_gemma":[0.12802309,0.000946881,0.8661838,0.00009930702,0.00006131358,0.00014359508,0.00015449789,0.0000958001,0.004291782],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99952495,0.00012587477,0.000027956847,0.000046369714,0.0002491919,0.000025702302],"domain_scores_gemma":[0.99949443,0.00020569579,0.000032140593,0.00007280815,0.00018220022,0.000012722154],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005593752,0.0004337607,0.00056435703,0.0006219222,0.00030273807,0.00073310913,0.0008047459,0.0005536861,0.0019065266],"category_scores_gemma":[0.0024908788,0.00022392797,0.00028485886,0.0013734428,0.00075595436,0.00079205027,0.0006964739,0.00072295277,0.00063124794],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012825709,0.00003955367,0.00024561552,0.00022598934,0.000031896863,0.00010328337,0.00018273845,0.34125572,0.024919212,0.18155403,0.006510616,0.44480303],"study_design_scores_gemma":[0.000008673165,0.00003077512,0.00006387715,0.00001527296,0.000005569824,0.00009091371,0.0000121953535,0.9675059,0.00748695,0.019459119,0.0053096325,0.000011114144],"about_ca_topic_score_codex":0.0039768927,"about_ca_topic_score_gemma":0.0030026438,"teacher_disagreement_score":0.0039768927,"about_ca_system_score_codex":0.00062043447,"about_ca_system_score_gemma":0.00060205994,"threshold_uncertainty_score":0.00790745},"labels":[],"label_agreement":null},{"id":"W1529017486","doi":"10.1109/ispa.2003.1296879","title":"Reliable adaptive watermarking scheme integrated with JPEG2000","year":2004,"lang":"en","type":"article","venue":"","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Watermark; Digital watermarking; JPEG 2000; Quantization (signal processing); Computer science; Computer vision; Image compression; Artificial intelligence; Wavelet; Transform coding; Encoder; Compression ratio; Data compression; Compression (physics); Algorithm; Image processing; Image (mathematics); Discrete cosine transform; Engineering","score_opus":0.012478562280299225,"score_gpt":0.23201300823837165,"score_spread":0.21953444595807242,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1529017486","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08145986,0.0021984277,0.9041155,0.00022000939,0.00029918537,0.00035784484,0.000103796505,0.002654954,0.008590459],"genre_scores_gemma":[0.53816813,0.0013964255,0.44089532,0.00015890786,0.000253325,0.00026968855,0.00036221195,0.000101201316,0.018394703],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995732,0.000042423668,0.000026743264,0.00008320645,0.00024087146,0.000033721],"domain_scores_gemma":[0.9996711,0.00003389755,0.000055858367,0.000088198605,0.00012462873,0.000026300708],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033627983,0.00047672354,0.0003387814,0.0007749452,0.00026407314,0.00040639486,0.00078758,0.00054420053,0.0015388194],"category_scores_gemma":[0.00071867596,0.00021927411,0.00025282905,0.00042676483,0.00024968776,0.0010265567,0.00044595433,0.00068625744,0.001000462],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00048528,0.00010968829,0.00062562944,0.000177874,0.00003555757,0.00024390894,0.00008838288,0.0032443455,0.65521127,0.01117535,0.0013961178,0.32720664],"study_design_scores_gemma":[0.00022664014,0.0016109456,0.0026489752,0.000047239166,0.00017926077,0.0021965164,0.00004494492,0.1941778,0.7403089,0.003907673,0.05454334,0.00010788145],"about_ca_topic_score_codex":0.00034222557,"about_ca_topic_score_gemma":0.00043504275,"teacher_disagreement_score":0.0015388194,"about_ca_system_score_codex":0.00021048954,"about_ca_system_score_gemma":0.00026814672,"threshold_uncertainty_score":0.0051478148},"labels":[],"label_agreement":null},{"id":"W1534189005","doi":"10.1007/11427445_115","title":"Adaptive Constructive Neural Networks Using Hermite Polynomials for Image Compression","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":19,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Computer science; Hermite polynomials; Constructive; Image compression; Artificial neural network; Artificial intelligence; Data compression; Image (mathematics); Computer vision; Algorithm; Image processing; Mathematics; Pure mathematics; Programming language","score_opus":0.02542618094314895,"score_gpt":0.2912761856900123,"score_spread":0.2658500047468633,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1534189005","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0111243855,0.0005163026,0.9851597,0.00007587036,0.00006399377,0.000012774049,0.0000119836395,0.00023503554,0.0028000928],"genre_scores_gemma":[0.46053734,0.0012980831,0.5265622,0.00017412008,0.00017657976,0.000078403595,0.000072994444,0.00013092131,0.010969346],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998356,0.000045802262,0.0000063277416,0.00002364821,0.000069887756,0.000018726267],"domain_scores_gemma":[0.9995432,0.0002866292,0.000026770249,0.000042380423,0.00008934171,0.000011653227],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003669114,0.00043151283,0.00038157575,0.00031445234,0.0002049944,0.000489219,0.0006662799,0.0006462732,0.0019610259],"category_scores_gemma":[0.0012071598,0.00026226658,0.00032941575,0.00058839144,0.00047409986,0.00085587206,0.0005308307,0.0011744088,0.00044111957],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016540573,0.00012464689,0.00024063396,0.00014448843,0.0000615551,0.000090551875,0.00007294661,0.43696302,0.06543077,0.07141478,0.0024982572,0.42279294],"study_design_scores_gemma":[0.000004450152,0.000022066282,0.000043490905,0.0000044638136,0.0000072739676,0.00003389079,0.0000044463004,0.9878037,0.0068721883,0.0045105093,0.00068740395,0.0000060819643],"about_ca_topic_score_codex":0.0006192452,"about_ca_topic_score_gemma":0.0016072409,"teacher_disagreement_score":0.0019610259,"about_ca_system_score_codex":0.00036208262,"about_ca_system_score_gemma":0.00023980504,"threshold_uncertainty_score":0.006560266},"labels":[],"label_agreement":null},{"id":"W1542003756","doi":"10.1109/ccece.1995.526406","title":"Fuzzy detection of directions for the interpolation of images","year":2002,"lang":"en","type":"article","venue":"","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Sherbrooke","funders":"","keywords":"Filter (signal processing); Interpolation (computer graphics); Computer vision; Artificial intelligence; Fuzzy logic; Pixel; Computer science; Composite image filter; Mathematics; Image (mathematics)","score_opus":0.0238627151661672,"score_gpt":0.2792656961212897,"score_spread":0.2554029809551225,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1542003756","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.081375845,0.00028775638,0.9159391,0.00008681319,0.000037568985,0.000041553438,0.000037670514,0.00029200537,0.0019017113],"genre_scores_gemma":[0.48398694,0.00027339702,0.5135696,0.000039847662,0.000018184634,0.000050599418,0.0000752626,0.00002660585,0.001959545],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997254,0.000046122263,0.000015241045,0.000041780044,0.00014637034,0.000025054509],"domain_scores_gemma":[0.99909425,0.00036009582,0.00008333498,0.00010071039,0.00032917905,0.000032386626],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006480415,0.00027631645,0.00018648039,0.0004453831,0.00026258433,0.0004417849,0.00032697493,0.0004130837,0.0011611544],"category_scores_gemma":[0.0025632933,0.0001676283,0.0002604324,0.0004405256,0.000314773,0.00048744804,0.00023441839,0.00042892297,0.00032237935],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008147725,0.00007840819,0.0021979418,0.00017689842,0.000025288602,0.00008191835,0.00018596131,0.0155370645,0.4374272,0.011328889,0.00076562073,0.53138006],"study_design_scores_gemma":[0.000046599438,0.00055949815,0.0069946004,0.00004794327,0.000053358846,0.0007433921,0.00013958657,0.4720397,0.50182974,0.0056555504,0.011819046,0.00007104014],"about_ca_topic_score_codex":0.0010823011,"about_ca_topic_score_gemma":0.0017851874,"teacher_disagreement_score":0.0011611544,"about_ca_system_score_codex":0.00034719368,"about_ca_system_score_gemma":0.00036993367,"threshold_uncertainty_score":0.0038844347},"labels":[],"label_agreement":null},{"id":"W1544418007","doi":"","title":"Rate-distortion approach to bit allocation in lossy image set compression","year":2014,"lang":"en","type":"article","venue":"","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Lethbridge","funders":"","keywords":"Lossy compression; Image compression; Data compression; Residual; Computer science; Distortion (music); Artificial intelligence; Rate–distortion theory; Computer vision; Algorithm; Set (abstract data type); Image (mathematics); Texture compression; Compression (physics); Image processing","score_opus":0.01949697604543874,"score_gpt":0.2848629585092081,"score_spread":0.26536598246376936,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1544418007","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011946261,0.00120916,0.9823046,0.0005182409,0.000060967373,0.000055436507,0.00004229902,0.000120643344,0.0037424965],"genre_scores_gemma":[0.607701,0.0028627843,0.37896279,0.00029782002,0.00028891818,0.0002136088,0.00009918888,0.00018720487,0.009386646],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99881953,0.000462503,0.00004037034,0.00006825766,0.0005507678,0.00005849846],"domain_scores_gemma":[0.9986071,0.00084028323,0.00010530917,0.0001412299,0.00027113824,0.000034908382],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016632631,0.0006442162,0.0006505781,0.0007294568,0.00033756145,0.0011637096,0.001355676,0.00079099205,0.0025709402],"category_scores_gemma":[0.004116303,0.00032195885,0.00029600254,0.0008964019,0.0012156345,0.0015639613,0.0008446871,0.0013402107,0.000506493],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003504114,0.00009160807,0.0004533884,0.0002341767,0.000060007835,0.00016917523,0.00014439721,0.68681073,0.015729781,0.16235109,0.0037987821,0.1298065],"study_design_scores_gemma":[0.000011841649,0.00005411004,0.00009141294,0.000019552495,0.000008954338,0.00013681114,0.000012959141,0.97851497,0.00486515,0.014832198,0.0014412929,0.000010798923],"about_ca_topic_score_codex":0.0011947163,"about_ca_topic_score_gemma":0.0007310197,"teacher_disagreement_score":0.0025709402,"about_ca_system_score_codex":0.001663408,"about_ca_system_score_gemma":0.0005805859,"threshold_uncertainty_score":0.012068868},"labels":[],"label_agreement":null},{"id":"W1547137419","doi":"10.1109/scft.1993.762358","title":"Soft Decision Vector Quantization for Noisy Channels","year":2005,"lang":"en","type":"article","venue":"","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Codebook; Vector quantization; Linde–Buzo–Gray algorithm; Quantization (signal processing); Computer science; Channel (broadcasting); Pattern recognition (psychology); Algorithm; SIGNAL (programming language); Artificial intelligence; Speech recognition; Mathematics; Telecommunications","score_opus":0.023714916925128296,"score_gpt":0.31540197139265697,"score_spread":0.2916870544675287,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1547137419","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0065736426,0.001716344,0.9886176,0.00031207965,0.000093198694,0.000020179636,0.000051466606,0.00011428083,0.0025012451],"genre_scores_gemma":[0.6893047,0.0044252775,0.29798284,0.00038487886,0.00036166096,0.00015248006,0.00024891392,0.000086105894,0.0070531024],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986755,0.00048204738,0.00007179386,0.00013222579,0.00054146844,0.00009694237],"domain_scores_gemma":[0.9987068,0.0008283451,0.00009979659,0.00013635114,0.0002048068,0.000023977234],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012967477,0.0004959579,0.00072155386,0.00036382864,0.00027895308,0.001332739,0.000682379,0.0007087617,0.0016192918],"category_scores_gemma":[0.0043006986,0.00023641855,0.00023259546,0.0008300751,0.0009916764,0.0015855083,0.0008747897,0.0011791481,0.00037468364],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017325455,0.000027820548,0.0003117724,0.00020441144,0.00004076922,0.000107839995,0.000102804035,0.53462934,0.0048396513,0.2672497,0.0031465206,0.18916616],"study_design_scores_gemma":[0.00001495312,0.000032385997,0.0000781659,0.000025173675,0.000007652179,0.000037026344,0.000016528502,0.9131552,0.0021669797,0.08201605,0.0024369918,0.000012972777],"about_ca_topic_score_codex":0.0015144445,"about_ca_topic_score_gemma":0.0015846874,"teacher_disagreement_score":0.0016192918,"about_ca_system_score_codex":0.0007551227,"about_ca_system_score_gemma":0.0008497804,"threshold_uncertainty_score":0.0068579316},"labels":[],"label_agreement":null},{"id":"W1547585763","doi":"10.1109/dcc.1996.488370","title":"Real-time implementation of full-search vector quantization on a low memory SIMD architecture","year":2002,"lang":"en","type":"article","venue":"","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; SIMD; Vector quantization; Frame rate; Clock rate; Parallel computing; Encoding (memory); Quantization (signal processing); Block (permutation group theory); Image compression; Speedup; Computer hardware; Implementation; Frame (networking); Code word; Pixel; Data compression; Image processing; Decoding methods; Image (mathematics); Algorithm; Artificial intelligence; Chip; Mathematics","score_opus":0.019929540827267396,"score_gpt":0.31109371235388256,"score_spread":0.29116417152661517,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1547585763","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.36415383,0.0009234486,0.60329086,0.00044495813,0.00016204175,0.00020964941,0.00043205736,0.009112329,0.021270825],"genre_scores_gemma":[0.8048063,0.0001514568,0.19026758,0.000102997146,0.000017538083,0.00007157589,0.00033022452,0.000073800635,0.0041785836],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99986315,0.000030026025,0.000009603742,0.00002496972,0.000054410568,0.000017798977],"domain_scores_gemma":[0.9997675,0.000058578553,0.00002861536,0.000052795593,0.00007597774,0.000016646953],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019972627,0.00022899348,0.00018660845,0.00027018506,0.00019745916,0.00039587112,0.0007883744,0.00019969732,0.0058761337],"category_scores_gemma":[0.00043412205,0.00011073149,0.00013010227,0.0003544509,0.00019542914,0.00048528254,0.00022366403,0.00021923272,0.0007671564],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0015585609,0.0002804234,0.005586957,0.0005202404,0.00014181476,0.00057057186,0.0002190882,0.079348706,0.3650684,0.021932824,0.016114177,0.5086583],"study_design_scores_gemma":[0.00021762356,0.0008879019,0.0017614678,0.000027263444,0.00004770076,0.00035287123,0.00005808513,0.75296474,0.2189099,0.0033240544,0.02141814,0.000030185482],"about_ca_topic_score_codex":0.0013245821,"about_ca_topic_score_gemma":0.001861605,"teacher_disagreement_score":0.0058761337,"about_ca_system_score_codex":0.0005213482,"about_ca_system_score_gemma":0.00050226535,"threshold_uncertainty_score":0.019657612},"labels":[],"label_agreement":null},{"id":"W1550004788","doi":"10.1109/vetec.1992.245427","title":"Video coding for very high rate mobile data transmission","year":2003,"lang":"en","type":"article","venue":"","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Videophone; Computer science; Codec; Coding (social sciences); Channel (broadcasting); Videotelephony; Teleconference; Video capture; Mobile telephony; Computer network; Multimedia; Video processing; Real-time computing; Mobile radio; Telecommunications; Computer hardware","score_opus":0.042572997354035275,"score_gpt":0.3168329396831474,"score_spread":0.2742599423291121,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1550004788","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00420043,0.0034804195,0.96263593,0.00060230924,0.0007622701,0.00022973024,0.00026480123,0.0010216633,0.0268023],"genre_scores_gemma":[0.14190443,0.009223728,0.78870595,0.0010970472,0.00063181936,0.00084721274,0.0017253892,0.00066314515,0.05520133],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993887,0.00010676346,0.000032788834,0.000036635596,0.00039806706,0.000037127305],"domain_scores_gemma":[0.9994752,0.00014756274,0.000035115703,0.00009476304,0.0002330347,0.000014303696],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039935735,0.0004560387,0.00035763264,0.0007422323,0.00035198044,0.00072507863,0.0007481656,0.0007921601,0.008958828],"category_scores_gemma":[0.0020852846,0.00016201506,0.00022454008,0.0011424022,0.0006004233,0.0006719406,0.0005784164,0.0011587887,0.0034018222],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019356947,0.00004800186,0.000284851,0.0008577786,0.0000369811,0.00049760996,0.00033646106,0.015929727,0.13667803,0.24848932,0.055635072,0.5410126],"study_design_scores_gemma":[0.00010664704,0.0002969301,0.0013705444,0.000704351,0.00005673859,0.0024466608,0.00013238472,0.2258439,0.13126265,0.10697058,0.5306686,0.00013999519],"about_ca_topic_score_codex":0.001963809,"about_ca_topic_score_gemma":0.0022395337,"teacher_disagreement_score":0.008958828,"about_ca_system_score_codex":0.00055818004,"about_ca_system_score_gemma":0.00067437044,"threshold_uncertainty_score":0.029970229},"labels":[],"label_agreement":null},{"id":"W1550347869","doi":"10.1109/isit.1997.613450","title":"A vector quantizer for additive white and colored Gaussian noise channels","year":2002,"lang":"en","type":"article","venue":"","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Additive white Gaussian noise; Phase-shift keying; Gaussian noise; White noise; Colors of noise; Computer science; Channel (broadcasting); Colored; Algorithm; Binary number; Quadrature amplitude modulation; Decoding methods; Mathematics; Speech recognition; Telecommunications; Bit error rate","score_opus":0.027150692413507378,"score_gpt":0.26942499149319604,"score_spread":0.24227429907968867,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1550347869","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00349306,0.0005380386,0.9944727,0.00015506538,0.00007238827,0.00003361138,0.00007592754,0.00016650945,0.0009926868],"genre_scores_gemma":[0.3810653,0.0014856621,0.61057025,0.00036018298,0.0002030664,0.0002514955,0.0003524489,0.00006898774,0.0056425766],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993455,0.00014541871,0.00005926851,0.00015776217,0.00024922838,0.000042778876],"domain_scores_gemma":[0.99946004,0.00022217125,0.000066500514,0.00008398376,0.00014904412,0.000018270766],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011311909,0.00056390587,0.0005961024,0.00039710256,0.0003690497,0.00086895376,0.00086077437,0.0006866614,0.0018108245],"category_scores_gemma":[0.001830365,0.00025198556,0.00034129227,0.000702238,0.00051041483,0.0016824091,0.00062159094,0.0009610031,0.00042005393],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023832553,0.00006590927,0.0004678374,0.00027719376,0.00008555256,0.000087316424,0.00011903163,0.20345303,0.035042122,0.38899386,0.0059948587,0.36517498],"study_design_scores_gemma":[0.000045854515,0.00014259458,0.00018162883,0.00003546039,0.000038628656,0.00010931584,0.000019931202,0.9236669,0.012889833,0.050858937,0.01197269,0.000038168608],"about_ca_topic_score_codex":0.0012956971,"about_ca_topic_score_gemma":0.0021254688,"teacher_disagreement_score":0.0018108245,"about_ca_system_score_codex":0.00056798686,"about_ca_system_score_gemma":0.001029955,"threshold_uncertainty_score":0.006057799},"labels":[],"label_agreement":null},{"id":"W1550408533","doi":"10.1109/icip.1999.817177","title":"Image compression based on multi-scale edge compensation","year":2003,"lang":"en","type":"article","venue":"","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Computer science; Computer vision; Image compression; Artificial intelligence; Enhanced Data Rates for GSM Evolution; Coding (social sciences); Data compression; Compensation (psychology); Edge detection; Compression (physics); Image (mathematics); Scale (ratio); Image processing; Mathematics","score_opus":0.026302235759074272,"score_gpt":0.2996222729759516,"score_spread":0.27332003721687737,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1550408533","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.075306326,0.00062495924,0.91814166,0.0001566401,0.0001137455,0.00006773839,0.00006657344,0.0011118824,0.0044104345],"genre_scores_gemma":[0.62155133,0.0009716148,0.3709444,0.00020824154,0.00008429017,0.000060151702,0.00023899795,0.000088576446,0.0058524054],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999864,0.000011794219,0.0000056855747,0.000022803262,0.00008271016,0.000012981165],"domain_scores_gemma":[0.99989414,0.000025370739,0.000013214185,0.00003034086,0.000030414125,0.000006564056],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001645897,0.00030146792,0.00029630944,0.0003222724,0.00010531452,0.00028686694,0.00041601615,0.00033222808,0.0009874117],"category_scores_gemma":[0.00028501698,0.00010916641,0.00021514216,0.00027057278,0.00027580716,0.0007569693,0.00028495744,0.00041597846,0.00037787436],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00042009103,0.00009752539,0.0014552488,0.0001776553,0.000044341163,0.00045015535,0.00011190057,0.07429765,0.5294159,0.04333047,0.002407138,0.3477918],"study_design_scores_gemma":[0.00003795212,0.00027734568,0.0020141597,0.000017096541,0.00002458908,0.00069916,0.000027947814,0.7822679,0.19922754,0.0056952867,0.009680744,0.0000301827],"about_ca_topic_score_codex":0.0005635733,"about_ca_topic_score_gemma":0.0006877545,"teacher_disagreement_score":0.0009874117,"about_ca_system_score_codex":0.00016362096,"about_ca_system_score_gemma":0.00014192684,"threshold_uncertainty_score":0.0033032298},"labels":[],"label_agreement":null},{"id":"W1552373727","doi":"10.1109/iscas.2006.1693253","title":"An Architecture for Best-Basis Algorithm Using Threshold Cost Function for Images","year":2006,"lang":"en","type":"article","venue":"","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Computer science; Wavelet packet decomposition; Correctness; Wavelet; Basis (linear algebra); Wavelet transform; Algorithm; Basis function; VHDL; Image compression; Function (biology); Field-programmable gate array; Artificial intelligence; Image (mathematics); Image processing; Mathematics; Computer hardware","score_opus":0.025509548749269,"score_gpt":0.31311437693271865,"score_spread":0.2876048281834497,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1552373727","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.040216874,0.00043007327,0.95075905,0.00015872062,0.00009940064,0.00009117097,0.00008512653,0.004067313,0.004092208],"genre_scores_gemma":[0.3842165,0.00035651954,0.6084738,0.00013435668,0.000060956558,0.00011394669,0.00044825897,0.00014299303,0.0060527255],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998354,0.000019384648,0.00001229752,0.000030107025,0.00007967831,0.000023132296],"domain_scores_gemma":[0.99987864,0.00001561529,0.0000096650565,0.000022370214,0.0000651025,0.000008593172],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001982562,0.00030240547,0.00030398607,0.00057165313,0.00033415688,0.00058781885,0.0009259727,0.00039762643,0.003186684],"category_scores_gemma":[0.00033150893,0.00019686922,0.00023798582,0.0003673319,0.00013454299,0.0005580295,0.00024237145,0.0003502372,0.0011044503],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006576472,0.0001240675,0.0017852648,0.00026073374,0.00011438729,0.00035228385,0.00019689155,0.04544704,0.37906125,0.018810859,0.008443588,0.544746],"study_design_scores_gemma":[0.00016012612,0.0006591243,0.0029330698,0.00004259847,0.00013300114,0.001182733,0.00006629322,0.69231254,0.26562262,0.005108456,0.031698402,0.00008099936],"about_ca_topic_score_codex":0.0015596146,"about_ca_topic_score_gemma":0.0016880279,"teacher_disagreement_score":0.003186684,"about_ca_system_score_codex":0.000450637,"about_ca_system_score_gemma":0.00059986225,"threshold_uncertainty_score":0.0106604695},"labels":[],"label_agreement":null},{"id":"W1554393788","doi":"","title":"Least squares solution for error correction on the real field using quantized DFT codes","year":2012,"lang":"en","type":"article","venue":"European Signal Processing Conference","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Overdetermined system; Quantization (signal processing); Algorithm; Decoding methods; Mean squared error; Mathematics; Error detection and correction; Computer science; Applied mathematics; Statistics","score_opus":0.11908713274077153,"score_gpt":0.3408139011529427,"score_spread":0.22172676841217115,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1554393788","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00438322,0.000101967154,0.9948284,0.00009478813,0.000021873324,0.000009037611,0.0000151814675,0.000128212,0.00041739945],"genre_scores_gemma":[0.21104617,0.0004937105,0.7841426,0.00012798351,0.00006185255,0.0000833023,0.00014798272,0.00013961983,0.0037567257],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991836,0.00030430435,0.000033980366,0.00010455396,0.00033081137,0.00004280076],"domain_scores_gemma":[0.997698,0.0015443461,0.00013507438,0.00020992981,0.0003821147,0.000030481562],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012694654,0.00071370084,0.0006518498,0.00047114003,0.00031353693,0.0006992422,0.00061040063,0.00091228855,0.0019774758],"category_scores_gemma":[0.0076149055,0.0002944887,0.00028851675,0.00071522023,0.0010035172,0.0012754125,0.0008071324,0.0010890622,0.00053718296],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013444302,0.000035400262,0.00049206655,0.00018456338,0.000035853744,0.00011297703,0.00017810585,0.76706195,0.017424515,0.09417367,0.002003324,0.11816309],"study_design_scores_gemma":[0.000006886869,0.0000147802275,0.00004661251,0.000009571953,0.0000021771086,0.000025292635,0.000009818375,0.9880244,0.00304096,0.0082610715,0.00055124256,0.0000071861127],"about_ca_topic_score_codex":0.002309294,"about_ca_topic_score_gemma":0.0019793531,"teacher_disagreement_score":0.002309294,"about_ca_system_score_codex":0.0005290595,"about_ca_system_score_gemma":0.0012339941,"threshold_uncertainty_score":0.006713629},"labels":[],"label_agreement":null},{"id":"W1555909604","doi":"10.1109/ccece.1993.332309","title":"Systolic designs for speech processing","year":2002,"lang":"en","type":"article","venue":"","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Technical University of Nova Scotia","funders":"","keywords":"Linear predictive coding; Speech recognition; Computer science; Coding (social sciences); Speech processing; Speech coding; Computation; Voice activity detection; Signal processing; Algorithm; Mathematics; Digital signal processing; Computer hardware; Statistics","score_opus":0.09084937844831745,"score_gpt":0.3131909810490816,"score_spread":0.22234160260076416,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1555909604","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0060740504,0.0033524248,0.9683363,0.0002910306,0.00043184715,0.00008139259,0.0001418861,0.002624873,0.018666232],"genre_scores_gemma":[0.19899562,0.0043015517,0.75674945,0.00075894216,0.00073943427,0.00039821432,0.00068345154,0.0004184146,0.036954954],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99960166,0.00008950565,0.00003078665,0.00006421753,0.00018044085,0.000033461132],"domain_scores_gemma":[0.9995902,0.00012002278,0.00003060757,0.00006907041,0.00017363636,0.000016450924],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005135973,0.000693132,0.0003303709,0.00044881055,0.0004568282,0.0010447328,0.00069810794,0.00054970995,0.012997751],"category_scores_gemma":[0.0010368965,0.0002613343,0.00035739527,0.0005843705,0.00039321632,0.0009017465,0.0005456611,0.0007778792,0.004873622],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00041156076,0.00007635045,0.00044078086,0.0006882861,0.00007968258,0.00023969503,0.00027686858,0.03052914,0.06451546,0.22338535,0.022218358,0.6571385],"study_design_scores_gemma":[0.00025561405,0.001070429,0.0006186129,0.00038342952,0.00016301271,0.0010402219,0.00018968506,0.22807314,0.08848321,0.1711289,0.50851494,0.00007885238],"about_ca_topic_score_codex":0.00045432372,"about_ca_topic_score_gemma":0.0009772261,"teacher_disagreement_score":0.012997751,"about_ca_system_score_codex":0.0005043588,"about_ca_system_score_gemma":0.00044697252,"threshold_uncertainty_score":0.043481767},"labels":[],"label_agreement":null},{"id":"W1558792739","doi":"10.1109/dcc.1998.672235","title":"Hybrid image compression scheme based on wavelet transform and adaptive context modeling","year":2002,"lang":"en","type":"article","venue":"","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Wavelet; Wavelet transform; Second-generation wavelet transform; Stationary wavelet transform; Human visual system model; Artificial intelligence; Lifting scheme; Mathematics; Wavelet packet decomposition; Image compression; Discrete wavelet transform; Thresholding; Computer science; Computer vision; Data compression; Pattern recognition (psychology); Redundancy (engineering); Algorithm; Image processing; Image (mathematics)","score_opus":0.03311373952432926,"score_gpt":0.2519074920673828,"score_spread":0.21879375254305353,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1558792739","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12942733,0.001976283,0.8575922,0.00038324803,0.00028438726,0.00011995111,0.00016443695,0.0014248772,0.008627232],"genre_scores_gemma":[0.56178755,0.000896344,0.42690906,0.0002191035,0.00013809673,0.00009501837,0.00035847453,0.000079315745,0.009517028],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998728,0.000013649177,0.0000075164285,0.000019055478,0.00007321226,0.000013776828],"domain_scores_gemma":[0.99989724,0.000019221488,0.000011055957,0.000022115784,0.000042649335,0.000007598162],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001340115,0.0003341623,0.00034479107,0.0005082011,0.00020033697,0.0003479384,0.00046484533,0.00034493586,0.0020741394],"category_scores_gemma":[0.00028587476,0.0001075225,0.00026405955,0.0005121295,0.00017801295,0.0006130379,0.00040378206,0.0003940559,0.00048501664],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00035762394,0.000089601286,0.00074333913,0.0001632482,0.000055415057,0.0003551988,0.00008329153,0.026168497,0.29434887,0.0142638115,0.0046466235,0.6587245],"study_design_scores_gemma":[0.0000597551,0.00037013358,0.0022085325,0.000041210835,0.00008610333,0.0013207389,0.000059860275,0.7657752,0.20675313,0.004539322,0.018729527,0.000056503442],"about_ca_topic_score_codex":0.0005279457,"about_ca_topic_score_gemma":0.00084946456,"teacher_disagreement_score":0.0020741394,"about_ca_system_score_codex":0.0001915414,"about_ca_system_score_gemma":0.000113503556,"threshold_uncertainty_score":0.0069387555},"labels":[],"label_agreement":null},{"id":"W1560007417","doi":"10.1109/icc.1997.609960","title":"Description of GSM enhanced full rate speech codec","year":2002,"lang":"en","type":"article","venue":"","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":19,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"Université de Sherbrooke","funders":"Université de Sherbrooke","keywords":"Full Rate; Codec; Wireline; Adaptive Multi-Rate audio codec; Computer science; Speech coding; GSM; Speech recognition; Codec2; Linear predictive coding; Speech processing; Computer hardware; Telecommunications; Voice activity detection; Wireless","score_opus":0.03681390282315309,"score_gpt":0.26093213325493037,"score_spread":0.22411823043177728,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1560007417","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01729537,0.010487644,0.8265091,0.001233656,0.001781138,0.0033346089,0.00877956,0.013290512,0.117288396],"genre_scores_gemma":[0.21735969,0.011969342,0.5652457,0.0035328844,0.0016978306,0.00626444,0.032971017,0.0032430517,0.15771604],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9991536,0.00007767224,0.000068879446,0.00011470622,0.00049855624,0.00008658794],"domain_scores_gemma":[0.99924505,0.000065108725,0.000041958167,0.00006712055,0.00053535553,0.000045450357],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004256768,0.0010448442,0.0006630351,0.0018340399,0.00061723625,0.0012620161,0.0011651864,0.0013876515,0.013505009],"category_scores_gemma":[0.0010118238,0.000328392,0.00031975124,0.001004058,0.000369017,0.0006777456,0.0006704729,0.001136301,0.01564807],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008365458,0.0002053276,0.0027131138,0.0017617278,0.000077690915,0.0024915386,0.00042937906,0.034002844,0.16456422,0.06332181,0.11010109,0.6194947],"study_design_scores_gemma":[0.00010352441,0.0005462936,0.002069688,0.00030673636,0.000062859996,0.0050430875,0.0000913659,0.055396542,0.06429473,0.0062332936,0.8656409,0.0002109905],"about_ca_topic_score_codex":0.002813766,"about_ca_topic_score_gemma":0.0014927825,"teacher_disagreement_score":0.013505009,"about_ca_system_score_codex":0.0006772465,"about_ca_system_score_gemma":0.0012725295,"threshold_uncertainty_score":0.04517877},"labels":[],"label_agreement":null},{"id":"W1564196590","doi":"10.1109/dcc.1998.672315","title":"Optimal decoding of entropy coded memoryless sources over binary symmetric channels","year":2002,"lang":"en","type":"article","venue":"","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Algorithm; Decoding methods; Soft-decision decoder; Computer science; Huffman coding; Encoder; Viterbi decoder; Binary number; Entropy (arrow of time); Bitstream; Mathematics; Data compression; Arithmetic","score_opus":0.028610708770179065,"score_gpt":0.2708631827636999,"score_spread":0.24225247399352084,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1564196590","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23706527,0.00034902533,0.75868434,0.00019138258,0.00003404669,0.00003807772,0.0001370277,0.00047822445,0.0030225897],"genre_scores_gemma":[0.85759497,0.00020031602,0.13967003,0.00004802273,0.000022724173,0.000040192666,0.0001867806,0.000054831547,0.002182176],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996147,0.00011735461,0.000021705255,0.000049457707,0.00015044493,0.000046203568],"domain_scores_gemma":[0.9985886,0.0009659264,0.00014510598,0.00007607924,0.00019141608,0.00003286482],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00054344843,0.00038452022,0.0005128153,0.0002940362,0.00018706148,0.00033587246,0.00034734828,0.0004478722,0.0009711865],"category_scores_gemma":[0.002485936,0.0002051514,0.0001759721,0.00037536057,0.00042851572,0.0005519252,0.00055039517,0.00035286558,0.00021547123],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006463856,0.000045230674,0.0012948095,0.00014795405,0.000041643063,0.00018072265,0.00013807166,0.82017946,0.04580681,0.020624617,0.00097563956,0.10991862],"study_design_scores_gemma":[0.00001369523,0.00004265712,0.00021618392,0.0000065262648,0.000006101787,0.000032406824,0.000010531407,0.9653907,0.02984998,0.004101211,0.00032356786,0.000006511885],"about_ca_topic_score_codex":0.0013286296,"about_ca_topic_score_gemma":0.0015648796,"teacher_disagreement_score":0.0013286296,"about_ca_system_score_codex":0.00054563663,"about_ca_system_score_gemma":0.0007316118,"threshold_uncertainty_score":0.003958881},"labels":[],"label_agreement":null},{"id":"W1566039065","doi":"10.1109/icip.2003.1247359","title":"On optimality of JPEG2000 code stream","year":2004,"lang":"en","type":"article","venue":"","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Computer science; JPEG 2000; Interleaving; Code (set theory); Algorithm; Scalability; Parallel computing; Image compression; Theoretical computer science; Image processing; Artificial intelligence; Image (mathematics)","score_opus":0.018159347997695842,"score_gpt":0.2992020316872884,"score_spread":0.2810426836895925,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1566039065","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.079023615,0.0017069352,0.89399374,0.00097584206,0.00008950368,0.00011840565,0.0003777999,0.00037162623,0.02334255],"genre_scores_gemma":[0.62864166,0.0038271884,0.3490191,0.0005527932,0.00025711476,0.00024045125,0.0012185959,0.0006670277,0.015576038],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984163,0.00042825376,0.000078413075,0.00021030888,0.0007150893,0.00015157532],"domain_scores_gemma":[0.9953004,0.0030893097,0.00027621718,0.00038200905,0.0008174883,0.00013450418],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028945464,0.0007660635,0.00076605624,0.0008699641,0.00053457334,0.0014162166,0.00072994,0.0008890909,0.0025927618],"category_scores_gemma":[0.014392559,0.00047486965,0.00035053515,0.0010045622,0.0015654452,0.002869312,0.0014636194,0.0016575294,0.00077598274],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00048173327,0.000077471945,0.0018494393,0.00019819186,0.000023885388,0.00010290818,0.0001556522,0.3545676,0.010133849,0.53787667,0.007325167,0.08720745],"study_design_scores_gemma":[0.000037508013,0.00009989591,0.00056872825,0.000047957372,0.000008818452,0.00009158968,0.0000388127,0.845087,0.006765794,0.14384085,0.003396655,0.00001642299],"about_ca_topic_score_codex":0.002330078,"about_ca_topic_score_gemma":0.001718172,"teacher_disagreement_score":0.0028945464,"about_ca_system_score_codex":0.0017826834,"about_ca_system_score_gemma":0.0018311641,"threshold_uncertainty_score":0.0153080225},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.0339443556881549,"score_gpt":0.3383017103835649,"score_spread":0.30435735469541,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1567180517","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0011392212,0.038806863,0.9311143,0.000993972,0.0009909471,0.000029228646,0.00018066462,0.00048320243,0.026261527],"genre_scores_gemma":[0.09658412,0.071838796,0.74077326,0.0008598254,0.0036419402,0.000295892,0.00089870056,0.0005099155,0.08459758],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995239,0.00011958101,0.00003126137,0.000056572222,0.0002510486,0.000017747943],"domain_scores_gemma":[0.9993919,0.00037470952,0.000017344444,0.000086866756,0.00011828117,0.000010844803],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006557241,0.0006609663,0.00088948023,0.0009444314,0.00038706983,0.0014816886,0.0011557912,0.0007515559,0.007721471],"category_scores_gemma":[0.0023620347,0.00039088528,0.000389955,0.0029585033,0.0014843796,0.0029219782,0.0006686555,0.0021986386,0.0026934184],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015597674,0.000024324463,0.00008000656,0.00036631618,0.000021409223,0.000024955314,0.00008954638,0.018308833,0.00083962467,0.49622482,0.034724258,0.44928035],"study_design_scores_gemma":[0.000009318753,0.000024734436,0.00021556224,0.00015205599,0.000017044305,0.0001480782,0.00003506124,0.120954946,0.001627701,0.7834051,0.09338191,0.000028418242],"about_ca_topic_score_codex":0.001487907,"about_ca_topic_score_gemma":0.0016823019,"teacher_disagreement_score":0.007721471,"about_ca_system_score_codex":0.0007469638,"about_ca_system_score_gemma":0.00060069293,"threshold_uncertainty_score":0.025830925},"labels":[],"label_agreement":null},{"id":"W1570779175","doi":"10.1007/978-3-642-13681-8_41","title":"Error-Resilient and Error Concealment 3-D SPIHT Video Coding with Added Redundancy","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Set partitioning in hierarchical trees; Redundancy (engineering); Computer science; Coding (social sciences); Novelty; Error concealment; Artificial intelligence; Algorithm; Pattern recognition (psychology); Decoding methods; Wavelet; Mathematics; Wavelet transform; Statistics; Psychology","score_opus":0.017991407094862154,"score_gpt":0.2760827457279089,"score_spread":0.2580913386330468,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1570779175","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.032343987,0.00062987773,0.9614154,0.0001596525,0.000103919476,0.000032119795,0.00011817266,0.0005780783,0.004618811],"genre_scores_gemma":[0.4484234,0.0015389718,0.5308899,0.00016543613,0.00011954252,0.000074876676,0.00034724837,0.00020808552,0.01823251],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997322,0.000040169172,0.00001479899,0.000019654264,0.00017219657,0.000020925485],"domain_scores_gemma":[0.9994254,0.00020318202,0.00007198535,0.00015932706,0.00012877633,0.000011317062],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003533291,0.00069428695,0.0003716305,0.00066081865,0.00020584425,0.00052800385,0.0007192351,0.00080265396,0.0021561987],"category_scores_gemma":[0.0012072725,0.00030559298,0.00048001966,0.00063391734,0.00043387274,0.0009956089,0.00061728596,0.0006813399,0.0006480199],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004949117,0.000082562874,0.00051043055,0.0003570414,0.000087953966,0.0006257293,0.00032579474,0.22233815,0.32261243,0.08388991,0.0039888285,0.36468622],"study_design_scores_gemma":[0.000018621431,0.0001614388,0.0004669173,0.00006750037,0.00004180479,0.0011895937,0.000024935225,0.8079015,0.17411588,0.010443451,0.00552502,0.00004326092],"about_ca_topic_score_codex":0.00066311343,"about_ca_topic_score_gemma":0.0010528313,"teacher_disagreement_score":0.0021561987,"about_ca_system_score_codex":0.00039971728,"about_ca_system_score_gemma":0.00032092212,"threshold_uncertainty_score":0.0072131753},"labels":[],"label_agreement":null},{"id":"W1571663174","doi":"10.1109/icassp.1981.1171219","title":"Medium band speech coding using a dictionary of waveforms","year":2005,"lang":"en","type":"article","venue":"","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Sherbrooke","funders":"","keywords":"Computer science; Waveform; Speech recognition; Speech coding; Coding (social sciences); Residual; Linear predictive coding; SIGNAL (programming language); Artificial intelligence; Algorithm; Mathematics; Telecommunications","score_opus":0.025271599809959487,"score_gpt":0.29391622605632406,"score_spread":0.2686446262463646,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1571663174","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.024694245,0.00022628374,0.97388524,0.000085214764,0.000018601479,0.000025331423,0.000023921199,0.000095858246,0.000945387],"genre_scores_gemma":[0.23352915,0.00062806375,0.7635595,0.000067643094,0.000054475637,0.00007266283,0.00015267059,0.000055951434,0.0018798648],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996923,0.00007267798,0.000020415151,0.0000543518,0.00013663362,0.0000236517],"domain_scores_gemma":[0.99917823,0.00046875994,0.000060947958,0.00013855369,0.00012380906,0.000029672008],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047472236,0.00026811118,0.00040361387,0.00038235696,0.00023088836,0.0006023834,0.0004758518,0.00054071774,0.00094871165],"category_scores_gemma":[0.0024530804,0.00015606999,0.00020795467,0.0004765938,0.0005820592,0.0014046023,0.0007380437,0.0007181872,0.0004885319],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00082786626,0.00010610925,0.0009707727,0.0004267188,0.000056526227,0.00022306317,0.00028329503,0.08619427,0.2754023,0.060528357,0.001193288,0.5737874],"study_design_scores_gemma":[0.00007142899,0.00046364468,0.00071223604,0.00008372075,0.000039061517,0.00071488315,0.00015912471,0.8096453,0.15164982,0.026715873,0.009704856,0.000039970942],"about_ca_topic_score_codex":0.00035183667,"about_ca_topic_score_gemma":0.00047388638,"teacher_disagreement_score":0.00094871165,"about_ca_system_score_codex":0.0002221796,"about_ca_system_score_gemma":0.00030965253,"threshold_uncertainty_score":0.003173709},"labels":[],"label_agreement":null},{"id":"W1575535846","doi":"10.1109/icassp.1986.1168612","title":"Reducing signal delay in multipulse coding at 16kb/s","year":2005,"lang":"en","type":"article","venue":"","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Bell (Canada)","funders":"","keywords":"Computer science; Coding (social sciences); SIGNAL (programming language); Degradation (telecommunications); Electronic engineering; Signal processing; Digital signal processing; Algorithm; Telecommunications; Mathematics; Computer hardware; Engineering","score_opus":0.02145320620840846,"score_gpt":0.2877197850274321,"score_spread":0.26626657881902366,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1575535846","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4768434,0.0011504202,0.5138119,0.00028726857,0.00014852275,0.00013124022,0.00017173412,0.0015555042,0.0059000147],"genre_scores_gemma":[0.74473894,0.00039760652,0.25014296,0.000110259614,0.00004555637,0.00009960803,0.00023117503,0.00014176151,0.0040922468],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9997726,0.000035453235,0.000015781132,0.000027392249,0.000117523465,0.00003134636],"domain_scores_gemma":[0.99913776,0.00041636112,0.000112092486,0.00013445172,0.00015499818,0.000044393026],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003192666,0.00032717292,0.00018553082,0.00045872552,0.00022369537,0.00042563642,0.0004748665,0.0004855368,0.0026573376],"category_scores_gemma":[0.0019482197,0.00014871662,0.00011422624,0.0004098997,0.00028799457,0.00075647247,0.00037483725,0.00048571153,0.00074904837],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006172764,0.0001244137,0.0008592327,0.00015902893,0.000010933322,0.00022068604,0.00018582973,0.01748716,0.6672788,0.011193444,0.0006058252,0.30125734],"study_design_scores_gemma":[0.00008183948,0.00085665233,0.0017233251,0.000057027883,0.000017459464,0.0005494414,0.000065505184,0.13439211,0.8473454,0.00477279,0.010106729,0.000031765387],"about_ca_topic_score_codex":0.0007158482,"about_ca_topic_score_gemma":0.0017742967,"teacher_disagreement_score":0.0026573376,"about_ca_system_score_codex":0.00047043926,"about_ca_system_score_gemma":0.00063959084,"threshold_uncertainty_score":0.008889616},"labels":[],"label_agreement":null},{"id":"W1585971001","doi":"10.1109/icassp.1985.1168210","title":"Two-dimensional digital filters with minimum cycle time","year":2005,"lang":"en","type":"article","venue":"","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Filter (signal processing); Digital filter; Root-raised-cosine filter; Throughput; Pixel; Filter design; Computer hardware; Algorithm; Real-time computing; Computer vision; Telecommunications","score_opus":0.005900329748722365,"score_gpt":0.23456646225499397,"score_spread":0.2286661325062716,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1585971001","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.029113213,0.0007045656,0.9647052,0.00015060212,0.00012112051,0.000055005305,0.0000536887,0.0006807089,0.004415802],"genre_scores_gemma":[0.24217658,0.0005955979,0.74509066,0.00018235622,0.000121787576,0.00017984917,0.00014312772,0.00007398325,0.011436135],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999632,0.00003112389,0.00002648503,0.000063062456,0.00021942199,0.000027971846],"domain_scores_gemma":[0.99956113,0.00013997608,0.000066220855,0.00008315444,0.00012860715,0.000020912688],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024556983,0.0003555459,0.0003745995,0.0004764725,0.00027635097,0.0007453344,0.00043834382,0.0007551749,0.0027000962],"category_scores_gemma":[0.0010951019,0.00023455633,0.00025169717,0.00051609025,0.00032235414,0.00084791996,0.0003038131,0.0004637997,0.0010389853],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006709089,0.00013162072,0.0008090144,0.00038415592,0.00006870775,0.00024793405,0.00018745178,0.027843084,0.40217933,0.05325895,0.0034781522,0.51074076],"study_design_scores_gemma":[0.00031606626,0.0010751701,0.0020160633,0.00008430492,0.00010574962,0.0016859674,0.000063665226,0.47300482,0.3991532,0.026931453,0.09544137,0.00012212123],"about_ca_topic_score_codex":0.000404798,"about_ca_topic_score_gemma":0.0010891971,"teacher_disagreement_score":0.0027000962,"about_ca_system_score_codex":0.00045139622,"about_ca_system_score_gemma":0.00049583457,"threshold_uncertainty_score":0.009032726},"labels":[],"label_agreement":null},{"id":"W1588766067","doi":"10.1109/iscas.1994.409111","title":"Associative memory architecture for video compression","year":2002,"lang":"en","type":"article","venue":"","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Computer science; Content-addressable memory; Architecture; Computer architecture; Data compression; Very-large-scale integration; Associative property; Modularity (biology); Vector quantization; Quantization (signal processing); Content-addressable storage; Codec; Artificial intelligence; Frame (networking); Computer engineering; Theoretical computer science; Computer hardware; Embedded system; Algorithm; Artificial neural network; Mathematics","score_opus":0.025925937178196263,"score_gpt":0.27770826422198075,"score_spread":0.2517823270437845,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1588766067","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11188981,0.012879861,0.82191145,0.0009069756,0.0010773509,0.00013829581,0.0002649473,0.0060579036,0.044873465],"genre_scores_gemma":[0.75046724,0.0046491167,0.21569622,0.0009619578,0.00039725876,0.00016143273,0.0004994569,0.00010266252,0.027064672],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99991846,0.000009468422,0.000006199808,0.000017151997,0.00003711292,0.000011626294],"domain_scores_gemma":[0.9999083,0.000017909319,0.0000073302294,0.000017191325,0.000043469812,0.0000058333217],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00011132384,0.00022283389,0.00018237322,0.00039031537,0.00032319236,0.0004859327,0.0008577123,0.0004221347,0.005423161],"category_scores_gemma":[0.00029091787,0.000081285056,0.00013214514,0.00062441936,0.00023583409,0.0009824857,0.00028857208,0.00047907772,0.0011110102],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00027710883,0.000150958,0.0005627652,0.00045039895,0.000067177796,0.00035317917,0.00009719645,0.019960351,0.15109573,0.1093446,0.013398807,0.7042417],"study_design_scores_gemma":[0.00016292064,0.0008909355,0.001301953,0.00013638815,0.00023736706,0.0019979097,0.00013543857,0.5081855,0.25660148,0.07463698,0.15562068,0.00009249595],"about_ca_topic_score_codex":0.00085577916,"about_ca_topic_score_gemma":0.0016243205,"teacher_disagreement_score":0.005423161,"about_ca_system_score_codex":0.0003009404,"about_ca_system_score_gemma":0.00035996133,"threshold_uncertainty_score":0.018142283},"labels":[],"label_agreement":null},{"id":"W1593300848","doi":"10.1109/wescan.1995.493976","title":"Simultaneous voice and in-band data","year":2002,"lang":"en","type":"article","venue":"","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Saskatchewan","funders":"","keywords":"Telephone line; Telephone network; Telephony; Computer science; Mobile radio telephone; Telecommunications; Line (geometry); Voice communication; Computer network","score_opus":0.04328135350516467,"score_gpt":0.2915911462192802,"score_spread":0.24830979271411552,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1593300848","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14279293,0.008603255,0.6213905,0.0017897699,0.0030982634,0.0001875481,0.00039547466,0.0016532211,0.22008903],"genre_scores_gemma":[0.7737933,0.006371785,0.09170364,0.0013379315,0.0024441716,0.000104760315,0.00050404697,0.00028595023,0.123454474],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9992816,0.00006732161,0.0000287635,0.00011100961,0.00038116693,0.00013025058],"domain_scores_gemma":[0.9995522,0.00015694957,0.000034916266,0.0000744695,0.00015142481,0.000030019548],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003212671,0.0004932186,0.00037729985,0.0005454765,0.0004903701,0.0013472077,0.0005592936,0.00072001107,0.008836247],"category_scores_gemma":[0.0009934192,0.0002165705,0.00026605724,0.0005686439,0.0004918625,0.0017030289,0.0013563068,0.00061256107,0.0027695165],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007364927,0.00014525911,0.0022121116,0.000783918,0.000060789604,0.0021804967,0.0012481421,0.0045921244,0.25870278,0.074601084,0.012008985,0.6427279],"study_design_scores_gemma":[0.000105471314,0.0012734542,0.0036709232,0.0003870931,0.00020416881,0.014157238,0.0013760993,0.049390946,0.40939194,0.033285588,0.4866169,0.00014005286],"about_ca_topic_score_codex":0.00037870216,"about_ca_topic_score_gemma":0.00059047766,"teacher_disagreement_score":0.008836247,"about_ca_system_score_codex":0.00022400975,"about_ca_system_score_gemma":0.00023170783,"threshold_uncertainty_score":0.029560149},"labels":[],"label_agreement":null},{"id":"W1593689416","doi":"10.1109/icassp.1985.1168409","title":"Adptive vector quantization for image sequence coding","year":2005,"lang":"en","type":"article","venue":"","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Codebook; Vector quantization; Linde–Buzo–Gray algorithm; Learning vector quantization; Quantization (signal processing); Computer science; Artificial intelligence; Algorithm; Coding (social sciences); Pixel; Pattern recognition (psychology); Bit rate; Computer vision; Sequence (biology); Image quality; Image (mathematics); Mathematics; Statistics; Computer engineering","score_opus":0.04493309174177421,"score_gpt":0.34630311390820573,"score_spread":0.3013700221664315,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1593689416","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0015255901,0.0044560977,0.9909848,0.00019393768,0.00017557123,0.00004339079,0.000041168958,0.00023272364,0.00234688],"genre_scores_gemma":[0.12818347,0.007792422,0.8545364,0.0003858474,0.00048595353,0.00022672593,0.00035813107,0.00007555762,0.007955444],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9993414,0.00019224029,0.00004087165,0.000059278103,0.00033943512,0.000026805666],"domain_scores_gemma":[0.9996171,0.00016067918,0.000027599794,0.00006949759,0.00011636848,0.000008664574],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006696791,0.00033057728,0.00034209102,0.00059137796,0.00022910071,0.00063030113,0.0007230193,0.00052015425,0.0026435908],"category_scores_gemma":[0.0019840798,0.00014291563,0.0002024085,0.0010206773,0.00060428935,0.00081675284,0.00050351507,0.00086578465,0.0010700246],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009662711,0.000025705805,0.0002100835,0.00030713758,0.000022135713,0.00008826775,0.00007604991,0.029408276,0.023225224,0.21843031,0.0064107543,0.72169954],"study_design_scores_gemma":[0.000049164377,0.0002685215,0.00044217508,0.00018997473,0.000031731954,0.00066431693,0.000043870852,0.6428649,0.030215116,0.19762564,0.12753758,0.00006717327],"about_ca_topic_score_codex":0.001163168,"about_ca_topic_score_gemma":0.001513746,"teacher_disagreement_score":0.0026435908,"about_ca_system_score_codex":0.0004156334,"about_ca_system_score_gemma":0.0004107798,"threshold_uncertainty_score":0.00884366},"labels":[],"label_agreement":null},{"id":"W1594363840","doi":"10.1109/icassp.2015.7179065","title":"Packet-loss concealment technology advances in EVS","year":2015,"lang":"en","type":"article","venue":"","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":26,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"VoiceAge (Canada)","funders":"","keywords":"Codec; Computer science; Packet loss; Jitter; Network packet; Robustness (evolution); Computer network; Embedded system; Computer hardware; Telecommunications","score_opus":0.020851370419776916,"score_gpt":0.31821012385269404,"score_spread":0.2973587534329171,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1594363840","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.055705488,0.013466286,0.902899,0.0014499107,0.00073051645,0.0001698539,0.00019722045,0.0009735182,0.02440827],"genre_scores_gemma":[0.6653315,0.015557098,0.29055443,0.00095093146,0.0007656402,0.00015707976,0.0007603534,0.00023372004,0.025689295],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9983565,0.00029063705,0.00013515852,0.0001670681,0.0009006368,0.00014983832],"domain_scores_gemma":[0.9976041,0.0004217899,0.00019514373,0.00031079372,0.0014147994,0.000053421925],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024116451,0.0005775421,0.00037178147,0.0012549177,0.0002595289,0.0014574733,0.0009059138,0.0009274221,0.0011957006],"category_scores_gemma":[0.0036870383,0.000296935,0.00041974013,0.0009558826,0.000742545,0.0019617614,0.0011128087,0.0016564415,0.0007274643],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00046120357,0.000102057056,0.0025505752,0.0005712385,0.000056235996,0.0006244608,0.0005453021,0.03968213,0.16771959,0.19582929,0.0056850486,0.58617294],"study_design_scores_gemma":[0.00006977158,0.0012015122,0.0032232853,0.00048552515,0.00011390772,0.0030079698,0.0002550282,0.20467527,0.45635524,0.029464876,0.30097336,0.00017418849],"about_ca_topic_score_codex":0.0013134774,"about_ca_topic_score_gemma":0.00070353015,"teacher_disagreement_score":0.0024116451,"about_ca_system_score_codex":0.001023662,"about_ca_system_score_gemma":0.0010053109,"threshold_uncertainty_score":0.012754142},"labels":[],"label_agreement":null},{"id":"W1594640825","doi":"10.1109/icassp.1995.479637","title":"Spectral excitation coding of speech at 2.4 kb/s","year":2002,"lang":"en","type":"article","venue":"","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Speech coding; Quantization (signal processing); Vector quantization; Harmonic Vector Excitation Coding; Codec2; Excitation; Speech recognition; Dimension (graph theory); Linear predictive coding; Coding (social sciences); Computer science; Algorithm; Adaptive Multi-Rate audio codec; Codec; Acoustics; Mathematics; Physics; Speech processing; Voice activity detection; Telecommunications; Statistics","score_opus":0.035136688578398675,"score_gpt":0.27510428760828903,"score_spread":0.23996759902989034,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1594640825","genre_codex":"empirical","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.80067724,0.0005067396,0.1871872,0.00027589832,0.00014852616,0.00013618144,0.00042295243,0.0025802075,0.008065118],"genre_scores_gemma":[0.9149125,0.00033506085,0.077154815,0.000111058005,0.00005743334,0.00009098916,0.0007239413,0.0001810903,0.006433042],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99982774,0.00004014528,0.000010452268,0.000016807948,0.000079960955,0.000024826279],"domain_scores_gemma":[0.9992785,0.0003070333,0.00003655168,0.000077255216,0.00026722415,0.00003352789],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031958695,0.00026809174,0.00021898911,0.000401817,0.00022618883,0.00031941698,0.00025026142,0.00029050352,0.0034177925],"category_scores_gemma":[0.0014302139,0.00007551886,0.00006002721,0.00027785712,0.00025647038,0.00031663757,0.00034100137,0.00027695257,0.0006771239],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0018089984,0.00013930035,0.0020812273,0.00021233739,0.000021795686,0.00071151764,0.0006363221,0.01692117,0.56639814,0.0073069204,0.0037048215,0.4000574],"study_design_scores_gemma":[0.00009223349,0.0017731948,0.0070985747,0.00009290184,0.000050102786,0.001148672,0.00029232516,0.24220353,0.7256211,0.0023733727,0.019171001,0.000083007166],"about_ca_topic_score_codex":0.0010644012,"about_ca_topic_score_gemma":0.0012408533,"teacher_disagreement_score":0.0034177925,"about_ca_system_score_codex":0.00016607236,"about_ca_system_score_gemma":0.0001906184,"threshold_uncertainty_score":0.011433661},"labels":[],"label_agreement":null},{"id":"W1594902770","doi":"10.1109/glocom.1994.513038","title":"Congestion control in integrated voice-data frame relay networks and the case for embedded coding","year":2002,"lang":"en","type":"article","venue":"","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"Instituto de Telecomunicações","keywords":"Computer science; Frame Relay; Computer network; Relay; Quality of service; Network congestion; Frame (networking); Coding (social sciences); Real-time computing","score_opus":0.036042016630056,"score_gpt":0.28849035954406,"score_spread":0.252448342914004,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1594902770","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13039951,0.010107427,0.8420311,0.0017749104,0.0002531955,0.00014787508,0.000042241038,0.000259942,0.01498378],"genre_scores_gemma":[0.9318306,0.0045417384,0.059074484,0.0002143315,0.0001780499,0.00010508752,0.00002836366,0.000049611055,0.0039778124],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99927074,0.00026720043,0.000022879103,0.00010508781,0.00019597297,0.00013810754],"domain_scores_gemma":[0.9979697,0.0015198343,0.00016705002,0.000093758244,0.00019602003,0.00005356979],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014087228,0.0006381263,0.0006204826,0.00035866583,0.0004135993,0.0015051909,0.0012402341,0.0013405279,0.0016770462],"category_scores_gemma":[0.0071742013,0.00039389235,0.00025297422,0.0005227562,0.0021421767,0.0033919702,0.00072908663,0.0012798175,0.00015701813],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00045554814,0.0001088674,0.0010853687,0.00036887685,0.00006842238,0.00052028184,0.00044038057,0.4221476,0.02429921,0.41468498,0.002530033,0.13329044],"study_design_scores_gemma":[0.00008542277,0.00054573605,0.0007653368,0.000100320285,0.000091211215,0.00048509403,0.00019686579,0.7904899,0.01477133,0.18503177,0.0073619625,0.00007494434],"about_ca_topic_score_codex":0.002160442,"about_ca_topic_score_gemma":0.002399746,"teacher_disagreement_score":0.002160442,"about_ca_system_score_codex":0.0010026523,"about_ca_system_score_gemma":0.00051140727,"threshold_uncertainty_score":0.0074501634},"labels":[],"label_agreement":null},{"id":"W1596822940","doi":"10.1109/dcc.1996.488377","title":"Audio coding using variable-depth multistage quantizers","year":2002,"lang":"en","type":"article","venue":"","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Sub-band coding; Computer science; Speech coding; Fidelity; Coding (social sciences); Speech recognition; Variable-length code; Quantization (signal processing); Audio signal; High fidelity; Entropy (arrow of time); Digital audio; Coding tree unit; Tunstall coding; Entropy encoding; Theoretical computer science; Algorithm; Decoding methods; Mathematics; Telecommunications; Acoustics; Statistics","score_opus":0.0744556640525527,"score_gpt":0.30108900163170316,"score_spread":0.22663333757915044,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1596822940","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.026558619,0.0005031653,0.9707498,0.000084848114,0.00003035566,0.00005137599,0.000055305314,0.00023395657,0.0017326],"genre_scores_gemma":[0.36593664,0.0007324491,0.6294588,0.000071081595,0.000033193683,0.000089858906,0.00012601793,0.00003373069,0.0035182473],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9998468,0.000025129393,0.000010086475,0.00002062765,0.00008508301,0.000012192595],"domain_scores_gemma":[0.99975663,0.00011127081,0.000033065513,0.000044715624,0.00004456955,0.000009738511],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002373339,0.0002441725,0.00021614223,0.00028278286,0.00014134825,0.00035095582,0.00042707555,0.00027644425,0.0012581503],"category_scores_gemma":[0.0008280089,0.00014317533,0.00017776072,0.00034393667,0.0003293721,0.0006977448,0.00051025423,0.00042608945,0.00024301797],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002962119,0.000053278516,0.00050271803,0.00024051995,0.000026499856,0.00012390898,0.00019325271,0.12298129,0.32510042,0.09464735,0.0015879027,0.45424664],"study_design_scores_gemma":[0.00005408753,0.0001754036,0.0008051548,0.000041392468,0.00002108921,0.00015937343,0.000024547156,0.85229874,0.11645766,0.021014242,0.008912838,0.00003547529],"about_ca_topic_score_codex":0.0007043949,"about_ca_topic_score_gemma":0.0012880831,"teacher_disagreement_score":0.0012581503,"about_ca_system_score_codex":0.00035194153,"about_ca_system_score_gemma":0.00031686982,"threshold_uncertainty_score":0.004208982},"labels":[],"label_agreement":null},{"id":"W1597080302","doi":"10.1007/11796435_10","title":"Efficient Automated Clock Gating Using CoDeL","year":2006,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Computer science; Clock gating; Embedded system; Power gating; Netlist; Computer hardware; Computer architecture; Clock signal; Clock skew; Engineering; Electrical engineering; Telecommunications","score_opus":0.020655920233807492,"score_gpt":0.28586468687680583,"score_spread":0.26520876664299836,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1597080302","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.030947806,0.00076334586,0.90417796,0.00036379858,0.0004107156,0.00024083279,0.00053241616,0.045212362,0.017350681],"genre_scores_gemma":[0.4400695,0.00030919007,0.5388038,0.000635826,0.00015537339,0.00033943704,0.0011997762,0.0035348907,0.01495219],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99921227,0.00013890771,0.00004466814,0.00011938741,0.00033379157,0.0001509777],"domain_scores_gemma":[0.99876165,0.00051035103,0.00009872912,0.00031641743,0.00026091214,0.00005201642],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004281366,0.0012506506,0.00067145604,0.0012343551,0.00070819695,0.0016658319,0.0017305014,0.00058314117,0.012342458],"category_scores_gemma":[0.0017910115,0.0004629671,0.00038543163,0.0010815077,0.0005197414,0.0013760332,0.0012784787,0.0008902967,0.0035209584],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00095567614,0.00021630096,0.0010835618,0.00039759028,0.000057942932,0.00035235315,0.00020315681,0.01835693,0.13540395,0.027796064,0.03937633,0.77580017],"study_design_scores_gemma":[0.00030026675,0.0004607689,0.00081675424,0.00013990326,0.00011718419,0.0005556225,0.00014528447,0.5218041,0.35959768,0.03248333,0.08347378,0.00010529107],"about_ca_topic_score_codex":0.0018406853,"about_ca_topic_score_gemma":0.0043769055,"teacher_disagreement_score":0.012342458,"about_ca_system_score_codex":0.0009331995,"about_ca_system_score_gemma":0.0016049303,"threshold_uncertainty_score":0.041289628},"labels":[],"label_agreement":null},{"id":"W1601293496","doi":"10.1109/glocom.1994.512716","title":"Vector quantization of harmonic magnitudes for low-rate speech coders","year":2002,"lang":"en","type":"article","venue":"","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Vector quantization; Quantization (signal processing); Mathematics; Algorithm; Speech coding; Harmonic Vector Excitation Coding; Dimension (graph theory); Coding (social sciences); Speech recognition; Computer science; Statistics","score_opus":0.039836451687988855,"score_gpt":0.284221560947957,"score_spread":0.24438510925996812,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1601293496","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009454685,0.00036006176,0.988076,0.00012911344,0.000058306094,0.00004387588,0.000049636397,0.00062564784,0.0012027222],"genre_scores_gemma":[0.2013367,0.00054745696,0.7946345,0.00007568951,0.000060081875,0.0000948684,0.00029152076,0.00011043985,0.0028487362],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99928623,0.00019839204,0.000049834696,0.000051170024,0.0003888564,0.000025597108],"domain_scores_gemma":[0.9987821,0.00055204966,0.000081158745,0.0002055888,0.0003614626,0.000017567683],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007679409,0.00036104856,0.00032577637,0.00037416446,0.00031161512,0.0007137281,0.0004835206,0.00039965517,0.004377737],"category_scores_gemma":[0.003854243,0.00017762638,0.00017397475,0.00050917594,0.00044668544,0.000870163,0.00037717668,0.00068916543,0.0011615808],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00029860952,0.000059879763,0.00050930574,0.0002661621,0.000018623801,0.00007055695,0.000107732914,0.042967286,0.12889956,0.05573427,0.0037493212,0.7673186],"study_design_scores_gemma":[0.00006074619,0.00026376048,0.0010298433,0.00006574415,0.000028799059,0.0002911152,0.00006664154,0.7621134,0.19340144,0.022549886,0.020079441,0.00004919409],"about_ca_topic_score_codex":0.0010159614,"about_ca_topic_score_gemma":0.0022885087,"teacher_disagreement_score":0.004377737,"about_ca_system_score_codex":0.00046884065,"about_ca_system_score_gemma":0.0006113895,"threshold_uncertainty_score":0.014644921},"labels":[],"label_agreement":null},{"id":"W1601379362","doi":"10.1109/acssc.1994.471637","title":"Speech coding for wireless communication","year":2002,"lang":"en","type":"article","venue":"","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Institut National de la Recherche Scientifique","funders":"","keywords":"GSM; Computer science; Wireless; Speech coding; Quality of service; Wireline; Coding (social sciences); Computer network; Telecommunications; Voice activity detection; Transmission (telecommunications); Speech recognition; Speech processing; Mathematics","score_opus":0.048925337679797246,"score_gpt":0.29818324562617826,"score_spread":0.24925790794638103,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1601379362","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006146985,0.11306745,0.6319134,0.006909561,0.014198593,0.0008287888,0.0036133179,0.0045540715,0.21876779],"genre_scores_gemma":[0.1111581,0.122471996,0.41145128,0.0067366017,0.0068995333,0.0019048832,0.011891415,0.0014298127,0.3260564],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992343,0.00021021157,0.000060016373,0.00009094036,0.00034887643,0.000055622488],"domain_scores_gemma":[0.9993079,0.0002137787,0.000053121694,0.00011267504,0.0002826595,0.000029850764],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00058220956,0.0009044235,0.00060195697,0.0010294311,0.0005099219,0.0014737066,0.000747246,0.0014137621,0.03302066],"category_scores_gemma":[0.0018637796,0.00017542363,0.00025352207,0.0015185232,0.0006875579,0.0011980702,0.0011567688,0.0017481652,0.022775244],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010387774,0.000040042705,0.00017470232,0.0014191634,0.000035196943,0.00029427942,0.00019631091,0.0032896968,0.019410424,0.17880759,0.17489234,0.6213363],"study_design_scores_gemma":[0.000028220149,0.00009795982,0.0005926733,0.0005807299,0.000018463435,0.00070029154,0.000085770094,0.014147736,0.0064454265,0.07154496,0.90571,0.0000479192],"about_ca_topic_score_codex":0.0012827567,"about_ca_topic_score_gemma":0.0011347207,"teacher_disagreement_score":0.03302066,"about_ca_system_score_codex":0.00058462453,"about_ca_system_score_gemma":0.000851476,"threshold_uncertainty_score":0.11046505},"labels":[],"label_agreement":null},{"id":"W1603214327","doi":"10.1109/ccece.1995.526614","title":"Modelling of the excitation for low-rate speech coding (≤4 kbit/s)","year":2002,"lang":"en","type":"article","venue":"","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Sherbrooke","funders":"","keywords":"Computer science; Linear predictive coding; Speech coding; Speech recognition; Harmonic Vector Excitation Coding; Speech synthesis; Redundancy (engineering); Decoding methods; Coding (social sciences); Speech processing; Codec2; Speech production; Voice; Signal processing; Algorithm; Mathematics; Digital signal processing; Statistics","score_opus":0.07555792113242926,"score_gpt":0.2767777800114953,"score_spread":0.20121985887906602,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1603214327","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014487564,0.00044066046,0.9832654,0.00008234031,0.000029705647,0.000034342916,0.00009711038,0.0002098787,0.0013530932],"genre_scores_gemma":[0.67650145,0.0021223591,0.3130333,0.000073782685,0.00006234493,0.0002289928,0.0008589216,0.00019300495,0.0069257976],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99985635,0.00004883135,0.00000793214,0.00001981624,0.000054702967,0.000012342248],"domain_scores_gemma":[0.9997129,0.0001826843,0.000029966506,0.000029388162,0.000037745514,0.000007309992],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034589713,0.00052940275,0.00038002364,0.00016917524,0.00017274063,0.0004919767,0.00046871504,0.0006983076,0.0014625787],"category_scores_gemma":[0.000990583,0.00017603589,0.00037688893,0.0002151077,0.00032876004,0.00047818263,0.0003039533,0.00075570366,0.001009284],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011622899,0.00004105787,0.00095446804,0.0005593637,0.00002680338,0.00023394304,0.0001861052,0.7246597,0.12393985,0.020956594,0.0012934523,0.12703246],"study_design_scores_gemma":[0.0000033983488,0.00006328353,0.0005196707,0.000028422239,0.000011067331,0.00014378116,0.000016732332,0.97482806,0.016516512,0.004292171,0.0035643154,0.000012608889],"about_ca_topic_score_codex":0.0015954791,"about_ca_topic_score_gemma":0.0016936847,"teacher_disagreement_score":0.0015954791,"about_ca_system_score_codex":0.00026206762,"about_ca_system_score_gemma":0.000425792,"threshold_uncertainty_score":0.004892826},"labels":[],"label_agreement":null},{"id":"W1606151816","doi":"10.1109/iembs.2006.259819","title":"Unbalanced 3-D Tree Structure for Region-Based Coding of Volumetric Medical Images","year":2006,"lang":"en","type":"article","venue":"","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Coding (social sciences); Set partitioning in hierarchical trees; Computer science; Region of interest; Coding tree unit; Artificial intelligence; Tunstall coding; Tree structure; Algorithmic efficiency; Algorithm; Pattern recognition (psychology); Computer vision; Mathematics; Decoding methods; Image compression; Binary tree; Statistics; Image (mathematics); Image processing","score_opus":0.010347964075032976,"score_gpt":0.2674013019726536,"score_spread":0.25705333789762064,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1606151816","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007910531,0.00017853147,0.9910664,0.000078530895,0.000023337747,0.000027960918,0.00007891061,0.00017352648,0.0004623087],"genre_scores_gemma":[0.15153478,0.0006795663,0.84570867,0.00011811862,0.000058846257,0.00012956237,0.00062691566,0.000098158176,0.0010454137],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99966764,0.00007266808,0.00002325661,0.000027158894,0.00018692782,0.000022324708],"domain_scores_gemma":[0.9987411,0.0004926598,0.000116485695,0.00020426433,0.00040654436,0.000038974456],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00053764856,0.00037227676,0.0002721214,0.0009804327,0.00022332012,0.00048611176,0.0005552428,0.0004762012,0.001454585],"category_scores_gemma":[0.0029574204,0.00017073387,0.00029180234,0.00095258595,0.0003193765,0.0012378466,0.0005134252,0.00051949645,0.0006137257],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003891414,0.00006807646,0.001207087,0.000301068,0.00004113254,0.00026194463,0.00024351162,0.122384146,0.2103743,0.04511493,0.0056358143,0.61397886],"study_design_scores_gemma":[0.000027414628,0.00020995973,0.0008966419,0.000045783454,0.000032238313,0.0006922255,0.00005477838,0.8926993,0.07723997,0.012989291,0.015068308,0.000044044173],"about_ca_topic_score_codex":0.0010520983,"about_ca_topic_score_gemma":0.00180146,"teacher_disagreement_score":0.001454585,"about_ca_system_score_codex":0.00039661565,"about_ca_system_score_gemma":0.0005362892,"threshold_uncertainty_score":0.004866123},"labels":[],"label_agreement":null},{"id":"W1607671585","doi":"10.1109/icip.2004.1421608","title":"Robust wireless transmission of regions of interest in jpeg2000","year":2005,"lang":"en","type":"article","venue":"","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Concatenation (mathematics); Computer science; Multiple description coding; Network packet; JPEG 2000; Redundancy (engineering); Algorithm; Cyclic redundancy check; Fading; Wireless; Computer network; Channel (broadcasting); Real-time computing; Telecommunications; Image compression; Mathematics; Artificial intelligence; Image processing; Arithmetic","score_opus":0.08441438083538458,"score_gpt":0.29204555340916044,"score_spread":0.20763117257377586,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1607671585","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.091176994,0.0017599309,0.9038315,0.00020248868,0.000087200904,0.00006916465,0.00009671113,0.0005946282,0.0021814567],"genre_scores_gemma":[0.6506282,0.0016498233,0.34169874,0.00022394379,0.00014724261,0.000088189365,0.0002528928,0.0001532498,0.0051577166],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999708,0.000054174423,0.000010427043,0.00003887963,0.00015784892,0.00003060683],"domain_scores_gemma":[0.99964154,0.00013033951,0.00006949452,0.00007487232,0.00007015656,0.000013552357],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004607396,0.00038098343,0.00027712586,0.00033263027,0.00020786368,0.00040675802,0.00043977125,0.00040042057,0.0005961992],"category_scores_gemma":[0.0016076602,0.00019358862,0.00024910708,0.00033133136,0.0004090875,0.0006788717,0.00052887975,0.0004742845,0.00034620886],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011107125,0.00007491438,0.00083592883,0.00024227673,0.00007787976,0.00083803653,0.0003193067,0.08135414,0.58385473,0.019376796,0.003059842,0.3088555],"study_design_scores_gemma":[0.000069457106,0.00043084,0.0021681297,0.00007483643,0.00010465819,0.0020606809,0.00011179771,0.500603,0.47507146,0.0056341607,0.013600417,0.00007061411],"about_ca_topic_score_codex":0.0007519224,"about_ca_topic_score_gemma":0.00070483814,"teacher_disagreement_score":0.0007519224,"about_ca_system_score_codex":0.00021598194,"about_ca_system_score_gemma":0.00024496345,"threshold_uncertainty_score":0.0024366975},"labels":[],"label_agreement":null},{"id":"W161216500","doi":"","title":"Partitioned Compression of Bitmap Indices","year":2011,"lang":"en","type":"article","venue":"Sound Ideas (University of Puget Sound)","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Compression (physics); Bitmap; Computer science; Artificial intelligence","score_opus":0.037025743322986485,"score_gpt":0.23446226718124397,"score_spread":0.1974365238582575,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W161216500","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14267974,0.0029203845,0.82606727,0.00070062187,0.0005666596,0.00041117106,0.0027922087,0.004814374,0.019047536],"genre_scores_gemma":[0.44008046,0.0018020205,0.5367651,0.00048997824,0.00018142835,0.00047235747,0.0057937237,0.00078217214,0.013632822],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99940014,0.00007018285,0.00005110261,0.00008795835,0.00030232008,0.00008825471],"domain_scores_gemma":[0.99831307,0.0003095513,0.000082491184,0.00063133595,0.00060576986,0.00005781082],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031971434,0.0007021306,0.0008300834,0.0016447282,0.0005260961,0.0016347271,0.001136832,0.00063842704,0.0045046965],"category_scores_gemma":[0.0032751022,0.0002950266,0.00039946035,0.003943048,0.00045849994,0.0029813559,0.0013674358,0.0008220264,0.0019553143],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0015621383,0.00025628682,0.0014997335,0.00039635279,0.00008729896,0.0007842735,0.00059424323,0.06817998,0.103811055,0.07067778,0.030906374,0.7212445],"study_design_scores_gemma":[0.00019297254,0.00051240687,0.002302322,0.00015676039,0.00007382069,0.0013025443,0.00048433273,0.6599435,0.18819767,0.08782834,0.05889853,0.00010682496],"about_ca_topic_score_codex":0.0012607883,"about_ca_topic_score_gemma":0.0017200714,"teacher_disagreement_score":0.0045046965,"about_ca_system_score_codex":0.0006055898,"about_ca_system_score_gemma":0.0007402397,"threshold_uncertainty_score":0.015069783},"labels":[],"label_agreement":null},{"id":"W1619071046","doi":"10.1109/icassp.2000.859104","title":"Perceptual bit allocation for low rate coding of narrowband audio","year":2002,"lang":"en","type":"article","venue":"","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Narrowband; Computer science; Speech recognition; Noise shaping; Speech coding; Sub-band coding; Coding (social sciences); Masking (illustration); Noise (video); Acoustics; Electronic engineering; Mathematics; Telecommunications; Artificial intelligence; Engineering; Physics; Computer vision; Statistics","score_opus":0.03416489687076789,"score_gpt":0.27128440714093466,"score_spread":0.23711951027016676,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1619071046","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08045078,0.0007702318,0.9156597,0.00013366928,0.000047058074,0.00004793777,0.000018143352,0.00011124245,0.0027612513],"genre_scores_gemma":[0.8463142,0.00048144418,0.15067618,0.000070710696,0.00004376836,0.00006516573,0.000025977708,0.000049158396,0.0022734534],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996269,0.00016213724,0.000013057268,0.000037341568,0.00012043927,0.000040059742],"domain_scores_gemma":[0.9994375,0.00038816454,0.0000404665,0.000038848208,0.00007578473,0.000019134171],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00055463635,0.0003896438,0.00029111738,0.00019302792,0.00020373968,0.0005376091,0.00054610363,0.00041190052,0.0016133124],"category_scores_gemma":[0.0018376261,0.00013315196,0.00018727689,0.00021508084,0.0005727051,0.0007566196,0.0003906273,0.00041397067,0.0002251998],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00067876524,0.00014130805,0.0006443628,0.0003023791,0.000030451261,0.00030259634,0.00018824829,0.6703424,0.12090166,0.07913314,0.0009964623,0.12633832],"study_design_scores_gemma":[0.000017517343,0.00006680189,0.00015592219,0.000008498482,0.000008977093,0.0000512352,0.000018214963,0.98011786,0.010567887,0.00819814,0.00077799597,0.000010956836],"about_ca_topic_score_codex":0.0009982869,"about_ca_topic_score_gemma":0.0010373371,"teacher_disagreement_score":0.0016133124,"about_ca_system_score_codex":0.00047849354,"about_ca_system_score_gemma":0.00027231761,"threshold_uncertainty_score":0.0053970814},"labels":[],"label_agreement":null},{"id":"W1619596152","doi":"10.1109/scft.1999.781466","title":"A wideband speech and audio codec at 16/24/32 kbit/s using hybrid ACELP/TCX techniques","year":2003,"lang":"en","type":"article","venue":"","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":25,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Sherbrooke","funders":"","keywords":"Speech coding; Computer science; Speech recognition; Codec; Linear prediction; Linear predictive coding; Full Rate; Computer hardware","score_opus":0.025128324872530784,"score_gpt":0.28169218402044177,"score_spread":0.25656385914791097,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1619596152","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.28493968,0.0006768819,0.70237976,0.00022534182,0.00016031024,0.0005194785,0.0003111553,0.0045017847,0.006285609],"genre_scores_gemma":[0.48779783,0.0003778313,0.49551687,0.00017195077,0.00012759214,0.00044297168,0.00075117795,0.00021478765,0.014598964],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9996326,0.000044104647,0.000021527343,0.000051553827,0.00020792523,0.000042267762],"domain_scores_gemma":[0.99936575,0.0001645734,0.00004289561,0.00007160181,0.00030494874,0.000050271196],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006168963,0.0005614453,0.00038394728,0.00082874106,0.00042956093,0.00047653812,0.00050287234,0.00069411896,0.0029247454],"category_scores_gemma":[0.000773787,0.00013725461,0.00019661896,0.000429854,0.00033256592,0.00038281397,0.00039335317,0.0005455872,0.0011980606],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009616037,0.00014322203,0.0015605794,0.00014250797,0.00006160467,0.00053665484,0.00022392832,0.004834701,0.5957166,0.0030096679,0.0020971852,0.39071175],"study_design_scores_gemma":[0.00027271349,0.0021762294,0.006063705,0.00008771977,0.0001608491,0.0031443825,0.0001287074,0.1439717,0.81015897,0.0010129565,0.03268866,0.0001334127],"about_ca_topic_score_codex":0.0021893044,"about_ca_topic_score_gemma":0.0035463518,"teacher_disagreement_score":0.0029247454,"about_ca_system_score_codex":0.00029056668,"about_ca_system_score_gemma":0.0004617352,"threshold_uncertainty_score":0.009784222},"labels":[],"label_agreement":null},{"id":"W1619898710","doi":"10.1109/icassp.1995.479410","title":"Reconstruction of missing packets for CELP-based speech coders","year":2002,"lang":"en","type":"article","venue":"","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Code-excited linear prediction; Computer science; Speech recognition; Speech coding; Linear predictive coding; Network packet; Voice activity detection; Codec2; Erasure; Speech processing; Computer network","score_opus":0.043289721208108936,"score_gpt":0.2802000708142504,"score_spread":0.2369103496061415,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1619898710","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.44904253,0.00037717214,0.54717094,0.0002002915,0.000054656895,0.00011535365,0.0001085945,0.0016887828,0.0012416018],"genre_scores_gemma":[0.8207758,0.00032770494,0.17609042,0.00009293176,0.00003498828,0.000060196355,0.00029083944,0.00016337837,0.0021636977],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99937373,0.00014724708,0.00003655983,0.000051862542,0.00034057355,0.000050054696],"domain_scores_gemma":[0.9970402,0.0013088351,0.0003221681,0.00046278184,0.0007971111,0.00006877572],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010649662,0.00044074323,0.00038030595,0.0004628667,0.00022937787,0.00045660874,0.00046616237,0.0005599358,0.0010417472],"category_scores_gemma":[0.005027445,0.0001806119,0.00018455267,0.00027311326,0.00042094523,0.0005182961,0.00042911601,0.00058951776,0.00057566806],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0020180638,0.000106142346,0.0023532745,0.00024816595,0.00004563184,0.00076572114,0.00030164747,0.029494496,0.7476343,0.0016482678,0.000851432,0.2145329],"study_design_scores_gemma":[0.00006092506,0.0006471275,0.001834113,0.000029056228,0.00003910357,0.0008748524,0.0000964294,0.22423455,0.76931137,0.00062656857,0.0022133016,0.000032701497],"about_ca_topic_score_codex":0.00060317764,"about_ca_topic_score_gemma":0.00078172353,"teacher_disagreement_score":0.0010649662,"about_ca_system_score_codex":0.00023895646,"about_ca_system_score_gemma":0.00024028546,"threshold_uncertainty_score":0.005632162},"labels":[],"label_agreement":null},{"id":"W1663306983","doi":"10.1109/icwc.1992.200743","title":"A hybrid multiband excitation coder for low bit rates","year":2003,"lang":"en","type":"article","venue":"","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Communications Research Centre Canada","funders":"","keywords":"Computer science; QUIET; Speech recognition; Quality (philosophy); Excitation; Artificial intelligence; Algorithm; Engineering; Electrical engineering; Physics","score_opus":0.020162874940739,"score_gpt":0.3063075878787372,"score_spread":0.2861447129379982,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1663306983","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.055581357,0.0011574083,0.9238562,0.0003549881,0.00021756477,0.00017290117,0.00035477607,0.00826992,0.010034983],"genre_scores_gemma":[0.36527875,0.0006424508,0.57733166,0.0006589791,0.00022248001,0.00037170303,0.00097382255,0.0009949842,0.05352519],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99909365,0.00013099326,0.000056028086,0.00011483878,0.0005565077,0.00004797709],"domain_scores_gemma":[0.998565,0.00044138695,0.0001282388,0.0003515843,0.0004618497,0.00005198942],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00054297235,0.00056515937,0.0005370235,0.0007104537,0.000326052,0.00075690873,0.0010020159,0.0010833658,0.008621227],"category_scores_gemma":[0.0015656025,0.00023153625,0.00020100187,0.0005215535,0.00026724295,0.0008752626,0.000601971,0.0007178741,0.0049516005],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005637616,0.000075557546,0.000514543,0.000179839,0.000032044136,0.0003230285,0.00010713462,0.003538158,0.6149386,0.008457418,0.005491791,0.3657782],"study_design_scores_gemma":[0.0000835522,0.0003839829,0.0015736858,0.00007241495,0.00004463935,0.0023045887,0.000027913073,0.11155536,0.8300153,0.001306818,0.052553046,0.00007870388],"about_ca_topic_score_codex":0.0003525559,"about_ca_topic_score_gemma":0.00083498406,"teacher_disagreement_score":0.008621227,"about_ca_system_score_codex":0.0002518328,"about_ca_system_score_gemma":0.0002620239,"threshold_uncertainty_score":0.02884084},"labels":[],"label_agreement":null},{"id":"W1664594238","doi":"10.1109/ccece.2001.933707","title":"Implementation of DSP-RAM: an architecture for parallel digital signal processing in memory","year":2002,"lang":"en","type":"article","venue":"","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"University of Alberta","funders":"","keywords":"Computer science; Digital signal processing; VHDL; Computer hardware; Parallel computing; Signal processing; Discrete cosine transform; Computer architecture; Field-programmable gate array","score_opus":0.03062689660909005,"score_gpt":0.3229456784149536,"score_spread":0.2923187818058635,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1664594238","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.033917014,0.0005821573,0.936637,0.00016201561,0.00017373501,0.00023083459,0.00024284224,0.0118171815,0.016237263],"genre_scores_gemma":[0.38117602,0.00046133608,0.60482466,0.00025438203,0.000072949224,0.00032643182,0.0007279022,0.00044578745,0.011710462],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998035,0.000033644505,0.000017632705,0.00003178773,0.000076504715,0.000036979425],"domain_scores_gemma":[0.99980086,0.00004345925,0.000017987017,0.0000509031,0.00007498201,0.000011847674],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026081182,0.00040471117,0.0002257452,0.00030227346,0.0001741354,0.0005697889,0.0015247159,0.0003581499,0.005790175],"category_scores_gemma":[0.0005100678,0.00019567712,0.0002731419,0.00018864071,0.00020806614,0.00071184064,0.00026704962,0.00056831556,0.0020596734],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00089089,0.00044677922,0.0016978799,0.0010908856,0.00014944458,0.00086828624,0.00032255854,0.08069969,0.33313397,0.07682255,0.017913302,0.48596373],"study_design_scores_gemma":[0.00026221634,0.0010737627,0.00066337764,0.000080931706,0.00012663973,0.0011895187,0.00005917658,0.34972072,0.47794914,0.010807441,0.15800248,0.00006455251],"about_ca_topic_score_codex":0.00055030285,"about_ca_topic_score_gemma":0.00063278544,"teacher_disagreement_score":0.005790175,"about_ca_system_score_codex":0.00031198343,"about_ca_system_score_gemma":0.00047280462,"threshold_uncertainty_score":0.019370079},"labels":[],"label_agreement":null},{"id":"W1671380688","doi":"10.1109/icassp.1994.389709","title":"8 kbit/s ACELP coding of speech with 10 ms speech-frame: a candidate for CCITT standardization","year":2002,"lang":"en","type":"article","venue":"","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Sherbrooke","funders":"","keywords":"Speech coding; Computer science; Linear predictive coding; Code-excited linear prediction; Codec2; Full Rate; Speech recognition; Codec; Adaptive Multi-Rate audio codec; Digital signal processing; Voice activity detection; Codebook; Vector sum excited linear prediction; Frame (networking); Quantization (signal processing); Coding (social sciences); Speech processing; Computer hardware; Algorithm; Mathematics; Telecommunications","score_opus":0.020058511929841226,"score_gpt":0.2706704139131948,"score_spread":0.2506119019833536,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1671380688","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.31412423,0.00083819847,0.64443034,0.0019169947,0.00048602157,0.0005242422,0.00054164894,0.0055142757,0.03162409],"genre_scores_gemma":[0.70835954,0.00033818634,0.25795957,0.0004113363,0.00016464385,0.00024034278,0.001528068,0.00030040013,0.030697921],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9996226,0.0000671413,0.000027758908,0.000039774593,0.00018258524,0.00006021114],"domain_scores_gemma":[0.99892515,0.00012721804,0.00005001553,0.00011528452,0.0006757147,0.00010661242],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009366795,0.00033043424,0.00022500815,0.0006808031,0.00043992637,0.0007840826,0.00069565163,0.0007661158,0.005022882],"category_scores_gemma":[0.0014088275,0.00007364097,0.0001336185,0.0003880426,0.00048322845,0.00046724983,0.00037585094,0.0006260966,0.001561846],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0018641932,0.0002878896,0.003475462,0.00021746967,0.00003396948,0.0013791408,0.0003552034,0.006951962,0.40569258,0.028301783,0.014618444,0.53682196],"study_design_scores_gemma":[0.00026817076,0.002527648,0.007366528,0.000098738165,0.000083192914,0.0030930839,0.00031813126,0.120254174,0.7474176,0.0059346673,0.112503864,0.00013421963],"about_ca_topic_score_codex":0.002262134,"about_ca_topic_score_gemma":0.003373714,"teacher_disagreement_score":0.005022882,"about_ca_system_score_codex":0.00052778696,"about_ca_system_score_gemma":0.0007911081,"threshold_uncertainty_score":0.016803205},"labels":[],"label_agreement":null},{"id":"W1701562649","doi":"10.1109/icosp.1998.770279","title":"A phase codebook model for PWI speech coding","year":2002,"lang":"en","type":"article","venue":"","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Codebook; Speech coding; Vector quantization; Computer science; Waveform; Speech recognition; Linde–Buzo–Gray algorithm; Coding (social sciences); Interpolation (computer graphics); Encoding (memory); Quantization (signal processing); Algorithm; Artificial intelligence; Pattern recognition (psychology); Mathematics","score_opus":0.08911808289701044,"score_gpt":0.3437812401031994,"score_spread":0.25466315720618893,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1701562649","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0010607947,0.00013153318,0.9959858,0.00006268425,0.000046862,0.000047719597,0.00011114838,0.00029820058,0.0022553033],"genre_scores_gemma":[0.21983486,0.0014422113,0.75941545,0.00024821056,0.00017879352,0.0007509645,0.001097802,0.00035449528,0.016677203],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99953747,0.00008900732,0.000025398287,0.00005655335,0.0002586426,0.000032926364],"domain_scores_gemma":[0.9994271,0.00018439142,0.000035144363,0.0001230679,0.0002091522,0.0000211877],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00063095416,0.00052013586,0.00045223135,0.00060563255,0.00034239495,0.0009635469,0.0016657653,0.00077744527,0.0059711984],"category_scores_gemma":[0.0021930053,0.0002975684,0.00039686565,0.0009766286,0.00064924825,0.0016488928,0.000525767,0.0011733779,0.0036316726],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001991254,0.00006495635,0.00028197392,0.00020906169,0.000020889776,0.0002055492,0.00015534295,0.22886185,0.02833435,0.4631512,0.008042491,0.27047327],"study_design_scores_gemma":[0.000018020235,0.00007846026,0.00008590253,0.000025310634,0.000006393497,0.00022390249,0.000015529436,0.9461779,0.004692238,0.038990375,0.00966399,0.000021947457],"about_ca_topic_score_codex":0.0028914902,"about_ca_topic_score_gemma":0.0024247586,"teacher_disagreement_score":0.0059711984,"about_ca_system_score_codex":0.00074849004,"about_ca_system_score_gemma":0.000855786,"threshold_uncertainty_score":0.019975603},"labels":[],"label_agreement":null},{"id":"W1709156878","doi":"10.3233/ica-2010-0327","title":"An efficient fingerprint image compression technique based on wave atoms decomposition and multistage vector quantization","year":2010,"lang":"en","type":"article","venue":"Integrated Computer-Aided Engineering","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":20,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Windsor","funders":"Natural Sciences and Engineering Research Council of Canada; Canada Research Chairs","keywords":"Vector quantization; Image compression; Computer science; Wavelet transform; Quantization (signal processing); Wavelet; Data compression; Artificial intelligence; Lossy compression; Tucker decomposition; Algorithm; Compression ratio; Pattern recognition (psychology); Computer vision; Mathematics; Image processing; Image (mathematics); Physics","score_opus":0.00567109710251399,"score_gpt":0.25164473850534597,"score_spread":0.24597364140283198,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1709156878","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.039416373,0.00086693774,0.9570022,0.00016614753,0.00014474062,0.00010762265,0.00007116801,0.0004492564,0.0017754529],"genre_scores_gemma":[0.32755435,0.00091523567,0.6651327,0.00011421701,0.00010691554,0.00010086578,0.00030345013,0.0000376316,0.0057346458],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99968266,0.0000230666,0.00001969731,0.00003467234,0.00022109467,0.000018850842],"domain_scores_gemma":[0.9998023,0.000038632876,0.000028182592,0.000038458675,0.00008432766,0.000008089601],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002292364,0.0002906717,0.00038462138,0.0007062976,0.0002297355,0.00031071002,0.000517392,0.0003714035,0.0012802918],"category_scores_gemma":[0.0005391743,0.00015614783,0.00028517706,0.00083825336,0.0002248726,0.0008107461,0.0003811765,0.0003916669,0.00032060195],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016364887,0.000090107336,0.00045407529,0.000101576734,0.000019244826,0.00013238657,0.00005577131,0.011437321,0.33865494,0.0066766646,0.0017548669,0.6404594],"study_design_scores_gemma":[0.000067733265,0.00066340226,0.003116142,0.000042394397,0.000053019845,0.0019305012,0.000044889646,0.5803433,0.3957351,0.0026239823,0.015306213,0.00007325172],"about_ca_topic_score_codex":0.00069736387,"about_ca_topic_score_gemma":0.00093988347,"teacher_disagreement_score":0.0012802918,"about_ca_system_score_codex":0.00023244668,"about_ca_system_score_gemma":0.00027798695,"threshold_uncertainty_score":0.0042829514},"labels":[],"label_agreement":null},{"id":"W1712101933","doi":"10.1109/dcc.1994.305936","title":"Fast bintree-structured image coder for high subjective quality","year":2002,"lang":"en","type":"article","venue":"","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Computer science; Image compression; Coding (social sciences); Texture compression; Image (mathematics); Artificial intelligence; Image texture; Encoding (memory); Piecewise; Data compression; Texture (cosmology); Block (permutation group theory); Image quality; Segmentation; Variable (mathematics); Image segmentation; Computer vision; Pattern recognition (psychology); Algorithm; Mathematics; Image processing; Statistics; Combinatorics","score_opus":0.028425744165599003,"score_gpt":0.3066374682132667,"score_spread":0.2782117240476677,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1712101933","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012677638,0.00038787353,0.9806985,0.00016349001,0.000074437026,0.000119829354,0.00017636416,0.0026780176,0.0030237725],"genre_scores_gemma":[0.12100935,0.00045149363,0.865727,0.00022248902,0.00007198267,0.00020279118,0.0006076038,0.00061815383,0.011089217],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994704,0.00007002111,0.000020398438,0.000034285695,0.0003792015,0.000025646299],"domain_scores_gemma":[0.99879956,0.00029652577,0.0000758465,0.00017958767,0.00059850287,0.000049890295],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00057683245,0.0004177964,0.00037376658,0.00080997776,0.0002690107,0.0006861966,0.0006355845,0.0005556758,0.009419261],"category_scores_gemma":[0.0017822371,0.00017966154,0.00016262238,0.000820932,0.00029772305,0.0008103715,0.0004493268,0.0007201559,0.0026068154],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00051605224,0.00006959813,0.00045289943,0.00026181928,0.000026763415,0.00020871763,0.00014472526,0.0081713535,0.36612266,0.017279666,0.011906635,0.5948391],"study_design_scores_gemma":[0.00019619662,0.00057489163,0.0022249946,0.000114864386,0.00006039717,0.0018745536,0.00007507524,0.43552628,0.48462933,0.005683465,0.06892311,0.000116855415],"about_ca_topic_score_codex":0.0011610388,"about_ca_topic_score_gemma":0.0022629122,"teacher_disagreement_score":0.009419261,"about_ca_system_score_codex":0.0003952101,"about_ca_system_score_gemma":0.00047846098,"threshold_uncertainty_score":0.03151059},"labels":[],"label_agreement":null},{"id":"W171956524","doi":"","title":"New motion estimation techniques and their SIMD implementations for video coding","year":2005,"lang":"en","type":"dissertation","venue":"Spectrum Research Repository (Concordia University)","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Motion estimation; SIMD; Computer science; Quarter-pixel motion; Block (permutation group theory); Motion vector; Data compression; Algorithm; Computational complexity theory; Block-matching algorithm; Motion compensation; Coding (social sciences); Parallel computing; Computer vision; Video processing; Mathematics; Video tracking; Image (mathematics)","score_opus":0.03289954311015654,"score_gpt":0.3376332126153004,"score_spread":0.30473366950514386,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W171956524","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0040022624,0.0048893015,0.9850756,0.00018713139,0.00020056403,0.000065553424,0.00007434917,0.00044744223,0.005057889],"genre_scores_gemma":[0.06381083,0.006165427,0.92455626,0.00023633896,0.00013905742,0.00020643343,0.00026188995,0.00006945822,0.004554367],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99954623,0.00009932185,0.000040967298,0.000043910975,0.00025121347,0.000018284214],"domain_scores_gemma":[0.9996778,0.00009517236,0.000045400408,0.00007832264,0.00009574781,0.000007671985],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005031413,0.00055445294,0.0003045686,0.0008669441,0.00024394099,0.00060881703,0.000685315,0.0004239743,0.0032913634],"category_scores_gemma":[0.0013386811,0.00026176297,0.00047462666,0.0013044782,0.00039201582,0.00089880085,0.00059281,0.00091648084,0.0013146062],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011357012,0.0000406892,0.000498145,0.0003919012,0.000054345037,0.00010726803,0.00011124884,0.026884496,0.05112376,0.15258794,0.0042699906,0.76381665],"study_design_scores_gemma":[0.00007531983,0.00039428825,0.00084464776,0.00025979296,0.00006257461,0.0010956322,0.00008404577,0.7121713,0.085351,0.04797315,0.15160857,0.00007969339],"about_ca_topic_score_codex":0.0005056018,"about_ca_topic_score_gemma":0.0007550749,"teacher_disagreement_score":0.0032913634,"about_ca_system_score_codex":0.00041949152,"about_ca_system_score_gemma":0.00037615636,"threshold_uncertainty_score":0.011010706},"labels":[],"label_agreement":null},{"id":"W1723956339","doi":"10.1109/icosp.1998.770329","title":"SAR image compression based on the discrete wavelet transform","year":2002,"lang":"en","type":"article","venue":"","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Texture compression; Wavelet; Image compression; Artificial intelligence; Computer science; Wavelet transform; Data compression; Computer vision; Discrete wavelet transform; Compression (physics); Wavelet packet decomposition; Image texture; Pattern recognition (psychology); Image segmentation; Image (mathematics); Image processing; Materials science","score_opus":0.021661502567788586,"score_gpt":0.259205500391752,"score_spread":0.2375439978239634,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1723956339","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06223978,0.0023126537,0.9261968,0.00033305975,0.00028971632,0.00010463342,0.000114870214,0.0007771022,0.0076314625],"genre_scores_gemma":[0.49384823,0.0068749916,0.48766226,0.00019853607,0.0004406984,0.00011478076,0.0005119177,0.00014475496,0.01020389],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9998528,0.00001712926,0.0000069072244,0.000014198192,0.00010029544,0.000008680323],"domain_scores_gemma":[0.99988496,0.000051549185,0.000009058987,0.00001903406,0.00003005728,0.000005290026],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013863573,0.0002820771,0.00030515596,0.00043292317,0.000116955474,0.00027310828,0.00023757298,0.00024579305,0.001061936],"category_scores_gemma":[0.00049375795,0.000091868875,0.00019160936,0.0004894709,0.00033841972,0.00045209622,0.00024271254,0.00039056683,0.0004373584],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019995907,0.000067902205,0.0004222338,0.00028169184,0.000026152256,0.0003482936,0.00006694294,0.019541604,0.35257125,0.032409295,0.0025063895,0.5915582],"study_design_scores_gemma":[0.000119539196,0.00056159374,0.0042162254,0.00008576435,0.000070225695,0.0025129144,0.00006666061,0.5230805,0.4035359,0.02900566,0.036691383,0.000053681997],"about_ca_topic_score_codex":0.00021686038,"about_ca_topic_score_gemma":0.00019490083,"teacher_disagreement_score":0.001061936,"about_ca_system_score_codex":0.00009650611,"about_ca_system_score_gemma":0.00015475422,"threshold_uncertainty_score":0.003552556},"labels":[],"label_agreement":null},{"id":"W1731830998","doi":"","title":"Software DAB transmitter on live CD","year":2008,"lang":"en","type":"article","venue":"","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Communications Research Centre Canada","funders":"","keywords":"Universal Software Radio Peripheral; Computer science; Embedded system; Software-defined radio; Software; Operating system; USB; Key (lock); Laptop; Broadcasting (networking); Computer hardware; Transmission (telecommunications); Backward compatibility; Computer network; Telecommunications","score_opus":0.02450492851442057,"score_gpt":0.255256972738385,"score_spread":0.23075204422396442,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1731830998","genre_codex":"methods","genre_gemma":"software","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"software","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.25348338,0.0006203386,0.6411273,0.00029619705,0.0006616018,0.00056718144,0.0005688737,0.03925082,0.06342436],"genre_scores_gemma":[0.7334261,0.00038231086,0.1847871,0.00036408825,0.00018726455,0.00023578861,0.00079552864,0.0013533521,0.07846849],"study_design_codex":"bench_or_experimental","study_design_gemma":"not_applicable","domain_scores_codex":[0.9995945,0.000047790254,0.000019499108,0.000088719935,0.0002028218,0.000046603567],"domain_scores_gemma":[0.99953043,0.00010992338,0.000029616811,0.00010670144,0.00018119326,0.00004206781],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029467352,0.00031576786,0.00034638157,0.0006234813,0.000247994,0.00060427724,0.00067578425,0.00034456712,0.0199372],"category_scores_gemma":[0.0008328049,0.00020081432,0.00017866422,0.00039181477,0.00015923711,0.00054490514,0.00049076404,0.0003911205,0.00558793],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0014280803,0.0002618954,0.0044375802,0.0005072711,0.00004452597,0.0009279974,0.0005549642,0.004076584,0.50500757,0.010987741,0.017613616,0.4541521],"study_design_scores_gemma":[0.0004181069,0.0016602866,0.008358639,0.00017201788,0.00012188034,0.0051323744,0.00022334684,0.1012694,0.69641715,0.0028066747,0.18332513,0.00009495156],"about_ca_topic_score_codex":0.00036900875,"about_ca_topic_score_gemma":0.00030951438,"teacher_disagreement_score":0.0199372,"about_ca_system_score_codex":0.00025855456,"about_ca_system_score_gemma":0.00033122968,"threshold_uncertainty_score":0.066696525},"labels":[],"label_agreement":null},{"id":"W1739260782","doi":"10.1109/isit.1993.748434","title":"A Positional Representation for Noiseless Compression","year":2005,"lang":"en","type":"article","venue":"","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Row; Computer science; Algorithm; Representation (politics); Entropy (arrow of time); Alphabet; Data compression; Position (finance); Sequence (biology); Artificial intelligence; Pattern recognition (psychology); Mathematics","score_opus":0.02625034937244773,"score_gpt":0.34027007032566864,"score_spread":0.3140197209532209,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1739260782","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007900508,0.00068638026,0.9832413,0.0003250238,0.00019997019,0.00004805362,0.00025519633,0.0005977669,0.006745789],"genre_scores_gemma":[0.2801083,0.001988041,0.6967107,0.000697379,0.0006125539,0.00035100477,0.0012745966,0.00018700396,0.018070353],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99957126,0.00009660275,0.000033240307,0.000080405385,0.00018211937,0.000036454978],"domain_scores_gemma":[0.99942076,0.00016190359,0.000056757133,0.00020731417,0.00013164904,0.000021666941],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034231122,0.00048728063,0.000307817,0.00074632297,0.00034638552,0.00091453566,0.0007636961,0.0007961922,0.0049535837],"category_scores_gemma":[0.0025123393,0.00015885569,0.00022417899,0.0013446695,0.00065317407,0.0013168112,0.00056728214,0.0007082077,0.0017724024],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022368418,0.000048092523,0.00022420571,0.0001561329,0.000012710807,0.00020657774,0.00011056266,0.055144668,0.041128207,0.5182947,0.00687107,0.37757945],"study_design_scores_gemma":[0.000047236146,0.0003067435,0.0004857228,0.00008589803,0.000032334996,0.00074159296,0.00006390892,0.6804485,0.04471637,0.22508714,0.047917377,0.00006726671],"about_ca_topic_score_codex":0.000596118,"about_ca_topic_score_gemma":0.0004940811,"teacher_disagreement_score":0.0049535837,"about_ca_system_score_codex":0.00040904773,"about_ca_system_score_gemma":0.00045675522,"threshold_uncertainty_score":0.016571403},"labels":[],"label_agreement":null},{"id":"W1747663898","doi":"10.1109/mwscas.1993.343058","title":"Improved hierarchical vector quantization for image compression","year":2002,"lang":"en","type":"article","venue":"","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Vector quantization; Linde–Buzo–Gray algorithm; Quantization (signal processing); Image compression; Learning vector quantization; Artificial intelligence; Computer vision; Data compression; Computer science; Mathematics; Coding (social sciences); Algorithm; Pattern recognition (psychology); Image processing; Image (mathematics)","score_opus":0.027277031825946773,"score_gpt":0.2914191826077905,"score_spread":0.2641421507818437,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1747663898","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0054818634,0.0028891522,0.98566806,0.0002658125,0.00019257753,0.000058506586,0.00017081057,0.0011039256,0.004169223],"genre_scores_gemma":[0.29972783,0.004656103,0.6784441,0.0004916793,0.00042675284,0.00019822718,0.0012855593,0.0002783463,0.014491465],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991159,0.00015204432,0.000051546886,0.00008539925,0.00054060074,0.000054423595],"domain_scores_gemma":[0.99953246,0.00013944405,0.000027968366,0.0001078953,0.00017938418,0.00001289127],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006345925,0.00056672253,0.00047513616,0.0009226886,0.00030286887,0.0006342466,0.00084020174,0.0005165529,0.0053470787],"category_scores_gemma":[0.0022494958,0.00015833655,0.00037219442,0.001578253,0.000446084,0.0015281594,0.0007246797,0.001026724,0.0014168237],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018542795,0.000050355706,0.00023326249,0.00028432245,0.00003436038,0.00009091688,0.00011175259,0.1167441,0.033836346,0.10415462,0.012651911,0.73162264],"study_design_scores_gemma":[0.000043616583,0.00012088871,0.0004241564,0.00006279105,0.000029225903,0.00018248693,0.000030994725,0.8943665,0.022602245,0.051986717,0.030108193,0.00004210497],"about_ca_topic_score_codex":0.0034911227,"about_ca_topic_score_gemma":0.004069865,"teacher_disagreement_score":0.0053470787,"about_ca_system_score_codex":0.0006686329,"about_ca_system_score_gemma":0.0005706784,"threshold_uncertainty_score":0.017887771},"labels":[],"label_agreement":null},{"id":"W1747912370","doi":"10.1109/icassp.1988.196560","title":"A low delay 16 kbits/sec speech coder","year":2003,"lang":"en","type":"article","venue":"","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":33,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Institut National de la Recherche Scientifique; McGill University","funders":"","keywords":"Formant; Speech recognition; Computer science; Speech coding; Linear predictive coding; Speech synthesis; Quantization (signal processing); Algorithm","score_opus":0.01436904719457608,"score_gpt":0.27005205296066404,"score_spread":0.25568300576608793,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1747912370","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4815921,0.0022236898,0.48559833,0.00045822686,0.00029976515,0.0004919461,0.00076016213,0.007162175,0.021413613],"genre_scores_gemma":[0.7785435,0.0006013352,0.18757005,0.00018823014,0.00013618822,0.00023202614,0.00070934143,0.0003370948,0.031682312],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994266,0.000094235285,0.000038535953,0.0001049895,0.0002928175,0.000042874093],"domain_scores_gemma":[0.9993254,0.00023099945,0.000058042882,0.00009189636,0.00024681416,0.00004691329],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043308435,0.0003910655,0.0005209682,0.00047804153,0.00036263242,0.0007073062,0.00069742906,0.0009714308,0.0050696027],"category_scores_gemma":[0.0012973042,0.00014498095,0.00021216797,0.0004782097,0.0003040423,0.00073059526,0.00028770918,0.00041743074,0.0031510422],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0014672047,0.00027731643,0.0027292646,0.0006135001,0.000063772735,0.0010763652,0.00038995413,0.027620219,0.68659765,0.012078373,0.0055961553,0.26149026],"study_design_scores_gemma":[0.0003671637,0.0032828457,0.0054740296,0.00008842664,0.00021807363,0.00397778,0.00017767039,0.27338383,0.6317267,0.0025423365,0.07861695,0.0001442051],"about_ca_topic_score_codex":0.0014142495,"about_ca_topic_score_gemma":0.0010554132,"teacher_disagreement_score":0.0050696027,"about_ca_system_score_codex":0.00045092017,"about_ca_system_score_gemma":0.0003614789,"threshold_uncertainty_score":0.016959548},"labels":[],"label_agreement":null},{"id":"W175630922","doi":"10.20381/ruor-11238","title":"Image coding for transmission over wireless CDMA channels.","year":2002,"lang":"en","type":"dissertation","venue":"uO Research (University of Ottawa)","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Rayleigh fading; Fading; Algorithm; Computer science; Multipath propagation; Electronic engineering; Wavelet; Code division multiple access; Mathematics; Telecommunications; Channel (broadcasting); Decoding methods; Artificial intelligence; Engineering","score_opus":0.052013256967242454,"score_gpt":0.34181136267748147,"score_spread":0.289798105710239,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W175630922","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.033330973,0.004593745,0.6116586,0.0032166177,0.0052790646,0.0012055049,0.009458683,0.0101045,0.3211524],"genre_scores_gemma":[0.31552994,0.004597912,0.31040192,0.0021275587,0.0006603264,0.0016362292,0.008907871,0.0011469703,0.35499126],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995111,0.00009555171,0.000026453808,0.00006375431,0.00022873492,0.0000743312],"domain_scores_gemma":[0.9991246,0.00019868331,0.00009073374,0.00020316,0.000356579,0.000026210833],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039487646,0.0005163911,0.0002250369,0.001063604,0.0004628614,0.0011600207,0.00064409984,0.0008573107,0.103617385],"category_scores_gemma":[0.002656269,0.0001447457,0.00018301253,0.0015991811,0.00030989057,0.0008510602,0.0007760241,0.0009054133,0.03219156],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00059353793,0.00009015127,0.000956883,0.00055825355,0.000023027069,0.00032921258,0.0002625683,0.003474004,0.037659373,0.048239157,0.14035968,0.7674542],"study_design_scores_gemma":[0.000081989674,0.0002609929,0.0059832414,0.00035993187,0.000028061013,0.0014863824,0.00034229498,0.057777405,0.03568303,0.01686995,0.8810331,0.000093599614],"about_ca_topic_score_codex":0.0024105888,"about_ca_topic_score_gemma":0.0030059773,"teacher_disagreement_score":0.103617385,"about_ca_system_score_codex":0.00063459674,"about_ca_system_score_gemma":0.0005884495,"threshold_uncertainty_score":0.3466347},"labels":[],"label_agreement":null},{"id":"W1770631741","doi":"10.1109/scft.1997.623908","title":"A good job well done: the latest wireless codecs deliver wireline quality","year":2002,"lang":"en","type":"article","venue":"","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Nortel (Canada)","funders":"","keywords":"Codec; Wireline; Computer science; Wireless; Speech coding; Speech recognition; Coding (social sciences); Computer network; Telecommunications","score_opus":0.0351141635135011,"score_gpt":0.28707113905245496,"score_spread":0.25195697553895385,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1770631741","genre_codex":"empirical","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7976308,0.0040661455,0.13137414,0.009449028,0.0010899169,0.0001975637,0.00066130096,0.0043739956,0.05115716],"genre_scores_gemma":[0.875811,0.0018120718,0.07171955,0.0021475956,0.00027143324,0.000050226383,0.0007109117,0.001044172,0.046433102],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9992341,0.00009359865,0.000051480565,0.00011048292,0.00043799542,0.00007240721],"domain_scores_gemma":[0.9932346,0.001946361,0.0005436995,0.00065579795,0.0032448042,0.0003747371],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010592777,0.0002841921,0.00022537037,0.00052990916,0.0005230772,0.0011718136,0.00033542977,0.0010456259,0.007478574],"category_scores_gemma":[0.008755517,0.00018068148,0.00017969185,0.00040400538,0.0005094699,0.0020834338,0.00056209636,0.00068989553,0.0026540805],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0014303797,0.0002691392,0.016860416,0.00057368196,0.00011570402,0.0006931173,0.0015601641,0.0014751982,0.40707603,0.0042091184,0.024633354,0.54110366],"study_design_scores_gemma":[0.00025835328,0.004989226,0.08206164,0.00031810318,0.00042448778,0.006319589,0.002376969,0.016557379,0.72502357,0.0030254028,0.15839167,0.00025365266],"about_ca_topic_score_codex":0.0017494862,"about_ca_topic_score_gemma":0.0045139543,"teacher_disagreement_score":0.007478574,"about_ca_system_score_codex":0.00028060397,"about_ca_system_score_gemma":0.00032796332,"threshold_uncertainty_score":0.025018275},"labels":[],"label_agreement":null},{"id":"W1778948012","doi":"10.48550/arxiv.cs/0609123","title":"Optimal Design of Multiple Description Lattice Vector Quantizers","year":2006,"lang":"en","type":"preprint","venue":"ArXiv.org","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Lattice (music); Computer science; Theoretical computer science; Algorithm; Physics; Acoustics","score_opus":0.0948112030016433,"score_gpt":0.3009240510922695,"score_spread":0.2061128480906262,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1778948012","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02988448,0.00043685592,0.9666703,0.00022789929,0.000043978136,0.000059626476,0.00008474607,0.00026593992,0.002326215],"genre_scores_gemma":[0.6764362,0.00030847866,0.3198081,0.00018050874,0.000037904872,0.00014512212,0.00016003355,0.000063890315,0.0028598246],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99902916,0.00027980277,0.00007319083,0.0001833389,0.0003174786,0.00011693228],"domain_scores_gemma":[0.9989374,0.0004973427,0.00015940487,0.00012727361,0.0001919739,0.00008659133],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012878806,0.00050302164,0.00075675186,0.00034461738,0.00038648356,0.0010067055,0.0013684195,0.000545787,0.0024599792],"category_scores_gemma":[0.0039323093,0.00041961353,0.00025720033,0.00058631593,0.0007479378,0.0021081103,0.001306824,0.0008892209,0.00038821244],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005910442,0.000107412896,0.0011837461,0.00028484216,0.00004958248,0.0001436254,0.00015260452,0.5418168,0.024895359,0.16837473,0.0032867827,0.2591135],"study_design_scores_gemma":[0.00003005416,0.000059477337,0.00006406914,0.00000925288,0.000005169627,0.00003872269,0.000018491939,0.9728899,0.0049234955,0.020808835,0.0011392764,0.0000132467085],"about_ca_topic_score_codex":0.0010708225,"about_ca_topic_score_gemma":0.0015675073,"teacher_disagreement_score":0.0024599792,"about_ca_system_score_codex":0.0010880507,"about_ca_system_score_gemma":0.0012885875,"threshold_uncertainty_score":0.0082294345},"labels":[],"label_agreement":null},{"id":"W1796935811","doi":"10.1109/icecs.1996.582934","title":"Lossless compression of bathymetric data using an improved nonlinear discrete wavelet transform","year":2002,"lang":"en","type":"article","venue":"","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Lossless compression; Bathymetry; Data compression; Wavelet transform; Wavelet; Compression (physics); Computer science; Discrete wavelet transform; Algorithm; Image compression; Nonlinear system; Artificial intelligence; Computer vision; Mathematics; Image processing; Geology; Image (mathematics); Materials science; Physics","score_opus":0.10358414020168562,"score_gpt":0.3350786273324924,"score_spread":0.23149448713080678,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1796935811","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.30871302,0.00080835813,0.68482274,0.00047244332,0.00015368298,0.00006918294,0.00020929208,0.0003918942,0.004359298],"genre_scores_gemma":[0.75558347,0.001556955,0.23372737,0.00010100481,0.00019376776,0.00006693573,0.00063057634,0.00006909937,0.008070847],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99989915,0.000009256866,0.0000054182483,0.0000077722,0.00007127463,0.0000072113453],"domain_scores_gemma":[0.9998204,0.00007547903,0.000017675347,0.00003135297,0.000050079834,0.0000050425438],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014153493,0.00024366016,0.00027881935,0.00028997002,0.0001223385,0.00027364888,0.00029372855,0.00024750127,0.0006582378],"category_scores_gemma":[0.0008397175,0.000077550525,0.0001515168,0.0004583234,0.0002934464,0.00053936674,0.00028359363,0.00029163325,0.00026507128],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005384748,0.00007131065,0.0009939168,0.00022671622,0.000027578757,0.00075355516,0.00017889135,0.111192524,0.4580993,0.008773432,0.0020790617,0.4170653],"study_design_scores_gemma":[0.000035942245,0.00019204266,0.004578917,0.000025287949,0.00003425619,0.0010712515,0.00006730102,0.818683,0.16503468,0.0032575731,0.006986236,0.00003343719],"about_ca_topic_score_codex":0.0010976472,"about_ca_topic_score_gemma":0.0011465919,"teacher_disagreement_score":0.0010976472,"about_ca_system_score_codex":0.00014974628,"about_ca_system_score_gemma":0.00014643981,"threshold_uncertainty_score":0.002202034},"labels":[],"label_agreement":null},{"id":"W1802314031","doi":"10.1109/adfsp.1998.685720","title":"Wavelet-based compression of speech signals on the TMS320C30 digital signal processor","year":2002,"lang":"en","type":"article","venue":"","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Lossless compression; Lossy compression; Computer science; Data compression; Speech recognition; Data compression ratio; Compression ratio; Huffman coding; Wavelet; Algorithm; Image compression; Artificial intelligence; Image processing; Engineering","score_opus":0.03613073151045538,"score_gpt":0.25338930745223426,"score_spread":0.2172585759417789,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1802314031","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.33653617,0.0012734443,0.6452521,0.00029190196,0.00021161315,0.00022703492,0.00027505725,0.0032205344,0.012712159],"genre_scores_gemma":[0.74583054,0.0011358677,0.24178208,0.00011854922,0.00006687889,0.00012138531,0.0005753226,0.00011358583,0.0102557605],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99987316,0.000012538339,0.00000757534,0.000008925421,0.00008824512,0.000009563934],"domain_scores_gemma":[0.9998354,0.000049360897,0.000014015976,0.000018895087,0.000074427175,0.00000787367],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001600184,0.0002220191,0.00025787877,0.0003937017,0.00013188581,0.00021510072,0.00029714374,0.0002206903,0.0020111727],"category_scores_gemma":[0.00063102,0.000071271104,0.00010761893,0.00044517577,0.00014985882,0.00026602476,0.00016445745,0.00023843098,0.00067103154],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00044376744,0.000056912788,0.00030360857,0.00019819023,0.000014884312,0.0003296127,0.00008577354,0.008466596,0.6891245,0.0042882254,0.0032688624,0.29341912],"study_design_scores_gemma":[0.00010691547,0.0009663777,0.0036254514,0.000047953195,0.0000551193,0.0019661286,0.00009915666,0.28132886,0.69045633,0.0017356452,0.01957725,0.000034821478],"about_ca_topic_score_codex":0.00048493897,"about_ca_topic_score_gemma":0.00073754456,"teacher_disagreement_score":0.0020111727,"about_ca_system_score_codex":0.0001742417,"about_ca_system_score_gemma":0.00024971226,"threshold_uncertainty_score":0.006728053},"labels":[],"label_agreement":null},{"id":"W1810057260","doi":"10.1109/dcc.1991.213320","title":"On the selection of color basis for image compression","year":2002,"lang":"en","type":"article","venue":"","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"","keywords":"Selection (genetic algorithm); Quantization (signal processing); Artificial intelligence; Computer science; Image compression; Color quantization; Basis (linear algebra); Image (mathematics); Data compression; Compression (physics); Computer vision; Pattern recognition (psychology); Mathematics; Image processing; Color image; Geometry","score_opus":0.029757877606795425,"score_gpt":0.28171076213502094,"score_spread":0.2519528845282255,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1810057260","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019005135,0.033429362,0.75597,0.0024165246,0.009737516,0.00055785966,0.0005068669,0.0022335944,0.17614315],"genre_scores_gemma":[0.29868877,0.041430704,0.47258198,0.0013213622,0.0057387995,0.00066258124,0.0015466198,0.0011411097,0.17688818],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998343,0.00004070307,0.000011199121,0.000024777479,0.00007462646,0.000014331682],"domain_scores_gemma":[0.99963224,0.00010168304,0.000016514068,0.000041771207,0.0001863854,0.00002136867],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002807327,0.00049318053,0.00045911942,0.0008251498,0.00033853733,0.00086239615,0.000470439,0.0004122511,0.026309691],"category_scores_gemma":[0.001078732,0.000119008495,0.00017000658,0.0013259965,0.0004488174,0.0005086074,0.0003315472,0.00044128933,0.0083254455],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00035073693,0.000041004303,0.00037578086,0.0008307855,0.000038476766,0.00027458704,0.00008269695,0.012095475,0.04569461,0.10447491,0.15229243,0.68344855],"study_design_scores_gemma":[0.000102713464,0.00045084584,0.0028310202,0.000550276,0.00013064538,0.001370238,0.00016348623,0.27150443,0.08336201,0.0634117,0.5759798,0.00014286352],"about_ca_topic_score_codex":0.00059074303,"about_ca_topic_score_gemma":0.0010692496,"teacher_disagreement_score":0.026309691,"about_ca_system_score_codex":0.00029977376,"about_ca_system_score_gemma":0.00016801314,"threshold_uncertainty_score":0.08801472},"labels":[],"label_agreement":null},{"id":"W1813353062","doi":"10.1109/scft.1999.781477","title":"LPC quantization requirements for the GPP-CELP coder","year":2003,"lang":"en","type":"article","venue":"","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Institut National de la Recherche Scientifique","funders":"","keywords":"Code-excited linear prediction; Codebook; Vector sum excited linear prediction; Speech coding; Linear prediction; Linear predictive coding; Quantization (signal processing); Speech recognition; Residual; Computer science; Harmonic Vector Excitation Coding; Linde–Buzo–Gray algorithm; Algorithm","score_opus":0.06210404770406686,"score_gpt":0.3408248890015048,"score_spread":0.27872084129743796,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1813353062","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1931002,0.0013678892,0.7851852,0.0016978276,0.00017980179,0.00039539102,0.001103737,0.0031945365,0.01377542],"genre_scores_gemma":[0.7737439,0.0006403388,0.21649952,0.00042369548,0.000092639806,0.00039745876,0.0020125688,0.00036346994,0.0058264304],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99669325,0.0003591938,0.00026183043,0.00022764802,0.002265918,0.00019212347],"domain_scores_gemma":[0.9873962,0.007252726,0.0007163055,0.0007050372,0.0037960291,0.00013366055],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001439694,0.0005010219,0.00066388777,0.00074169954,0.00057883497,0.0014036032,0.0010654507,0.001100752,0.006421841],"category_scores_gemma":[0.014616961,0.00025380455,0.00017942871,0.0008004626,0.0005874114,0.0015179927,0.0006076206,0.0009227246,0.0022281108],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0019174768,0.00019498405,0.002606432,0.0007999959,0.000051128027,0.001014571,0.00040747254,0.0952382,0.5188512,0.034725286,0.007779265,0.33641392],"study_design_scores_gemma":[0.00020911086,0.00077753037,0.003508935,0.00009865355,0.000058279642,0.0018346376,0.00025481588,0.6128292,0.36070254,0.00806518,0.011550636,0.00011048021],"about_ca_topic_score_codex":0.0030783447,"about_ca_topic_score_gemma":0.0027474707,"teacher_disagreement_score":0.006421841,"about_ca_system_score_codex":0.0011648218,"about_ca_system_score_gemma":0.0012033398,"threshold_uncertainty_score":0.021483183},"labels":[],"label_agreement":null},{"id":"W1817900408","doi":"10.1109/icassp.1988.196700","title":"Transform image coding with a new family of models","year":2003,"lang":"en","type":"article","venue":"","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Transform coding; Quantization (signal processing); Algorithm; Coding (social sciences); Pixel; Discrete cosine transform; Lapped transform; Computer science; Chen; Data compression; Artificial intelligence; Mathematics; Theoretical computer science; Speech recognition; Image (mathematics); Statistics","score_opus":0.02627811759469944,"score_gpt":0.262578961829836,"score_spread":0.23630084423513653,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1817900408","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002039532,0.00022035032,0.99535793,0.000106898784,0.000033810673,0.00001880857,0.00007310415,0.000209445,0.0019400236],"genre_scores_gemma":[0.1800324,0.003037256,0.7950349,0.0003704909,0.00025317358,0.00043071515,0.0011018859,0.0003133863,0.019425835],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994561,0.00010548469,0.000024335837,0.00008365114,0.00029267176,0.00003778955],"domain_scores_gemma":[0.99927706,0.00027640007,0.00006442396,0.00017646873,0.00017847025,0.000027187873],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006660917,0.000705765,0.0005827076,0.00087995076,0.00029378373,0.0011158839,0.0011870911,0.0009040526,0.0026250065],"category_scores_gemma":[0.002405837,0.0003593877,0.0011246712,0.00102967,0.00085040403,0.0021938966,0.00095055654,0.0017814195,0.0013662538],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000098589,0.00005391721,0.0005614834,0.00011939058,0.00006386154,0.00014755708,0.00011863297,0.44716343,0.010816915,0.31290522,0.007910434,0.22004056],"study_design_scores_gemma":[0.000007589799,0.00002815258,0.00006784671,0.000011174385,0.000008514329,0.0001203381,0.0000053206463,0.96059936,0.0015129976,0.029856566,0.0077695083,0.000012558618],"about_ca_topic_score_codex":0.0028391206,"about_ca_topic_score_gemma":0.0023552298,"teacher_disagreement_score":0.0028391206,"about_ca_system_score_codex":0.0007284377,"about_ca_system_score_gemma":0.0007914723,"threshold_uncertainty_score":0.008781552},"labels":[],"label_agreement":null},{"id":"W1821705883","doi":"10.1109/mmsp.1998.738974","title":"Order statistics preserving near-lossless image coding","year":2002,"lang":"en","type":"article","venue":"","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Lossless compression; Fidelity; Computer science; Data compression; Coding (social sciences); Context (archaeology); Image compression; Image (mathematics); Theoretical computer science; Algorithm; Mathematics; Artificial intelligence; Statistics; Image processing; Telecommunications; Geography","score_opus":0.02810671206283039,"score_gpt":0.2837483604976889,"score_spread":0.25564164843485854,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1821705883","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.022884818,0.0003261212,0.97178113,0.00015021482,0.00008409149,0.000020071742,0.00008613182,0.00032545166,0.0043420033],"genre_scores_gemma":[0.66105175,0.0009870493,0.32701352,0.000461576,0.00019479035,0.000063790794,0.00027105596,0.00015367917,0.009802781],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996933,0.000042165404,0.000014705197,0.000034943416,0.00018281577,0.00003211524],"domain_scores_gemma":[0.99954695,0.000103611404,0.000071227514,0.00012279577,0.00012392184,0.00003142671],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000256055,0.00035359245,0.00034388108,0.0004190145,0.00019623335,0.0006347864,0.00055813696,0.00036177228,0.0010993561],"category_scores_gemma":[0.0010930769,0.00012347438,0.00022425724,0.0005104017,0.0006604258,0.001302189,0.0007190929,0.00076214,0.00047292275],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002649611,0.00010736866,0.00082128996,0.00015088463,0.000036954298,0.00049027294,0.00019753222,0.116857305,0.1595767,0.38180482,0.0049505755,0.33474126],"study_design_scores_gemma":[0.000018422723,0.00027103172,0.00067757256,0.000024130315,0.000021516378,0.00095394894,0.000055931996,0.7883993,0.090469845,0.106153525,0.012908731,0.000045997745],"about_ca_topic_score_codex":0.00039387643,"about_ca_topic_score_gemma":0.00048805738,"teacher_disagreement_score":0.0010993561,"about_ca_system_score_codex":0.0002608807,"about_ca_system_score_gemma":0.0004057356,"threshold_uncertainty_score":0.0036776662},"labels":[],"label_agreement":null},{"id":"W1823764068","doi":"10.1109/icassp.1987.1169402","title":"Filters for subband coding analytical approach","year":2005,"lang":"en","type":"article","venue":"","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Sherbrooke","funders":"","keywords":"Coding (social sciences); Computer science; Algorithm; Artificial intelligence; Mathematics; Statistics","score_opus":0.0397861970252249,"score_gpt":0.3133632245710856,"score_spread":0.2735770275458607,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1823764068","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0013699866,0.0006987061,0.99109143,0.00018370143,0.00011918608,0.000016139114,0.00004350875,0.00011324749,0.006364106],"genre_scores_gemma":[0.13547735,0.0073940684,0.8054746,0.0008689886,0.0006903311,0.00022524434,0.0002814299,0.00035882226,0.049229123],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99969125,0.000064122185,0.00001710808,0.000053179945,0.00014376275,0.00003059234],"domain_scores_gemma":[0.99965143,0.00015522553,0.000027622675,0.00006874021,0.00008672615,0.000010179419],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004253839,0.0006614588,0.00039716292,0.0008258283,0.00023722077,0.0013378928,0.000541836,0.0008482893,0.00780877],"category_scores_gemma":[0.0014877851,0.00022595472,0.00048840407,0.00065220497,0.0005720663,0.001413929,0.0005019117,0.0013186202,0.0032165346],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000540373,0.000023701441,0.00013662489,0.00017046952,0.000019821926,0.00012349918,0.00012376152,0.034043446,0.022981059,0.81393003,0.004487681,0.12390585],"study_design_scores_gemma":[0.0000114476925,0.00006366142,0.00026746237,0.00008582225,0.000022393557,0.0005262171,0.00006584376,0.51775837,0.01713294,0.40270814,0.06132582,0.000031869607],"about_ca_topic_score_codex":0.0007901381,"about_ca_topic_score_gemma":0.0006477204,"teacher_disagreement_score":0.00780877,"about_ca_system_score_codex":0.00052643917,"about_ca_system_score_gemma":0.0004784856,"threshold_uncertainty_score":0.026122928},"labels":[],"label_agreement":null},{"id":"W1824492532","doi":"10.1109/scft.1993.762346","title":"Speech coding over frame relay networks","year":2005,"lang":"en","type":"article","venue":"","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Computer science; Frame (networking); Code-excited linear prediction; Frame Relay; Speech coding; Relay; Inter frame; Speech recognition; Linear predictive coding; Coding (social sciences); Voice activity detection; Real-time computing; Speech processing; Network packet; Reference frame; Computer network; Power (physics); Mathematics","score_opus":0.011844641748758095,"score_gpt":0.2777048173893036,"score_spread":0.2658601756405455,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1824492532","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09112446,0.0024123036,0.8959984,0.0003766249,0.00018022548,0.00007771304,0.00016887755,0.0010136142,0.008647747],"genre_scores_gemma":[0.8534277,0.003256208,0.13439432,0.00019005669,0.00018938452,0.00011141626,0.00035190812,0.00008721817,0.007991672],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99978,0.000061954306,0.000009519812,0.000029826098,0.000085973865,0.00003276137],"domain_scores_gemma":[0.99950874,0.00023506704,0.000037962833,0.000057962974,0.00014793234,0.000012193506],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038077484,0.00043766055,0.0002959478,0.0003456229,0.00020977526,0.00047009162,0.00042767977,0.0005378377,0.0022587068],"category_scores_gemma":[0.0015400229,0.0000962844,0.00014185283,0.00033624633,0.00024911732,0.0006131758,0.00037551665,0.000335871,0.00061332196],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012946025,0.000050382485,0.0005427706,0.00042819453,0.00005833545,0.001124737,0.00040525896,0.15075578,0.23295748,0.06044384,0.0076948623,0.5442438],"study_design_scores_gemma":[0.00007857808,0.00043763017,0.00071845716,0.00009801946,0.00007039927,0.0007299034,0.00014338993,0.80640006,0.14285512,0.023553098,0.024870815,0.000044560904],"about_ca_topic_score_codex":0.0018260299,"about_ca_topic_score_gemma":0.0017822736,"teacher_disagreement_score":0.0022587068,"about_ca_system_score_codex":0.0003210675,"about_ca_system_score_gemma":0.00028897318,"threshold_uncertainty_score":0.0075561404},"labels":[],"label_agreement":null},{"id":"W1831381168","doi":"10.1109/scft.1999.781471","title":"Low complexity LSF quantization for wideband speech coding","year":2003,"lang":"en","type":"article","venue":"","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Sherbrooke","funders":"","keywords":"Code-excited linear prediction; Speech coding; Computer science; Quantization (signal processing); Narrowband; Linear predictive coding; Algorithm; Codebook; Speech recognition; Computational complexity theory; Telecommunications","score_opus":0.0599781305744416,"score_gpt":0.32150906913287214,"score_spread":0.2615309385584305,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1831381168","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010803158,0.00041203533,0.9870204,0.00009503058,0.00002096497,0.00002561453,0.000029246574,0.00025790342,0.0013356498],"genre_scores_gemma":[0.44588855,0.0005638914,0.5516051,0.00006982802,0.00007267117,0.00006131618,0.00011230966,0.00003866367,0.0015876426],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99970454,0.00007182829,0.000020582469,0.000021631753,0.0001688705,0.000012505203],"domain_scores_gemma":[0.9996877,0.00014631123,0.000040285002,0.0000399956,0.00007688971,0.000008883483],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004009077,0.00025461844,0.00022486315,0.00034101354,0.00024045732,0.0004335672,0.00037139287,0.0003193156,0.0014796667],"category_scores_gemma":[0.001564803,0.00011023275,0.0001489461,0.00046111768,0.00040136473,0.0005112849,0.0003151357,0.00038605474,0.00039543095],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023459973,0.00004889891,0.00054543366,0.00028673894,0.000016834734,0.000108905864,0.00013629523,0.17306866,0.1091737,0.12951651,0.0025089637,0.58435446],"study_design_scores_gemma":[0.000034450557,0.0001406471,0.00030269474,0.000028720027,0.000013240114,0.00024725494,0.000020826246,0.9304829,0.040348288,0.021566568,0.006788244,0.000026088008],"about_ca_topic_score_codex":0.0007237856,"about_ca_topic_score_gemma":0.0011953333,"teacher_disagreement_score":0.0014796667,"about_ca_system_score_codex":0.00040838303,"about_ca_system_score_gemma":0.0003879938,"threshold_uncertainty_score":0.0049499273},"labels":[],"label_agreement":null},{"id":"W1837858880","doi":"10.1109/icassp.1980.1170981","title":"Spectral distance measure applied to the optimum design of DPCM coders with L predictors","year":2005,"lang":"en","type":"article","venue":"","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Sherbrooke","funders":"","keywords":"Measure (data warehouse); Computer science; Discriminant; Algorithm; Coding (social sciences); Mathematics; Discrete mathematics; Artificial intelligence; Statistics; Data mining","score_opus":0.016282676634015076,"score_gpt":0.2361084542471907,"score_spread":0.21982577761317562,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1837858880","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011542317,0.0001448681,0.98690724,0.000052896357,0.000010673181,0.000026279435,0.000009391675,0.000097520555,0.0012088097],"genre_scores_gemma":[0.4609459,0.000201651,0.5370086,0.000060559138,0.000028665972,0.00015289253,0.000050520073,0.00006523253,0.0014860468],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99908245,0.00034168691,0.000043741515,0.00013640658,0.00034583051,0.000049886767],"domain_scores_gemma":[0.9984218,0.0009833443,0.00019458494,0.00009505505,0.00026624498,0.00003902782],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001252533,0.00068883813,0.0005695663,0.0005787158,0.00031252136,0.00070610974,0.0006295774,0.0006355531,0.0014780619],"category_scores_gemma":[0.005636494,0.00039203596,0.00033179478,0.00039327648,0.0007295078,0.0007599848,0.00070249237,0.0006429505,0.00035952817],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021179396,0.000073442185,0.00064702483,0.00023597936,0.000040075938,0.00006579612,0.00013439034,0.7162675,0.021459894,0.031284858,0.0006454308,0.22893378],"study_design_scores_gemma":[0.000012674316,0.00012146504,0.0001609101,0.000015603642,0.0000067546594,0.00003207582,0.000011477667,0.9879118,0.007581165,0.0031705485,0.0009646494,0.000010949977],"about_ca_topic_score_codex":0.0013418928,"about_ca_topic_score_gemma":0.0010882714,"teacher_disagreement_score":0.0014780619,"about_ca_system_score_codex":0.0009609739,"about_ca_system_score_gemma":0.0011419898,"threshold_uncertainty_score":0.0069723725},"labels":[],"label_agreement":null},{"id":"W1850550719","doi":"10.1109/icassp.1985.1168522","title":"Tree structures for implementation of a vector quantized speech coding system","year":2005,"lang":"en","type":"article","venue":"","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Windsor","funders":"","keywords":"Codebook; Vector quantization; Linde–Buzo–Gray algorithm; Speech coding; Harmonic Vector Excitation Coding; Computer science; Coding (social sciences); Quantization (signal processing); Speech recognition; Algorithm; Linear predictive coding; Bit rate; Mathematics; Computer engineering","score_opus":0.028369141017308565,"score_gpt":0.35043762675543577,"score_spread":0.3220684857381272,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1850550719","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.053188384,0.0005440478,0.93345904,0.00023084939,0.0001261138,0.00023744749,0.00038912747,0.0044769123,0.0073480126],"genre_scores_gemma":[0.3507064,0.00043740982,0.64090437,0.00012003416,0.000040419705,0.0003062693,0.00086009124,0.00015098132,0.0064741103],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997744,0.000055697736,0.000021272133,0.000019164405,0.00010139661,0.000028067972],"domain_scores_gemma":[0.99957436,0.00015711178,0.00002851292,0.00005422104,0.00016857016,0.000017172672],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030541967,0.00023824963,0.00019241491,0.00037198924,0.00035679288,0.0005463012,0.0004907311,0.0004278592,0.0055952077],"category_scores_gemma":[0.0009345965,0.00014388483,0.00015376475,0.0005306304,0.00015013244,0.00057708455,0.00019982342,0.00038147063,0.0015005999],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000991433,0.00021658532,0.0012902442,0.0005199741,0.00007439124,0.00041844137,0.0004095713,0.06489685,0.24513124,0.08853733,0.015882222,0.58163166],"study_design_scores_gemma":[0.0003225197,0.001821843,0.0019843855,0.00016822503,0.00015623725,0.00064755324,0.00017124467,0.661756,0.2145053,0.03506817,0.083308294,0.00009018067],"about_ca_topic_score_codex":0.0024829947,"about_ca_topic_score_gemma":0.0032142175,"teacher_disagreement_score":0.0055952077,"about_ca_system_score_codex":0.00037953144,"about_ca_system_score_gemma":0.00064124895,"threshold_uncertainty_score":0.018717825},"labels":[],"label_agreement":null},{"id":"W1851132131","doi":"10.1109/icassp.1985.1168226","title":"Generalization of the multipulse coding for low bit rate coding purposes: The generalized decimation","year":2005,"lang":"en","type":"article","venue":"","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Sherbrooke","funders":"","keywords":"Residual; Decimation; Speech coding; Harmonic Vector Excitation Coding; Computer science; Coding (social sciences); Speech recognition; Algorithm; Vector sum excited linear prediction; Decoding methods; Linear predictive coding; Bit rate; Sub-band coding; Digital signal processing; Code-excited linear prediction; Mathematics; Telecommunications; Computer engineering; Computer hardware; Statistics; Bandwidth (computing)","score_opus":0.02507048579274233,"score_gpt":0.2928769052717996,"score_spread":0.26780641947905726,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1851132131","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009320851,0.0006918541,0.98427075,0.00010717986,0.0001160013,0.00004197676,0.00004522252,0.00025694663,0.0051491815],"genre_scores_gemma":[0.27195898,0.0025948328,0.7147005,0.00041462755,0.00044027195,0.00016029987,0.00022425578,0.00023214267,0.00927403],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9998123,0.000030302608,0.0000111120635,0.000041809028,0.000086887136,0.000017635803],"domain_scores_gemma":[0.99974984,0.0000887906,0.000019110348,0.00008120035,0.00004873027,0.000012297617],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021137465,0.00043381195,0.00031669496,0.0003999944,0.00015753957,0.00036384547,0.0004887014,0.00039976358,0.0019810975],"category_scores_gemma":[0.0006172092,0.00009501451,0.00032310054,0.00037006047,0.00047698666,0.0005864212,0.00047340352,0.0009859744,0.00096520537],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012989277,0.000062528205,0.00022792217,0.00037730703,0.00002610703,0.00036421267,0.00022157944,0.01756644,0.2864724,0.12863529,0.0020614013,0.563855],"study_design_scores_gemma":[0.000045170895,0.0006880301,0.0017088173,0.00017054098,0.00006555206,0.0043798215,0.000079288046,0.43480805,0.35467914,0.10187925,0.10137703,0.00011934224],"about_ca_topic_score_codex":0.00027001102,"about_ca_topic_score_gemma":0.00032346422,"teacher_disagreement_score":0.0019810975,"about_ca_system_score_codex":0.00014476737,"about_ca_system_score_gemma":0.00025767603,"threshold_uncertainty_score":0.0066275},"labels":[],"label_agreement":null},{"id":"W1852079998","doi":"10.1109/pacrim.1999.799581","title":"Block subband coding and time-varying filterbanks","year":2003,"lang":"en","type":"article","venue":"","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University; Western University","funders":"","keywords":"Filter bank; Sub-band coding; Algorithm; Computer science; Coding (social sciences); Signal processing; Adaptive filter; Mathematics; Speech recognition; Filter (signal processing); Digital signal processing; Speech coding; Computer vision; Statistics","score_opus":0.015691690423967748,"score_gpt":0.2551012721467056,"score_spread":0.23940958172273782,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1852079998","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011538549,0.0002353984,0.9860523,0.000077417666,0.000023090977,0.00001523584,0.000022502254,0.00007335975,0.0019621549],"genre_scores_gemma":[0.30287823,0.0013887135,0.6861902,0.0001695094,0.0001040327,0.00016347844,0.00018261773,0.0001179333,0.008805357],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997391,0.00007481567,0.0000138260375,0.000041162843,0.00010814096,0.000022930377],"domain_scores_gemma":[0.999079,0.00053382746,0.00010534718,0.00012909388,0.0001321816,0.000020458761],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00049694174,0.0003729643,0.00023564708,0.0003992664,0.00015339877,0.0005782199,0.00030253842,0.0006774269,0.0020521795],"category_scores_gemma":[0.0024270238,0.00017786908,0.00020198089,0.000469324,0.00068293,0.0010117375,0.00032405718,0.0006721539,0.00045892844],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014694467,0.000027049191,0.0003693273,0.00009188234,0.000018151572,0.000126318,0.00015335185,0.13748038,0.12914458,0.59348613,0.00117585,0.13778004],"study_design_scores_gemma":[0.000018614022,0.00009753469,0.0005582652,0.000019233561,0.000014152013,0.00014908149,0.00002659923,0.86143965,0.039082855,0.0906552,0.007917583,0.000021208834],"about_ca_topic_score_codex":0.00060389494,"about_ca_topic_score_gemma":0.00056928355,"teacher_disagreement_score":0.0020521795,"about_ca_system_score_codex":0.0003765982,"about_ca_system_score_gemma":0.00027974544,"threshold_uncertainty_score":0.006865263},"labels":[],"label_agreement":null},{"id":"W1856766194","doi":"10.1007/978-3-642-21596-4_25","title":"Lossless Compression of Satellite Image Sets Using Spatial Area Overlap Compensation","year":2011,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Lethbridge","funders":"","keywords":"Lossless compression; Computer science; Data compression; Image compression; Artificial intelligence; Computer vision; Set (abstract data type); Compression (physics); Image (mathematics); Satellite; Pattern recognition (psychology); Image processing","score_opus":0.03627776436042709,"score_gpt":0.28479161270061265,"score_spread":0.24851384834018556,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1856766194","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.25889552,0.0014868007,0.726833,0.00027936077,0.0002307613,0.00007518643,0.0005093604,0.001281092,0.010408913],"genre_scores_gemma":[0.68723196,0.001306813,0.29715213,0.00011345739,0.00020651145,0.000076743345,0.0011807546,0.0001671958,0.012564418],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998417,0.000013680327,0.0000066302105,0.000013634597,0.00011136712,0.000013000885],"domain_scores_gemma":[0.99979633,0.00007910848,0.000018710467,0.000061285216,0.000037910435,0.000006678379],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013377123,0.0003574249,0.00028755696,0.00057253457,0.00017410153,0.00040652658,0.00037703646,0.0002633606,0.0015529986],"category_scores_gemma":[0.0005774499,0.00014889243,0.00020254016,0.0008862422,0.00025051806,0.00060888694,0.000438117,0.00033983917,0.00045179535],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00072788884,0.00012766036,0.00058445527,0.00022256168,0.00006174606,0.00035841053,0.00016811697,0.06043603,0.31656358,0.009482096,0.004517714,0.6067498],"study_design_scores_gemma":[0.000050883995,0.00023828106,0.005024193,0.000056343546,0.000057450878,0.001482469,0.00009059909,0.6370074,0.33695903,0.0073385304,0.011662847,0.00003187952],"about_ca_topic_score_codex":0.0006130294,"about_ca_topic_score_gemma":0.0010359441,"teacher_disagreement_score":0.0015529986,"about_ca_system_score_codex":0.00017484283,"about_ca_system_score_gemma":0.00013010984,"threshold_uncertainty_score":0.0051953197},"labels":[],"label_agreement":null},{"id":"W185705012","doi":"10.1007/978-1-4615-1527-2_13","title":"Compression Coding for IAP Data","year":2001,"lang":"en","type":"book-chapter","venue":"˜The œKluwer international series on Asian studies in computer and information science","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Compression (physics); Computer science; Materials science; Composite material","score_opus":0.07991580012025451,"score_gpt":0.36116334537480904,"score_spread":0.28124754525455453,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W185705012","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01351852,0.0055288738,0.9185833,0.0007461531,0.00084485504,0.00016914352,0.0006134438,0.0025359495,0.057459854],"genre_scores_gemma":[0.27167135,0.009750757,0.6009695,0.00076034415,0.0010624982,0.00052555936,0.003425661,0.0010355393,0.11079884],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9997793,0.000025900772,0.000010623665,0.0000134585725,0.00015277586,0.000017927408],"domain_scores_gemma":[0.9995833,0.00014545763,0.000018489369,0.00011335664,0.0001314416,0.000007953476],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018284997,0.00059543346,0.00032097904,0.001208243,0.00030431637,0.00076272263,0.0005096357,0.00055666745,0.009417232],"category_scores_gemma":[0.0011837973,0.00016415713,0.00022319495,0.0019243987,0.0004401103,0.00082920986,0.00054568396,0.0008730174,0.0029244395],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010053115,0.000028533006,0.0002605646,0.0003119061,0.00001916147,0.00034721254,0.00014836261,0.016768262,0.04513613,0.11807259,0.031035438,0.7877714],"study_design_scores_gemma":[0.00004681399,0.00019271154,0.0017641,0.0004844005,0.000056369237,0.003582917,0.00016912214,0.4395387,0.18230371,0.13028704,0.24150012,0.00007401079],"about_ca_topic_score_codex":0.0009747159,"about_ca_topic_score_gemma":0.0010022603,"teacher_disagreement_score":0.009417232,"about_ca_system_score_codex":0.00035748488,"about_ca_system_score_gemma":0.0003026261,"threshold_uncertainty_score":0.031503797},"labels":[],"label_agreement":null},{"id":"W1859724630","doi":"","title":"Lossy Distributed Source Coding Using Real-Number Codes","year":2011,"lang":"en","type":"article","venue":"arXiv (Cornell University)","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Lossy compression; Algorithm; Decoding methods; Distributed source coding; Computer science; Quantization (signal processing); Coding (social sciences); Variable-length code; Theoretical computer science; Mathematics; Statistics; Artificial intelligence","score_opus":0.12343383488074901,"score_gpt":0.2182328074991595,"score_spread":0.09479897261841048,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1859724630","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003828329,0.00025264767,0.99417526,0.00012683295,0.000043926408,0.00001563737,0.000035476336,0.00011209707,0.001409868],"genre_scores_gemma":[0.3498769,0.001269175,0.64144856,0.00025796637,0.00018690202,0.00018952493,0.00026170557,0.00011708395,0.006392226],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99931026,0.00019595979,0.000029880684,0.000087881686,0.0003335964,0.000042444964],"domain_scores_gemma":[0.998536,0.00067458756,0.00015680763,0.0003637465,0.00024141798,0.000027490101],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00093960494,0.00060012756,0.00054167566,0.0005710173,0.00025742187,0.0008293201,0.0010492286,0.0007018419,0.0015263181],"category_scores_gemma":[0.00373982,0.00018358596,0.00038171178,0.00091100996,0.0011003704,0.0017072879,0.0011380906,0.0014915457,0.0006093183],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019248408,0.000048278016,0.00033656353,0.0001714285,0.000036987494,0.00026774147,0.0001608645,0.36819983,0.024694983,0.4625078,0.0028789316,0.14050406],"study_design_scores_gemma":[0.000022771143,0.000043767755,0.00009838462,0.000032272903,0.000008903533,0.00017552407,0.000013998036,0.89744663,0.010296833,0.08729182,0.0045460234,0.000023010467],"about_ca_topic_score_codex":0.00080463395,"about_ca_topic_score_gemma":0.00070476695,"teacher_disagreement_score":0.0015263181,"about_ca_system_score_codex":0.0007369632,"about_ca_system_score_gemma":0.00048887124,"threshold_uncertainty_score":0.005347073},"labels":[],"label_agreement":null},{"id":"W1860610487","doi":"10.1109/scft.1993.762345","title":"Subjective Test Methodology: MOS vs. DMOS in Evaluation of Speech Coding Algorithms","year":2005,"lang":"en","type":"article","venue":"","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Bell (Canada)","funders":"","keywords":"Computer science; Speech coding; Algorithm; Test (biology); Coding (social sciences); Speech recognition; Mathematics; Statistics","score_opus":0.12222349111720984,"score_gpt":0.4010377439997647,"score_spread":0.2788142528825549,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1860610487","genre_codex":"empirical","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.66777635,0.0017716285,0.309718,0.00025572747,0.00039427908,0.001235646,0.0027418893,0.00080959324,0.015296812],"genre_scores_gemma":[0.8964853,0.0006032552,0.09593268,0.00024093792,0.00014376869,0.0008866819,0.0013044088,0.00024202144,0.0041608093],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9960496,0.0017410079,0.00047430253,0.0003060783,0.0013479948,0.000080897655],"domain_scores_gemma":[0.9722821,0.018949283,0.0011719344,0.0010914556,0.0060299067,0.00047528182],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005909032,0.0005947401,0.0004944406,0.0015153721,0.00029870364,0.000715765,0.0005526106,0.0009758157,0.0049964306],"category_scores_gemma":[0.025908155,0.00012858317,0.0003378,0.0011257484,0.000421555,0.0006518277,0.00058355846,0.00044142877,0.00089771947],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.013154857,0.0016120326,0.07083858,0.0022141521,0.0006406602,0.00038924805,0.0011105323,0.012843305,0.3277974,0.004280118,0.0052287295,0.55989033],"study_design_scores_gemma":[0.0011088842,0.024122108,0.34509206,0.0005504557,0.0012007899,0.003568159,0.00165703,0.19627227,0.40791035,0.0048125363,0.013198206,0.0005071074],"about_ca_topic_score_codex":0.0006399555,"about_ca_topic_score_gemma":0.0013844946,"teacher_disagreement_score":0.005909032,"about_ca_system_score_codex":0.00025678746,"about_ca_system_score_gemma":0.00029319976,"threshold_uncertainty_score":0.031250298},"labels":[],"label_agreement":null},{"id":"W1861008281","doi":"10.1109/pacrim.1993.407343","title":"Design of a data compression scheme for the Canadian National Seismographic Network","year":2002,"lang":"en","type":"article","venue":"","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"University of Victoria","funders":"","keywords":"Compression ratio; Coding (social sciences); Inefficiency; Computer science; Data compression; Binary number; Algorithm; Context-adaptive binary arithmetic coding; Computation; Computer engineering; Data mining; Statistics; Mathematics; Arithmetic; Engineering","score_opus":0.17407001992712046,"score_gpt":0.3262597821298605,"score_spread":0.15218976220274005,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1861008281","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.026723107,0.0001157375,0.9695285,0.00022254759,0.00004008346,0.0003156232,0.00013387212,0.00088171265,0.0020388314],"genre_scores_gemma":[0.31555143,0.00018959495,0.6805803,0.00010408473,0.000040399485,0.000568895,0.00038025912,0.00007847914,0.0025064694],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99961674,0.00004857712,0.00001986454,0.00006743424,0.00018864754,0.00005868971],"domain_scores_gemma":[0.99942976,0.000096843,0.00006421996,0.000048583974,0.00032498245,0.000035496963],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005851023,0.0005210581,0.00029359473,0.0011700317,0.00075431255,0.00061131554,0.0009320968,0.0005076571,0.0017763561],"category_scores_gemma":[0.002185647,0.00022758977,0.00020436832,0.0009996092,0.0005607113,0.0007733897,0.0007401737,0.00051234604,0.00042264987],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":true,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00041410013,0.00010011901,0.002639371,0.00016641074,0.000035333236,0.00017892093,0.0002877292,0.21555406,0.08404214,0.02015885,0.005446307,0.6709767],"study_design_scores_gemma":[0.000057908113,0.00011658824,0.0010930264,0.00001940578,0.000020354702,0.00009030962,0.00006901843,0.9559663,0.034112863,0.0024372148,0.005990853,0.000026174368],"about_ca_topic_score_codex":0.026245289,"about_ca_topic_score_gemma":0.031228088,"teacher_disagreement_score":0.9737547,"about_ca_system_score_codex":0.0016842876,"about_ca_system_score_gemma":0.0028806166,"threshold_uncertainty_score":0.05218506},"labels":[],"label_agreement":null},{"id":"W1861533052","doi":"10.1109/iscas.1988.15214","title":"Parallel implementation of a median filtering algorithm","year":2003,"lang":"en","type":"article","venue":"","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Synchronization (alternating current); Multiprocessing; Scheme (mathematics); Computer science; Parallel computing; Algorithm; Parallel algorithm; Mathematics; Computer network","score_opus":0.018383339516046187,"score_gpt":0.3195520202434848,"score_spread":0.3011686807274386,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1861533052","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009872922,0.000063599786,0.9839752,0.000069038695,0.00006530851,0.000037151985,0.000050420127,0.0025450473,0.0033212134],"genre_scores_gemma":[0.20965965,0.00012901906,0.78322417,0.00008172375,0.00006732215,0.00013488263,0.0002753325,0.0002128922,0.00621506],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995766,0.000045833825,0.000034012963,0.00009120867,0.0001940596,0.000058261696],"domain_scores_gemma":[0.9996228,0.00008446213,0.000026096592,0.00011237398,0.00012547789,0.000028744356],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004398937,0.00043885392,0.0005519994,0.00058076746,0.0005904864,0.0009317571,0.00095597596,0.00055873336,0.0074464763],"category_scores_gemma":[0.0010284587,0.00028801546,0.00042724478,0.00065404206,0.0002611649,0.00088681915,0.0006024207,0.0005168723,0.0018311895],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00068758806,0.00023082737,0.0015103377,0.00016452599,0.000112413654,0.00033986784,0.00016980722,0.14303926,0.13374984,0.028735543,0.008030073,0.68323],"study_design_scores_gemma":[0.00012298963,0.00017528026,0.0006248434,0.000013177852,0.000042626467,0.00025705973,0.00004073708,0.88811475,0.08069382,0.010088545,0.019794984,0.000031190502],"about_ca_topic_score_codex":0.002084087,"about_ca_topic_score_gemma":0.0024116808,"teacher_disagreement_score":0.0074464763,"about_ca_system_score_codex":0.00057109306,"about_ca_system_score_gemma":0.00095709285,"threshold_uncertainty_score":0.024910927},"labels":[],"label_agreement":null},{"id":"W1863751431","doi":"10.1109/iscas.2003.1206098","title":"Multi-server optimal bandwidth monitoring for QoS based multimedia delivery","year":2003,"lang":"en","type":"article","venue":"","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Computer science; Bandwidth (computing); Dynamic bandwidth allocation; Server; Quality of service; Computer network; Probabilistic logic; Bandwidth allocation; Real-time computing; Distributed computing; Artificial intelligence","score_opus":0.041122026099765535,"score_gpt":0.30484147241149523,"score_spread":0.2637194463117297,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1863751431","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.051340047,0.00038477045,0.9467584,0.00012275796,0.00001594119,0.00004403414,0.000019638746,0.00077216094,0.00054225273],"genre_scores_gemma":[0.7622064,0.00010666444,0.236986,0.00004199575,0.000021961881,0.00006589177,0.000047910184,0.000046851565,0.00047633465],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99859816,0.0004678255,0.0000789483,0.0002369754,0.0005115296,0.0001065513],"domain_scores_gemma":[0.99710065,0.0018321181,0.00030587107,0.00031019578,0.00034463487,0.00010660551],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017776983,0.00043998176,0.0008157219,0.0008948812,0.0005715853,0.00073758356,0.0013395121,0.0006935545,0.0006067586],"category_scores_gemma":[0.0068587773,0.00037021487,0.00028973512,0.0006643476,0.000630166,0.0012434816,0.00083185034,0.00087420864,0.00018500176],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007309116,0.00024381315,0.0035929566,0.00007925806,0.00005029423,0.00010572413,0.00017557158,0.65403914,0.025099643,0.010723392,0.0010613981,0.3040979],"study_design_scores_gemma":[0.000010104782,0.000030591626,0.00025109726,0.0000017718916,0.000003959656,0.000024704701,0.000009220325,0.9944771,0.0031069892,0.0019452975,0.00013423114,0.0000049760133],"about_ca_topic_score_codex":0.0023748,"about_ca_topic_score_gemma":0.0017969196,"teacher_disagreement_score":0.0023748,"about_ca_system_score_codex":0.0011541635,"about_ca_system_score_gemma":0.00090410083,"threshold_uncertainty_score":0.009401441},"labels":[],"label_agreement":null},{"id":"W1871710631","doi":"10.1109/adfsp.1998.685718","title":"Hardware implementation of a wavelet based image compression coder","year":2002,"lang":"en","type":"article","venue":"","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Set partitioning in hierarchical trees; Computer science; Image compression; Wavelet; Wavelet transform; Data compression; Discrete wavelet transform; Lossy compression; Lifting scheme; Computer hardware; VHDL; Wavelet packet decomposition; Modular design; Parallel computing; Artificial intelligence; Image processing; Image (mathematics); Field-programmable gate array","score_opus":0.02533093836983842,"score_gpt":0.3102244978834219,"score_spread":0.28489355951358347,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1871710631","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09790182,0.00065139844,0.8717827,0.00024281465,0.0002611381,0.0002814551,0.00038273822,0.014982287,0.013513628],"genre_scores_gemma":[0.5052823,0.000394395,0.47788802,0.00039592615,0.000091381415,0.0002862748,0.00080074184,0.0002631624,0.014597799],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99983156,0.000014543763,0.000009687089,0.000030474412,0.00008871948,0.00002502412],"domain_scores_gemma":[0.99979705,0.000031419975,0.000019403918,0.00003355383,0.00010524811,0.000013301504],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001174845,0.0003157146,0.00033493922,0.00042126837,0.00022637393,0.0003671493,0.00097357895,0.00039857195,0.005138385],"category_scores_gemma":[0.0003733252,0.00018852312,0.00018610134,0.0002883515,0.0001620506,0.00030941496,0.00022601117,0.00037930883,0.0022693877],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00043277474,0.00015788073,0.0011579086,0.00032524744,0.000076442884,0.0006332025,0.00010490178,0.01707795,0.61052924,0.0073888577,0.008174139,0.35394153],"study_design_scores_gemma":[0.00017733921,0.0016882365,0.004618134,0.00006250242,0.00012544486,0.0034865953,0.000049457674,0.28607875,0.64145684,0.0020452568,0.06014026,0.000071217626],"about_ca_topic_score_codex":0.0005460253,"about_ca_topic_score_gemma":0.0005083469,"teacher_disagreement_score":0.005138385,"about_ca_system_score_codex":0.00026018097,"about_ca_system_score_gemma":0.00032276404,"threshold_uncertainty_score":0.017189622},"labels":[],"label_agreement":null},{"id":"W1873452063","doi":"10.1109/ccece.2001.933565","title":"A review of current raw SAR data compression techniques","year":2002,"lang":"en","type":"review","venue":"","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":20,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba; Research Manitoba","funders":"","keywords":"Synthetic aperture radar; Computer science; Radar imaging; Remote sensing; Raw data; Inverse synthetic aperture radar; Data compression; Side looking airborne radar; Radar; 3D radar; Bandwidth (computing); Vector quantization; Quantization (signal processing); Computer vision; Pulse-Doppler radar; Artificial intelligence; Geology; Telecommunications","score_opus":0.2565061111116205,"score_gpt":0.4678998049423345,"score_spread":0.211393693830714,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1873452063","genre_codex":"review","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":"review","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0032679022,0.9429442,0.03224344,0.00064589386,0.00092416594,0.00007944589,0.00023827734,0.00030280146,0.019353807],"genre_scores_gemma":[0.008138205,0.94317186,0.03320737,0.0004474301,0.00097576657,0.00009114756,0.0005320146,0.00004689096,0.013389247],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99959093,0.000032710846,0.000045127843,0.000059287537,0.0002524633,0.00001945767],"domain_scores_gemma":[0.9993278,0.0002310403,0.00005112679,0.000033530276,0.00033157296,0.000025006715],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037704257,0.0007021965,0.00076618727,0.0030552375,0.00033401864,0.0009479712,0.0009231305,0.0007065537,0.006097406],"category_scores_gemma":[0.0012017654,0.00031947577,0.00036461093,0.0040667797,0.00025233655,0.0016118286,0.00032606814,0.00052150676,0.005480577],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000036245663,0.000051119845,0.00017758209,0.0027161718,0.000017631924,0.00011869579,0.000035047313,0.0008218457,0.00322322,0.0019161188,0.01360187,0.97728455],"study_design_scores_gemma":[0.000015893587,0.00022146435,0.0013841173,0.0019040536,0.00008113288,0.0030064338,0.000108689215,0.0032912153,0.0066689197,0.004202014,0.9790622,0.000053806903],"about_ca_topic_score_codex":0.00087490655,"about_ca_topic_score_gemma":0.0010501442,"teacher_disagreement_score":0.006097406,"about_ca_system_score_codex":0.00028315975,"about_ca_system_score_gemma":0.0006521213,"threshold_uncertainty_score":0.020397842},"labels":[],"label_agreement":null},{"id":"W1875208079","doi":"10.1109/icassp.1988.196603","title":"Multiply occupied cells (speech codecs)","year":2003,"lang":"en","type":"article","venue":"","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Tellabs (Canada)","funders":"","keywords":"Concatenation (mathematics); Codec; Cardinality (data modeling); Computer science; Distortion (music); Speech recognition; Algorithm; Theoretical computer science; Mathematics; Discrete mathematics; Combinatorics; Telecommunications; Data mining","score_opus":0.0146610528278227,"score_gpt":0.26598214071761944,"score_spread":0.25132108788979673,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1875208079","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013523316,0.0013793216,0.95848787,0.00040813943,0.00081156066,0.00016529467,0.0004203557,0.0023980492,0.02240607],"genre_scores_gemma":[0.27612707,0.0019219728,0.6761114,0.0010711437,0.00092594523,0.0005424498,0.0011269016,0.001171323,0.0410018],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9982742,0.00034419258,0.000118654745,0.00023530704,0.0008226773,0.00020500724],"domain_scores_gemma":[0.9962288,0.0014957937,0.00036198623,0.0009313352,0.0008483737,0.00013368492],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00073791225,0.0011540948,0.00074612466,0.0016582033,0.001091225,0.002761634,0.0014298728,0.0018184842,0.009961716],"category_scores_gemma":[0.005705642,0.0005372618,0.000505261,0.0016838785,0.0024469576,0.002901593,0.0028728913,0.002222768,0.0065736435],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00045756908,0.00007147673,0.0006813141,0.00034243552,0.000044482567,0.0015308612,0.00068320753,0.017009119,0.042322837,0.5922749,0.018130291,0.32645154],"study_design_scores_gemma":[0.00008374264,0.0004935562,0.00081273663,0.00031526087,0.000090220696,0.0063751866,0.00037286468,0.19583167,0.16210261,0.29106152,0.3422456,0.00021498592],"about_ca_topic_score_codex":0.0011527742,"about_ca_topic_score_gemma":0.0013470061,"teacher_disagreement_score":0.009961716,"about_ca_system_score_codex":0.0007391449,"about_ca_system_score_gemma":0.00093958474,"threshold_uncertainty_score":0.033325315},"labels":[],"label_agreement":null},{"id":"W1883305861","doi":"10.1109/icassp.2000.861080","title":"Quantization of line spectral parameters using a trellis structure","year":2002,"lang":"en","type":"article","venue":"","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Trellis quantization; Algorithm; Quantization (signal processing); Inter frame; Mathematics; Computer science; Coding (social sciences); Trellis (graph); Speech coding; Frame (networking); Speech recognition; Telecommunications; Decoding methods; Reference frame; Image compression; Artificial intelligence; Statistics","score_opus":0.05296140145513423,"score_gpt":0.2868187478375755,"score_spread":0.23385734638244127,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1883305861","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0229818,0.00049021596,0.97211,0.00012617101,0.00007843159,0.00008573522,0.00015072996,0.0008932972,0.0030836097],"genre_scores_gemma":[0.35443866,0.00061687164,0.6394775,0.00011673608,0.00009112821,0.00015006216,0.0004095179,0.00013343051,0.004566122],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994363,0.00014721882,0.000047655765,0.0000820124,0.00025011544,0.00003669014],"domain_scores_gemma":[0.9992524,0.00027036347,0.00009587808,0.00013444535,0.00022759743,0.000019201472],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046013284,0.00032822517,0.00034497303,0.0005203387,0.0003933807,0.0007052742,0.0005622989,0.00053864106,0.0026889713],"category_scores_gemma":[0.0017339101,0.00018034344,0.00031173337,0.00056689035,0.0004893216,0.0007871336,0.00024395471,0.00065585104,0.0010115958],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004803374,0.00010190848,0.00059198414,0.0003529551,0.00006688225,0.00022152149,0.00024675982,0.14735529,0.37963519,0.06342004,0.0032275498,0.40429962],"study_design_scores_gemma":[0.00009177245,0.0006100623,0.00068619155,0.000077250384,0.00004187352,0.00041369896,0.000048340713,0.71187717,0.2502448,0.017168397,0.018639462,0.00010105412],"about_ca_topic_score_codex":0.0014865827,"about_ca_topic_score_gemma":0.002482826,"teacher_disagreement_score":0.0026889713,"about_ca_system_score_codex":0.0006464953,"about_ca_system_score_gemma":0.0005898013,"threshold_uncertainty_score":0.008995533},"labels":[],"label_agreement":null},{"id":"W1892509000","doi":"10.1109/icip.1999.817138","title":"Robust subband image coding for wireless transmission","year":2003,"lang":"en","type":"article","venue":"","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; Image compression; Vector quantization; JPEG; Data compression; Artificial intelligence; Robustness (evolution); Entropy encoding; JPEG 2000; Algorithm; Transform coding; Wavelet; Computer vision; Image processing; Image (mathematics); Discrete cosine transform","score_opus":0.03467106250547815,"score_gpt":0.27816046692570456,"score_spread":0.24348940442022643,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1892509000","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013746431,0.0027142025,0.9774826,0.0003514198,0.0001329249,0.000044995224,0.00008320284,0.0009934059,0.0044507976],"genre_scores_gemma":[0.4134703,0.0047769193,0.5695427,0.0002604944,0.00026366205,0.00016591675,0.00040180146,0.00024389113,0.010874344],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99969196,0.00004878022,0.00001130625,0.000025126388,0.00020626294,0.000016595606],"domain_scores_gemma":[0.99966,0.00009589406,0.000054069835,0.00009784575,0.00008081214,0.000011316329],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000266638,0.00032870646,0.00032561054,0.00043226645,0.00013480123,0.00045018533,0.00045359932,0.0005402566,0.002037121],"category_scores_gemma":[0.0012175344,0.00013557727,0.00017883176,0.0006029742,0.00041107932,0.00065179414,0.0003655278,0.00067868346,0.0009773304],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019046018,0.000058305635,0.00023237157,0.00025009055,0.00004075664,0.00014200066,0.000084619096,0.12748687,0.18267722,0.14411743,0.009585236,0.53513455],"study_design_scores_gemma":[0.000022774193,0.00010031124,0.00030515212,0.000042808642,0.000019258363,0.00021631861,0.000019796,0.87284774,0.066970326,0.038242627,0.02118515,0.000027714486],"about_ca_topic_score_codex":0.00082661863,"about_ca_topic_score_gemma":0.0007075631,"teacher_disagreement_score":0.002037121,"about_ca_system_score_codex":0.00031872527,"about_ca_system_score_gemma":0.00039247875,"threshold_uncertainty_score":0.006814778},"labels":[],"label_agreement":null},{"id":"W1897628727","doi":"10.1109/scft.1999.781509","title":"An improved background noise coding mode for variable rate speech coders","year":2003,"lang":"en","type":"article","venue":"","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Computer science; Speech recognition; Speech coding; Coding (social sciences); Harmonic Vector Excitation Coding; Codec; Noise measurement; Noise (video); Codec2; Voice activity detection; Adaptive Multi-Rate audio codec; Linear predictive coding; Speech processing; Noise reduction; Mathematics; Artificial intelligence; Telecommunications; Statistics","score_opus":0.029819995876328092,"score_gpt":0.31923337510459193,"score_spread":0.2894133792282638,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1897628727","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.038936056,0.00068533863,0.9570103,0.00017364054,0.00010607208,0.0000684157,0.000054274573,0.00096179446,0.0020039505],"genre_scores_gemma":[0.40578586,0.00066810916,0.58682,0.0003210818,0.00018257408,0.00013896763,0.00027223933,0.00019748637,0.0056136865],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99887675,0.0002986828,0.00004891917,0.00013428797,0.00056248275,0.00007885127],"domain_scores_gemma":[0.99878436,0.0003710866,0.000098401615,0.00023690432,0.00045548548,0.00005375544],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00085623516,0.0007392936,0.0005320741,0.0006336404,0.00033891867,0.0005719384,0.0013910718,0.0008413783,0.0011446903],"category_scores_gemma":[0.0023441135,0.00020386909,0.00028002108,0.00040070314,0.0005600212,0.001054993,0.0008369037,0.001077675,0.0006731447],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012579454,0.00017190918,0.0013047472,0.00029409718,0.00006845765,0.00048064033,0.0002716921,0.048952866,0.47956058,0.038940012,0.002404755,0.4262924],"study_design_scores_gemma":[0.00010266908,0.0006825535,0.000918273,0.00010479083,0.000084849984,0.0010497413,0.00003720201,0.7224362,0.25216007,0.0038518808,0.018471273,0.000100560916],"about_ca_topic_score_codex":0.0009973894,"about_ca_topic_score_gemma":0.0013147653,"teacher_disagreement_score":0.0013910718,"about_ca_system_score_codex":0.0003521444,"about_ca_system_score_gemma":0.00040105262,"threshold_uncertainty_score":0.004528284},"labels":[],"label_agreement":null},{"id":"W1900178479","doi":"10.1109/ccece.1995.528097","title":"Indexing the output points in a lattice based vector quantizer","year":2002,"lang":"en","type":"article","venue":"","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Codebook; Search engine indexing; Vector quantization; Computer science; Lattice (music); Linde–Buzo–Gray algorithm; Artificial intelligence; Support vector machine; JPEG; Algorithm; Pattern recognition (psychology); Mathematics; Data compression; Physics","score_opus":0.046907325261516704,"score_gpt":0.277172590434202,"score_spread":0.2302652651726853,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1900178479","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008150922,0.0004705196,0.9887057,0.00008539202,0.00011736321,0.00004495074,0.00012793593,0.0010131384,0.0012842036],"genre_scores_gemma":[0.1574912,0.0007230757,0.83398366,0.00013620984,0.00013058225,0.00022665004,0.0006348416,0.0002022131,0.006471504],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9989489,0.00014738056,0.000079535355,0.0001176809,0.000634665,0.00007188326],"domain_scores_gemma":[0.99937063,0.00014608109,0.0000584503,0.000119312885,0.00025687247,0.000048598242],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006540122,0.0004363215,0.0007945108,0.0007686305,0.00041588984,0.0011729504,0.0012018168,0.0006239334,0.003922941],"category_scores_gemma":[0.0019999023,0.0002785425,0.00030633478,0.0012280324,0.00061696983,0.0018132447,0.001023965,0.0010688789,0.0023106534],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007000399,0.00014558881,0.00063506886,0.0003289929,0.000035744415,0.00012298122,0.00015442935,0.045119382,0.17446092,0.039494965,0.008045915,0.730756],"study_design_scores_gemma":[0.00021309419,0.00039743373,0.00046443797,0.000062864194,0.000035176123,0.00035240708,0.000079899044,0.81425995,0.14248829,0.018794632,0.022735788,0.000115969175],"about_ca_topic_score_codex":0.0018302763,"about_ca_topic_score_gemma":0.0023003367,"teacher_disagreement_score":0.003922941,"about_ca_system_score_codex":0.0005821874,"about_ca_system_score_gemma":0.00093504274,"threshold_uncertainty_score":0.013123512},"labels":[],"label_agreement":null},{"id":"W1900682062","doi":"10.1109/mwscas.1997.662164","title":"Fast VLSI architecture for rank order based filtering using a bit-serial window partitioning technique","year":2002,"lang":"en","type":"article","venue":"","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Very-large-scale integration; Computer science; Window (computing); Algorithm; Window function; Binary number; Filter (signal processing); Boolean function; Rank (graph theory); Binary tree; Parallel computing; Stack (abstract data type); Computer hardware; Arithmetic; Mathematics; Embedded system; Computer vision","score_opus":0.034794536998911975,"score_gpt":0.2789180752288343,"score_spread":0.2441235382299223,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1900682062","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.033885892,0.000586839,0.9607777,0.00008144453,0.00007627692,0.000091460846,0.00009218029,0.0021468757,0.002261302],"genre_scores_gemma":[0.19796212,0.0005460839,0.79713905,0.00010562449,0.00007697738,0.00016073558,0.0003864947,0.00009486466,0.0035280786],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9998648,0.00001846194,0.000010388002,0.000023838315,0.000063104584,0.00001938326],"domain_scores_gemma":[0.99984264,0.0000483088,0.000019524516,0.000027810653,0.000052175517,0.000009436118],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024138627,0.0005470442,0.00038117068,0.00077329314,0.00027643106,0.0006097296,0.00089662056,0.00043019178,0.0029458501],"category_scores_gemma":[0.00039561215,0.00026767925,0.00027960146,0.00070509204,0.00021236572,0.00092155125,0.00023786945,0.0004681442,0.0010298231],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003851837,0.000089560664,0.00055910915,0.00020841378,0.000080363774,0.0001468633,0.00009676034,0.012585707,0.4547794,0.014407151,0.0036153425,0.5130462],"study_design_scores_gemma":[0.00024538112,0.0016597698,0.0029970543,0.00004653557,0.00027048204,0.0011660252,0.00006589289,0.5956062,0.36024237,0.008676536,0.028930135,0.000093668394],"about_ca_topic_score_codex":0.0014232275,"about_ca_topic_score_gemma":0.002897733,"teacher_disagreement_score":0.0029458501,"about_ca_system_score_codex":0.0003925388,"about_ca_system_score_gemma":0.0005014371,"threshold_uncertainty_score":0.009854794},"labels":[],"label_agreement":null},{"id":"W1904060471","doi":"10.1109/scft.1993.762361","title":"On the Use of Band-Passed Excitation Codebooks for CELP Coding of Speech","year":2005,"lang":"en","type":"article","venue":"","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Institut National de la Recherche Scientifique","funders":"","keywords":"Code-excited linear prediction; Codebook; Subframe; Vector sum excited linear prediction; Speech coding; Computer science; Linear predictive coding; Residual; Speech recognition; Linear prediction; Coding (social sciences); Harmonic Vector Excitation Coding; Algorithm; Telecommunications; Mathematics; Statistics","score_opus":0.10914796334011749,"score_gpt":0.312842464408936,"score_spread":0.20369450106881848,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1904060471","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04650907,0.00073940057,0.9475609,0.00009604938,0.000038355152,0.00007872196,0.000055346467,0.00048812153,0.004434096],"genre_scores_gemma":[0.38836896,0.0010109852,0.60521543,0.000092987,0.00004615956,0.000099518176,0.0003236847,0.00011166062,0.004730617],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995202,0.00017520922,0.000024588611,0.00003904386,0.00021402015,0.000027086502],"domain_scores_gemma":[0.99781334,0.001481316,0.0000664605,0.00024329657,0.00036068243,0.000034926466],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007823891,0.00028672995,0.00022919379,0.00036099282,0.00023057332,0.00047211425,0.0004703267,0.0002836423,0.0015003913],"category_scores_gemma":[0.004317442,0.00015359813,0.00015205608,0.00036314304,0.00039058173,0.0008724877,0.00053163,0.00038764812,0.0005564963],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005013856,0.00010596244,0.0011495968,0.00011417589,0.000024575604,0.00019791744,0.00025327527,0.115890495,0.07170341,0.038068127,0.0015851124,0.770406],"study_design_scores_gemma":[0.000042852975,0.00028337637,0.00094807026,0.000060469676,0.000019924228,0.0004061026,0.00006522214,0.9313677,0.05324265,0.005754215,0.0077696764,0.00003982674],"about_ca_topic_score_codex":0.004790877,"about_ca_topic_score_gemma":0.0068988674,"teacher_disagreement_score":0.004790877,"about_ca_system_score_codex":0.00032056007,"about_ca_system_score_gemma":0.0004032985,"threshold_uncertainty_score":0.009525955},"labels":[],"label_agreement":null},{"id":"W1905146943","doi":"10.1109/pacrim.1997.620362","title":"Optimum non-integer rate allocation using integer programming","year":2002,"lang":"en","type":"article","venue":"","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Convexity; Integer programming; Mathematical optimization; Integer (computer science); Rate distortion; Coding (social sciences); Rate–distortion theory; Mathematics; Discrete cosine transform; Distortion (music); Algorithm; Computer science; Statistics; Artificial intelligence; Image (mathematics)","score_opus":0.03843670613304793,"score_gpt":0.292787535486394,"score_spread":0.2543508293533461,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1905146943","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0029665343,0.00032112584,0.99351126,0.00010605989,0.000023222092,0.00004012984,0.000025327705,0.00007169749,0.0029345902],"genre_scores_gemma":[0.22493728,0.0015884512,0.76560295,0.00016962556,0.00013114887,0.00033883873,0.00014045216,0.00024840282,0.006842886],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99886715,0.00052060356,0.000047657933,0.00013556801,0.00030710397,0.000122018166],"domain_scores_gemma":[0.9983234,0.0013088477,0.00015682419,0.00005571724,0.00012615367,0.000028997305],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017120139,0.0015035457,0.0016341584,0.0006874822,0.0003948866,0.0018626403,0.0010486696,0.0010699093,0.0032614465],"category_scores_gemma":[0.004098323,0.00076657324,0.00070133444,0.0014195889,0.0010647888,0.0018833383,0.0008366263,0.0015588513,0.00056424324],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000069514026,0.000051806248,0.000106583546,0.00015835531,0.000023824614,0.000056416713,0.000049816736,0.9282051,0.0018391133,0.037326675,0.001198483,0.030914385],"study_design_scores_gemma":[0.000016817588,0.0000280339,0.000027261558,0.000012006135,0.000007754871,0.000021463038,0.000012035553,0.984884,0.00077944796,0.013106393,0.0010984036,0.0000063862813],"about_ca_topic_score_codex":0.0012108415,"about_ca_topic_score_gemma":0.0015441776,"teacher_disagreement_score":0.0032614465,"about_ca_system_score_codex":0.0010172398,"about_ca_system_score_gemma":0.0010766858,"threshold_uncertainty_score":0.01091063},"labels":[],"label_agreement":null},{"id":"W1912498562","doi":"10.1109/mmsp.2001.962792","title":"Novel multiresolution-multicast framework for Internet video","year":2002,"lang":"en","type":"article","venue":"","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Eyeball (Canada)","funders":"University of Missouri; National Aeronautics and Space Administration","keywords":"Computer science; Multicast; Retransmission; Computer network; Network packet; Reliable multicast; Source-specific multicast; Pragmatic General Multicast; Multiple description coding; Xcast; IP multicast; Real-time computing","score_opus":0.05792081989948266,"score_gpt":0.3123445324589626,"score_spread":0.25442371255947993,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1912498562","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0076000853,0.00083662313,0.98373586,0.00024035017,0.000084017476,0.00009604051,0.000056371122,0.0012517947,0.0060988697],"genre_scores_gemma":[0.14778274,0.00067805516,0.8460408,0.00012233421,0.00015093354,0.0002068314,0.00022930928,0.0001248732,0.004664031],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996762,0.00008428181,0.00001613726,0.00003808114,0.00014668901,0.000038688762],"domain_scores_gemma":[0.9998586,0.00003047788,0.000011150402,0.00003079356,0.000044337656,0.000024488521],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00053380243,0.00038398703,0.00046540133,0.0005039753,0.0007377639,0.00073207,0.001495911,0.0007464432,0.0028052083],"category_scores_gemma":[0.0005510156,0.00016697265,0.00041278967,0.00042261762,0.0002882058,0.0011261586,0.0008592817,0.0006637581,0.0007367932],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00029231262,0.00023706096,0.0005346754,0.00034083656,0.00008651637,0.0011403548,0.00057304476,0.04431041,0.08524058,0.41622046,0.020639455,0.43038434],"study_design_scores_gemma":[0.00010161672,0.00012973993,0.00028496585,0.00003497652,0.000050681112,0.0007884934,0.00007180995,0.8593478,0.015103728,0.054216173,0.069826886,0.00004305046],"about_ca_topic_score_codex":0.0013031109,"about_ca_topic_score_gemma":0.0024177225,"teacher_disagreement_score":0.0028052083,"about_ca_system_score_codex":0.0006555514,"about_ca_system_score_gemma":0.00054702285,"threshold_uncertainty_score":0.009384334},"labels":[],"label_agreement":null},{"id":"W1913660584","doi":"10.1109/icassp.2001.941016","title":"Approximating and exploiting the residual redundancies-applications to efficient reconstruction of speech over noisy channels","year":2002,"lang":"en","type":"article","venue":"","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Code-excited linear prediction; Residual; Decoding methods; Redundancy (engineering); Algorithm; A priori and a posteriori; Inter frame; Speech recognition; Speech coding; Frame (networking); Linear predictive coding; Reference frame; Telecommunications","score_opus":0.03250382997920014,"score_gpt":0.27269653053963744,"score_spread":0.2401927005604373,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1913660584","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.112898044,0.00038266345,0.88499177,0.000121842764,0.000016921831,0.000034049026,0.00003483966,0.0003321614,0.0011877355],"genre_scores_gemma":[0.6687562,0.00068525923,0.3278527,0.000028789073,0.000021978865,0.000040593568,0.00008778066,0.000044261848,0.0024824433],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99988186,0.000026210968,0.000007763886,0.000010597715,0.000061519546,0.000012102452],"domain_scores_gemma":[0.9996158,0.00020788248,0.000048416543,0.00005793845,0.000058899415,0.000011064952],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045797226,0.00038160992,0.0003635258,0.0004171565,0.00015272756,0.00033651234,0.00026383105,0.00034778766,0.0008361309],"category_scores_gemma":[0.0016558085,0.00014903219,0.0001799633,0.00033828052,0.00043955856,0.00039015117,0.00033527278,0.0002689927,0.00021038137],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00056977296,0.00008624036,0.0015413307,0.00026427794,0.000040013692,0.0005013548,0.00021545589,0.44423872,0.17866418,0.020222863,0.0005045281,0.3531513],"study_design_scores_gemma":[0.0000124533735,0.0000767401,0.0004195599,0.000010725,0.000009294186,0.00025609252,0.000016508366,0.9292828,0.06709648,0.0020109196,0.0008008568,0.000007594967],"about_ca_topic_score_codex":0.00079514703,"about_ca_topic_score_gemma":0.0011750371,"teacher_disagreement_score":0.0008361309,"about_ca_system_score_codex":0.00020584739,"about_ca_system_score_gemma":0.00032636608,"threshold_uncertainty_score":0.0027971268},"labels":[],"label_agreement":null},{"id":"W191394139","doi":"","title":"Comparative study of the spectral selection based on image compression methods","year":2005,"lang":"en","type":"article","venue":"","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Moncton","funders":"","keywords":"Pixel; Computer science; Pattern recognition (psychology); Artificial intelligence; Selection (genetic algorithm); Image compression; Data compression; Computer vision; Mathematics; Algorithm; Image (mathematics); Image processing","score_opus":0.039444485054244416,"score_gpt":0.40659060962753474,"score_spread":0.3671461245732903,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W191394139","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.76182556,0.019839073,0.20555136,0.00043963952,0.00022776768,0.00040052773,0.0003096769,0.00095286814,0.010453635],"genre_scores_gemma":[0.88580686,0.0047177197,0.10656543,0.000074412215,0.00016345858,0.00013163735,0.00037577876,0.0001488492,0.002015835],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9971059,0.00070512894,0.00013476695,0.00020722335,0.001735164,0.0001117467],"domain_scores_gemma":[0.9910589,0.005390763,0.00077097473,0.00063854636,0.0019794796,0.00016132621],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021037122,0.0006582067,0.00054488773,0.0031733555,0.00029972548,0.00084874366,0.00061048876,0.00063324976,0.001528502],"category_scores_gemma":[0.009732188,0.00016864343,0.0004209898,0.0018840419,0.000683805,0.0012816753,0.00056438445,0.00031356205,0.00031522856],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0034856587,0.0004959849,0.012316682,0.0017452394,0.00036554513,0.0004169331,0.0004586227,0.03224909,0.18891592,0.004522884,0.0014674289,0.75356],"study_design_scores_gemma":[0.00021789024,0.006358281,0.066600695,0.00043003345,0.0008334509,0.0038447173,0.0009205264,0.37530804,0.527706,0.003727503,0.013776558,0.00027623933],"about_ca_topic_score_codex":0.00044934367,"about_ca_topic_score_gemma":0.00038855415,"teacher_disagreement_score":0.0031733555,"about_ca_system_score_codex":0.00035941802,"about_ca_system_score_gemma":0.00030935684,"threshold_uncertainty_score":0.011125624},"labels":[],"label_agreement":null},{"id":"W1914246070","doi":"10.1109/iscas.2003.1206017","title":"A parallel/pipelined algorithm for the computation of MDCT and IMDCT","year":2003,"lang":"en","type":"article","venue":"","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"Natural Sciences and Engineering Research Council of Canada; Concordia University","keywords":"Computer science; Computation; Data compression; Parallel architecture; Parallel computing; Scalability; Coding (social sciences); Parallel algorithm; Transform coding; Algorithm; Computer hardware; Architecture; Discrete cosine transform; Artificial intelligence; Mathematics","score_opus":0.02108806019309503,"score_gpt":0.30137092394072335,"score_spread":0.28028286374762834,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1914246070","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.001083484,0.0001003148,0.9969709,0.000059565802,0.000049239996,0.00004936577,0.000032995333,0.00068147964,0.0009725362],"genre_scores_gemma":[0.023145935,0.00015421545,0.97366613,0.00005102917,0.00004170969,0.00012781471,0.00015618783,0.00009065123,0.0025663387],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999617,0.000027261207,0.000028584436,0.00007067271,0.00021941136,0.00003702256],"domain_scores_gemma":[0.99963665,0.00007851738,0.00002591904,0.000074989075,0.00015976826,0.000024031715],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043644814,0.0007613777,0.00047501453,0.0008901301,0.0005851276,0.0008591539,0.0012543722,0.00061317725,0.009262029],"category_scores_gemma":[0.0011974524,0.00045377036,0.00048810017,0.0009082668,0.0005029905,0.0009996736,0.00088835374,0.0010975772,0.0027868277],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003210543,0.000082156235,0.0004150605,0.0002373156,0.000046509515,0.00020329948,0.0001224748,0.069456935,0.08888416,0.049761303,0.012496386,0.77797335],"study_design_scores_gemma":[0.00014184143,0.00019894789,0.00035555023,0.000040186256,0.00004450543,0.0005193983,0.00003662977,0.86316615,0.062387608,0.02488471,0.048160054,0.00006447845],"about_ca_topic_score_codex":0.0033960524,"about_ca_topic_score_gemma":0.0060040196,"teacher_disagreement_score":0.009262029,"about_ca_system_score_codex":0.0007653448,"about_ca_system_score_gemma":0.0016405969,"threshold_uncertainty_score":0.03098458},"labels":[],"label_agreement":null},{"id":"W1914990675","doi":"10.1109/dcc.2006.4","title":"A Unified Framework for Lossless Image Set Compression","year":2006,"lang":"en","type":"article","venue":"","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta; University of Lethbridge","funders":"","keywords":"Lossless compression; Image compression; Computer science; Entropy encoding; Spanning tree; Redundancy (engineering); Centroid; Image (mathematics); Data compression; Lossy compression; Minimum spanning tree; Entropy (arrow of time); Algorithm; ENCODE; Scheme (mathematics); Graph; Artificial intelligence; Mathematics; Theoretical computer science; Image processing; Discrete mathematics","score_opus":0.022429625220751207,"score_gpt":0.3223165000410087,"score_spread":0.2998868748202575,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1914990675","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0013854965,0.00022525745,0.99690187,0.00007047188,0.000025407551,0.000031924148,0.000030770563,0.00039826886,0.0009306184],"genre_scores_gemma":[0.08479765,0.0010960392,0.90980226,0.000118424505,0.00015581609,0.00019803796,0.00025428287,0.00017854235,0.003398891],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993274,0.000103903476,0.00003742784,0.00006779232,0.0004237275,0.00003972218],"domain_scores_gemma":[0.99954706,0.00010999924,0.000035396093,0.00015630497,0.00012140952,0.000029801864],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008001847,0.000567677,0.0007465709,0.0014251175,0.0005052689,0.0012045072,0.001731242,0.00064010645,0.0031863872],"category_scores_gemma":[0.001527618,0.00029856985,0.00080164114,0.0012831605,0.00091868936,0.0020722304,0.0016797091,0.0013391682,0.001024914],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015385049,0.00010035024,0.00023630454,0.00033162528,0.000101789185,0.00033746177,0.00020703637,0.15706258,0.036794607,0.3904016,0.010455684,0.4038171],"study_design_scores_gemma":[0.00002517049,0.00012823998,0.0001681157,0.00006392195,0.00003842198,0.00047366085,0.000038150836,0.87491876,0.014350218,0.08321873,0.026534425,0.000042257492],"about_ca_topic_score_codex":0.00112767,"about_ca_topic_score_gemma":0.0013963904,"teacher_disagreement_score":0.0031863872,"about_ca_system_score_codex":0.0007265678,"about_ca_system_score_gemma":0.0006783766,"threshold_uncertainty_score":0.010659456},"labels":[],"label_agreement":null},{"id":"W1917584725","doi":"10.1109/nsip.2005.1502250","title":"Object-based fractal coding of video sequence","year":2005,"lang":"en","type":"article","venue":"","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Sherbrooke","funders":"","keywords":"Computer science; Motion compensation; Computer vision; Artificial intelligence; Multiview Video Coding; ENCODE; Video compression picture types; Data compression; Block-matching algorithm; Video tracking; Coding (social sciences); Inter frame; Video processing; Frame (networking); Reference frame; Mathematics; Computer network","score_opus":0.02782125381889087,"score_gpt":0.30679022111371274,"score_spread":0.27896896729482185,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1917584725","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12440982,0.0030787475,0.83991045,0.00032394723,0.00078182487,0.00010114676,0.00052128517,0.0009850418,0.029887779],"genre_scores_gemma":[0.6470614,0.001861547,0.31397712,0.00013877085,0.00030415365,0.00011231416,0.0012720868,0.00012391928,0.03514863],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99993885,0.000009459851,0.0000032338587,0.000006664989,0.000035512672,0.0000062797153],"domain_scores_gemma":[0.9998091,0.00007217228,0.000014241399,0.00003469644,0.000060138867,0.000009710235],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000108755994,0.00014768996,0.00015637328,0.00035855864,0.000091911905,0.00016535074,0.00015525275,0.00016215973,0.0029691516],"category_scores_gemma":[0.0005162494,0.000035547604,0.0001122295,0.00034970403,0.00017766905,0.00018736155,0.00014618602,0.00020546287,0.0004515236],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002851005,0.00002528445,0.00053926243,0.0003017986,0.000021890235,0.00038141824,0.00016086717,0.03836991,0.25332952,0.12638788,0.010289609,0.56990755],"study_design_scores_gemma":[0.00004926369,0.00043791326,0.0027685522,0.00012211103,0.000049766073,0.0016249494,0.00003803791,0.560798,0.23508906,0.025920417,0.17304906,0.000052895793],"about_ca_topic_score_codex":0.00039230645,"about_ca_topic_score_gemma":0.00054197875,"teacher_disagreement_score":0.0029691516,"about_ca_system_score_codex":0.00024620234,"about_ca_system_score_gemma":0.00011623591,"threshold_uncertainty_score":0.009932756},"labels":[],"label_agreement":null},{"id":"W1919844839","doi":"10.1109/igarss.1999.775025","title":"Study of real-time lossless data compression for hyperspectral imagery","year":2003,"lang":"en","type":"article","venue":"","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Canadian Space Agency","funders":"","keywords":"Hyperspectral imaging; Lossless compression; Data compression; Computer science; Remote sensing; Artificial intelligence; Entropy (arrow of time); Entropy encoding; Encoder; JPEG 2000; Imaging spectrometer; Computer vision; Image compression; Spectrometer; Image processing; Geography","score_opus":0.06235719579032278,"score_gpt":0.34889138952002563,"score_spread":0.28653419372970285,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1919844839","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.67363715,0.0017831299,0.32214502,0.0002532211,0.00005287866,0.000067721194,0.00005901039,0.00025309663,0.0017488811],"genre_scores_gemma":[0.9439211,0.0008614187,0.053768575,0.00003363103,0.000046481335,0.000028340619,0.00008776839,0.00003914845,0.0012135734],"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99963474,0.00010035421,0.000012744391,0.00003832647,0.000194745,0.000019084055],"domain_scores_gemma":[0.99747425,0.0019726327,0.00016778069,0.00012063499,0.00023763037,0.000027145552],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008019617,0.00032282344,0.00031837632,0.00026037305,0.00013867699,0.0002760955,0.00039965558,0.00028792734,0.0005313843],"category_scores_gemma":[0.0028467905,0.000115323535,0.00016457637,0.00035174028,0.00051073043,0.0010128693,0.0001652278,0.00040569832,0.00007375651],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010254084,0.00031665736,0.003026008,0.0004966071,0.000097488635,0.00048350554,0.00034057852,0.6308951,0.13428605,0.007894299,0.0007943538,0.22034399],"study_design_scores_gemma":[0.00001615759,0.00034879532,0.0010917919,0.0000093079825,0.000011020925,0.00017672993,0.00002734623,0.9442458,0.053037606,0.00047527425,0.00055136747,0.0000088311635],"about_ca_topic_score_codex":0.00065627525,"about_ca_topic_score_gemma":0.00037765465,"teacher_disagreement_score":0.0008019617,"about_ca_system_score_codex":0.00032260193,"about_ca_system_score_gemma":0.00018566992,"threshold_uncertainty_score":0.004241228},"labels":[],"label_agreement":null},{"id":"W1922381206","doi":"10.1109/ccece.1995.528199","title":"Mean-gain-shape vector quantization using counterpropagation networks","year":2002,"lang":"en","type":"article","venue":"","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Vector quantization; Learning vector quantization; Linde–Buzo–Gray algorithm; Quantization (signal processing); Artificial neural network; Self-organizing map; Computer science; Algorithm; Artificial intelligence; Pattern recognition (psychology)","score_opus":0.03597466220850824,"score_gpt":0.27606942364858295,"score_spread":0.2400947614400747,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1922381206","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0056590238,0.00026963174,0.9920145,0.000115611816,0.0000637574,0.00003462198,0.000021650842,0.000682179,0.0011389424],"genre_scores_gemma":[0.30119643,0.00035227693,0.6945086,0.00017308214,0.000056729445,0.00013020854,0.00010978376,0.000079356665,0.003393452],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99959797,0.00007022124,0.000027721268,0.00006576042,0.0002097335,0.000028544175],"domain_scores_gemma":[0.9994666,0.00018094995,0.00005050906,0.00006538721,0.00021584377,0.000020651096],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006772443,0.00053248525,0.00057065906,0.00047253002,0.00034636998,0.00088089413,0.001595837,0.0009368182,0.001600181],"category_scores_gemma":[0.0019383766,0.00025103812,0.00024766035,0.00071243546,0.0005403993,0.0013629489,0.0006164887,0.0010761587,0.0004995998],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019894625,0.00009224178,0.00050401443,0.000115114584,0.000049376627,0.000066388275,0.000062598054,0.31821787,0.022939602,0.03163306,0.0032533815,0.6228674],"study_design_scores_gemma":[0.000007836162,0.000021552149,0.000057483085,0.000005275525,0.0000048525435,0.000021130494,0.0000022503991,0.9900517,0.0053354395,0.0036202632,0.0008652987,0.0000068786926],"about_ca_topic_score_codex":0.0041999076,"about_ca_topic_score_gemma":0.0053435266,"teacher_disagreement_score":0.0041999076,"about_ca_system_score_codex":0.00080582016,"about_ca_system_score_gemma":0.00083248393,"threshold_uncertainty_score":0.008350968},"labels":[],"label_agreement":null},{"id":"W1923479864","doi":"10.1109/icc.1993.397320","title":"A software tool for progressive image transmission","year":2002,"lang":"en","type":"article","venue":"","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Zoom; Computer science; Software; Image (mathematics); Transmission (telecommunications); Simple (philosophy); Software tool; Artificial intelligence; Computer graphics (images); Computer vision; Programming language; Engineering","score_opus":0.018894237851428932,"score_gpt":0.27951051457908777,"score_spread":0.26061627672765886,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1923479864","genre_codex":"methods","genre_gemma":"software","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"software","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000834355,0.00013893138,0.89361805,0.000056184985,0.00010571137,0.00021642935,0.0011329268,0.100158945,0.003738546],"genre_scores_gemma":[0.021903956,0.000540098,0.91448385,0.000267622,0.0001287612,0.0018864978,0.0074791578,0.034405306,0.018904645],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9978054,0.00023813016,0.00024127816,0.00023112327,0.0013887128,0.000095333715],"domain_scores_gemma":[0.99599934,0.0018228597,0.00017830096,0.0006216393,0.0012076746,0.00017027589],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023117694,0.0018296517,0.0013957934,0.003967686,0.0007054748,0.0020230687,0.0031821236,0.0014097174,0.079318725],"category_scores_gemma":[0.008250764,0.001166379,0.0011256187,0.0020006332,0.0006193896,0.0021328563,0.0026950072,0.0021183346,0.0269104],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004168159,0.0001953249,0.0008157832,0.0011929243,0.0001379786,0.0009111279,0.00038092825,0.012125847,0.05641973,0.015741607,0.1949243,0.7167377],"study_design_scores_gemma":[0.00054078916,0.00038470363,0.0029516781,0.0005286952,0.00016155864,0.0049893702,0.00015802124,0.21500018,0.10795418,0.032612897,0.63416004,0.0005578548],"about_ca_topic_score_codex":0.0008128575,"about_ca_topic_score_gemma":0.00084246974,"teacher_disagreement_score":0.079318725,"about_ca_system_score_codex":0.00047230034,"about_ca_system_score_gemma":0.0008315912,"threshold_uncertainty_score":0.2653476},"labels":[],"label_agreement":null},{"id":"W1929033233","doi":"10.1109/icassp.1977.1170247","title":"On line speech/Data-modem identifier for telephone network","year":2005,"lang":"en","type":"article","venue":"","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Sherbrooke","funders":"","keywords":"Computer science; Telephony; Speech recognition; Piecewise linear function; Identifier; Zero crossing; Speech coding; Voice activity detection; Speech processing; Telecommunications; Computer network; Mathematics; Engineering","score_opus":0.05670980792137648,"score_gpt":0.34786097138850364,"score_spread":0.29115116346712716,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1929033233","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.054332577,0.00095213414,0.9157709,0.00045429304,0.00040693505,0.00015979553,0.00069319067,0.0059371945,0.02129287],"genre_scores_gemma":[0.45658338,0.00070250814,0.49292132,0.0003104281,0.00031838697,0.00018559203,0.0018622151,0.00041138573,0.046704814],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.999652,0.000093429786,0.000020333384,0.000049299913,0.00015334463,0.00003154418],"domain_scores_gemma":[0.9995061,0.000096062344,0.00006746717,0.00016634088,0.00014167825,0.00002237882],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023795225,0.00031967228,0.00022261366,0.0007171989,0.0003002563,0.00058171677,0.00036031276,0.0004972104,0.011543178],"category_scores_gemma":[0.001204314,0.000109726425,0.00011356613,0.00045436682,0.00018122204,0.0005003285,0.00037969608,0.00038261458,0.004892247],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004727488,0.00006875191,0.0013936902,0.00013451526,0.000014028272,0.00019175555,0.00006848453,0.0032860397,0.13060926,0.016977124,0.016541658,0.8302419],"study_design_scores_gemma":[0.000096213844,0.0007107166,0.010878294,0.0001248379,0.00006481583,0.0021376857,0.00011524507,0.4471549,0.27271402,0.016682984,0.24925809,0.00006227591],"about_ca_topic_score_codex":0.0005439244,"about_ca_topic_score_gemma":0.0010881433,"teacher_disagreement_score":0.011543178,"about_ca_system_score_codex":0.00034453018,"about_ca_system_score_gemma":0.00033162115,"threshold_uncertainty_score":0.038615823},"labels":[],"label_agreement":null},{"id":"W1932653299","doi":"10.1109/scft.2000.878425","title":"Bandwidth extension of narrowband speech for low bit-rate wideband coding","year":2002,"lang":"en","type":"preprint","venue":"","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":34,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Sherbrooke","funders":"","keywords":"Narrowband; Bandwidth extension; Wideband; Wideband audio; Bandwidth (computing); Computer science; Harmonic Vector Excitation Coding; Bit rate; Extension (predicate logic); Speech coding; Electronic engineering; Speech recognition; Telecommunications; Engineering; Computer network; Digital audio","score_opus":0.03865130738622296,"score_gpt":0.29601613952823674,"score_spread":0.2573648321420138,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1932653299","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04398252,0.00070070435,0.9511154,0.0000946533,0.00005028715,0.000035849673,0.000042812106,0.0007626811,0.003214916],"genre_scores_gemma":[0.4162989,0.0012163654,0.5738925,0.00010443032,0.000070559814,0.00012093271,0.00040206473,0.0001764336,0.0077178245],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998809,0.000026503552,0.0000066632238,0.000017517143,0.000055625373,0.000012682462],"domain_scores_gemma":[0.9997756,0.000097985096,0.000018994535,0.000045678033,0.000052907664,0.000008840948],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001810514,0.00034853362,0.00021488364,0.00029140004,0.00020335737,0.0002275785,0.00023066788,0.00031162225,0.002010854],"category_scores_gemma":[0.0008407075,0.00010563869,0.00017715311,0.00020488769,0.0002337076,0.00035685938,0.0003181906,0.0003716617,0.0010768976],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00030814958,0.000064948035,0.0006095136,0.00016744481,0.000015079737,0.00025197046,0.00023747333,0.06466103,0.32362708,0.032154948,0.0017191876,0.5761832],"study_design_scores_gemma":[0.00002741476,0.00021322873,0.0012011132,0.00007612024,0.000034193432,0.00078927976,0.000065160406,0.7033718,0.24416861,0.021490203,0.028528966,0.00003385878],"about_ca_topic_score_codex":0.0005101721,"about_ca_topic_score_gemma":0.0008249588,"teacher_disagreement_score":0.002010854,"about_ca_system_score_codex":0.00013481795,"about_ca_system_score_gemma":0.00017253027,"threshold_uncertainty_score":0.00672698},"labels":[],"label_agreement":null},{"id":"W1933924263","doi":"10.1109/pacrim.1997.619959","title":"A comparison of new reversible wavelet transforms for image compression","year":2002,"lang":"en","type":"article","venue":"","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Image compression; Wavelet transform; Data compression; Computer science; Wavelet; Texture compression; Compression (physics); Artificial intelligence; Transform coding; Computer vision; Algorithm; Image (mathematics); Image processing; Discrete cosine transform; Materials science","score_opus":0.07174400082135461,"score_gpt":0.35533802837886,"score_spread":0.2835940275575054,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1933924263","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.27120253,0.010805022,0.69544065,0.000500615,0.0004839824,0.00035924735,0.00021337156,0.0016589912,0.019335695],"genre_scores_gemma":[0.6359266,0.008674988,0.34622836,0.0001628245,0.00028112816,0.00024206398,0.00046039178,0.00020384182,0.00781977],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99950254,0.000055357916,0.000021500457,0.000029946405,0.00035249215,0.00003821979],"domain_scores_gemma":[0.99934226,0.00035457552,0.0000559259,0.000075696036,0.00014014269,0.000031496835],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00073211605,0.00053298724,0.00038781296,0.0010541129,0.00018283985,0.00053479534,0.0005202626,0.0005277902,0.0019838202],"category_scores_gemma":[0.002724616,0.00021253526,0.00041256682,0.0006657512,0.00046745478,0.001167877,0.00035488314,0.00060789747,0.00045400532],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012701576,0.00030907057,0.0011461844,0.00065385574,0.00016010106,0.0006236464,0.00013941375,0.036449783,0.32069424,0.035837166,0.0023928843,0.60032356],"study_design_scores_gemma":[0.00033491896,0.0024245363,0.0052635255,0.0001412891,0.0002569956,0.0038612387,0.00012689615,0.47702116,0.47259912,0.011849356,0.025939157,0.00018190067],"about_ca_topic_score_codex":0.00023639623,"about_ca_topic_score_gemma":0.00047769287,"teacher_disagreement_score":0.0019838202,"about_ca_system_score_codex":0.00023703833,"about_ca_system_score_gemma":0.00023364766,"threshold_uncertainty_score":0.00663656},"labels":[],"label_agreement":null},{"id":"W1935790646","doi":"10.1109/pacrim.1997.619964","title":"Image compression for facial photographs based on wavelet transform","year":2002,"lang":"en","type":"article","venue":"","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Artificial intelligence; Computer vision; Computer science; Wavelet transform; Wavelet; Quantization (signal processing); Pattern recognition (psychology); Image compression; Discrete wavelet transform; Data compression; Stationary wavelet transform; Second-generation wavelet transform; Image processing; Image (mathematics)","score_opus":0.023764528313314097,"score_gpt":0.2730208203366701,"score_spread":0.24925629202335597,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1935790646","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.053387478,0.0017200224,0.93763155,0.0003033346,0.0002544091,0.00009704304,0.000087929555,0.00066410546,0.005854055],"genre_scores_gemma":[0.2671966,0.0035551821,0.72263885,0.00012564592,0.0002355057,0.00008533185,0.00025609627,0.00012664984,0.0057801446],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99985623,0.000014756177,0.000006890458,0.0000131087545,0.00009974664,0.000009252356],"domain_scores_gemma":[0.9998671,0.00005855713,0.000011521328,0.000020707224,0.000036731726,0.00000540038],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018865798,0.000255508,0.00026488685,0.0005722536,0.00015644338,0.00026647584,0.0002656466,0.00022689946,0.0018106108],"category_scores_gemma":[0.00089444127,0.00009871009,0.00022144825,0.00044558203,0.00022265974,0.00044624365,0.00026555976,0.00031816147,0.000606301],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020394038,0.00003717251,0.00050580007,0.00022233893,0.000022702547,0.0005395581,0.00012329142,0.016025843,0.2302473,0.01606948,0.0036358438,0.7323666],"study_design_scores_gemma":[0.00007981767,0.00039728952,0.005231871,0.00012394086,0.00008577277,0.004674881,0.000134366,0.5702246,0.36020908,0.010245631,0.048540782,0.000051984633],"about_ca_topic_score_codex":0.0004167314,"about_ca_topic_score_gemma":0.0004886688,"teacher_disagreement_score":0.0018106108,"about_ca_system_score_codex":0.00014233708,"about_ca_system_score_gemma":0.0001344163,"threshold_uncertainty_score":0.0060570836},"labels":[],"label_agreement":null},{"id":"W1939047588","doi":"10.1109/vtsa.1989.68628","title":"A systolic array architecture for image coding using vector quantization","year":2003,"lang":"en","type":"article","venue":"International Symposium on VLSI Technology, Systems, and Applications","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Codebook; Computer science; Encoder; Vector quantization; Computation; Encoding (memory); Code word; Pipeline (software); Coding (social sciences); Quantization (signal processing); Architecture; Dimension (graph theory); Algorithm; Parallel computing; Very-large-scale integration; Computer hardware; Theoretical computer science; Mathematics; Decoding methods; Artificial intelligence; Embedded system","score_opus":0.019369970840027825,"score_gpt":0.30827998637023896,"score_spread":0.2889100155302111,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1939047588","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.020139666,0.0008883453,0.964903,0.00027989515,0.00023380855,0.00007442763,0.00016856313,0.0030923923,0.010219961],"genre_scores_gemma":[0.28865406,0.00093196507,0.6944902,0.00024216596,0.00018335211,0.00016195478,0.00059799996,0.00007652764,0.014661767],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9999002,0.000017246457,0.000007783617,0.000013957073,0.000050367824,0.000010435277],"domain_scores_gemma":[0.9999002,0.000018119383,0.000007985407,0.000013137666,0.000053354503,0.000007128501],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016292676,0.00019463025,0.00016213096,0.00038028782,0.00024255917,0.00046472618,0.0005138806,0.00028388662,0.0032439767],"category_scores_gemma":[0.00032651858,0.00011405276,0.00017202711,0.0006069891,0.00018540527,0.00049815775,0.00024035762,0.0003163404,0.0011361782],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00024382489,0.000077953635,0.00064558355,0.00018035517,0.00004054647,0.00022650078,0.00011223911,0.05900096,0.1506961,0.07445332,0.01675762,0.6975649],"study_design_scores_gemma":[0.00018561134,0.00092134223,0.0011720374,0.00007748043,0.000059991,0.0007434954,0.00006432965,0.76134014,0.08924809,0.04397606,0.10214188,0.00006953221],"about_ca_topic_score_codex":0.0012763524,"about_ca_topic_score_gemma":0.002035213,"teacher_disagreement_score":0.0032439767,"about_ca_system_score_codex":0.0003311861,"about_ca_system_score_gemma":0.0006967202,"threshold_uncertainty_score":0.010852218},"labels":[],"label_agreement":null},{"id":"W1940282903","doi":"10.1109/icassp.1988.196709","title":"Pyramid transform coding using vector quantization","year":2003,"lang":"en","type":"article","venue":"","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Vector quantization; Lossless compression; Quadtree; Linde–Buzo–Gray algorithm; Computer science; Data compression; Entropy encoding; Quantization (signal processing); Algorithm; Artificial intelligence; Residual; Transform coding; Image compression; Computer vision; Mathematics; Discrete cosine transform; Image processing; Image (mathematics)","score_opus":0.03824623763270309,"score_gpt":0.30538405711518185,"score_spread":0.2671378194824788,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1940282903","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011137721,0.00028997124,0.9804136,0.00013904099,0.00008008268,0.00014296472,0.0001772126,0.0013841105,0.006235243],"genre_scores_gemma":[0.22701657,0.0008124092,0.7563953,0.00015918969,0.00007679901,0.0001638918,0.0009829472,0.00019170946,0.014201229],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996685,0.000026497995,0.000016140983,0.00002876163,0.00023185887,0.000028264245],"domain_scores_gemma":[0.9997701,0.000042568416,0.000019464815,0.000056582052,0.00009928461,0.0000120108325],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029700153,0.0003884127,0.00036439774,0.0006954084,0.00025604427,0.00074151857,0.0005650705,0.0005116116,0.003911404],"category_scores_gemma":[0.00084704265,0.00017739415,0.00033201312,0.0012694631,0.00034409526,0.001095439,0.00069025165,0.00060800463,0.0011687118],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001646371,0.0000960207,0.00029293908,0.00017720566,0.000039401893,0.00020415358,0.00009671808,0.050824415,0.1869834,0.077280246,0.010861408,0.6729794],"study_design_scores_gemma":[0.0001073711,0.0003629419,0.0008494648,0.000053449556,0.000056555997,0.0008852931,0.000044842378,0.7849463,0.14228648,0.029362204,0.040980168,0.000065019856],"about_ca_topic_score_codex":0.0042212885,"about_ca_topic_score_gemma":0.004076887,"teacher_disagreement_score":0.0042212885,"about_ca_system_score_codex":0.00040295091,"about_ca_system_score_gemma":0.0007503844,"threshold_uncertainty_score":0.013084948},"labels":[],"label_agreement":null},{"id":"W1941936296","doi":"10.1007/978-3-319-05290-8_9","title":"Image Compression Standards","year":2014,"lang":"en","type":"book-chapter","venue":"Texts in computer science","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Computer science; Compression (physics); Materials science; Composite material","score_opus":0.015262547516690289,"score_gpt":0.29901577214061664,"score_spread":0.2837532246239264,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1941936296","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0040345374,0.023108402,0.25351152,0.0029326675,0.004421831,0.0003172226,0.0015497654,0.0041645407,0.7059595],"genre_scores_gemma":[0.02324921,0.022293532,0.07949142,0.0012282254,0.0015481696,0.00029518493,0.0047058137,0.0018233219,0.865365],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99922514,0.00004213308,0.000037233833,0.00007922496,0.00057173445,0.000044461656],"domain_scores_gemma":[0.99906427,0.00018821773,0.000033055916,0.00019489705,0.0004834313,0.0000361489],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006066019,0.00095557445,0.0005663918,0.0030877832,0.0007040704,0.0024628723,0.0009980615,0.0012838335,0.06579965],"category_scores_gemma":[0.0018309392,0.00045767226,0.00031275503,0.0031674313,0.00088738085,0.002937934,0.0012073881,0.0023443052,0.039736614],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000558204,0.00006411301,0.000076339005,0.00040353267,0.000010938984,0.0000975567,0.00013689722,0.0011002435,0.01651515,0.12580855,0.20310162,0.6526292],"study_design_scores_gemma":[0.000011209605,0.000039339076,0.000248022,0.00025765476,0.00000887367,0.0004671651,0.000050258186,0.0021894118,0.019054264,0.031814184,0.9458364,0.00002316488],"about_ca_topic_score_codex":0.00067256397,"about_ca_topic_score_gemma":0.00078484055,"teacher_disagreement_score":0.06579965,"about_ca_system_score_codex":0.0007806382,"about_ca_system_score_gemma":0.00087460474,"threshold_uncertainty_score":0.22012174},"labels":[],"label_agreement":null},{"id":"W194203561","doi":"10.1007/978-3-319-05290-8_8","title":"Lossy Compression Algorithms","year":2014,"lang":"en","type":"book-chapter","venue":"Texts in computer science","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Lossy compression; Computer science; Compression (physics); Algorithm; Data compression; Materials science; Artificial intelligence; Composite material","score_opus":0.021766558359714742,"score_gpt":0.28674061594981365,"score_spread":0.2649740575900989,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W194203561","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0042056427,0.022623114,0.8404712,0.0012547076,0.0017198053,0.0001924397,0.00081457244,0.0036197884,0.12509868],"genre_scores_gemma":[0.085550115,0.036590643,0.5529168,0.0015643057,0.003147399,0.0004666205,0.0042047002,0.0020871726,0.31347227],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99928916,0.00005341412,0.000034077162,0.000096053765,0.0004864717,0.00004076228],"domain_scores_gemma":[0.999355,0.0002089266,0.000028025714,0.00023630814,0.00015275051,0.000019027892],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00053992664,0.0013489575,0.0008140152,0.002119467,0.00060049456,0.001924994,0.0012652423,0.0009911087,0.029620815],"category_scores_gemma":[0.0019471433,0.00046589115,0.00043633563,0.0028117476,0.0011175137,0.0030471482,0.001365643,0.0024764743,0.018575313],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000643216,0.000048197584,0.00008079493,0.00028771476,0.00002472642,0.00006296361,0.000064119304,0.006445304,0.008184565,0.10254019,0.05773531,0.8244618],"study_design_scores_gemma":[0.0000612641,0.00015671753,0.0006967127,0.00041690827,0.000060328217,0.0017725523,0.00008089223,0.09746866,0.061479114,0.261402,0.57632667,0.000078170495],"about_ca_topic_score_codex":0.0003482362,"about_ca_topic_score_gemma":0.00041537438,"teacher_disagreement_score":0.029620815,"about_ca_system_score_codex":0.0006075722,"about_ca_system_score_gemma":0.0005644277,"threshold_uncertainty_score":0.09909153},"labels":[],"label_agreement":null},{"id":"W1943963003","doi":"10.1109/icassp.1984.1172363","title":"A new concept for encoding speech amplitude time quantization","year":2005,"lang":"en","type":"article","venue":"","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Sherbrooke","funders":"","keywords":"Computer science; Speech coding; Quantization (signal processing); Analog signal; Analog transmission; Codec2; Linear predictive coding; Sub-band coding; Amplitude; Speech recognition; Sampling (signal processing); Algorithm; Transmission (telecommunications); Telecommunications; Physics; Optics","score_opus":0.022420397202242183,"score_gpt":0.30919457158576774,"score_spread":0.28677417438352554,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1943963003","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003209262,0.0027231444,0.9809419,0.0006326339,0.001193778,0.00009475523,0.0001282487,0.00043232538,0.010643859],"genre_scores_gemma":[0.0884875,0.003645901,0.88522565,0.0011918527,0.0011703797,0.0003157752,0.00024955824,0.00016371567,0.019549722],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99928695,0.00011294929,0.00005866425,0.00017716049,0.00031782629,0.000046549572],"domain_scores_gemma":[0.99943024,0.00017916597,0.000050154336,0.00012070785,0.00018196346,0.000037743837],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006582845,0.00045515993,0.00041225506,0.0009438544,0.0005174695,0.0016809938,0.0009530808,0.00083348877,0.004415575],"category_scores_gemma":[0.0017349552,0.00026528165,0.00040397496,0.0011057972,0.0016063842,0.0021207046,0.0012105497,0.0017311967,0.0016817413],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016872477,0.000041436528,0.00016802855,0.00022169923,0.000025232333,0.00019293449,0.00035388974,0.003724099,0.059544258,0.58817756,0.0071930946,0.34018913],"study_design_scores_gemma":[0.00011298474,0.0005928582,0.0005972311,0.00024559803,0.000095249714,0.0028557891,0.0001832446,0.09955363,0.08295522,0.26863486,0.5439914,0.00018195354],"about_ca_topic_score_codex":0.00048849673,"about_ca_topic_score_gemma":0.00055397756,"teacher_disagreement_score":0.004415575,"about_ca_system_score_codex":0.0004749059,"about_ca_system_score_gemma":0.000583097,"threshold_uncertainty_score":0.014771581},"labels":[],"label_agreement":null},{"id":"W1949718559","doi":"10.1109/ccece.2000.849750","title":"Encoding identification of Internet packets","year":2002,"lang":"en","type":"article","venue":"","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick","funders":"","keywords":"Computer science; The Internet; Encoding (memory); ASCII; Artificial intelligence; Network packet; Identification (biology); World Wide Web; Natural language processing; Computer network; Programming language","score_opus":0.034918416011488485,"score_gpt":0.2809151393518011,"score_spread":0.24599672334031264,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1949718559","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.31667182,0.00025386998,0.6779536,0.00024220263,0.00012878419,0.00016576794,0.00045030678,0.0013800224,0.0027535718],"genre_scores_gemma":[0.86935437,0.000339637,0.12642373,0.00006728736,0.00003343024,0.000094774616,0.0011556841,0.000103949686,0.00242712],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99902713,0.00021893189,0.000062886815,0.00011534909,0.00048138405,0.00009436127],"domain_scores_gemma":[0.99639505,0.0015460041,0.0004296045,0.00051813305,0.0010652341,0.00004595301],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011503586,0.00046349518,0.00045660938,0.0014685162,0.00028487243,0.0010227442,0.00044660454,0.00058334495,0.00069594075],"category_scores_gemma":[0.009256588,0.00016337808,0.00042970874,0.0011388926,0.000342496,0.0011805693,0.00041154906,0.000572647,0.0005781656],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0015440474,0.00039167894,0.044950094,0.00022906427,0.0001223324,0.00057011674,0.000424396,0.25991106,0.0624516,0.028964635,0.003386857,0.5970541],"study_design_scores_gemma":[0.000009812447,0.00009372649,0.0040262216,0.000014518961,0.000022556245,0.00024587754,0.000060281374,0.9627805,0.027950605,0.003801895,0.00097240513,0.000021656619],"about_ca_topic_score_codex":0.0023986606,"about_ca_topic_score_gemma":0.00097421644,"teacher_disagreement_score":0.0023986606,"about_ca_system_score_codex":0.000720483,"about_ca_system_score_gemma":0.00082750217,"threshold_uncertainty_score":0.006083727},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.08676036190007076,"score_gpt":0.3357824590285874,"score_spread":0.24902209712851664,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1950765696","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.022962816,0.00031825862,0.97106016,0.00009366009,0.000057158995,0.000048028243,0.00004406042,0.00055900414,0.0048568444],"genre_scores_gemma":[0.30415648,0.0009827911,0.6839935,0.00015158481,0.00008565284,0.00012312386,0.00032473297,0.0001353505,0.01004672],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998196,0.00002799818,0.000008766504,0.000016695325,0.0001122533,0.000014615166],"domain_scores_gemma":[0.9997019,0.00012792258,0.000034005356,0.000040272516,0.00008749315,0.000008438857],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023939933,0.00030609188,0.00016062359,0.000278388,0.00013853003,0.00042835358,0.00023184683,0.0003593942,0.00175358],"category_scores_gemma":[0.0009055608,0.00008509807,0.00016194093,0.0003688213,0.0003318517,0.00047280526,0.00041815542,0.00035131347,0.0006761795],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00027134726,0.000037524947,0.0005373727,0.00018603241,0.0000203039,0.00040623333,0.00022901797,0.04092249,0.4027589,0.046746682,0.0028227954,0.5050613],"study_design_scores_gemma":[0.000059111753,0.00036091774,0.00118101,0.000080861246,0.00003690525,0.0016686049,0.000100331104,0.4573408,0.49233925,0.009311269,0.037479807,0.00004119057],"about_ca_topic_score_codex":0.0006824648,"about_ca_topic_score_gemma":0.0010197884,"teacher_disagreement_score":0.00175358,"about_ca_system_score_codex":0.00016273004,"about_ca_system_score_gemma":0.00023145041,"threshold_uncertainty_score":0.005866289},"labels":[],"label_agreement":null},{"id":"W1951444337","doi":"10.1109/icecs.1998.814063","title":"Image compression using a mixed-transform technique and vector quantization","year":2002,"lang":"en","type":"article","venue":"","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Lossy compression; Discrete cosine transform; Vector quantization; Image compression; Wavelet transform; Transform coding; Artificial intelligence; Quantization (signal processing); Mathematics; Data compression; JPEG; Compression ratio; Wavelet; Fractal transform; Computer science; Computer vision; Pattern recognition (psychology); Algorithm; Image processing; Image (mathematics); Physics","score_opus":0.028372954555468996,"score_gpt":0.28274022677266814,"score_spread":0.2543672722171991,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1951444337","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04673487,0.0028356717,0.9453624,0.00025079926,0.000250816,0.000110914094,0.00009128679,0.000866504,0.0034967067],"genre_scores_gemma":[0.33049077,0.0020445501,0.65767807,0.00022730042,0.00023995532,0.00014015069,0.00030895925,0.0001256027,0.008744592],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9995345,0.000041973566,0.000025889514,0.00004356808,0.0003306553,0.00002347282],"domain_scores_gemma":[0.99973696,0.000070080205,0.00004057099,0.00003907923,0.000100644844,0.000012752492],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003115688,0.00043474176,0.00042016586,0.00096743286,0.00025396503,0.0006860338,0.000749239,0.00052370084,0.0016904556],"category_scores_gemma":[0.00075307075,0.0002146586,0.0004105481,0.00089154206,0.00036721057,0.0013025829,0.00066926784,0.00065396447,0.00080200145],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00035572055,0.00011452095,0.0006814395,0.00030155535,0.00007803188,0.0003502921,0.00008470749,0.0063931583,0.41261917,0.01549196,0.0019754234,0.5615541],"study_design_scores_gemma":[0.00011882793,0.0014058384,0.0028106326,0.00008199201,0.00011424367,0.0057983394,0.00006957364,0.37739554,0.57364476,0.006611671,0.031848345,0.000100216144],"about_ca_topic_score_codex":0.000305108,"about_ca_topic_score_gemma":0.00057940127,"teacher_disagreement_score":0.0016904556,"about_ca_system_score_codex":0.00021412302,"about_ca_system_score_gemma":0.00022464478,"threshold_uncertainty_score":0.00565511},"labels":[],"label_agreement":null},{"id":"W1953727112","doi":"10.1109/icassp.1995.479794","title":"Fast and low-complexity LSF quantization using algebraic vector quantizer","year":2002,"lang":"en","type":"article","venue":"","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Sherbrooke","funders":"","keywords":"Codebook; Vector quantization; Rounding; Algorithm; Linde–Buzo–Gray algorithm; Computer science; Quantization (signal processing); Computational complexity theory; Encoding (memory); Algebraic number; Mathematics; Theoretical computer science; Artificial intelligence","score_opus":0.07185963094802084,"score_gpt":0.29265005246869874,"score_spread":0.2207904215206779,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1953727112","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0044311425,0.00032092645,0.99322116,0.00007192704,0.000045251818,0.000033440698,0.000050199185,0.00055935694,0.0012665162],"genre_scores_gemma":[0.16138208,0.00049172924,0.8354628,0.00005899746,0.00010554571,0.000089690206,0.00022538977,0.000057154062,0.002126594],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99931264,0.00015936591,0.000059531332,0.000056503923,0.00038037443,0.000031585718],"domain_scores_gemma":[0.999382,0.0002582125,0.000048018224,0.000098386525,0.00019502692,0.000018288918],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00076134905,0.0004482246,0.00059740257,0.00062511547,0.00038477982,0.0007518038,0.00081552024,0.00039641646,0.0028138703],"category_scores_gemma":[0.0022710466,0.00017121807,0.00023580753,0.00076667586,0.0005429674,0.0014845867,0.00067666295,0.00070822524,0.0011275773],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023670266,0.000048570335,0.00035516912,0.0002099935,0.000025125177,0.000081015394,0.00015823336,0.084137954,0.043689463,0.082371764,0.0043558497,0.7843302],"study_design_scores_gemma":[0.00007659937,0.00018957822,0.00023369878,0.000039006263,0.00002134798,0.00031902682,0.000056107932,0.91859937,0.034369875,0.024743536,0.02130047,0.00005141275],"about_ca_topic_score_codex":0.0014809974,"about_ca_topic_score_gemma":0.0020238524,"teacher_disagreement_score":0.0028138703,"about_ca_system_score_codex":0.00040056984,"about_ca_system_score_gemma":0.0005833566,"threshold_uncertainty_score":0.009413362},"labels":[],"label_agreement":null},{"id":"W1957947421","doi":"10.1109/ccece.1996.548129","title":"Lossy compression of head and shoulder images using zerotrees of wavelet coefficients","year":2002,"lang":"en","type":"article","venue":"","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Artificial intelligence; Wavelet transform; Computer vision; Wavelet; Discrete wavelet transform; Computer science; JPEG; Second-generation wavelet transform; Lossy compression; Stationary wavelet transform; Data compression; Lossless compression; Mathematics; Image compression; Pattern recognition (psychology); Image processing; Image (mathematics)","score_opus":0.05152443775793727,"score_gpt":0.31739827948329047,"score_spread":0.2658738417253532,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1957947421","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3992751,0.0042844447,0.5800195,0.00055489293,0.00066529773,0.0002090609,0.00085086306,0.0028188808,0.011321862],"genre_scores_gemma":[0.6389281,0.004302051,0.3342578,0.00027682233,0.00032947602,0.00010013028,0.0019700432,0.000381376,0.019454064],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9998803,0.000013247755,0.0000082760225,0.000010286523,0.00007477916,0.0000132343575],"domain_scores_gemma":[0.99976605,0.00008716787,0.000017348788,0.000049916478,0.00006837794,0.000011084678],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022912562,0.00031389884,0.00032173516,0.0009811411,0.00018208132,0.00038219843,0.00027417354,0.00023489719,0.00294941],"category_scores_gemma":[0.00092678866,0.00013967416,0.00021460683,0.0007881044,0.00020986209,0.0005157251,0.00029127812,0.00028493628,0.0008581337],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00079964736,0.00011079945,0.00093602523,0.00029979486,0.000052929146,0.000935047,0.00019167062,0.009745565,0.37940523,0.00417836,0.008837609,0.59450746],"study_design_scores_gemma":[0.00017671942,0.001536073,0.024502032,0.00017722844,0.00018874383,0.0070222504,0.00029208412,0.2337547,0.66826576,0.008524089,0.055433936,0.00012636255],"about_ca_topic_score_codex":0.0007272599,"about_ca_topic_score_gemma":0.0012072392,"teacher_disagreement_score":0.00294941,"about_ca_system_score_codex":0.0001773955,"about_ca_system_score_gemma":0.0001556258,"threshold_uncertainty_score":0.009866774},"labels":[],"label_agreement":null},{"id":"W1962592885","doi":"10.1109/icassp.2000.859195","title":"Fuzzy trellis vector quantization of images","year":2002,"lang":"en","type":"article","venue":"","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Codebook; Linde–Buzo–Gray algorithm; Vector quantization; Algorithm; Decoding methods; Trellis (graph); Distortion (music); Image compression; Mathematics; Viterbi algorithm; Fuzzy logic; Computer science; Artificial intelligence; Image (mathematics); Image processing; Bandwidth (computing)","score_opus":0.02422231274296993,"score_gpt":0.26036661878059714,"score_spread":0.2361443060376272,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1962592885","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004240777,0.00046133995,0.99284667,0.000092651644,0.00008111928,0.000030614516,0.00006997242,0.00022272718,0.0019542424],"genre_scores_gemma":[0.20734054,0.0008840487,0.785287,0.00014529692,0.0001296857,0.00010781942,0.0002956652,0.00009502642,0.0057148905],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99946684,0.000079386184,0.000043724136,0.0000900279,0.00028338793,0.000036735408],"domain_scores_gemma":[0.9994042,0.00018271952,0.000053889384,0.000098817036,0.00023997169,0.000020468095],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00055549,0.0002767288,0.00050933147,0.00047555458,0.00029516726,0.0008223539,0.0008352367,0.0004965717,0.0022035942],"category_scores_gemma":[0.0029168343,0.00015550683,0.00029261108,0.0007416038,0.0005529109,0.0011973885,0.0003839272,0.000767314,0.00067497004],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001652111,0.00003267543,0.00040539503,0.00020467292,0.000031888172,0.000077401215,0.00014127199,0.20413035,0.033956863,0.15098806,0.0057325438,0.6041337],"study_design_scores_gemma":[0.00001962562,0.0000667854,0.0002517831,0.000022638511,0.0000072319704,0.00013121768,0.000020260755,0.9443129,0.016918223,0.027618386,0.01060541,0.000025546204],"about_ca_topic_score_codex":0.002950354,"about_ca_topic_score_gemma":0.0033787042,"teacher_disagreement_score":0.002950354,"about_ca_system_score_codex":0.0008148413,"about_ca_system_score_gemma":0.0005630932,"threshold_uncertainty_score":0.0073717237},"labels":[],"label_agreement":null},{"id":"W1963578859","doi":"10.4018/ijcvip.2013100103","title":"A Hybrid Lossless-Lossy Binary Image Compression Scheme","year":2013,"lang":"en","type":"article","venue":"International Journal of Computer Vision and Image Processing","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Northern British Columbia","funders":"","keywords":"Lossy compression; Lossless compression; Image compression; Binary image; Rectangle; Data compression; Mathematics; Algorithm; Color Cell Compression; Computer science; Pixel; Binary number; Distortion (music); Artificial intelligence; Computer vision; Image (mathematics); Image processing; Geometry; Arithmetic","score_opus":0.008962960856768967,"score_gpt":0.30743387850158294,"score_spread":0.298470917644814,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1963578859","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05318468,0.0010693838,0.9396541,0.0002975934,0.00015820794,0.00013525494,0.000106958636,0.0009339055,0.0044599627],"genre_scores_gemma":[0.459337,0.0008041924,0.5245935,0.00040537937,0.00015816801,0.00015660927,0.00034805862,0.000103732185,0.014093294],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99964976,0.000039966097,0.000019533543,0.00004225716,0.00021853976,0.000029889694],"domain_scores_gemma":[0.9996785,0.00005789171,0.000038473536,0.00010494658,0.00009855058,0.000021635607],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028061974,0.00033939414,0.00039069625,0.0006801744,0.00025506137,0.0005322128,0.00088661973,0.00051046105,0.0019404117],"category_scores_gemma":[0.00074477104,0.00018959933,0.00022930045,0.0004927499,0.00030449106,0.0012671708,0.0006802396,0.0005509463,0.00078548025],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005478891,0.0002011512,0.00060579606,0.0002634068,0.00005259918,0.00028243853,0.0001354726,0.028908787,0.34934348,0.026113885,0.0053221113,0.588223],"study_design_scores_gemma":[0.00013916897,0.00066078536,0.001775608,0.000067190755,0.00007527232,0.0023258082,0.00005121372,0.6733394,0.28423023,0.007417484,0.029823674,0.000094160874],"about_ca_topic_score_codex":0.00031781042,"about_ca_topic_score_gemma":0.00036787265,"teacher_disagreement_score":0.0019404117,"about_ca_system_score_codex":0.00024060962,"about_ca_system_score_gemma":0.00021576132,"threshold_uncertainty_score":0.0064913034},"labels":[],"label_agreement":null},{"id":"W1964217348","doi":"10.1117/1.3515313","title":"Decadal research and development of near lossless data compression on-board satellites at the Canadian Space Agency","year":2010,"lang":"en","type":"article","venue":"Journal of Applied Remote Sensing","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"Canadian Space Agency","funders":"Government of Canada; Australian Government","keywords":"Lossless compression; Hyperspectral imaging; Lossy compression; Computer science; Data compression; Remote sensing; Image compression; Artificial intelligence; Image processing; Geography","score_opus":0.08493621479629047,"score_gpt":0.35244521020465003,"score_spread":0.26750899540835954,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1964217348","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4002634,0.07971827,0.17446394,0.024116568,0.0021569566,0.0008477963,0.0022082813,0.0015215606,0.31470323],"genre_scores_gemma":[0.70598835,0.05246235,0.12094374,0.0020588934,0.00042233642,0.00014189655,0.0033978447,0.00033810703,0.11424656],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9978671,0.00012003398,0.000038809147,0.00015770631,0.0016565528,0.00015979329],"domain_scores_gemma":[0.9946451,0.0002872676,0.0001295978,0.00021441672,0.0044497997,0.0002737809],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028958993,0.00041385213,0.00018442988,0.001798762,0.0011185803,0.001358423,0.0009569985,0.00044807466,0.0033961975],"category_scores_gemma":[0.0028497253,0.00017432297,0.00021822666,0.001868762,0.0010191299,0.0013692583,0.00092834904,0.00093586714,0.00046474944],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":true,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017475466,0.00012107557,0.00853973,0.0006110652,0.000035291094,0.00027355723,0.0011826843,0.007391595,0.048791084,0.025113398,0.017723897,0.89004195],"study_design_scores_gemma":[0.000041598603,0.00071719754,0.052536916,0.0005533679,0.00007293544,0.0007050422,0.0023494205,0.019669823,0.09327185,0.003963469,0.8259817,0.00013662921],"about_ca_topic_score_codex":0.3186864,"about_ca_topic_score_gemma":0.3808888,"teacher_disagreement_score":0.68131363,"about_ca_system_score_codex":0.006901321,"about_ca_system_score_gemma":0.0137129845,"threshold_uncertainty_score":0.6336629},"labels":[],"label_agreement":null},{"id":"W1965260842","doi":"10.1049/iet-ipr.2012.0179","title":"Transmission of JPEG2000 images over frequency‐selective channels with unequal power allocation","year":2013,"lang":"en","type":"article","venue":"IET Image Processing","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada; Simon Fraser University","keywords":"Transmission (telecommunications); Computer science; Power (physics); JPEG 2000; Electronic engineering; Telecommunications; Artificial intelligence; Image compression; Image (mathematics); Physics; Image processing; Engineering","score_opus":0.007691248705578448,"score_gpt":0.26059077785532747,"score_spread":0.252899529149749,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1965260842","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6493726,0.0007681582,0.34430724,0.0001531286,0.00005463666,0.00008521012,0.00008301261,0.00031093662,0.0048650894],"genre_scores_gemma":[0.9385263,0.00042249085,0.058422055,0.000046606678,0.000028387845,0.000026604557,0.00007634224,0.000032043394,0.002419242],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998286,0.000044550532,0.0000074829964,0.000019395353,0.00007462113,0.00002536385],"domain_scores_gemma":[0.99955636,0.00022998638,0.000060820086,0.00005976141,0.00008166336,0.000011533268],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028114757,0.00030059114,0.00020806216,0.00026520476,0.00017742273,0.00029027293,0.00021367434,0.00024090918,0.00071878865],"category_scores_gemma":[0.0009273893,0.00009836993,0.00014858891,0.00028622657,0.00026395658,0.00044421983,0.0001841015,0.00020089169,0.00016489382],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011264612,0.00017387932,0.004040352,0.0004338412,0.00010711739,0.000772434,0.00028724744,0.08294566,0.63028157,0.006774158,0.001264341,0.27179292],"study_design_scores_gemma":[0.000084312866,0.0009314645,0.0061619943,0.00003628157,0.00010467389,0.0015506689,0.00016204389,0.5191667,0.46380806,0.0018882971,0.0060553425,0.00005015985],"about_ca_topic_score_codex":0.00083658245,"about_ca_topic_score_gemma":0.0011064579,"teacher_disagreement_score":0.00083658245,"about_ca_system_score_codex":0.0002127305,"about_ca_system_score_gemma":0.00015951948,"threshold_uncertainty_score":0.0024046302},"labels":[],"label_agreement":null},{"id":"W1965544008","doi":"10.1117/12.740633","title":"Current status of satellite data compression in Canadian Space Agency","year":2007,"lang":"en","type":"article","venue":"Proceedings of SPIE, the International Society for Optical Engineering/Proceedings of SPIE","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"Canadian Space Agency","funders":"Natural Resources Canada","keywords":"Lossless compression; Lossy compression; Computer science; Hyperspectral imaging; Data compression; Remote sensing; Satellite; Real-time computing; Telecommunications link; Telecommunications; Artificial intelligence; Aerospace engineering; Geology; Engineering","score_opus":0.023043053801493036,"score_gpt":0.28669755017222104,"score_spread":0.263654496370728,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1965544008","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.069579504,0.36391407,0.04879583,0.05499483,0.0029112257,0.0007781462,0.007904881,0.0029731975,0.44814837],"genre_scores_gemma":[0.3073917,0.44577107,0.088887855,0.004359446,0.0011320576,0.0003024869,0.014986236,0.00045546514,0.13671377],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99722135,0.00012687902,0.00010076289,0.00018907912,0.0021176091,0.00024433958],"domain_scores_gemma":[0.9880465,0.00045924698,0.00027214753,0.00024107462,0.010550857,0.0004300121],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003216588,0.00061645935,0.00037266614,0.0037639828,0.0017411967,0.002435575,0.0021013392,0.00081071444,0.014228016],"category_scores_gemma":[0.005873413,0.00021633685,0.00025295324,0.0072970763,0.0013184953,0.0024493772,0.0011067295,0.000719364,0.0022230304],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":true,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001769896,0.00007157624,0.0022060631,0.00068062404,0.000015167951,0.000052524396,0.00017833813,0.0021606088,0.0033504844,0.016151099,0.067488834,0.9074677],"study_design_scores_gemma":[0.000039862596,0.00019200493,0.008068506,0.00093021675,0.00004065161,0.00017368728,0.0007180128,0.008162902,0.011952287,0.003963413,0.96567154,0.00008691618],"about_ca_topic_score_codex":0.7371892,"about_ca_topic_score_gemma":0.6642872,"teacher_disagreement_score":0.7371892,"about_ca_system_score_codex":0.016244676,"about_ca_system_score_gemma":0.03531499,"threshold_uncertainty_score":0.52871716},"labels":[],"label_agreement":null},{"id":"W1966509400","doi":"10.1016/j.imavis.2003.09.011","title":"A hybrid quantization scheme for image compression","year":2003,"lang":"en","type":"article","venue":"Image and Vision Computing","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Government of Alberta","keywords":"Quantization (signal processing); Vector quantization; Linde–Buzo–Gray algorithm; Computer science; Smoothness; Algorithm; Trellis quantization; Image compression; Scheme (mathematics); Mathematics; Artificial intelligence; Image (mathematics); Image processing","score_opus":0.016468508487516055,"score_gpt":0.34834362785045436,"score_spread":0.3318751193629383,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1966509400","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02080742,0.001203191,0.97274774,0.00020752243,0.00026037087,0.00009212081,0.00014479694,0.00095805974,0.0035787192],"genre_scores_gemma":[0.24854271,0.0008957656,0.73345375,0.0002550327,0.00019883939,0.00015856413,0.000442435,0.000118018055,0.015934974],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99964714,0.000050184695,0.000023198872,0.000039143903,0.0002127118,0.000027567818],"domain_scores_gemma":[0.9996278,0.00007743834,0.000017948847,0.000111212765,0.00014655592,0.000018987854],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032326602,0.0004005899,0.0005325904,0.00062352646,0.0004126494,0.00060328975,0.0007739146,0.0005726304,0.0047695376],"category_scores_gemma":[0.00077535666,0.00018839556,0.00027558082,0.001013346,0.0003602765,0.0010301915,0.00075709814,0.0006310293,0.0011461158],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00046741287,0.00012370087,0.0003267393,0.00019726965,0.00005100229,0.00010868737,0.000086786444,0.023068286,0.19582726,0.04292164,0.008214731,0.72860646],"study_design_scores_gemma":[0.00016394505,0.0005112628,0.0011136913,0.000058405138,0.00008357824,0.000996234,0.000051273393,0.7905503,0.15332368,0.024947455,0.028103584,0.00009663197],"about_ca_topic_score_codex":0.00090901443,"about_ca_topic_score_gemma":0.0018626578,"teacher_disagreement_score":0.0047695376,"about_ca_system_score_codex":0.00028365638,"about_ca_system_score_gemma":0.0003441282,"threshold_uncertainty_score":0.015955687},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.029359771998687563,"score_gpt":0.3082857185496629,"score_spread":0.27892594655097536,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1967451774","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003208825,0.000096142176,0.9961898,0.00002956507,0.000019330442,0.000017338178,0.000017643773,0.00008017657,0.000341193],"genre_scores_gemma":[0.10816609,0.0004071509,0.8883598,0.000045987123,0.000057244888,0.000066658715,0.000106373634,0.000047162608,0.0027435469],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9996437,0.000052158226,0.000028583918,0.00010463154,0.00015478072,0.000016117894],"domain_scores_gemma":[0.9996917,0.00012709938,0.000028483299,0.00003248666,0.000106110456,0.000014181156],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005660726,0.00039452975,0.0007147306,0.0006437752,0.000352511,0.0005404874,0.00067168067,0.0004940357,0.0022536898],"category_scores_gemma":[0.0010920911,0.00025418718,0.00070553564,0.00082702725,0.0003799492,0.0010199186,0.00049147935,0.0008639124,0.000384215],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002504005,0.00008262523,0.00071538135,0.0003415474,0.00009232801,0.0002092809,0.00025394285,0.10935037,0.082767986,0.08489258,0.0028932055,0.71815026],"study_design_scores_gemma":[0.000019119167,0.00007567361,0.00035345223,0.000010279519,0.000042573713,0.00020262203,0.000017842127,0.9770832,0.014081029,0.0047675865,0.0033190595,0.00002762415],"about_ca_topic_score_codex":0.0022214856,"about_ca_topic_score_gemma":0.0019161444,"teacher_disagreement_score":0.0022536898,"about_ca_system_score_codex":0.00028480726,"about_ca_system_score_gemma":0.00057949906,"threshold_uncertainty_score":0.007539332},"labels":[],"label_agreement":null},{"id":"W1969517404","doi":"10.1109/ccece.2008.4564707","title":"IR database compression algorithm using optimized key mask","year":2008,"lang":"en","type":"article","venue":"Conference proceedings - Canadian Conference on Electrical and Computer Engineering","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Computer science; Key (lock); Database; Data compression; Set (abstract data type); Algorithm; Operating system","score_opus":0.028566832129196952,"score_gpt":0.23128853837032382,"score_spread":0.20272170624112687,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1969517404","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.028030735,0.00051285507,0.9640478,0.00014727641,0.00013518543,0.00014198516,0.00028865781,0.00333165,0.0033637625],"genre_scores_gemma":[0.124790296,0.00037589335,0.86684257,0.00010319131,0.00007455195,0.0001982096,0.0011614207,0.0003075624,0.0061463765],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99930596,0.000045251014,0.00007647729,0.00011795672,0.0003828981,0.00007151871],"domain_scores_gemma":[0.9992872,0.00011820844,0.00007145077,0.00016210874,0.00033607607,0.000025024357],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039679342,0.0006596335,0.0006553683,0.0014340852,0.00046920165,0.0012060789,0.0012100097,0.00055573834,0.004347339],"category_scores_gemma":[0.0018234174,0.0002815086,0.00039223096,0.0013403835,0.0003233372,0.0014682686,0.00086294074,0.00063392695,0.0021249722],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007750125,0.000084814805,0.000996856,0.0001441574,0.00003609022,0.00027033844,0.00025377353,0.025689866,0.10183398,0.012301097,0.009910448,0.8477035],"study_design_scores_gemma":[0.00013429776,0.00038874432,0.0021554767,0.0000495253,0.00006438364,0.0017515921,0.00017960079,0.6764745,0.26986265,0.008670188,0.040179644,0.000089329966],"about_ca_topic_score_codex":0.0020921275,"about_ca_topic_score_gemma":0.001374364,"teacher_disagreement_score":0.004347339,"about_ca_system_score_codex":0.0006032751,"about_ca_system_score_gemma":0.0007946744,"threshold_uncertainty_score":0.014543235},"labels":[],"label_agreement":null},{"id":"W1970162918","doi":"10.1109/vtcfall.2012.6399216","title":"Distributed Lossy Source Coding Using Real-Number Codes","year":2012,"lang":"en","type":"preprint","venue":"","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"Hydro-Québec; Natural Sciences and Engineering Research Council of Canada; McGill University","keywords":"Lossy compression; Algorithm; Decoding methods; Computer science; Distributed source coding; Quantization (signal processing); Coding (social sciences); Variable-length code; Theoretical computer science; Mathematics; Artificial intelligence; Statistics","score_opus":0.05389629084179563,"score_gpt":0.34209888734386507,"score_spread":0.2882025965020694,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1970162918","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0049476796,0.00024893106,0.9926945,0.00013722233,0.0000440539,0.000015361598,0.00003479657,0.00011604776,0.0017614237],"genre_scores_gemma":[0.4591583,0.0011711289,0.53166324,0.00025248097,0.00019195121,0.00017790178,0.0002470593,0.0001281832,0.0070097],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99930704,0.00018158068,0.000025871876,0.00009887729,0.00034073144,0.000045947447],"domain_scores_gemma":[0.99843615,0.000706333,0.00017566634,0.00039331746,0.00025570617,0.000032827505],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00081098714,0.0006318547,0.00055440643,0.00054469774,0.00025450316,0.0008499836,0.0010765895,0.00071169715,0.0016771453],"category_scores_gemma":[0.0036340666,0.00018389587,0.00035889822,0.0008635605,0.001081178,0.0016242608,0.0012461523,0.0014910464,0.00057776726],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018450928,0.000053747055,0.00032521127,0.00016238334,0.00003400443,0.00026421642,0.00015753238,0.3742342,0.025885426,0.48024702,0.0028373457,0.115614444],"study_design_scores_gemma":[0.00002273386,0.0000394282,0.00008819105,0.000026072456,0.000007637916,0.00016992558,0.000013366485,0.89238805,0.010114539,0.09349653,0.0036141695,0.00001939881],"about_ca_topic_score_codex":0.0006179046,"about_ca_topic_score_gemma":0.00056755176,"teacher_disagreement_score":0.0016771453,"about_ca_system_score_codex":0.0007328148,"about_ca_system_score_gemma":0.000478588,"threshold_uncertainty_score":0.005610645},"labels":[],"label_agreement":null},{"id":"W1971082577","doi":"10.1109/tbc.2012.2186728","title":"Segmentation of Source Symbols for Adaptive Arithmetic Coding","year":2012,"lang":"en","type":"article","venue":"IEEE Transactions on Broadcasting","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Communications Research Centre Canada","funders":"","keywords":"Context-adaptive variable-length coding; Arithmetic coding; Adaptive coding; Context-adaptive binary arithmetic coding; Shannon–Fano coding; Lossless compression; Variable-length code; Coding (social sciences); Tunstall coding; Huffman coding; Decoding methods; Computer science; Algorithm; Sub-band coding; Source code; Segmentation; Coding tree unit; Data compression; Arithmetic; Mathematics; Artificial intelligence; Statistics","score_opus":0.047800982061374495,"score_gpt":0.303580003122286,"score_spread":0.2557790210609115,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1971082577","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011501009,0.000296634,0.98525745,0.000067872075,0.00007664254,0.00008868715,0.000097852266,0.0005082683,0.0021056307],"genre_scores_gemma":[0.28953785,0.0006786636,0.7037727,0.00025632285,0.00012704989,0.00039250907,0.0007408695,0.0003382312,0.004155709],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995914,0.000072992436,0.000036090518,0.00009017111,0.0001590884,0.000050226186],"domain_scores_gemma":[0.9991116,0.0003273271,0.000079658916,0.00023347371,0.00022145253,0.000026444646],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031881582,0.00078798615,0.0006739072,0.00071207335,0.00045648732,0.0007255058,0.0007589068,0.00070695684,0.0025993092],"category_scores_gemma":[0.0024416836,0.0002260782,0.0004958097,0.0010701163,0.00079500536,0.0010730998,0.0008479434,0.0011983202,0.001264567],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006543844,0.00011770636,0.0010543461,0.00030459257,0.000061672814,0.00048828946,0.0005145102,0.085632905,0.41344172,0.077554576,0.0038197562,0.41635552],"study_design_scores_gemma":[0.000050268678,0.0004096146,0.001788502,0.000120622666,0.00006892965,0.0009499859,0.00011572722,0.6386447,0.26600653,0.053559795,0.038198646,0.00008664973],"about_ca_topic_score_codex":0.0010501262,"about_ca_topic_score_gemma":0.00095331046,"teacher_disagreement_score":0.0025993092,"about_ca_system_score_codex":0.00057223585,"about_ca_system_score_gemma":0.00079209486,"threshold_uncertainty_score":0.008695543},"labels":[],"label_agreement":null},{"id":"W1972971724","doi":"10.1007/s11042-005-6848-5","title":"Performance Analysis of the JPEG 2000 Image Coding Standard","year":2005,"lang":"en","type":"article","venue":"Multimedia Tools and Applications","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":22,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia Hospital","funders":"","keywords":"Computer science; JPEG; Lossless JPEG; Lossy compression; JPEG 2000; Codec; Lossless compression; Quantization (signal processing); Coding (social sciences); Image compression; Data compression; Artificial intelligence; Computer vision; Image processing; Computer hardware; Image (mathematics); Mathematics","score_opus":0.015479317873349144,"score_gpt":0.27844493416202437,"score_spread":0.2629656162886752,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1972971724","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9249683,0.0054576974,0.049239945,0.00040994768,0.00012765266,0.000110927176,0.0010948579,0.0014979583,0.017092701],"genre_scores_gemma":[0.9871169,0.0011998726,0.0073519815,0.000051115887,0.000052780895,0.000031784253,0.0013741934,0.000089859655,0.0027314234],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99817634,0.00030364585,0.00008009243,0.00014856974,0.0010316946,0.00025971583],"domain_scores_gemma":[0.99502736,0.0025635867,0.00031372492,0.00026134696,0.0017177876,0.00011613581],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012160005,0.00058023905,0.0003695343,0.0022928177,0.0003659115,0.0007275458,0.00041342468,0.00041014358,0.0024945887],"category_scores_gemma":[0.006466975,0.00012229967,0.00021602644,0.0024428382,0.00029312653,0.0007188959,0.00029242394,0.00029351245,0.0005168193],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00743608,0.00058903405,0.023043951,0.0006282374,0.0002716041,0.0005396092,0.00020404169,0.31046823,0.16155124,0.018556915,0.012882974,0.46382806],"study_design_scores_gemma":[0.00012504713,0.0021373895,0.03270505,0.00006179423,0.00024627853,0.0008822384,0.00013490602,0.8687185,0.08573434,0.0029423966,0.006224069,0.00008806836],"about_ca_topic_score_codex":0.007824409,"about_ca_topic_score_gemma":0.005171181,"teacher_disagreement_score":0.007824409,"about_ca_system_score_codex":0.0015532403,"about_ca_system_score_gemma":0.00092413684,"threshold_uncertainty_score":0.015557766},"labels":[],"label_agreement":null},{"id":"W1977073517","doi":"10.1109/icassp.2013.6637864","title":"ℓ<inf>2</inf> optimized predictive image coding with ℓ<inf>∞</inf> bound","year":2013,"lang":"en","type":"article","venue":"","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Coding (social sciences); Computer science; Algorithm; Metric (unit); Artificial intelligence; Mathematics; Statistics; Engineering","score_opus":0.01841411466337482,"score_gpt":0.26712572943125057,"score_spread":0.24871161476787576,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1977073517","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0047560367,0.0020521774,0.7128197,0.0027005957,0.000967024,0.00019132392,0.002468549,0.013053617,0.2609911],"genre_scores_gemma":[0.14518833,0.002919922,0.38503975,0.0020630702,0.0006258835,0.00060933136,0.007041943,0.0060676136,0.45044416],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99819285,0.00014947965,0.00006551253,0.0002690205,0.0011647318,0.00015840666],"domain_scores_gemma":[0.99885476,0.00026749272,0.00008375211,0.00029408187,0.00042653634,0.000073434196],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010604524,0.0017339126,0.0008579219,0.0010386152,0.0008194423,0.0026879162,0.0021472075,0.0018222809,0.15604612],"category_scores_gemma":[0.0034524044,0.00054896384,0.000530507,0.0015159011,0.0011975658,0.002214348,0.0024245693,0.0029262684,0.12079996],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005042818,0.00013908326,0.00036098942,0.00042939215,0.0000314029,0.0002562513,0.00018777842,0.021065295,0.04409194,0.16772509,0.2503028,0.5149057],"study_design_scores_gemma":[0.00006469437,0.00012952708,0.0007961328,0.00021677496,0.000023289973,0.0004694971,0.000055862172,0.30311763,0.07361786,0.060545918,0.56085265,0.00011009701],"about_ca_topic_score_codex":0.005308795,"about_ca_topic_score_gemma":0.0061907624,"teacher_disagreement_score":0.15604612,"about_ca_system_score_codex":0.0022233275,"about_ca_system_score_gemma":0.001615009,"threshold_uncertainty_score":0.5220263},"labels":[],"label_agreement":null},{"id":"W1977829609","doi":"10.1109/mmsp.2005.248598","title":"Centralized P2P Streaming with MDC","year":2005,"lang":"en","type":"article","venue":"","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Computer science; Bottleneck; Computer network; Video streaming; Live streaming; Peer-to-peer; Frame (networking); Linear network coding; Coding (social sciences); Distributed computing; Server; Content distribution; Network packet; Embedded system","score_opus":0.008282347761365723,"score_gpt":0.24937185889276253,"score_spread":0.24108951113139682,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1977829609","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.055894766,0.0007177957,0.93341905,0.00028911568,0.000096090385,0.000242624,0.00011676362,0.0030708306,0.0061530466],"genre_scores_gemma":[0.8124057,0.00024234064,0.18409671,0.000093484836,0.000090388705,0.00013686242,0.00017346877,0.000069566704,0.0026915558],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9989178,0.00015196113,0.000042463187,0.00020214035,0.00061833,0.00006721891],"domain_scores_gemma":[0.99873525,0.00031059943,0.00009339307,0.00037739886,0.0004136185,0.000069813825],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008420087,0.0004892948,0.001021602,0.00047957874,0.0006944365,0.00081723864,0.0013561726,0.00054924487,0.0011850919],"category_scores_gemma":[0.0021271727,0.00020978106,0.00024117966,0.0006878292,0.00054397446,0.0010004888,0.00084057817,0.00077589357,0.00036910461],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007933087,0.00035148585,0.0025515088,0.0002943209,0.00012328633,0.00063479587,0.00023994799,0.35920912,0.098360166,0.029757656,0.009705794,0.49797848],"study_design_scores_gemma":[0.00005838696,0.00010823377,0.0004138787,0.000007263973,0.000019510031,0.00018093827,0.00002851902,0.97447157,0.017983092,0.0038642837,0.002843642,0.00002078556],"about_ca_topic_score_codex":0.0058011403,"about_ca_topic_score_gemma":0.0056472938,"teacher_disagreement_score":0.0058011403,"about_ca_system_score_codex":0.0009998365,"about_ca_system_score_gemma":0.0018060964,"threshold_uncertainty_score":0.01153475},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.05710625590233875,"score_gpt":0.28973193220963955,"score_spread":0.2326256763073008,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1978068076","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009817322,0.0013894852,0.98615104,0.00009858574,0.000086751235,0.00012663164,0.0000614742,0.0006481852,0.001620511],"genre_scores_gemma":[0.1068993,0.0015632898,0.8874235,0.00016825488,0.000093389914,0.00014067352,0.00025829911,0.0001249109,0.003328358],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99932075,0.00013400524,0.0000228816,0.00008241758,0.00038282928,0.000057143177],"domain_scores_gemma":[0.99943703,0.00015868068,0.000058922647,0.000083598825,0.00023388409,0.000027768343],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006948049,0.00059696403,0.0004366623,0.001000228,0.00032692912,0.0007912039,0.0011859089,0.00057671533,0.0011189667],"category_scores_gemma":[0.0014632556,0.00033325434,0.00034402817,0.0011707899,0.00036075202,0.0010227038,0.0005193892,0.001001357,0.0007264339],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00047108292,0.00014442464,0.0006050737,0.00029473205,0.000042228203,0.00038192468,0.00021751162,0.031249039,0.28541538,0.040538717,0.005358885,0.635281],"study_design_scores_gemma":[0.00011069754,0.0004263302,0.0015932944,0.00009656832,0.00008421281,0.0021603322,0.0000733642,0.743947,0.20304236,0.012068831,0.036292993,0.00010399517],"about_ca_topic_score_codex":0.0030246784,"about_ca_topic_score_gemma":0.0036856616,"teacher_disagreement_score":0.0030246784,"about_ca_system_score_codex":0.0005111478,"about_ca_system_score_gemma":0.0010011437,"threshold_uncertainty_score":0.0060141087},"labels":[],"label_agreement":null},{"id":"W1980698970","doi":"10.1109/mcom.2006.1637952","title":"Extended AMR-WB for high-quality audio on mobile devices","year":2006,"lang":"en","type":"article","venue":"IEEE Communications Magazine","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":33,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"VoiceAge (Canada)","funders":"Academy of Finland","keywords":"Codec; Computer science; Adaptive Multi-Rate audio codec; Sound quality; Audio over Ethernet; Bit rate; Digital audio broadcasting; Speech coding; Multimedia; Mobile device; Audio signal; Computer network; Telecommunications; Speech recognition; Digital audio; Speech processing; Voice activity detection; Operating system","score_opus":0.04279933091079921,"score_gpt":0.3562517374871472,"score_spread":0.313452406576348,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1980698970","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03967465,0.004129566,0.92044365,0.00060613395,0.00034731542,0.00023345822,0.00017244661,0.0034017006,0.030991007],"genre_scores_gemma":[0.58604085,0.0037120052,0.37305936,0.0008579258,0.00070739613,0.00032059,0.00068921444,0.0004982658,0.034114406],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99935776,0.00011793674,0.000027815968,0.00004716608,0.00038292704,0.000066450666],"domain_scores_gemma":[0.99932146,0.00011473654,0.000063899985,0.00013347602,0.00032497695,0.000041530973],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00051013223,0.0005690457,0.00030072528,0.0004900752,0.00042352526,0.0008717285,0.00061033224,0.00072607776,0.0052196155],"category_scores_gemma":[0.0011744513,0.00015672765,0.00021482402,0.00032134433,0.00030479516,0.00068012805,0.0008894616,0.0010442964,0.0028980854],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00079676457,0.00007412868,0.0008955745,0.0005666746,0.000053388503,0.0011524468,0.00034121764,0.013148855,0.41323054,0.04666809,0.018698879,0.50437343],"study_design_scores_gemma":[0.00021625507,0.0016264552,0.0047200746,0.0004032416,0.000107487576,0.0073843333,0.00016945071,0.32115123,0.25169405,0.021299602,0.39109087,0.00013697526],"about_ca_topic_score_codex":0.0007029206,"about_ca_topic_score_gemma":0.00090973004,"teacher_disagreement_score":0.0052196155,"about_ca_system_score_codex":0.00027969878,"about_ca_system_score_gemma":0.0002741257,"threshold_uncertainty_score":0.01746136},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.035387526039532956,"score_gpt":0.27622695559455174,"score_spread":0.24083942955501877,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1980828944","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.021609735,0.0015213968,0.8951567,0.0006544082,0.0007987049,0.00011619282,0.00034097303,0.0011629997,0.07863897],"genre_scores_gemma":[0.49489477,0.0036297645,0.42372325,0.0014201665,0.00065875734,0.00026585607,0.00093957194,0.00059465715,0.07387316],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99964094,0.00005877459,0.000020544447,0.000089346955,0.00013952317,0.000050945757],"domain_scores_gemma":[0.99971443,0.000065637934,0.00003336459,0.00009331638,0.00007202416,0.000021246064],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032872212,0.00056033867,0.0005355505,0.0007564422,0.0004888966,0.001309358,0.0006931383,0.00091995153,0.015237449],"category_scores_gemma":[0.0012656925,0.00018926337,0.00059241656,0.00082215597,0.0010026805,0.001547642,0.0011156991,0.0010650707,0.004023523],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002318647,0.000035423975,0.00032939346,0.00021432572,0.000023410405,0.0003950647,0.00014209849,0.024870269,0.047529407,0.660337,0.012282934,0.25360876],"study_design_scores_gemma":[0.00009608122,0.000451433,0.00046766555,0.00011788823,0.0000473475,0.0023499785,0.00021522699,0.3102818,0.07250958,0.38803488,0.2253041,0.00012400142],"about_ca_topic_score_codex":0.00044026828,"about_ca_topic_score_gemma":0.00048602882,"teacher_disagreement_score":0.015237449,"about_ca_system_score_codex":0.00040606898,"about_ca_system_score_gemma":0.00066932815,"threshold_uncertainty_score":0.05097437},"labels":[],"label_agreement":null},{"id":"W1984954390","doi":"10.1117/12.529453","title":"Selecting the don't care bits in JPEG2000 ROI coding","year":2004,"lang":"en","type":"article","venue":"Proceedings of SPIE, the International Society for Optical Engineering/Proceedings of SPIE","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"JPEG 2000; Computer science; Bit plane; Encoder; Coding (social sciences); Bitstream; Variable-length code; Entropy encoding; Algorithm; Transform coding; Entropy (arrow of time); Decoding methods; Image compression; Bit field; Computer vision; Image processing; Mathematics; Discrete cosine transform; Image (mathematics)","score_opus":0.010944867149843114,"score_gpt":0.24446810877831715,"score_spread":0.23352324162847404,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1984954390","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.086075366,0.003731614,0.90404904,0.000322476,0.0001592616,0.00017674272,0.00015972125,0.001210485,0.00411519],"genre_scores_gemma":[0.388453,0.002156124,0.6024482,0.0002602289,0.00007518452,0.00015102216,0.00034042491,0.0002908958,0.0058249505],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99954236,0.0001035483,0.00002716414,0.000067521876,0.00022265641,0.000036772293],"domain_scores_gemma":[0.9995216,0.00015988537,0.00007175169,0.000113319606,0.00011607751,0.000017383098],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00056470087,0.0005246946,0.00028388988,0.0006442883,0.00031923375,0.0005366205,0.0005685133,0.00048980414,0.0011124897],"category_scores_gemma":[0.002236679,0.0002657672,0.00017639378,0.0006147496,0.0005301931,0.00077363005,0.00045646448,0.0006111509,0.00066004414],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006450762,0.00008881305,0.0011589946,0.00027264576,0.000019890715,0.00035135006,0.00017865213,0.013586108,0.37350053,0.024343606,0.0032934733,0.5825609],"study_design_scores_gemma":[0.00007534991,0.00045883865,0.0042606015,0.00016498117,0.000090841524,0.0015826363,0.000087505774,0.17370331,0.7711195,0.012053028,0.03628548,0.00011788414],"about_ca_topic_score_codex":0.0011359806,"about_ca_topic_score_gemma":0.0021343436,"teacher_disagreement_score":0.0011359806,"about_ca_system_score_codex":0.0002747822,"about_ca_system_score_gemma":0.00039722052,"threshold_uncertainty_score":0.0037216544},"labels":[],"label_agreement":null},{"id":"W1985216274","doi":"10.1109/cjece.2005.1541728","title":"Novel error concealment methods in JPEG 2000","year":2005,"lang":"en","type":"article","venue":"Canadian Journal of Electrical and Computer Engineering","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"JPEG; Computer science; JPEG 2000; Error concealment; Transmission (telecommunications); Algorithm; Quantization (signal processing); Error detection and correction; Lossless JPEG; Wavelet; Computer vision; Data compression; Artificial intelligence; Image compression; Image (mathematics); Telecommunications; Decoding methods; Image processing","score_opus":0.01520156133059689,"score_gpt":0.2788213688776354,"score_spread":0.2636198075470385,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1985216274","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012416883,0.006326194,0.9755466,0.00027684867,0.00020978265,0.0000672918,0.000045312034,0.00021532536,0.0048957122],"genre_scores_gemma":[0.2133979,0.01191618,0.7515664,0.00026318553,0.00031448828,0.00010820862,0.00020432455,0.00007577152,0.022153495],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99948263,0.000070493195,0.000026720982,0.000064901564,0.0003270692,0.000028192933],"domain_scores_gemma":[0.9997203,0.000079630256,0.000049651884,0.000052207008,0.00008541132,0.000012738397],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000579541,0.00047490318,0.00032444543,0.0005448584,0.00026001112,0.0006529497,0.0006275731,0.00079591497,0.0013543391],"category_scores_gemma":[0.0013730681,0.00021090056,0.00031763926,0.00059591146,0.00045314356,0.0012463019,0.0005939099,0.00093393377,0.0006968102],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00039447498,0.00011174732,0.00053067325,0.0005284093,0.0000520396,0.00027625464,0.00025750647,0.040384077,0.115034774,0.14716221,0.004414387,0.6908535],"study_design_scores_gemma":[0.00010476486,0.0003858576,0.0016021687,0.00022262023,0.00006237293,0.0029542905,0.00009913008,0.70648015,0.18278748,0.036108434,0.06907706,0.00011572197],"about_ca_topic_score_codex":0.0008001724,"about_ca_topic_score_gemma":0.00076950045,"teacher_disagreement_score":0.0013543391,"about_ca_system_score_codex":0.00040483294,"about_ca_system_score_gemma":0.00041808808,"threshold_uncertainty_score":0.004530728},"labels":[],"label_agreement":null},{"id":"W1985938849","doi":"10.1109/itw.2013.6691217","title":"On symmetric multiple description coding","year":2013,"lang":"en","type":"article","venue":"","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Minimax; Mathematics; Binary number; Upper and lower bounds; Hamming distance; Gaussian; Quadratic equation; Distortion (music); Hamming code; Combinatorics; Rate–distortion theory; Discrete mathematics; Coding (social sciences); Mathematical optimization; Algorithm; Computer science; Block code; Decoding methods; Statistics; Mathematical analysis","score_opus":0.028476764762748536,"score_gpt":0.25480076013010994,"score_spread":0.2263239953673614,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1985938849","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010072103,0.0027898303,0.9568991,0.0012039781,0.00024851807,0.0000711951,0.00032195458,0.000094045135,0.028299345],"genre_scores_gemma":[0.6271693,0.011878441,0.32947317,0.001659618,0.0015650317,0.0006485855,0.0014308984,0.00028251982,0.025892414],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99801373,0.00059941434,0.00009824339,0.00021536522,0.00083576754,0.00023741744],"domain_scores_gemma":[0.99535227,0.0028983473,0.00029621675,0.000583218,0.00077239855,0.000097549346],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027380106,0.0012927996,0.0011113558,0.0018430162,0.0006535969,0.002123155,0.0018954743,0.0015758721,0.005179108],"category_scores_gemma":[0.010091472,0.00051936944,0.0006770258,0.0022510493,0.0018378148,0.003906699,0.003286969,0.002594569,0.0020444754],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000083981555,0.000035075285,0.00019716636,0.00029265988,0.000030018713,0.00021250949,0.00010393763,0.1002866,0.0033159882,0.84023064,0.0050707166,0.050140634],"study_design_scores_gemma":[0.00002217234,0.00006128896,0.0001547096,0.000121385594,0.000015687287,0.00019316323,0.00002741425,0.3761364,0.0032858816,0.61275065,0.0071889996,0.000042234755],"about_ca_topic_score_codex":0.0014462915,"about_ca_topic_score_gemma":0.0010384495,"teacher_disagreement_score":0.005179108,"about_ca_system_score_codex":0.0018723605,"about_ca_system_score_gemma":0.0013800872,"threshold_uncertainty_score":0.017325819},"labels":[],"label_agreement":null},{"id":"W1988044931","doi":"10.1002/wcm.279","title":"Scalable multiple description coding and distributed video streaming in 3G mobile communications","year":2005,"lang":"en","type":"article","venue":"Wireless Communications and Mobile Computing","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Computer network; UMTS frequency bands; Handover; Multiple description coding; Scalability; Network packet; Overlay network; Packet loss; Radio access network; Linear network coding; Cellular network; Real-time computing; The Internet; Mobile station; Base station","score_opus":0.028251853832534597,"score_gpt":0.29600165622129526,"score_spread":0.26774980238876067,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1988044931","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06968307,0.002059031,0.9223658,0.0004809837,0.00010213961,0.00006726075,0.00007046527,0.00058956933,0.004581646],"genre_scores_gemma":[0.7850703,0.0010637605,0.2097685,0.0001736215,0.00008985933,0.000075498014,0.00017098388,0.00003674437,0.0035507397],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99980444,0.00006167974,0.000007608717,0.000016271839,0.00008625289,0.000023654737],"domain_scores_gemma":[0.9996444,0.00016690706,0.000028965564,0.000044178378,0.00009862535,0.000016935244],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005903217,0.0002315899,0.00022268819,0.0003712249,0.00016432813,0.00035897165,0.00037844141,0.00033467848,0.0008893907],"category_scores_gemma":[0.0009356051,0.00010375662,0.00017656088,0.00039001895,0.0003123185,0.00046390275,0.00036967563,0.00043414434,0.00021198316],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00047039715,0.00011002304,0.001427387,0.00021163309,0.00006310287,0.00073070434,0.00025653656,0.26681933,0.10743568,0.12316955,0.006123197,0.49318248],"study_design_scores_gemma":[0.00002918221,0.000070472306,0.00028591332,0.000014509506,0.000012195389,0.000118604265,0.00002416408,0.963507,0.015695395,0.015635323,0.004593919,0.000013355367],"about_ca_topic_score_codex":0.0023171306,"about_ca_topic_score_gemma":0.0022091307,"teacher_disagreement_score":0.0023171306,"about_ca_system_score_codex":0.00047199006,"about_ca_system_score_gemma":0.00041844172,"threshold_uncertainty_score":0.00460726},"labels":[],"label_agreement":null},{"id":"W1988694162","doi":"10.1109/vcip.2011.6115914","title":"Unequal channel error protection of multiple description codes for wireless media streaming","year":2011,"lang":"en","type":"article","venue":"","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"","keywords":"Computer science; Forward error correction; Channel (broadcasting); Network packet; Wireless; Optimization problem; Algorithm; Convex optimization; Video quality; Computer network; Decoding methods; Mathematical optimization; Real-time computing; Regular polygon; Telecommunications; Mathematics","score_opus":0.11070295950146197,"score_gpt":0.2833146831212439,"score_spread":0.17261172361978194,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1988694162","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.057693996,0.0010042564,0.9382888,0.00040615734,0.000042920146,0.000035058976,0.000036908797,0.00012715801,0.002364638],"genre_scores_gemma":[0.8945141,0.0008074438,0.10282962,0.00006847483,0.000056250545,0.00006061688,0.00005896193,0.000040539402,0.0015639606],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991732,0.0004064698,0.00002211731,0.000054053406,0.00026251646,0.00008152245],"domain_scores_gemma":[0.99671483,0.0026073102,0.00019944209,0.00020194186,0.00021102079,0.000065381784],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020294103,0.00060785224,0.0005260542,0.00045586354,0.000295475,0.00055690756,0.000620169,0.00078940776,0.0007384113],"category_scores_gemma":[0.00614575,0.00029041216,0.0003588625,0.0005186309,0.0009285569,0.0009829515,0.0009199861,0.00086642255,0.00016682656],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012744908,0.000027851873,0.0003149892,0.000074731775,0.00002265581,0.00009521366,0.00006161143,0.9320127,0.0064332387,0.027385632,0.0004198945,0.033024136],"study_design_scores_gemma":[0.00001151262,0.000026869771,0.0000464489,0.000005182147,0.0000039955,0.00002226996,0.0000051814104,0.9912059,0.002915827,0.005504097,0.0002465428,0.0000062993176],"about_ca_topic_score_codex":0.001717051,"about_ca_topic_score_gemma":0.0011507357,"teacher_disagreement_score":0.0020294103,"about_ca_system_score_codex":0.00077809306,"about_ca_system_score_gemma":0.0007841771,"threshold_uncertainty_score":0.010732651},"labels":[],"label_agreement":null},{"id":"W1991793489","doi":"10.1117/12.411909","title":"<title>3D foveated visualization on the Web</title>","year":2000,"lang":"en","type":"article","venue":"Proceedings of SPIE, the International Society for Optical Engineering/Proceedings of SPIE","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Computer science; Lossy compression; Lossless compression; JPEG; Wavelet; Image compression; Computer vision; JPEG 2000; Data compression; Artificial intelligence; Computer graphics (images); Image processing; Image (mathematics)","score_opus":0.011514192499403884,"score_gpt":0.2462906831810128,"score_spread":0.2347764906816089,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1991793489","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0052273055,0.0029747132,0.26541382,0.0037632703,0.014350935,0.0012374871,0.018847791,0.1418499,0.54633474],"genre_scores_gemma":[0.03447422,0.0029899536,0.08633103,0.0019177913,0.0027473646,0.00062496844,0.022854479,0.04344045,0.8046197],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996239,0.000046096386,0.000019832447,0.000063484345,0.00020946069,0.00003721198],"domain_scores_gemma":[0.9990706,0.00014579357,0.000037227295,0.00020197275,0.00038120113,0.0001631836],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0006118742,0.0009828199,0.00085338106,0.0014847819,0.0004222993,0.0028691303,0.0015316958,0.001080934,0.48732457],"category_scores_gemma":[0.0011199174,0.0004733945,0.0006998519,0.0012151379,0.00047651245,0.0019833606,0.0016921317,0.0013047613,0.23021512],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016116169,0.000052359177,0.00020028034,0.00027620292,0.000020618172,0.00021487456,0.00004482517,0.000911598,0.015330309,0.0040447437,0.828447,0.15029602],"study_design_scores_gemma":[0.00006430934,0.000064364554,0.0013055233,0.00013393888,0.0000097006505,0.0002821653,0.000031975942,0.0123236,0.010537451,0.003039481,0.9721532,0.00005432044],"about_ca_topic_score_codex":0.004131205,"about_ca_topic_score_gemma":0.0038948893,"teacher_disagreement_score":0.48732457,"about_ca_system_score_codex":0.0006687992,"about_ca_system_score_gemma":0.0005010443,"threshold_uncertainty_score":0.73126924},"labels":[],"label_agreement":null},{"id":"W1992704442","doi":"10.1016/j.imavis.2008.06.005","title":"Image compression using plane fitting with inter-block prediction","year":2008,"lang":"en","type":"article","venue":"Image and Vision Computing","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Block (permutation group theory); Artificial intelligence; Image compression; Compression (physics); Computer science; Computer vision; Data compression; Image (mathematics); Plane (geometry); Color Cell Compression; Pattern recognition (psychology); Algorithm; Image processing; Mathematics; Geometry; Materials science","score_opus":0.01896011311072735,"score_gpt":0.31068729354801067,"score_spread":0.2917271804372833,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1992704442","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04568686,0.00042703527,0.9491077,0.00014190971,0.00011977814,0.000072077426,0.00017426268,0.0021389874,0.0021313108],"genre_scores_gemma":[0.28539988,0.00052268966,0.7077387,0.000095421456,0.00009062134,0.000072202376,0.0006955064,0.000391916,0.0049930587],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99963045,0.000054412223,0.000017887447,0.000056954115,0.00020100172,0.000039270748],"domain_scores_gemma":[0.9993925,0.00013660124,0.0000673826,0.00022597772,0.00015137477,0.000026008549],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033920494,0.00093227223,0.0007671315,0.0010621834,0.00041651892,0.00072302,0.00068856904,0.00063235743,0.0037469352],"category_scores_gemma":[0.001326208,0.00032674932,0.00045370765,0.0018636503,0.00030759143,0.0010855492,0.0007324754,0.001090927,0.0013626874],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00090076,0.00022960783,0.0021237948,0.00008135783,0.000101712234,0.00022321628,0.00010354182,0.078289755,0.1431824,0.007830265,0.005711084,0.7612224],"study_design_scores_gemma":[0.00003178502,0.00023411482,0.0019223347,0.0000136691315,0.000041645206,0.00044612706,0.000032656102,0.8460775,0.14277989,0.0023310704,0.0060575968,0.00003165325],"about_ca_topic_score_codex":0.0024905992,"about_ca_topic_score_gemma":0.0030999149,"teacher_disagreement_score":0.0037469352,"about_ca_system_score_codex":0.00038217095,"about_ca_system_score_gemma":0.0004891775,"threshold_uncertainty_score":0.012534738},"labels":[],"label_agreement":null},{"id":"W1992852642","doi":"10.1109/iccitechn.2011.6164776","title":"Efficient implementation of adaptive LZW algorithm for medical image compression","year":2011,"lang":"en","type":"article","venue":"","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Saskatchewan","funders":"Natural Sciences and Engineering Research Council of Canada; CMC Microsystems","keywords":"Computer science; Data compression; Encoder; Compression ratio; Image compression; Algorithm; Data compression ratio; Bandwidth (computing); Image quality; Image (mathematics); Computer vision; Artificial intelligence; Image processing; Engineering","score_opus":0.031150904888091375,"score_gpt":0.3409240742282291,"score_spread":0.30977316934013777,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1992852642","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011137921,0.00077744917,0.9838181,0.00013835395,0.00006996488,0.000119244105,0.000095357995,0.0017627802,0.0020808177],"genre_scores_gemma":[0.12649788,0.00065655104,0.8674083,0.00013173987,0.00009713296,0.0002861976,0.00057024794,0.00015730177,0.0041946415],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9994593,0.00009646674,0.000041299863,0.0000426542,0.0003215978,0.000038681916],"domain_scores_gemma":[0.9997062,0.00009410519,0.000026823378,0.000049259066,0.00010861863,0.000014995712],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005000927,0.00053847453,0.0004658787,0.0013027585,0.0003952037,0.0006627192,0.0011532129,0.00067953294,0.0034874987],"category_scores_gemma":[0.001282179,0.00015392214,0.00031262357,0.0010161835,0.00031135883,0.0009797338,0.000641749,0.00056469033,0.002010608],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00046661613,0.00012262253,0.00061301445,0.00035638953,0.0000509204,0.0003040821,0.0001854482,0.023873186,0.15578088,0.021520186,0.0068078497,0.7899188],"study_design_scores_gemma":[0.00016556226,0.0004177095,0.00087346626,0.000057491645,0.00004758408,0.0014718598,0.00008136319,0.61540115,0.33951458,0.009673164,0.03221935,0.00007676339],"about_ca_topic_score_codex":0.0006031673,"about_ca_topic_score_gemma":0.0006192715,"teacher_disagreement_score":0.0034874987,"about_ca_system_score_codex":0.00040705048,"about_ca_system_score_gemma":0.00075286336,"threshold_uncertainty_score":0.011666834},"labels":[],"label_agreement":null},{"id":"W1993065986","doi":"10.1109/tip.2005.860350","title":"Error resilient pre/post-filtering for DCT-based block coding systems","year":2005,"lang":"en","type":"article","venue":"IEEE Transactions on Image Processing","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":20,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Discrete cosine transform; Computer science; Robustness (evolution); Coding (social sciences); Transform coding; Data compression; Algorithm; Coding tree unit; Algorithmic efficiency; Coding gain; Lapped transform; Iterative reconstruction; Computer vision; Artificial intelligence; Decoding methods; Mathematics; Image (mathematics)","score_opus":0.023507816497707393,"score_gpt":0.30665008609391814,"score_spread":0.28314226959621075,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1993065986","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.020119786,0.0005131835,0.97808856,0.000087213106,0.000029033645,0.000038683054,0.000020494534,0.0002639391,0.0008390247],"genre_scores_gemma":[0.4447816,0.0014575907,0.5498211,0.0001439948,0.00010737606,0.00010728015,0.0001619116,0.0000901325,0.0033289765],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99942017,0.00012726021,0.000047302634,0.00006764607,0.00030035703,0.000037317615],"domain_scores_gemma":[0.9986872,0.00069861626,0.0001849773,0.00019329612,0.00021086023,0.000025084406],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00080218527,0.00060154486,0.0003641581,0.00041838927,0.000363173,0.00043043602,0.00041220535,0.00071605906,0.0008949409],"category_scores_gemma":[0.0028842858,0.0001867619,0.00027095535,0.00041123256,0.00042776924,0.00055738154,0.00026703867,0.00064889126,0.0004325692],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005336431,0.00014866813,0.0013398788,0.00028641315,0.000049785525,0.00034395806,0.00015382345,0.2489378,0.32196265,0.027744042,0.002241274,0.3962581],"study_design_scores_gemma":[0.000026144253,0.00032604125,0.0007645423,0.000036431215,0.000029629045,0.0005100065,0.000022526277,0.8535597,0.13405812,0.0057284352,0.004907104,0.00003131302],"about_ca_topic_score_codex":0.0010416136,"about_ca_topic_score_gemma":0.0013627387,"teacher_disagreement_score":0.0010416136,"about_ca_system_score_codex":0.0003242018,"about_ca_system_score_gemma":0.0003451099,"threshold_uncertainty_score":0.00424242},"labels":[],"label_agreement":null},{"id":"W1995345730","doi":"10.1109/tcomm.2014.2367014","title":"Flexible Symmetric Multiple Description Lattice Vector Quantizer With <inline-formula> <tex-math notation=\"TeX\">$L\\geq 3$</tex-math></inline-formula> Descriptions","year":2014,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Mathematics; Decoding methods; Lattice (music); Algorithm; Erasure; Notation; Discrete mathematics; Arithmetic; Computer science","score_opus":0.04422991991100132,"score_gpt":0.28563133392587653,"score_spread":0.2414014140148752,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1995345730","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0094298,0.00047070422,0.98566705,0.00017515096,0.00006694118,0.00009794673,0.00021536561,0.00072001736,0.0031570306],"genre_scores_gemma":[0.34894457,0.00047782168,0.6439868,0.00023794264,0.000054339485,0.00019836528,0.00050771603,0.00011263345,0.005479768],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995291,0.00009620923,0.000040530078,0.00007410109,0.00021516094,0.000044843884],"domain_scores_gemma":[0.9993987,0.00018281647,0.00008477806,0.00017720008,0.00012502624,0.000031508953],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00082241226,0.0004669805,0.00053871784,0.0003796389,0.00033727885,0.0010271863,0.001195162,0.00042584664,0.0039729266],"category_scores_gemma":[0.0017534154,0.00021656265,0.00030018616,0.000890323,0.0005299607,0.0015799527,0.00094977574,0.00092943583,0.0009830045],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00047754165,0.00014528199,0.0009352567,0.00043734783,0.00005958507,0.00029618508,0.00024542102,0.16415226,0.08214249,0.20176898,0.009884171,0.5394555],"study_design_scores_gemma":[0.00007760432,0.00014063495,0.00016660235,0.00003893733,0.000016347447,0.00028903736,0.000042216205,0.9204,0.04333272,0.023139114,0.012300477,0.00005631901],"about_ca_topic_score_codex":0.001699688,"about_ca_topic_score_gemma":0.0023746477,"teacher_disagreement_score":0.0039729266,"about_ca_system_score_codex":0.0007281864,"about_ca_system_score_gemma":0.0014994935,"threshold_uncertainty_score":0.013290763},"labels":[],"label_agreement":null},{"id":"W1995585537","doi":"10.1117/12.2057413","title":"Fixed tile rate codec for bandwidth saving in video processors","year":2014,"lang":"en","type":"article","venue":"Proceedings of SPIE, the International Society for Optical Engineering/Proceedings of SPIE","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Qualcomm (Canada)","funders":"","keywords":"Pixel; Computer science; Bitstream; Codec; Lossless compression; Data compression; Block size; Quantization (signal processing); Algorithm; Block (permutation group theory); Huffman coding; Computer hardware; Computer vision; Mathematics; Decoding methods","score_opus":0.011681987286100514,"score_gpt":0.24691652218213206,"score_spread":0.23523453489603155,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1995585537","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15486637,0.008002417,0.7593953,0.0009369613,0.001302939,0.0005939279,0.0013885887,0.010569625,0.0629438],"genre_scores_gemma":[0.6660546,0.002842911,0.2669385,0.0007870626,0.0002501844,0.00044898328,0.0021452983,0.0013118548,0.059220657],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996351,0.000027952572,0.000015599222,0.00005230761,0.00023131534,0.00003769179],"domain_scores_gemma":[0.99951327,0.00007179093,0.00005719961,0.00008842959,0.00024709373,0.000022209908],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017371683,0.0003535119,0.00027327397,0.00085266045,0.00038931833,0.00063689344,0.00085251546,0.0004149531,0.005935696],"category_scores_gemma":[0.00086384325,0.000114776,0.00020028217,0.0010684112,0.00031499425,0.0005394768,0.000383957,0.0006201217,0.0018388762],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00072917296,0.00011458855,0.0013889495,0.0005379639,0.00005201127,0.00066624535,0.00016227279,0.011855575,0.45809662,0.03226292,0.025771989,0.46836165],"study_design_scores_gemma":[0.00011805569,0.0007513486,0.0030983838,0.00020302029,0.00009998276,0.0020037785,0.000080494545,0.129373,0.6720046,0.0045359004,0.18761142,0.00011998582],"about_ca_topic_score_codex":0.0019644857,"about_ca_topic_score_gemma":0.0024375536,"teacher_disagreement_score":0.005935696,"about_ca_system_score_codex":0.000724194,"about_ca_system_score_gemma":0.0005468394,"threshold_uncertainty_score":0.01985687},"labels":[],"label_agreement":null},{"id":"W1996101106","doi":"10.1109/ccece.2013.6567756","title":"Effect of timing error on equalizer performance","year":2013,"lang":"en","type":"article","venue":"","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Saskatchewan","funders":"","keywords":"Equalizer; Adaptive equalizer; Computer science; Sensitivity (control systems); Modulation (music); Convergence (economics); Bit error rate; Electronic engineering; Algorithm; Telecommunications; Engineering; Decoding methods; Acoustics; Channel (broadcasting); Physics","score_opus":0.022374631521420548,"score_gpt":0.3159533106810242,"score_spread":0.2935786791596037,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1996101106","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9076478,0.001779344,0.08154667,0.0004386258,0.00020293276,0.00007466526,0.00041458884,0.0013351388,0.0065603214],"genre_scores_gemma":[0.9907107,0.00044963718,0.0067637465,0.00015396006,0.000064390195,0.000019836216,0.00016681396,0.00018196911,0.0014888907],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99696416,0.00083306007,0.00024174678,0.00061210134,0.0010032188,0.0003457504],"domain_scores_gemma":[0.95454043,0.038971208,0.0024030586,0.0015745492,0.002261605,0.00024927317],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031317587,0.0008998386,0.0006727015,0.0008842369,0.00043996706,0.0007996499,0.00042119127,0.0014370792,0.0025647322],"category_scores_gemma":[0.026901793,0.00040152238,0.0003106096,0.0007990238,0.0005690419,0.0016637857,0.00064306846,0.0009640597,0.00056030875],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.008218151,0.0003229861,0.030191528,0.00069798005,0.0004443241,0.0017447657,0.00056629954,0.32410413,0.51916623,0.0043843808,0.0007767781,0.10938251],"study_design_scores_gemma":[0.00011205216,0.00260246,0.030826937,0.000074382115,0.00031616635,0.0018599146,0.00009873454,0.13716458,0.82382524,0.0011680102,0.0017986925,0.00015281794],"about_ca_topic_score_codex":0.0007589318,"about_ca_topic_score_gemma":0.00058374036,"teacher_disagreement_score":0.0031317587,"about_ca_system_score_codex":0.0006755476,"about_ca_system_score_gemma":0.00037131447,"threshold_uncertainty_score":0.016562521},"labels":[],"label_agreement":null},{"id":"W1997694404","doi":"10.1109/glocom.2013.6831107","title":"Progressive compression and transmission of images: Experimental evaluation over Visual Sensor Networks","year":2013,"lang":"en","type":"article","venue":"","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"Canada Research Chairs","keywords":"JPEG; Testbed; Computer science; Computer vision; Artificial intelligence; Image compression; JPEG 2000; Data compression; Transmission (telecommunications); Image sensor; Lossless JPEG; Visual sensor network; Image processing; Computer graphics (images); Image (mathematics); Key distribution in wireless sensor networks; Computer network; Telecommunications","score_opus":0.013453951472371477,"score_gpt":0.326122717388181,"score_spread":0.3126687659158095,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1997694404","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9670948,0.00049794203,0.0281764,0.00013825511,0.000104061895,0.00027687426,0.00026831045,0.0007184531,0.002724945],"genre_scores_gemma":[0.9732676,0.00047081625,0.024160128,0.000043860022,0.000022620157,0.00011745333,0.00040086627,0.00006496641,0.0014516426],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9991227,0.00014951476,0.000060713104,0.00012257112,0.00041668632,0.00012791042],"domain_scores_gemma":[0.9969356,0.0014682405,0.00032626215,0.00029822005,0.00078079844,0.00019091088],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001007377,0.00075600366,0.0004232006,0.0010328867,0.0003213817,0.00040876513,0.0010143124,0.0006352082,0.0015446872],"category_scores_gemma":[0.005149842,0.00014954322,0.00019687673,0.0009303644,0.00059185753,0.00089798815,0.0006005278,0.00039556046,0.00020991571],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.004879373,0.0029557492,0.0039332886,0.001766827,0.00019450265,0.0011794504,0.0006186495,0.2652726,0.5125184,0.0020328714,0.0027580662,0.2018902],"study_design_scores_gemma":[0.00037523775,0.010459351,0.008509097,0.00012966806,0.00013080376,0.0011288929,0.0005015926,0.56058353,0.4139984,0.0011066633,0.0029944482,0.00008244075],"about_ca_topic_score_codex":0.002034876,"about_ca_topic_score_gemma":0.0014039209,"teacher_disagreement_score":0.002034876,"about_ca_system_score_codex":0.0004402628,"about_ca_system_score_gemma":0.00033755,"threshold_uncertainty_score":0.0053275824},"labels":[],"label_agreement":null},{"id":"W1998243788","doi":"10.1109/isit.2013.6620287","title":"Optimal multiresolution quantization with error detecting codes for broadcast channels","year":2013,"lang":"en","type":"article","venue":"","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Quantization (signal processing); Vector quantization; Algorithm; Computer science; Redundancy (engineering); Decoding methods; Probability of error; Coding (social sciences); Cyclic redundancy check; Error detection and correction; Mathematics; Statistics","score_opus":0.02994627147733205,"score_gpt":0.2936187508964378,"score_spread":0.26367247941910577,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1998243788","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019864902,0.0006505635,0.97828627,0.0001378626,0.000019625446,0.000026840056,0.000035599438,0.00014082831,0.00083762675],"genre_scores_gemma":[0.66977245,0.0006023492,0.32831544,0.00009682875,0.000063066946,0.00006707797,0.00008661927,0.000058366626,0.0009378344],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981172,0.0005890629,0.000094676354,0.0002447637,0.00078582065,0.0001685191],"domain_scores_gemma":[0.9965946,0.002032686,0.00047020803,0.00026806977,0.0005676867,0.000066760564],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015007214,0.0006864069,0.0009212514,0.00056290143,0.0004041743,0.0007794151,0.00074098003,0.0005693172,0.00077029614],"category_scores_gemma":[0.008163303,0.0003407019,0.00025272928,0.00082052656,0.00074549636,0.0015697022,0.0008402266,0.00076389476,0.00021011576],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00040620903,0.000076219956,0.00077294215,0.00021012235,0.000037717695,0.00014572153,0.00023500292,0.68306726,0.027474767,0.06850986,0.0015320024,0.21753211],"study_design_scores_gemma":[0.000021924381,0.000085014115,0.000106975145,0.00001632425,0.000010246932,0.00006380575,0.00002390517,0.98171645,0.0072494578,0.009908158,0.0007788551,0.000018868499],"about_ca_topic_score_codex":0.0020263928,"about_ca_topic_score_gemma":0.0022387602,"teacher_disagreement_score":0.0020263928,"about_ca_system_score_codex":0.0009067597,"about_ca_system_score_gemma":0.0009341946,"threshold_uncertainty_score":0.007936716},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.03814222906508322,"score_gpt":0.3354868431399719,"score_spread":0.29734461407488866,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1998468704","genre_codex":"methods","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00908346,0.14903247,0.8193368,0.0011060323,0.00071746146,0.0002434372,0.0002860909,0.00080728007,0.019387009],"genre_scores_gemma":[0.08190945,0.24566378,0.6516849,0.000714582,0.0011811565,0.00040216904,0.0011253237,0.00021161074,0.01710718],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99953103,0.00006461875,0.000046456837,0.000055919932,0.00028445947,0.000017540062],"domain_scores_gemma":[0.9994167,0.00021734912,0.000044105553,0.000053883225,0.0002548179,0.000013169061],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005203935,0.00075330544,0.0006177156,0.0018846652,0.0003515705,0.0009037709,0.000802246,0.0008067871,0.0024606837],"category_scores_gemma":[0.0017909076,0.00027789158,0.00040306288,0.0025442408,0.00033527854,0.0012488799,0.0004287329,0.00066335144,0.0012933643],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000062018225,0.00004354722,0.0004075068,0.0011406881,0.000034871646,0.0000870782,0.000052651452,0.013112829,0.00974058,0.014664588,0.008668923,0.95198476],"study_design_scores_gemma":[0.000070215385,0.0005356476,0.0041366187,0.0016965133,0.00014919929,0.0040252,0.00023894083,0.39384377,0.058205705,0.04385111,0.49308896,0.0001581114],"about_ca_topic_score_codex":0.00096112036,"about_ca_topic_score_gemma":0.0010692042,"teacher_disagreement_score":0.0024606837,"about_ca_system_score_codex":0.00042251492,"about_ca_system_score_gemma":0.0005504471,"threshold_uncertainty_score":0.008231819},"labels":[],"label_agreement":null},{"id":"W1999760780","doi":"10.1109/tit.2003.813484","title":"Near-ellipsoidal voronoi coding","year":2003,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Sherbrooke","funders":"","keywords":"Voronoi diagram; Lambda; Combinatorics; Mathematics; Lattice (music); Ellipsoid; Discrete mathematics; Algorithm; Geometry; Physics; Quantum mechanics","score_opus":0.01112130308934732,"score_gpt":0.24285952335488822,"score_spread":0.23173822026554092,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1999760780","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18260652,0.00020503518,0.7965443,0.00013710934,0.000030900053,0.000075810516,0.0002239142,0.00023125278,0.019945232],"genre_scores_gemma":[0.8142621,0.00015178925,0.17918071,0.000065736815,0.000023440256,0.00007324239,0.0003124847,0.00005915368,0.0058714147],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991472,0.0001687398,0.000041999177,0.00012653996,0.00038166743,0.00013384415],"domain_scores_gemma":[0.99823123,0.0006130736,0.00021180531,0.00037348742,0.00041480103,0.00015557575],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046631612,0.0002100657,0.0003594963,0.00039315296,0.00060633774,0.00095860637,0.0009687781,0.00049468904,0.0020216096],"category_scores_gemma":[0.004033648,0.0001980176,0.00026234184,0.00079527625,0.0009388931,0.0009933463,0.0011342133,0.0005960808,0.0004522555],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022839477,0.00004737003,0.0015496695,0.00007306029,0.000016084367,0.00046049425,0.00033347437,0.25329605,0.017928775,0.65177804,0.0016878744,0.07260071],"study_design_scores_gemma":[0.000022579157,0.00005180793,0.0005158432,0.000011982807,0.0000062925897,0.00047772052,0.00012456032,0.8238732,0.009141718,0.15807638,0.0076709967,0.000026923211],"about_ca_topic_score_codex":0.0028989716,"about_ca_topic_score_gemma":0.0035822373,"teacher_disagreement_score":0.0028989716,"about_ca_system_score_codex":0.0006102412,"about_ca_system_score_gemma":0.0006669876,"threshold_uncertainty_score":0.0067629814},"labels":[],"label_agreement":null},{"id":"W2000728570","doi":"10.1109/tip.2009.2032344","title":"Directional Lapped Transforms for Image Coding","year":2009,"lang":"en","type":"article","venue":"IEEE Transactions on Image Processing","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":29,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Lapped transform; Discrete cosine transform; Transform coding; Modified discrete cosine transform; Mathematics; Computer vision; Coding (social sciences); Discrete sine transform; Artificial intelligence; Image compression; Algorithm; Computer science; Image (mathematics); Image processing; Fractional Fourier transform; Fourier transform; Mathematical analysis","score_opus":0.017785521960085045,"score_gpt":0.3041373479634017,"score_spread":0.28635182600331666,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2000728570","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0034029323,0.001550878,0.9897127,0.00011338348,0.00008734948,0.000028065475,0.000047840338,0.00026223456,0.004794695],"genre_scores_gemma":[0.12327192,0.00463945,0.86339504,0.00035858311,0.00024070262,0.0001482913,0.0003512086,0.00017019609,0.007424642],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998053,0.00003442538,0.000011364351,0.000029339099,0.00010463927,0.000015034516],"domain_scores_gemma":[0.99977964,0.0000700834,0.000020467387,0.000056281213,0.00006287731,0.000010555682],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022771435,0.0005231745,0.00028160738,0.0005284557,0.00018774175,0.00072388595,0.0004094277,0.00047678963,0.0034893518],"category_scores_gemma":[0.00087849563,0.00016766792,0.00030200498,0.0006996362,0.00050435733,0.000952679,0.0005684285,0.0010387216,0.001345171],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015569097,0.000037272584,0.0003106877,0.0003695311,0.000034497323,0.0003242923,0.00013897278,0.036378723,0.14520429,0.3156803,0.0069550867,0.4944107],"study_design_scores_gemma":[0.000050058123,0.00026608817,0.00042514972,0.00015201974,0.00006627356,0.0017951363,0.00010432452,0.5230611,0.16421591,0.12803401,0.18174547,0.000084478685],"about_ca_topic_score_codex":0.00033694317,"about_ca_topic_score_gemma":0.0004840354,"teacher_disagreement_score":0.0034893518,"about_ca_system_score_codex":0.00025225047,"about_ca_system_score_gemma":0.00025071425,"threshold_uncertainty_score":0.011673033},"labels":[],"label_agreement":null},{"id":"W2003191604","doi":"10.1109/bsc.2010.5472984","title":"Rateless code based multimedia multicasting with outage probability constraints","year":2010,"lang":"en","type":"article","venue":"","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Multicast; Computer science; Transmission (telecommunications); Asynchronous communication; Encoding (memory); Computer network; Scheme (mathematics); Outage probability; Code (set theory); Fading; Telecommunications; Channel (broadcasting); Mathematics; Artificial intelligence","score_opus":0.021846985588896025,"score_gpt":0.2781131068693714,"score_spread":0.2562661212804754,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2003191604","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.033651594,0.00036668804,0.9636142,0.0001145921,0.00003807634,0.00004378604,0.000041979234,0.00025675402,0.0018723503],"genre_scores_gemma":[0.8165649,0.00053329265,0.1805764,0.00011448734,0.00010469731,0.00013821732,0.000090650494,0.000050864433,0.0018264343],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990695,0.0002448036,0.000047996342,0.000062582796,0.0004854208,0.00008967367],"domain_scores_gemma":[0.99734384,0.001205312,0.00041921553,0.00031780597,0.000646491,0.00006731216],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00094102946,0.0007016106,0.000727731,0.0005621508,0.00047352043,0.00075413,0.0012190662,0.0007351762,0.00060848787],"category_scores_gemma":[0.004836001,0.00022581624,0.00023822852,0.00075284834,0.00045915926,0.0010569255,0.0007863595,0.0008499322,0.0001876197],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00034561186,0.00015165351,0.0013734504,0.00042328011,0.000073922914,0.0009651987,0.0003914787,0.5383329,0.07473715,0.13477653,0.0026992562,0.24572957],"study_design_scores_gemma":[0.000016840273,0.00014950114,0.00021178518,0.00001646982,0.000022437629,0.00041496838,0.000017886246,0.97430444,0.011482525,0.01189091,0.0014542427,0.000018026976],"about_ca_topic_score_codex":0.000687742,"about_ca_topic_score_gemma":0.00083239825,"teacher_disagreement_score":0.0012190662,"about_ca_system_score_codex":0.00054606976,"about_ca_system_score_gemma":0.00063703547,"threshold_uncertainty_score":0.00497669},"labels":[],"label_agreement":null},{"id":"W2003689580","doi":"10.1167/14.10.1447","title":"Visual coding in the superior colliculus during unconstrained viewing of natural dynamic video","year":2014,"lang":"en","type":"article","venue":"Journal of Vision","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Saccade; Superior colliculus; Stimulus (psychology); Fixation (population genetics); Eye movement; Computer science; Neuroscience; Artificial intelligence; Psychology; Computer vision; Cognitive psychology; Chemistry","score_opus":0.007334090794580754,"score_gpt":0.3030086312011691,"score_spread":0.29567454040658836,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2003689580","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.998711,0.000044329696,0.00090279843,0.000012816993,0.0000021417386,0.000005533932,0.00007489634,0.000016756127,0.00022973008],"genre_scores_gemma":[0.9991371,0.000033599386,0.00054664764,0.000011401532,0.00000244696,0.000009070384,0.00010395485,0.000008129129,0.00014769722],"study_design_codex":"bench_or_experimental","study_design_gemma":"observational","domain_scores_codex":[0.99995947,0.000004442002,0.0000018206208,0.000012290158,0.000010521818,0.000011533583],"domain_scores_gemma":[0.9998826,0.000045932495,0.000020877958,0.000008951419,0.000018152288,0.000023578947],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00006772716,0.00011275361,0.00015903817,0.00012501059,0.00013054429,0.00018255295,0.000087666864,0.00015663682,0.0005164989],"category_scores_gemma":[0.00072033604,0.00008701713,0.00015617523,0.00010927722,0.00015897192,0.00014136646,0.00020188329,0.00018581586,0.000045346336],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003064949,0.000024014622,0.010526695,0.0000569379,0.000031350944,0.00019356827,0.00019973223,0.0012211268,0.9812409,0.00013793641,0.00011849531,0.005942772],"study_design_scores_gemma":[0.00003133026,0.0003546463,0.8830254,0.00002080396,0.000043239594,0.00034259414,0.00020134481,0.049870938,0.06498381,0.0007310766,0.0003706331,0.000024105115],"about_ca_topic_score_codex":0.0056928988,"about_ca_topic_score_gemma":0.0074174292,"teacher_disagreement_score":0.0056928988,"about_ca_system_score_codex":0.00031118433,"about_ca_system_score_gemma":0.0001969432,"threshold_uncertainty_score":0.011319518},"labels":[],"label_agreement":null},{"id":"W2004115810","doi":"10.1109/tip.2009.2028923","title":"Fast Parallel Approach for 2-D DHT-Based Real-Valued Discrete Gabor Transform","year":2009,"lang":"en","type":"article","venue":"IEEE Transactions on Image Processing","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Windsor","funders":"","keywords":"Gabor transform; Computational complexity theory; Discrete Hartley transform; Computer science; Inverse; Algorithm; S transform; Block (permutation group theory); Image processing; Image (mathematics); Artificial intelligence; Mathematics; Time–frequency analysis; Computer vision; Fractional Fourier transform; Fourier transform; Discrete wavelet transform; Combinatorics; Fourier analysis; Wavelet transform","score_opus":0.019414176905339076,"score_gpt":0.30248958120129965,"score_spread":0.28307540429596056,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2004115810","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0036900486,0.00009844579,0.99422896,0.000053526033,0.000036969028,0.0000271346,0.00001966945,0.00043651465,0.0014088029],"genre_scores_gemma":[0.08396462,0.00033138567,0.91093016,0.00007847707,0.000072029434,0.000088559704,0.0001759276,0.000121154975,0.004237693],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995234,0.000063738924,0.00002634316,0.000054943037,0.00029489002,0.000036638507],"domain_scores_gemma":[0.9994012,0.00022778334,0.000040020266,0.00014321931,0.0001674488,0.000020220083],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00050327537,0.0005896094,0.0005931151,0.0007205159,0.00033089574,0.00087474147,0.00073781976,0.00059085037,0.0049950224],"category_scores_gemma":[0.0014497781,0.0002881701,0.00053203123,0.00078927533,0.00041228373,0.0010349888,0.00072691584,0.0007184617,0.0020355307],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003795675,0.00010905471,0.0007039608,0.00016275252,0.00004890162,0.00025224485,0.00013927813,0.055950012,0.08597625,0.030454988,0.0038554063,0.82196766],"study_design_scores_gemma":[0.00006448124,0.00012649942,0.00054743915,0.000014328788,0.0000310576,0.0007037733,0.000042059783,0.9248642,0.04876054,0.008620923,0.016188273,0.000036525238],"about_ca_topic_score_codex":0.001511102,"about_ca_topic_score_gemma":0.0022137898,"teacher_disagreement_score":0.0049950224,"about_ca_system_score_codex":0.0004345454,"about_ca_system_score_gemma":0.0006687142,"threshold_uncertainty_score":0.016709983},"labels":[],"label_agreement":null},{"id":"W2005157037","doi":"10.1109/isit.2011.6034036","title":"Scalar quantization with Rényi entropy constraint","year":2011,"lang":"en","type":"article","venue":"","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Companding; Quantization (signal processing); Mathematics; Entropy (arrow of time); Vector quantization; Rate–distortion theory; Constructive; Applied mathematics; Rate distortion; Statistical physics; Algorithm; Computer science; Physics; Quantum mechanics; Estimator; Data compression; Statistics; Coding (social sciences)","score_opus":0.04305476764432897,"score_gpt":0.25985305991835855,"score_spread":0.21679829227402958,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2005157037","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.036019273,0.0021897939,0.9309897,0.0010346252,0.00011658319,0.000046403937,0.00017875875,0.0001505927,0.029274313],"genre_scores_gemma":[0.9123322,0.002290197,0.07540929,0.00020844229,0.00017613186,0.000047983624,0.000102503094,0.000059649366,0.009373729],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99933404,0.00018645369,0.000030725907,0.00009372683,0.0002807302,0.00007426008],"domain_scores_gemma":[0.99902177,0.0005616381,0.00013160062,0.000090515256,0.00016259187,0.00003188658],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012443804,0.0005966508,0.00068657764,0.0003954059,0.0003088008,0.0011198934,0.0006523289,0.0006562643,0.0031187495],"category_scores_gemma":[0.0037011816,0.00025013476,0.00028728816,0.0007969418,0.0013751319,0.001974646,0.0009343855,0.00092724845,0.00050830765],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013069676,0.00002289779,0.00026780763,0.00014913488,0.00001678907,0.00021751002,0.00009816303,0.19983171,0.0062811426,0.7652357,0.0015470359,0.026201423],"study_design_scores_gemma":[0.000023926414,0.00009444472,0.00018074672,0.00004269422,0.000012529031,0.00018779545,0.00004308352,0.7552617,0.0046188277,0.23699445,0.0025110524,0.000028681097],"about_ca_topic_score_codex":0.0009569292,"about_ca_topic_score_gemma":0.0006217263,"teacher_disagreement_score":0.0031187495,"about_ca_system_score_codex":0.0010879863,"about_ca_system_score_gemma":0.0006159117,"threshold_uncertainty_score":0.010433257},"labels":[],"label_agreement":null},{"id":"W2005849497","doi":"10.1145/1089737.1089744","title":"QoS- based JPEG images transmission protocol for wireless CDMA communication systems","year":2005,"lang":"en","type":"article","venue":"","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Computer science; Wireless; Multipath propagation; Computer network; Transmission (telecommunications); Wireless network; Quality of service; Radio resource management; Wi-Fi array; JPEG; Real-time computing; Channel (broadcasting); Telecommunications; Data compression; Algorithm","score_opus":0.029808987280882177,"score_gpt":0.346667321667877,"score_spread":0.31685833438699484,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2005849497","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.028749686,0.0008023693,0.96345145,0.0005328008,0.00029724595,0.00086935214,0.0001521503,0.0016246345,0.0035202436],"genre_scores_gemma":[0.5755837,0.0009555287,0.41416717,0.00055956224,0.00021632771,0.0012977417,0.00053932157,0.00018337945,0.0064973095],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99896705,0.00029978942,0.00012463945,0.00009964463,0.0004356281,0.000073183764],"domain_scores_gemma":[0.9978377,0.00071494735,0.00023263982,0.00033912677,0.0007589667,0.000116695184],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015489875,0.0005172325,0.00044625663,0.00051694765,0.0006240835,0.0007422429,0.0008395995,0.0008070451,0.0017311621],"category_scores_gemma":[0.004769533,0.00021457674,0.00020652171,0.00045229212,0.00063481875,0.0010505314,0.0008016771,0.0011283471,0.0004581286],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0021557806,0.0006068467,0.002392847,0.0010506451,0.00015359341,0.0014332526,0.00077521446,0.09495989,0.36193752,0.12378501,0.020942397,0.38980702],"study_design_scores_gemma":[0.0003092168,0.0008653346,0.001177733,0.00006465508,0.00009405726,0.0012086057,0.00010097387,0.80886656,0.13143332,0.016290516,0.039460525,0.00012854031],"about_ca_topic_score_codex":0.0011152879,"about_ca_topic_score_gemma":0.0012095033,"teacher_disagreement_score":0.0017311621,"about_ca_system_score_codex":0.0007577177,"about_ca_system_score_gemma":0.0008298873,"threshold_uncertainty_score":0.008191943},"labels":[],"label_agreement":null},{"id":"W2006595939","doi":"10.1109/icip.2011.6115865","title":"L<inf>2</inf> restoration of L<inf>∞</inf>-decoded images with context modeling","year":2011,"lang":"en","type":"article","venue":"","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Decoding methods; Encoder; Lossless compression; Algorithm; Computer science; Coding (social sciences); Pixel; Artificial intelligence; Mathematics; Data compression; Statistics","score_opus":0.04757131477943198,"score_gpt":0.2731982054103786,"score_spread":0.2256268906309466,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2006595939","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0263407,0.00051279634,0.9653288,0.00040216828,0.00011514136,0.000048160193,0.00014083917,0.0013462846,0.005764991],"genre_scores_gemma":[0.4297868,0.0010285288,0.54606295,0.0006316683,0.000132261,0.000081815895,0.0005230211,0.0006886538,0.021064283],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99943763,0.000095849864,0.0000337374,0.000107606385,0.00026598014,0.00005929563],"domain_scores_gemma":[0.9993862,0.00013602177,0.000073909054,0.00021637502,0.00015085543,0.000036649133],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00052728766,0.0010745018,0.00063672534,0.0005794402,0.00041036826,0.001537338,0.0011243621,0.0009919788,0.004016274],"category_scores_gemma":[0.0022546225,0.00033533032,0.0006563012,0.0004165723,0.0007766319,0.0015340865,0.0015907024,0.0014329733,0.0016644583],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007000849,0.00014701934,0.0014339201,0.00027903295,0.000061158156,0.0008062506,0.00036291452,0.15975372,0.18066092,0.075033,0.007122652,0.5736393],"study_design_scores_gemma":[0.000015632957,0.00008196632,0.0006358656,0.0000413499,0.000024354855,0.0003730499,0.000044962264,0.8683086,0.104916975,0.015328426,0.010177475,0.000051291256],"about_ca_topic_score_codex":0.006131379,"about_ca_topic_score_gemma":0.012252886,"teacher_disagreement_score":0.006131379,"about_ca_system_score_codex":0.00084683846,"about_ca_system_score_gemma":0.0014067647,"threshold_uncertainty_score":0.013435781},"labels":[],"label_agreement":null},{"id":"W2007294857","doi":"10.1117/12.862846","title":"Variable length coding for binary sources and applications in video compression","year":2010,"lang":"en","type":"article","venue":"Proceedings of SPIE, the International Society for Optical Engineering/Proceedings of SPIE","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Blackberry (Canada)","funders":"University of Waterloo","keywords":"Computer science; Decoding methods; Lossless compression; Entropy encoding; Context-adaptive binary arithmetic coding; Data compression; Binary number; Encoding (memory); Tunstall coding; Algorithm; Coding (social sciences); Entropy (arrow of time); Theoretical computer science; Arithmetic; Artificial intelligence; Mathematics","score_opus":0.010139684231790189,"score_gpt":0.24575793503058543,"score_spread":0.23561825079879525,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2007294857","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011922232,0.0058093397,0.97275996,0.00043288618,0.00019201972,0.000062126965,0.00008364452,0.00040176886,0.008336077],"genre_scores_gemma":[0.29244632,0.0085595185,0.6881727,0.00046748228,0.00043709404,0.0002097156,0.00035332487,0.00014868908,0.009205106],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997403,0.00006258147,0.000014189259,0.000025924423,0.00014056118,0.000016478834],"domain_scores_gemma":[0.9996228,0.00021209149,0.000044808545,0.00005509858,0.00005606412,0.0000091042675],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035147194,0.00039851668,0.00024002783,0.0006547653,0.00021611771,0.00047558543,0.0005903044,0.000611692,0.0022193887],"category_scores_gemma":[0.0015418122,0.00014125758,0.00018443339,0.00093947165,0.0005609751,0.00084393844,0.00044094282,0.0009775413,0.00082607224],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021060157,0.00006143749,0.00031235346,0.00045836798,0.000023741622,0.00018655614,0.000114671035,0.03445751,0.09580514,0.37347198,0.0039776294,0.49092004],"study_design_scores_gemma":[0.00009337745,0.00034557207,0.00064264535,0.00038267998,0.000046917095,0.0010657284,0.00004121883,0.49623105,0.15047128,0.26531824,0.085272506,0.00008876587],"about_ca_topic_score_codex":0.0003116659,"about_ca_topic_score_gemma":0.00046833657,"teacher_disagreement_score":0.0022193887,"about_ca_system_score_codex":0.0003619344,"about_ca_system_score_gemma":0.00028472554,"threshold_uncertainty_score":0.0074245334},"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,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.010549331787016284,"score_gpt":0.252056479072526,"score_spread":0.2415071472855097,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2007759781","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05719729,0.006350816,0.92686886,0.0011801054,0.00047131878,0.00010613061,0.00012605677,0.0007068599,0.0069925897],"genre_scores_gemma":[0.8093591,0.003940511,0.17106669,0.00028371814,0.00078007206,0.00019012256,0.00040922096,0.00010259121,0.013868047],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99887604,0.00032405177,0.000048752685,0.00008400299,0.00056089566,0.00010630443],"domain_scores_gemma":[0.9973838,0.0016500157,0.00014760911,0.00020263532,0.0005391588,0.00007683742],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015450837,0.00034370786,0.0008434352,0.0009779484,0.0007040154,0.0008881506,0.0012011691,0.0009710296,0.0017829601],"category_scores_gemma":[0.0038019884,0.00038358787,0.00020715813,0.0011193559,0.00047185956,0.0019961076,0.000728159,0.0007555568,0.00031792678],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007383724,0.00031480344,0.0016989362,0.0005639108,0.00009939693,0.0004973592,0.00031226754,0.24979374,0.027067889,0.1274348,0.017851144,0.57362735],"study_design_scores_gemma":[0.00004771676,0.000083688676,0.00042696184,0.0000233617,0.000030398323,0.00017211838,0.00007647124,0.95678174,0.0055294693,0.031004865,0.0058043054,0.000018801196],"about_ca_topic_score_codex":0.002017825,"about_ca_topic_score_gemma":0.0020767655,"teacher_disagreement_score":0.002017825,"about_ca_system_score_codex":0.00086047256,"about_ca_system_score_gemma":0.000573228,"threshold_uncertainty_score":0.00817132},"labels":[],"label_agreement":null},{"id":"W2007838037","doi":"10.1109/icip.2006.312524","title":"Enhanced Multiple Description Decoder for Error-Prone Channels","year":2006,"lang":"en","type":"article","venue":"","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Computer science; Algorithm; Residual; Coding (social sciences); Decoding methods; Computational complexity theory; Distortion (music); Channel (broadcasting); Range (aeronautics); Multiple description coding; Mathematics; Bandwidth (computing); Telecommunications","score_opus":0.03344641233332462,"score_gpt":0.28803136395210954,"score_spread":0.2545849516187849,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2007838037","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00922386,0.00024767718,0.9891262,0.000094277806,0.000031715892,0.00003645356,0.00011123938,0.00034543188,0.0007832448],"genre_scores_gemma":[0.35187328,0.00046453293,0.64094216,0.00018853736,0.00006320278,0.00014086107,0.0007035603,0.000085616484,0.0055382694],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99936587,0.00017291418,0.00005142508,0.00007189036,0.00028456465,0.000053237523],"domain_scores_gemma":[0.9986815,0.00057657034,0.00012293307,0.0002407358,0.00034539876,0.000032836357],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011625246,0.00041114277,0.0007179032,0.00044033313,0.0003029015,0.00062154565,0.0009377108,0.00066108006,0.0014642578],"category_scores_gemma":[0.0024478247,0.00021488241,0.00024886898,0.0004692884,0.00036853447,0.0008675932,0.00094528036,0.00084175635,0.00052893366],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00081657537,0.00013241192,0.001483439,0.0005323321,0.000113736554,0.0005976062,0.00021753433,0.27896127,0.07812442,0.15005279,0.007843022,0.48112503],"study_design_scores_gemma":[0.000059899383,0.000080868835,0.00018518318,0.000018195204,0.000019403913,0.00023021246,0.000014999073,0.95745534,0.028091053,0.009753351,0.004067681,0.00002378027],"about_ca_topic_score_codex":0.0013604946,"about_ca_topic_score_gemma":0.0023254768,"teacher_disagreement_score":0.0014642578,"about_ca_system_score_codex":0.00048953807,"about_ca_system_score_gemma":0.0016932244,"threshold_uncertainty_score":0.0061481},"labels":[],"label_agreement":null},{"id":"W2008249050","doi":"10.1109/tit.2014.2373382","title":"Randomized Quantization and Source Coding With Constrained Output Distribution","year":2014,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":20,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Quantization (signal processing); Vector quantization; Rate–distortion theory; Probability distribution; Distortion (music); Joint probability distribution; Mathematical optimization; Applied mathematics; Algorithm; Data compression; Control theory (sociology); Computer science; Statistics; Artificial intelligence","score_opus":0.007630340906766237,"score_gpt":0.2248557356607354,"score_spread":0.21722539475396918,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2008249050","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013745996,0.0009849956,0.98118144,0.00037478033,0.000053378673,0.000023139486,0.00008054375,0.00015436266,0.0034012438],"genre_scores_gemma":[0.79110444,0.0023693778,0.19986814,0.0002815457,0.00024782075,0.00013929218,0.00025654573,0.00014037944,0.0055924095],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99782324,0.0009859254,0.0000963599,0.00027874025,0.0006512257,0.00016455133],"domain_scores_gemma":[0.99739754,0.0017906977,0.00028820522,0.00026895362,0.00022159333,0.000032954977],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019126001,0.0005877513,0.00082599354,0.0004909898,0.00031400326,0.001111906,0.0011378061,0.00089828,0.0013205884],"category_scores_gemma":[0.007945561,0.00035227602,0.00046144263,0.0011922466,0.0015349822,0.0026794155,0.00088948023,0.0012284325,0.00038469856],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012491125,0.0000223627,0.00017432864,0.00009891561,0.000029510855,0.00009552276,0.000056992587,0.37594226,0.0052177617,0.59142894,0.000724923,0.026083577],"study_design_scores_gemma":[0.00002279164,0.000039877283,0.00007398845,0.000023295888,0.00001043541,0.00006825358,0.000010469262,0.8815253,0.0029841226,0.11372952,0.0014918877,0.000020030418],"about_ca_topic_score_codex":0.0016495152,"about_ca_topic_score_gemma":0.0010573348,"teacher_disagreement_score":0.0019126001,"about_ca_system_score_codex":0.00139578,"about_ca_system_score_gemma":0.0009935299,"threshold_uncertainty_score":0.010127127},"labels":[],"label_agreement":null},{"id":"W2009605565","doi":"10.1109/twc.2013.062413.122017","title":"Designing Optimal Multiresolution Quantizers with Error Detecting Codes","year":2013,"lang":"en","type":"article","venue":"IEEE Transactions on Wireless Communications","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Vector quantization; Quantization (signal processing); Computer science; Algorithm; Decoding methods; Redundancy (engineering); Coding (social sciences); Mathematics","score_opus":0.044973149826657316,"score_gpt":0.3006034573517701,"score_spread":0.25563030752511273,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2009605565","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014504158,0.0003866143,0.9839787,0.00009566323,0.000021026774,0.000035249166,0.000023985313,0.00009483436,0.0008599581],"genre_scores_gemma":[0.5592665,0.0005456289,0.43863225,0.00013491599,0.0000575349,0.00011228747,0.000065803986,0.00004107319,0.0011440348],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99881846,0.0003070852,0.00006718064,0.0001997767,0.0005020035,0.00010550116],"domain_scores_gemma":[0.9982426,0.0009111661,0.0003558177,0.00014689469,0.0002995763,0.00004400772],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013889049,0.00059685163,0.0008095769,0.00046929848,0.00030201708,0.0008641149,0.00094586186,0.0007736075,0.00093298],"category_scores_gemma":[0.006162064,0.00044683687,0.0002488716,0.0005076617,0.00068412605,0.0014094186,0.0009368971,0.00075276825,0.00024757255],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00038050918,0.000089308574,0.00095184374,0.00031258859,0.000065632885,0.0001746582,0.00031893948,0.61008096,0.07026352,0.10001502,0.0017153199,0.21563178],"study_design_scores_gemma":[0.00003113946,0.000101759906,0.000092762464,0.000020689162,0.000011700787,0.00005010745,0.000024352952,0.9814663,0.009982558,0.0070444755,0.0011549315,0.00001938103],"about_ca_topic_score_codex":0.001205326,"about_ca_topic_score_gemma":0.0013270734,"teacher_disagreement_score":0.0013889049,"about_ca_system_score_codex":0.00066449895,"about_ca_system_score_gemma":0.0007498451,"threshold_uncertainty_score":0.007345319},"labels":[],"label_agreement":null},{"id":"W2010183137","doi":"10.1109/pacrim.2007.4313300","title":"H.264 Intra Frame Coding and JPEG 2000-based Predictive Multiple Description Image Coding","year":2007,"lang":"en","type":"article","venue":"","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Computer science; JPEG; Coding (social sciences); Residual; Lossless JPEG; Transform coding; Artificial intelligence; Intra-frame; Algorithm; JPEG 2000; Data compression; Computer vision; Image compression; Image (mathematics); Image processing; Discrete cosine transform; Decoding methods; Mathematics; Statistics","score_opus":0.018717599741012718,"score_gpt":0.26999196873822356,"score_spread":0.25127436899721084,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2010183137","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012460137,0.005755119,0.96805936,0.00045557987,0.00048858527,0.00038083442,0.0005339448,0.0020565519,0.009809829],"genre_scores_gemma":[0.16261706,0.0046711112,0.8030956,0.00058228325,0.0003848703,0.00040871458,0.0030553995,0.00022052492,0.024964495],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99944085,0.0000616406,0.000023101964,0.000066239416,0.00035977032,0.00004834113],"domain_scores_gemma":[0.9993919,0.0001032977,0.00006799172,0.00010812516,0.0003000193,0.00002859264],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006749813,0.00064045313,0.00047856543,0.0010171564,0.00021372284,0.0004815214,0.0011715775,0.00091859564,0.0022247233],"category_scores_gemma":[0.0017311713,0.0002111607,0.00035556487,0.00095484947,0.00036932476,0.00074598065,0.00046404754,0.0010056457,0.0011300413],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00043331078,0.00013713939,0.000930765,0.0004540725,0.00006823554,0.00037196852,0.00006498946,0.034680225,0.061861757,0.034279242,0.020307472,0.8464109],"study_design_scores_gemma":[0.00018870723,0.0005603947,0.0059819263,0.00014980552,0.00014131644,0.0016590256,0.00006646996,0.67374384,0.16693999,0.012065446,0.1383165,0.0001865772],"about_ca_topic_score_codex":0.0046218317,"about_ca_topic_score_gemma":0.005052898,"teacher_disagreement_score":0.0046218317,"about_ca_system_score_codex":0.0005643903,"about_ca_system_score_gemma":0.0010819972,"threshold_uncertainty_score":0.009189844},"labels":[],"label_agreement":null},{"id":"W2010865325","doi":"10.1109/icip.2013.6738382","title":"Quantization table design revisited for image/video coding","year":2013,"lang":"en","type":"article","venue":"","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Quantization (signal processing); Rate–distortion theory; Algorithm; Computer science; JPEG; Computational complexity theory; Coding (social sciences); Transform coding; Data compression; Theoretical computer science; Mathematics; Artificial intelligence; Discrete cosine transform; Image (mathematics); Statistics","score_opus":0.037511001928201414,"score_gpt":0.30019482513722406,"score_spread":0.26268382320902267,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2010865325","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0016380601,0.0007231262,0.9957231,0.00022806674,0.000097229255,0.000031669777,0.000032724074,0.00014020801,0.0013858451],"genre_scores_gemma":[0.20552392,0.00153405,0.7882187,0.00047997525,0.00017386553,0.000129871,0.00018266814,0.00012115669,0.0036357201],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992906,0.00021698952,0.00006665653,0.0000991355,0.0002922727,0.000034278484],"domain_scores_gemma":[0.9993562,0.0002176587,0.000050876537,0.00013619605,0.00022229354,0.000016713759],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009255123,0.00041650343,0.00045413643,0.00047300637,0.00028097472,0.0012477011,0.0009570218,0.00077244436,0.002310172],"category_scores_gemma":[0.0028257782,0.00024824974,0.0003764164,0.00097400526,0.00056854694,0.0011224332,0.0006114321,0.0011647907,0.00057658507],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013626703,0.000039373113,0.0004570503,0.00025269447,0.000040517865,0.00016509648,0.0001562573,0.1341169,0.035076782,0.40175498,0.0067660254,0.42103806],"study_design_scores_gemma":[0.000041456973,0.00011415677,0.00019004267,0.00007957405,0.000028004439,0.00044967697,0.0000405852,0.8310455,0.024632737,0.112072945,0.03126743,0.0000379656],"about_ca_topic_score_codex":0.0014986906,"about_ca_topic_score_gemma":0.0017532903,"teacher_disagreement_score":0.002310172,"about_ca_system_score_codex":0.0009617543,"about_ca_system_score_gemma":0.0009333996,"threshold_uncertainty_score":0.0077283382},"labels":[],"label_agreement":null},{"id":"W2011471683","doi":"10.1117/12.846701","title":"GPU implementation of JPEG XR","year":2009,"lang":"de","type":"article","venue":"Proceedings of SPIE, the International Society for Optical Engineering/Proceedings of SPIE","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Computer science; JPEG; JPEG 2000; Huffman coding; CUDA; Codec; Transform coding; Lossless JPEG; Image compression; Data compression; Computer hardware; Parallel computing; Computer architecture; Computer engineering; Image processing; Discrete cosine transform; Artificial intelligence; Image (mathematics)","score_opus":0.01334424663427033,"score_gpt":0.27552688069742326,"score_spread":0.26218263406315295,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2011471683","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.062434673,0.00080771727,0.8685636,0.00038922337,0.00032348695,0.00023089947,0.0010543494,0.014235402,0.05196067],"genre_scores_gemma":[0.4063391,0.0006559298,0.5611528,0.00024108434,0.000060933464,0.00023004637,0.002751297,0.0010202182,0.027548607],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99980325,0.000020287565,0.000012140119,0.000027256277,0.00011139683,0.000025667614],"domain_scores_gemma":[0.9997832,0.000020921485,0.000008799706,0.000041731644,0.00013126693,0.000014158534],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013071619,0.00037609038,0.00038066597,0.0004229074,0.00022787247,0.00074445235,0.00082237035,0.00032235598,0.0068501527],"category_scores_gemma":[0.0008746656,0.00014747465,0.00023115949,0.0005026243,0.00013138512,0.00036933285,0.0003532193,0.0005718354,0.0020329452],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005747637,0.00018878053,0.00374587,0.00039179783,0.00011257453,0.00075854844,0.00032351844,0.09029211,0.1623459,0.05272993,0.06950399,0.61903226],"study_design_scores_gemma":[0.0000909972,0.00015916332,0.0016218456,0.00003565011,0.00002316304,0.0005874445,0.000049401246,0.8110985,0.08145034,0.0036373637,0.101214714,0.000031440533],"about_ca_topic_score_codex":0.005931969,"about_ca_topic_score_gemma":0.0055806157,"teacher_disagreement_score":0.0068501527,"about_ca_system_score_codex":0.00036027393,"about_ca_system_score_gemma":0.0006858096,"threshold_uncertainty_score":0.022916019},"labels":[],"label_agreement":null},{"id":"W2011629644","doi":"10.1016/s0167-8191(02)00109-6","title":"Parallel codebook design for vector quantization on a message passing MIMD architecture","year":2002,"lang":"en","type":"article","venue":"Parallel Computing","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"Scheme for Promotion of Academic and Research Collaboration","keywords":"Codebook; MIMD; Vector quantization; Linde–Buzo–Gray algorithm; Computer science; Pipeline (software); Computation; Image compression; Quantization (signal processing); Parallel computing; Algorithm; Data compression; Computer engineering; Image (mathematics); Artificial intelligence; Image processing; Theoretical computer science","score_opus":0.059519953608185044,"score_gpt":0.2954016781205356,"score_spread":0.23588172451235054,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2011629644","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015584369,0.00026577694,0.9800439,0.00015317593,0.000099416495,0.000071924514,0.0000925166,0.0013706406,0.0023182607],"genre_scores_gemma":[0.38113642,0.00025127854,0.6119761,0.00015698081,0.00008708904,0.00027024743,0.00034118505,0.00013460808,0.0056460085],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9996132,0.000079631514,0.00003220179,0.000054651027,0.00017493167,0.000045418994],"domain_scores_gemma":[0.9993765,0.00013567635,0.000037982398,0.00014071693,0.00027344615,0.000035691744],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005099482,0.00039195453,0.0006080374,0.0005121847,0.0006026258,0.00087882247,0.0014245808,0.00044779113,0.004788636],"category_scores_gemma":[0.0014741401,0.00024656503,0.00023061795,0.0010221598,0.00034631783,0.0010797544,0.0007031675,0.00053695845,0.0011459608],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012048132,0.00021004894,0.0013350549,0.0003493057,0.000092872004,0.00020287586,0.00018545151,0.172826,0.076586686,0.094247,0.020264791,0.632495],"study_design_scores_gemma":[0.00009643612,0.0001940313,0.00019873625,0.000012615126,0.000021902151,0.0000961962,0.000035529585,0.948074,0.027487662,0.017523881,0.006236549,0.000022587425],"about_ca_topic_score_codex":0.0026928564,"about_ca_topic_score_gemma":0.0057595256,"teacher_disagreement_score":0.004788636,"about_ca_system_score_codex":0.0008286672,"about_ca_system_score_gemma":0.0012536693,"threshold_uncertainty_score":0.016019583},"labels":[],"label_agreement":null},{"id":"W2012506975","doi":"10.3103/s1060992x09040158","title":"Erratum to: “3-D Neural Mapper for LDPC Sum-Product Decoder”","year":2009,"lang":"en","type":"erratum","venue":"Optical Memory and Neural Networks","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa; Carleton University","funders":"","keywords":"Low-density parity-check code; Computer science; Product (mathematics); Algorithm; Decoding methods; Mathematics","score_opus":0.020809523762357496,"score_gpt":0.2869255382481984,"score_spread":0.2661160144858409,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2012506975","genre_codex":"editorial","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0016531718,0.0028066006,0.008953658,0.06427135,0.9044807,0.000106982596,0.0012784357,0.0011521529,0.015296867],"genre_scores_gemma":[0.038990747,0.008494401,0.02955137,0.13420884,0.120257206,0.00033578422,0.004697122,0.0021374025,0.6613272],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99825484,0.0002359726,0.00026625124,0.00022561674,0.00088971935,0.00012755409],"domain_scores_gemma":[0.99616313,0.0007067111,0.00016922031,0.00031633518,0.002488056,0.00015653156],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011410828,0.0015955984,0.0014330939,0.0016580115,0.0026568538,0.0015771729,0.0021787705,0.0054714982,0.02350187],"category_scores_gemma":[0.012699424,0.00087585655,0.00076835114,0.0011994605,0.0014623377,0.0017249458,0.0012238672,0.0052815718,0.017391253],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012944655,0.00002155682,0.000091567,0.00016877508,0.000015511963,0.0005761886,0.00003396219,0.00032120166,0.00070943177,0.0020514869,0.97867525,0.01720563],"study_design_scores_gemma":[0.0000771367,0.00015016976,0.0011407497,0.00025154458,0.00007235411,0.0013549872,0.00010001421,0.0038880669,0.008131978,0.004081105,0.9806631,0.00008873757],"about_ca_topic_score_codex":0.0089659095,"about_ca_topic_score_gemma":0.014445592,"teacher_disagreement_score":0.02350187,"about_ca_system_score_codex":0.0025558562,"about_ca_system_score_gemma":0.002515533,"threshold_uncertainty_score":0.078621626},"labels":[],"label_agreement":null},{"id":"W2012632681","doi":"10.1016/j.image.2012.01.020","title":"A family of fast index and redundancy assignments for error resilient multiple description coding","year":2012,"lang":"en","type":"article","venue":"Signal Processing Image Communication","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University; Communications Research Centre Canada","funders":"","keywords":"Decoding methods; Computer science; Binary number; Algorithm; Quantization (signal processing); Redundancy (engineering); Robustness (evolution); Multiple description coding; Theoretical computer science; Mathematics; Arithmetic","score_opus":0.05354517223124848,"score_gpt":0.32467601010647995,"score_spread":0.27113083787523146,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2012632681","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008387021,0.00078033283,0.986654,0.00018929332,0.00011072963,0.00012864648,0.00018542363,0.0009950544,0.0025695018],"genre_scores_gemma":[0.21115309,0.0012386385,0.7767998,0.00047728114,0.00018511282,0.00049112434,0.00060577464,0.0003524255,0.008696683],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984346,0.00044685657,0.000097190365,0.00021381077,0.0006392098,0.00016830201],"domain_scores_gemma":[0.9973049,0.0010143339,0.00019204897,0.000891706,0.0005029728,0.000094020805],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021897221,0.0013392894,0.000865604,0.0013523285,0.0011483774,0.0010605116,0.0020175772,0.00096470147,0.0033514968],"category_scores_gemma":[0.00657336,0.00047559853,0.00059033814,0.0014197222,0.00084230717,0.0019443044,0.0024345105,0.00175314,0.0011561579],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00063749653,0.00016005093,0.00032610694,0.00029271762,0.0000605796,0.00016746901,0.0001731235,0.09806636,0.021250186,0.18862922,0.013672854,0.6765638],"study_design_scores_gemma":[0.00011962932,0.00031003516,0.0002407915,0.00011047246,0.000050786588,0.00039529195,0.000051209317,0.77348936,0.025623867,0.18013297,0.0193849,0.00009070998],"about_ca_topic_score_codex":0.0012623005,"about_ca_topic_score_gemma":0.001727314,"teacher_disagreement_score":0.0033514968,"about_ca_system_score_codex":0.00087303866,"about_ca_system_score_gemma":0.0013725531,"threshold_uncertainty_score":0.011580527},"labels":[],"label_agreement":null},{"id":"W2013766532","doi":"10.1109/cwit.2013.6621599","title":"On separation of source and channel coding in the finite block length regime","year":2013,"lang":"en","type":"article","venue":"","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Channel code; Channel (broadcasting); Binary number; Coding (social sciences); Block code; Algorithm; Scalar (mathematics); Decoding methods; Variable-length code; Source separation; Computer science; Block (permutation group theory); Mathematics; Block size; Telecommunications; Statistics; Combinatorics; Arithmetic; Geometry","score_opus":0.019429932414591202,"score_gpt":0.2770790204125593,"score_spread":0.2576490879979681,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2013766532","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.039913557,0.0011178852,0.95294684,0.0002800738,0.000029263925,0.000029078174,0.00003548636,0.00008257013,0.0055652303],"genre_scores_gemma":[0.84976256,0.002317558,0.14397372,0.00021144343,0.00015061887,0.00012282455,0.00010196546,0.00007647063,0.0032828378],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981053,0.0008408311,0.00006911549,0.00018998705,0.0006552507,0.00013951278],"domain_scores_gemma":[0.9856506,0.012501871,0.00068778783,0.00060570746,0.00046213425,0.000091837675],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031717946,0.00075270375,0.0007653736,0.0005454201,0.00034834963,0.00088268623,0.0006398707,0.0007863461,0.0015169566],"category_scores_gemma":[0.013668267,0.00032846964,0.00031967106,0.00066915626,0.0024959987,0.0037089053,0.0014810235,0.0013035354,0.0003956263],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00047713157,0.00006773511,0.000732518,0.00029604955,0.00006471879,0.0002396593,0.00025350958,0.44236797,0.017460847,0.47434795,0.0007155766,0.06297632],"study_design_scores_gemma":[0.000029689943,0.00015300319,0.0003278914,0.000045079305,0.000016515189,0.00014999777,0.000027146958,0.85797644,0.010220831,0.12999335,0.0010243807,0.000035637546],"about_ca_topic_score_codex":0.0006884611,"about_ca_topic_score_gemma":0.0004260474,"teacher_disagreement_score":0.0031717946,"about_ca_system_score_codex":0.00091389456,"about_ca_system_score_gemma":0.00071402563,"threshold_uncertainty_score":0.016774297},"labels":[],"label_agreement":null},{"id":"W2015101028","doi":"10.1117/12.2004844","title":"Cubic-panorama image dataset analysis for storage and transmission","year":2013,"lang":"en","type":"article","venue":"Proceedings of SPIE, the International Society for Optical Engineering/Proceedings of SPIE","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Panorama; Computer science; Computer vision; Transmission (telecommunications); Artificial intelligence; Transcoding; Epipolar geometry; Image (mathematics); Image compression; Data compression; Frame (networking); Scheme (mathematics); Image processing; Mathematics","score_opus":0.010704610210938928,"score_gpt":0.24858923362920457,"score_spread":0.23788462341826563,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2015101028","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10946812,0.0010635026,0.868204,0.00045169835,0.00026344732,0.0003906459,0.0043184226,0.0056402963,0.010199792],"genre_scores_gemma":[0.3348018,0.0010886713,0.6504596,0.000099760655,0.00009130175,0.00026267106,0.007595502,0.00040857616,0.0051921178],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995541,0.00003893854,0.00003140551,0.00006116592,0.0002634564,0.00005092559],"domain_scores_gemma":[0.99906987,0.00010212989,0.00006324484,0.00047520388,0.00026906948,0.00002051678],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039126314,0.0004533661,0.0003653275,0.0011810131,0.00049417745,0.0010901936,0.00072594837,0.00034898816,0.0071761687],"category_scores_gemma":[0.0020593097,0.0001778199,0.00044633454,0.0021747437,0.00022327242,0.0014649335,0.00083215354,0.00045173414,0.0019109007],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006530924,0.00010305428,0.0028530557,0.00040887157,0.00007540288,0.000443197,0.00017741197,0.02088506,0.15435389,0.012765112,0.015883652,0.79139817],"study_design_scores_gemma":[0.00006635747,0.0004344475,0.018056588,0.00011183101,0.00008847363,0.0027657505,0.00054804626,0.49042976,0.3740136,0.013144267,0.100214146,0.00012671063],"about_ca_topic_score_codex":0.0028394905,"about_ca_topic_score_gemma":0.0040800287,"teacher_disagreement_score":0.0071761687,"about_ca_system_score_codex":0.00045087523,"about_ca_system_score_gemma":0.0011034308,"threshold_uncertainty_score":0.024006665},"labels":[],"label_agreement":null},{"id":"W2015679331","doi":"10.1109/coginf.2009.5250762","title":"Fractal modelling of residues in linear predictive coding of speech","year":2009,"lang":"en","type":"article","venue":"","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"","keywords":"Speech coding; Linear predictive coding; Residual; Fractal; Computer science; Speech recognition; Linear prediction; Vector sum excited linear prediction; Code-excited linear prediction; Algorithm; Mathematics","score_opus":0.03197252270360747,"score_gpt":0.29508308720016757,"score_spread":0.2631105644965601,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2015679331","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.053873915,0.00037940074,0.94276375,0.00009703164,0.000038874387,0.000018369072,0.000024679966,0.00017484593,0.0026291404],"genre_scores_gemma":[0.8047489,0.0006740733,0.19019397,0.000063927524,0.00006108127,0.000041053612,0.00008880952,0.0000765721,0.004051644],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99983203,0.0000524329,0.000008024253,0.00001678524,0.00007919321,0.00001153714],"domain_scores_gemma":[0.99958724,0.00024664678,0.000041422347,0.000058214828,0.00005515734,0.000011212103],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031487414,0.00025715644,0.00021411732,0.00026244193,0.00014393464,0.00036386002,0.00031516005,0.000420075,0.00064471125],"category_scores_gemma":[0.0013553649,0.00013719469,0.00027457613,0.0001950674,0.0005686591,0.00059407327,0.00024412735,0.0004507059,0.0002447965],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014878792,0.000033115088,0.00041316458,0.000098393,0.000017281927,0.0003523646,0.00025476093,0.7465036,0.07012613,0.123570174,0.0005230352,0.057959232],"study_design_scores_gemma":[0.000003679315,0.000040145926,0.000097261836,0.0000075720254,0.0000038036428,0.00009110375,0.000007764515,0.9856248,0.004746479,0.0083029745,0.0010643117,0.00001016498],"about_ca_topic_score_codex":0.0010610315,"about_ca_topic_score_gemma":0.0008489685,"teacher_disagreement_score":0.0010610315,"about_ca_system_score_codex":0.00027201584,"about_ca_system_score_gemma":0.00019373302,"threshold_uncertainty_score":0.002156794},"labels":[],"label_agreement":null},{"id":"W2018284587","doi":"10.1109/vcip.2011.6116045","title":"Multiple description video coding against both erasure and bit errors by compressive sensing","year":2011,"lang":"en","type":"article","venue":"","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Computer science; Erasure; Encoder; Lossy compression; Network packet; Multiview Video Coding; Compressed sensing; Coding (social sciences); Real-time computing; Fountain code; Video tracking; Video processing; Computer hardware; Decoding methods; Computer network; Algorithm; Artificial intelligence; Block code; Concatenated error correction code","score_opus":0.03966990330032994,"score_gpt":0.2450772977584887,"score_spread":0.20540739445815875,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2018284587","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016872244,0.00042011737,0.9813809,0.0002157606,0.000050296112,0.000024201989,0.000034238772,0.00013139992,0.00087087543],"genre_scores_gemma":[0.5666602,0.0009641002,0.4279674,0.00029038114,0.00020112445,0.000115010575,0.0002366054,0.000052458847,0.003512659],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99943024,0.00011078688,0.00002430589,0.00005231365,0.0003353623,0.00004694735],"domain_scores_gemma":[0.99917823,0.00031311522,0.0001590718,0.00014535167,0.00017351334,0.000030725278],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007207188,0.00043963728,0.0003975389,0.00043565343,0.00022243375,0.00042373626,0.00084785616,0.0007025757,0.00063426263],"category_scores_gemma":[0.0023507713,0.00016412942,0.0002607427,0.000485037,0.00052494474,0.0011452411,0.0007787454,0.00077579304,0.0002442929],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00030173876,0.00009783056,0.000782177,0.00025244418,0.0000827602,0.0004044587,0.00020099849,0.33978775,0.1640531,0.09219585,0.0037979744,0.39804295],"study_design_scores_gemma":[0.000043518867,0.00020614901,0.0002315913,0.000025677282,0.000025232346,0.0002839167,0.00001928006,0.94441336,0.04035211,0.010164386,0.0042023626,0.000032429703],"about_ca_topic_score_codex":0.0010316529,"about_ca_topic_score_gemma":0.0012007734,"teacher_disagreement_score":0.0010316529,"about_ca_system_score_codex":0.00024496485,"about_ca_system_score_gemma":0.00049898156,"threshold_uncertainty_score":0.0038115978},"labels":[],"label_agreement":null},{"id":"W2018387394","doi":"10.1049/el:20020869","title":"Sequential search approach to fixed-rate entropy-coded quantisation","year":2002,"lang":"en","type":"article","venue":"Electronics Letters","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Entropy (arrow of time); Algorithm; Mathematics; Computational complexity theory; Reduction (mathematics); Computer science; Mathematical optimization; Physics","score_opus":0.02928694960963438,"score_gpt":0.26409937156566554,"score_spread":0.23481242195603116,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2018387394","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005424308,0.00027070017,0.9918298,0.00005806804,0.000041640487,0.000046374975,0.00003410221,0.00020719723,0.0020879032],"genre_scores_gemma":[0.31425947,0.00057960895,0.6780069,0.00012413545,0.00008361892,0.00024388512,0.0001520452,0.00007972683,0.006470678],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99969256,0.00006635867,0.000021362219,0.00004127028,0.00015422763,0.000024284578],"domain_scores_gemma":[0.9996449,0.00016677826,0.000032349173,0.000056318724,0.000088774425,0.000010904148],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043771748,0.0004739406,0.0004319295,0.00046990233,0.00026177944,0.00047199093,0.0010130723,0.0004427894,0.0030454753],"category_scores_gemma":[0.0011732846,0.00021010474,0.00021952702,0.000678656,0.00056693295,0.000911395,0.00061588816,0.0006687725,0.0005076922],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00047464087,0.00009285939,0.0002766844,0.00027643304,0.000058783913,0.00015092963,0.00010236103,0.24389736,0.0719509,0.20783314,0.0038011018,0.47108474],"study_design_scores_gemma":[0.000061187304,0.00014717487,0.00011260703,0.00002156065,0.000014648573,0.00013603533,0.000007486162,0.94776183,0.023383565,0.023580486,0.004747423,0.000025944038],"about_ca_topic_score_codex":0.0012920045,"about_ca_topic_score_gemma":0.0020583959,"teacher_disagreement_score":0.0030454753,"about_ca_system_score_codex":0.00039617223,"about_ca_system_score_gemma":0.0007976567,"threshold_uncertainty_score":0.010188103},"labels":[],"label_agreement":null},{"id":"W2020076974","doi":"10.1109/iscas.2012.6271727","title":"Implantable narrow band image compressor for capsule endoscopy","year":2012,"lang":"en","type":"article","venue":"","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Saskatchewan","funders":"CMC Microsystems","keywords":"Computer science; Gas compressor; RGB color model; Chrominance; Computer vision; Pixel; Raster graphics; Artificial intelligence; CMOS; Electronic engineering; Engineering","score_opus":0.019952012366000572,"score_gpt":0.3057520506700636,"score_spread":0.28580003830406303,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2020076974","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14059947,0.0061887396,0.8383085,0.0011171509,0.000328615,0.00027080107,0.00039398618,0.0032362477,0.0095565],"genre_scores_gemma":[0.600379,0.0035251465,0.3720389,0.000632967,0.0002685756,0.00016566008,0.00049978046,0.00022095541,0.022269012],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9998759,0.000011681212,0.000006497619,0.000013589448,0.000084072,0.000008237136],"domain_scores_gemma":[0.9998357,0.000049382666,0.000033566008,0.000018120754,0.000049175273,0.000013891108],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015784182,0.00032842736,0.00023716652,0.00044393705,0.00017540522,0.00040421687,0.00048574904,0.00034532513,0.0029075132],"category_scores_gemma":[0.00044599109,0.00012974424,0.00013903249,0.00033057792,0.00019141925,0.00053506554,0.00021034667,0.00033116335,0.0005518253],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00040469426,0.000056904708,0.00082172337,0.00028418103,0.000026699301,0.0003786463,0.000059055346,0.0024720174,0.693282,0.0028804285,0.0045042513,0.2948294],"study_design_scores_gemma":[0.00006013383,0.0006900545,0.0035403727,0.000050925526,0.00008514134,0.004061199,0.000042583157,0.068930976,0.8638719,0.00056051055,0.058032826,0.00007332535],"about_ca_topic_score_codex":0.00042138205,"about_ca_topic_score_gemma":0.0007920057,"teacher_disagreement_score":0.0029075132,"about_ca_system_score_codex":0.00031249426,"about_ca_system_score_gemma":0.00025217183,"threshold_uncertainty_score":0.009726584},"labels":[],"label_agreement":null},{"id":"W2021305240","doi":"10.1016/j.jvcir.2006.09.001","title":"Grayscale true two-dimensional dictionary-based image compression","year":2006,"lang":"en","type":"article","venue":"Journal of Visual Communication and Image Representation","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Lossless compression; Computer science; Lossy compression; Image compression; Lossless JPEG; Grayscale; JPEG; Data compression; Artificial intelligence; Color Cell Compression; Data compression ratio; JPEG 2000; Pixel; Computer vision; Texture compression; Compression (physics); Image (mathematics); Image processing","score_opus":0.01519203767192199,"score_gpt":0.3540390804271585,"score_spread":0.33884704275523647,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2021305240","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.053192466,0.0016073468,0.9334146,0.0006805266,0.00074469147,0.00010838406,0.00045883207,0.001212144,0.008580995],"genre_scores_gemma":[0.3966257,0.0026431081,0.5784013,0.0005820963,0.00037908665,0.0001388137,0.0010712743,0.00020896764,0.01994962],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99975735,0.000035147128,0.000015626592,0.00003104185,0.00013769964,0.000023185392],"domain_scores_gemma":[0.9995716,0.00010388487,0.000025814194,0.00014792924,0.00013442728,0.00001626864],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022319876,0.00046293644,0.00042334627,0.0007124406,0.00023983455,0.0006708129,0.00040720202,0.0006026949,0.0052470434],"category_scores_gemma":[0.0013136226,0.00020009358,0.00024434694,0.0011718504,0.00033921545,0.0009307478,0.0006461549,0.00061968534,0.0015670358],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008522923,0.0001308211,0.0005510753,0.0002711453,0.000049984625,0.00022455672,0.0000892353,0.017982898,0.16232698,0.018398285,0.009896131,0.78922665],"study_design_scores_gemma":[0.00014359716,0.00039023557,0.002834789,0.000092796094,0.00007165353,0.0024970574,0.000114597155,0.6943635,0.2638716,0.009632741,0.025913946,0.00007347394],"about_ca_topic_score_codex":0.00059993286,"about_ca_topic_score_gemma":0.00094303285,"teacher_disagreement_score":0.0052470434,"about_ca_system_score_codex":0.00017808085,"about_ca_system_score_gemma":0.0003337643,"threshold_uncertainty_score":0.01755315},"labels":[],"label_agreement":null},{"id":"W2021995874","doi":"10.1109/tit.2007.907498","title":"Lagrangian Optimization of Two-Description Scalar Quantizers","year":2007,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":23,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Lagrange multiplier; Parameterized complexity; Bounded function; Monotonic function; Mathematics; Mathematical optimization; Convex function; Function (biology); Computer science; Algorithm; Regular polygon","score_opus":0.011853549915452434,"score_gpt":0.2602401401358047,"score_spread":0.24838659022035228,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2021995874","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019097494,0.00031769404,0.97704816,0.00022409728,0.000022435035,0.000036631507,0.000065005894,0.00011193943,0.0030766076],"genre_scores_gemma":[0.71511936,0.00038907188,0.2765678,0.00018386291,0.000033998185,0.00016428028,0.00018265599,0.00009100417,0.0072681005],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992963,0.00023682625,0.000025961786,0.00014404116,0.00021707106,0.00007982994],"domain_scores_gemma":[0.9989029,0.0006549587,0.00014239726,0.000060524548,0.00020142992,0.000037655558],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001575894,0.00083271717,0.00093612,0.00034580153,0.00024727153,0.0011091152,0.0008107866,0.0007617144,0.0030672404],"category_scores_gemma":[0.0030535692,0.0004993677,0.0003017569,0.0005503658,0.00087215396,0.0014269943,0.0007234066,0.0008148611,0.00044334502],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017325945,0.000028241779,0.0002495764,0.000120646415,0.000023227376,0.000053744363,0.000037464444,0.9166462,0.0052010245,0.046492707,0.0009989466,0.02997502],"study_design_scores_gemma":[0.00002070846,0.00003109645,0.00003192996,0.0000053271137,0.0000030348522,0.000010008238,0.0000048424977,0.99378926,0.00077622157,0.004945933,0.00037714423,0.0000044999247],"about_ca_topic_score_codex":0.0017458999,"about_ca_topic_score_gemma":0.0014420769,"teacher_disagreement_score":0.0030672404,"about_ca_system_score_codex":0.0015009579,"about_ca_system_score_gemma":0.001240002,"threshold_uncertainty_score":0.010890305},"labels":[],"label_agreement":null},{"id":"W2022012431","doi":"10.5121/ijcnc.2010.2307","title":"A Joint Power Allocation and Adaptive Channel Coding Scheme for Image Transmission over Wireless Channels","year":2010,"lang":"en","type":"article","venue":"International journal of Computer Networks & Communications","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":20,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Computer science; Channel (broadcasting); Coding (social sciences); Joint (building); Channel code; Computer network; Transmission (telecommunications); Wireless; Scheme (mathematics); Telecommunications; Decoding methods","score_opus":0.0262274384344205,"score_gpt":0.30949220196517874,"score_spread":0.28326476353075825,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2022012431","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009070195,0.0003515455,0.9891769,0.00009734714,0.00004541947,0.000039117826,0.00001686839,0.00011688633,0.0010857275],"genre_scores_gemma":[0.6440246,0.0008738171,0.34959152,0.00017183389,0.00018873124,0.00020880527,0.00006996542,0.000053726882,0.0048169997],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993974,0.00017560688,0.000025693287,0.00007882108,0.00025415866,0.00006832556],"domain_scores_gemma":[0.9994406,0.00022438353,0.000069612666,0.000078563025,0.00016108082,0.000025768213],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00049781956,0.0006054597,0.00051995396,0.00048263208,0.0004097883,0.0005105705,0.0009635593,0.0005798167,0.0009887749],"category_scores_gemma":[0.0013178674,0.00021754485,0.0003413943,0.00066406967,0.000581365,0.0009847784,0.00075303414,0.0007885589,0.00026062713],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003475706,0.00016077381,0.00068008073,0.0002631971,0.00009209985,0.0002676099,0.00015710716,0.37307355,0.08519633,0.035617612,0.0030991556,0.501045],"study_design_scores_gemma":[0.000026651875,0.00014293304,0.0002073127,0.000012886787,0.000030412124,0.0002417537,0.000018372079,0.97935164,0.013270176,0.0043270974,0.0023425575,0.000028254155],"about_ca_topic_score_codex":0.0010890804,"about_ca_topic_score_gemma":0.0018926519,"teacher_disagreement_score":0.0010890804,"about_ca_system_score_codex":0.0003606227,"about_ca_system_score_gemma":0.0006898903,"threshold_uncertainty_score":0.0033078194},"labels":[],"label_agreement":null},{"id":"W2022582029","doi":"10.1109/tcomm.2005.861683","title":"A fast trellis-based rate-allocation algorithm for robust transmission of progressively coded images over noisy channels","year":2006,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Trellis (graph); Algorithm; Viterbi algorithm; Computer science; Soft output Viterbi algorithm; Space–time trellis code; Transmission (telecommunications); Channel (broadcasting); Binary number; Trellis modulation; Set (abstract data type); Viterbi decoder; Decoding methods; Mathematics; Fading; Sequential decoding; Error floor; Telecommunications; Block code","score_opus":0.028492406471890722,"score_gpt":0.29817121432877536,"score_spread":0.26967880785688464,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2022582029","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0038546773,0.0002675287,0.99460196,0.00008184743,0.00004076026,0.00004687505,0.000035038756,0.00049072196,0.00058057223],"genre_scores_gemma":[0.094846725,0.0003416338,0.90090466,0.00011450182,0.00008319982,0.00022041818,0.00022861513,0.00015758889,0.0031025899],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988494,0.00027271066,0.00008587508,0.00017864464,0.00051134906,0.00010203814],"domain_scores_gemma":[0.9982237,0.0006948871,0.00021877898,0.0002803659,0.00053752714,0.00004469401],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015840946,0.0008008895,0.0009099413,0.0009302877,0.0006285539,0.0010120445,0.0014550409,0.0010845694,0.002598601],"category_scores_gemma":[0.003839548,0.00051494926,0.0006466068,0.00083837874,0.00081808673,0.0013543378,0.0008294387,0.0014651477,0.0014917388],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00067016535,0.00010170098,0.00041552266,0.0002464263,0.000124931,0.00021982208,0.00028437134,0.25698623,0.13037229,0.052767616,0.006417055,0.55139375],"study_design_scores_gemma":[0.000094573305,0.000209748,0.00025223635,0.000030907722,0.000038184546,0.00037020518,0.000021763997,0.91779244,0.065190546,0.008643806,0.007261477,0.00009415942],"about_ca_topic_score_codex":0.0019802237,"about_ca_topic_score_gemma":0.0022928677,"teacher_disagreement_score":0.002598601,"about_ca_system_score_codex":0.00091570057,"about_ca_system_score_gemma":0.0013722798,"threshold_uncertainty_score":0.008693218},"labels":[],"label_agreement":null},{"id":"W2025347728","doi":"10.1109/icip.2006.312786","title":"An Efficient Architecture for Entropy-Based Best-Basis Algorithm","year":2006,"lang":"en","type":"article","venue":"","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Computer science; Algorithm; Correctness; Logarithm; Entropy (arrow of time); Field-programmable gate array; VHDL; Parallel computing; Theoretical computer science; Mathematics; Computer hardware","score_opus":0.008409375289618813,"score_gpt":0.2700155921112247,"score_spread":0.2616062168216059,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2025347728","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.034752227,0.00045048282,0.9579935,0.00013693233,0.0000855426,0.000054119086,0.00005932102,0.0023071924,0.004160791],"genre_scores_gemma":[0.44239518,0.00030974476,0.55218244,0.00010085862,0.00006437025,0.00008616649,0.00029504034,0.00012801847,0.0044380827],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999728,0.000042510237,0.000018773459,0.00003529338,0.00013669781,0.000038577506],"domain_scores_gemma":[0.9997696,0.00004126921,0.000014223369,0.000046573117,0.00011307003,0.000015231344],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003156246,0.00030087755,0.00037125146,0.0008514463,0.00048404397,0.0008160057,0.0011860783,0.0004950442,0.003324971],"category_scores_gemma":[0.00072434655,0.00025918297,0.00025061457,0.0004969036,0.00023034327,0.0010965096,0.00043014664,0.0004987714,0.001278005],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00082602364,0.00019247162,0.0016852617,0.0002639799,0.00011739564,0.0003147758,0.00022293303,0.08880603,0.19608633,0.04925442,0.0068324963,0.65539795],"study_design_scores_gemma":[0.000096316384,0.00034737162,0.0011307077,0.00003104128,0.000079671925,0.00047741106,0.00004822858,0.8417434,0.1258732,0.011832049,0.018285153,0.000055367578],"about_ca_topic_score_codex":0.0010748826,"about_ca_topic_score_gemma":0.0013219449,"teacher_disagreement_score":0.003324971,"about_ca_system_score_codex":0.00055647595,"about_ca_system_score_gemma":0.00062460423,"threshold_uncertainty_score":0.01112318},"labels":[],"label_agreement":null},{"id":"W2026102764","doi":"10.1007/s10278-010-9343-0","title":"Using JPEG 2000 Interactive Protocol to Stream a Large Image or a Large Image Set","year":2010,"lang":"en","type":"article","venue":"Journal of Digital Imaging","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"École de Technologie Supérieure; Université du Québec à Montréal","funders":"","keywords":"JPEG; Computer science; Computer vision; Consistency (knowledge bases); Protocol (science); Set (abstract data type); Image (mathematics); Image quality; Digital image; Visualization; Artificial intelligence; Software deployment; Information retrieval; Image processing; Medicine","score_opus":0.02283536533562796,"score_gpt":0.3828828044438506,"score_spread":0.3600474391082226,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2026102764","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19376622,0.0004154761,0.6984173,0.0011366606,0.0007600535,0.0022648806,0.0029570365,0.05182585,0.04845648],"genre_scores_gemma":[0.53485096,0.0006793895,0.39584735,0.00083779404,0.00029370713,0.0011327075,0.005337266,0.0034898382,0.05753092],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99985707,0.000015606378,0.000017572174,0.000021972864,0.000062917454,0.00002484766],"domain_scores_gemma":[0.99940825,0.00013444644,0.000030756364,0.000144072,0.00022320244,0.000059406295],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042357112,0.0004942029,0.00021800103,0.0011310632,0.00030746183,0.0008812341,0.00032954392,0.00036415845,0.013846775],"category_scores_gemma":[0.0018578211,0.00019582121,0.00015271605,0.0007224283,0.00024341034,0.0007149895,0.0005060196,0.0006240288,0.0026760928],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0026911227,0.0004966208,0.0036215293,0.00031239892,0.00012322649,0.0015142121,0.00046941105,0.004815776,0.4697329,0.01483135,0.07618289,0.4252085],"study_design_scores_gemma":[0.0005035738,0.00046181868,0.005397112,0.00008825625,0.000111137546,0.0020445066,0.00016647087,0.13485377,0.74364537,0.0071845404,0.10542861,0.00011478097],"about_ca_topic_score_codex":0.0012538657,"about_ca_topic_score_gemma":0.0017995927,"teacher_disagreement_score":0.013846775,"about_ca_system_score_codex":0.0003109032,"about_ca_system_score_gemma":0.0005512037,"threshold_uncertainty_score":0.046322107},"labels":[],"label_agreement":null},{"id":"W2029597966","doi":"10.1117/12.465280","title":"<title>Hiding-based compression for improved color image coding</title>","year":2002,"lang":"en","type":"article","venue":"Proceedings of SPIE, the International Society for Optical Engineering/Proceedings of SPIE","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Chrominance; Computer science; Artificial intelligence; Set partitioning in hierarchical trees; Computer vision; Luminance; Grayscale; Image compression; Data compression; JPEG; Color Cell Compression; Color depth; JPEG 2000; Color image; Image processing; Image (mathematics)","score_opus":0.01402255868763367,"score_gpt":0.24197821510596973,"score_spread":0.22795565641833607,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2029597966","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1987843,0.0044274987,0.67211646,0.0021877661,0.003396988,0.00042058103,0.000902155,0.006738666,0.11102559],"genre_scores_gemma":[0.5858494,0.0041169147,0.28319907,0.0005104859,0.0008340279,0.000114379836,0.0018880569,0.0008051654,0.12268255],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99992526,0.000006717556,0.000004875902,0.000008048409,0.00004436167,0.000010733683],"domain_scores_gemma":[0.9998374,0.000024124816,0.00001704698,0.000035510697,0.00007306376,0.000012774832],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001482487,0.00020749614,0.00016565846,0.00043281296,0.00016686555,0.0003175212,0.00041929723,0.00028232488,0.0112185655],"category_scores_gemma":[0.00035692367,0.00007860494,0.00011793403,0.0005426047,0.00024594096,0.0005056879,0.00023726694,0.0002957777,0.0033728771],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00025255856,0.00010191747,0.0006020841,0.0002925287,0.00001054885,0.0005222421,0.00007378995,0.0056613907,0.4407794,0.021159422,0.026786128,0.50375795],"study_design_scores_gemma":[0.00006348844,0.0004696156,0.0027184773,0.000069405185,0.000029784596,0.0016967321,0.000030334097,0.16385667,0.6569485,0.0032910868,0.17078638,0.00003950871],"about_ca_topic_score_codex":0.0007461509,"about_ca_topic_score_gemma":0.0015757146,"teacher_disagreement_score":0.0112185655,"about_ca_system_score_codex":0.0002235342,"about_ca_system_score_gemma":0.00023463192,"threshold_uncertainty_score":0.037529886},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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)","score_opus":0.037233982576037626,"score_gpt":0.27405656446591037,"score_spread":0.23682258188987274,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2030185887","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.024406962,0.00015119677,0.9725036,0.00006200696,0.000017005503,0.00003717529,0.000044691722,0.0004776983,0.0022995786],"genre_scores_gemma":[0.44690734,0.00024151131,0.54823864,0.00007574896,0.000029523453,0.00010204711,0.00023176332,0.00025251895,0.003920899],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993279,0.00015464301,0.00002973481,0.00010600065,0.00031649024,0.000065170345],"domain_scores_gemma":[0.9993881,0.00022383209,0.000072500334,0.000092262875,0.00019475914,0.000028487986],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007110826,0.0007548663,0.0005300339,0.0005046461,0.00020203501,0.0007416988,0.0008897713,0.00051458686,0.0013872181],"category_scores_gemma":[0.0024961862,0.00024853938,0.00033222936,0.00084196054,0.0003392929,0.001019617,0.00062083104,0.0005076852,0.00044971498],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00030614025,0.00011609018,0.0010041017,0.00009783897,0.00006941826,0.00013982104,0.00010713267,0.61298114,0.06175596,0.036605336,0.0022677921,0.2845492],"study_design_scores_gemma":[0.000022288654,0.00010024421,0.00023494805,0.0000057249154,0.000017172117,0.00009102382,0.000011227198,0.97614384,0.017442476,0.0046512685,0.001263966,0.00001581297],"about_ca_topic_score_codex":0.0024513635,"about_ca_topic_score_gemma":0.0038148419,"teacher_disagreement_score":0.0024513635,"about_ca_system_score_codex":0.00056503864,"about_ca_system_score_gemma":0.0014214781,"threshold_uncertainty_score":0.00487417},"labels":[],"label_agreement":null},{"id":"W2031208232","doi":"10.1109/qbsc.2012.6221361","title":"On noisy source vector quantization via a subspace constrained mean shift algorithm","year":2012,"lang":"en","type":"article","venue":"","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Subspace topology; Vector quantization; Preprocessor; Linde–Buzo–Gray algorithm; Curse of dimensionality; Algorithm; Computer science; Quantization (signal processing); Iterative method; Artificial intelligence; Pattern recognition (psychology)","score_opus":0.013504297712514558,"score_gpt":0.26805457585786074,"score_spread":0.2545502781453462,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2031208232","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0021498401,0.00014554596,0.9969572,0.00007169029,0.000021685175,0.000014473186,0.000019954965,0.000114786264,0.0005048799],"genre_scores_gemma":[0.12922941,0.0006198586,0.86600477,0.0001404244,0.00011837647,0.0001557829,0.00027265862,0.0001027404,0.0033559692],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992656,0.00023654877,0.000036056637,0.00011180061,0.00031777465,0.000032121134],"domain_scores_gemma":[0.99918765,0.00040848632,0.000047249614,0.00011817176,0.000220895,0.000017434806],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010994603,0.0006327532,0.00081683113,0.00056147366,0.0003529936,0.0006277161,0.000819365,0.00083977316,0.0023735408],"category_scores_gemma":[0.003723518,0.00035343657,0.0003589713,0.0010575121,0.0009484175,0.0014318301,0.0012064092,0.0011045218,0.00088248105],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020178284,0.00004579346,0.0003131466,0.00012503636,0.000053641623,0.000072437986,0.00013090408,0.49451405,0.016401595,0.105731875,0.004020805,0.37838897],"study_design_scores_gemma":[0.0000113309015,0.000028608776,0.00007375743,0.00000850448,0.000004019742,0.000027282964,0.0000066220828,0.9758423,0.0027569435,0.019339971,0.0018895476,0.00001116001],"about_ca_topic_score_codex":0.002156478,"about_ca_topic_score_gemma":0.0021548315,"teacher_disagreement_score":0.0023735408,"about_ca_system_score_codex":0.00041712663,"about_ca_system_score_gemma":0.00097629084,"threshold_uncertainty_score":0.007940292},"labels":[],"label_agreement":null},{"id":"W2031365227","doi":"10.1109/tip.2013.2286324","title":"$\\ell_{2}$ Optimized Predictive Image Coding With $\\ell_{\\infty}$ Bound","year":2013,"lang":"en","type":"article","venue":"IEEE Transactions on Image Processing","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Lossless compression; Algorithm; Image compression; Coding (social sciences); Computer science; Upper and lower bounds; JPEG 2000; Entropy encoding; Huffman coding; JPEG; Data compression; Artificial intelligence; Mathematics; Theoretical computer science; Image (mathematics); Image processing; Statistics","score_opus":0.011249872560046415,"score_gpt":0.25823297341932516,"score_spread":0.24698310085927874,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2031365227","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013583696,0.0011972865,0.97337747,0.00032161223,0.00010046989,0.000030746174,0.0001275927,0.00045101342,0.0108100595],"genre_scores_gemma":[0.654691,0.0018921512,0.3261088,0.00047511072,0.00016602004,0.00018991518,0.00048042447,0.00020702633,0.015789537],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999453,0.00006183802,0.000021290092,0.00006702405,0.00034332136,0.00005338824],"domain_scores_gemma":[0.9997155,0.00012281402,0.000027515463,0.000041396266,0.00008277236,0.000009912125],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042801438,0.00063936657,0.0005136788,0.00030191374,0.00029307036,0.00090118614,0.00081177463,0.0005599292,0.0041123796],"category_scores_gemma":[0.0015406132,0.00019049995,0.0002287046,0.00057411194,0.0006129415,0.001118395,0.0011792622,0.001178003,0.0009829617],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00026426732,0.00008247288,0.0003647445,0.00019414343,0.000028910337,0.00022273815,0.00010966646,0.4933599,0.028446734,0.19821134,0.00934671,0.26936847],"study_design_scores_gemma":[0.0000051054085,0.000036869147,0.0000945543,0.000021852602,0.000006291329,0.000060874372,0.00000708024,0.97605395,0.005969212,0.013733836,0.0039967457,0.000013656919],"about_ca_topic_score_codex":0.003492082,"about_ca_topic_score_gemma":0.004427062,"teacher_disagreement_score":0.0041123796,"about_ca_system_score_codex":0.00083141885,"about_ca_system_score_gemma":0.0010929249,"threshold_uncertainty_score":0.013757348},"labels":[],"label_agreement":null},{"id":"W2034587272","doi":"10.1109/icip.2011.6116332","title":"JPEG XR optimization with graph-based soft decision quantization","year":2011,"lang":"en","type":"article","venue":"","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"JPEG; Quantization (signal processing); Computer science; Graph; Transform coding; Lossless JPEG; Image compression; Algorithm; Data compression; Discrete cosine transform; Theoretical computer science; Artificial intelligence; Image processing; Image (mathematics)","score_opus":0.025073201834804108,"score_gpt":0.2489927058601762,"score_spread":0.22391950402537208,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2034587272","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011618449,0.0002875133,0.98620415,0.0001399584,0.000032425487,0.00004339072,0.000054125547,0.00046114993,0.0011588815],"genre_scores_gemma":[0.4166488,0.00038793727,0.5792185,0.00017274283,0.000044286884,0.00009137177,0.00025151126,0.00016315846,0.0030216333],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995043,0.00012009638,0.000027297468,0.000070532784,0.00024509875,0.00003261454],"domain_scores_gemma":[0.9994573,0.0002694435,0.00004963873,0.00005147424,0.00015104943,0.00002100345],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00053184567,0.00059568376,0.0005946009,0.00056236325,0.00018705844,0.000630488,0.000671274,0.00053977355,0.0017894582],"category_scores_gemma":[0.0017788148,0.00022706935,0.00032511982,0.00071624195,0.0004135871,0.0010127921,0.00066367205,0.0007373102,0.00028727995],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018064014,0.00006025328,0.00029676236,0.00011270791,0.000032964537,0.0000519657,0.000041097945,0.707412,0.015625881,0.01652639,0.0034812493,0.2561781],"study_design_scores_gemma":[0.000016024891,0.000021966685,0.000055675897,0.0000020398031,0.0000028890845,0.000011615851,0.0000034557145,0.9947573,0.0021872902,0.002633447,0.0003034108,0.000004845172],"about_ca_topic_score_codex":0.002704859,"about_ca_topic_score_gemma":0.0035443844,"teacher_disagreement_score":0.002704859,"about_ca_system_score_codex":0.000684565,"about_ca_system_score_gemma":0.00082841463,"threshold_uncertainty_score":0.005986333},"labels":[],"label_agreement":null},{"id":"W2035717928","doi":"10.4018/jitn.2011040104","title":"Data Transmission Oriented on the Object, Communication Media, Application, and State of Communication Systems","year":2011,"lang":"en","type":"article","venue":"International Journal of Interdisciplinary Telecommunications and Networking","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"École de Technologie Supérieure","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Orthogonal frequency-division multiplexing; Lossless compression; Wireless; Channel (broadcasting); Transmission (telecommunications); JPEG 2000; Fading; Communications system; OSI model; Computer network; Real-time computing; Interconnection; Image compression; Data compression; Telecommunications; Image processing; Image (mathematics); Algorithm; Artificial intelligence","score_opus":0.046978274472125006,"score_gpt":0.3180524181200378,"score_spread":0.2710741436479128,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2035717928","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04498206,0.00072893314,0.91427547,0.0007065952,0.0005923213,0.00031750818,0.0002028681,0.0061089173,0.032085333],"genre_scores_gemma":[0.66484386,0.0011925473,0.29349068,0.0006786814,0.00064683886,0.0004715309,0.0007830902,0.0004582918,0.037434563],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994136,0.00009814402,0.000067160305,0.00012667876,0.00020353045,0.00009092702],"domain_scores_gemma":[0.9991573,0.00009868067,0.000093871255,0.00026772768,0.00032862485,0.000053788383],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00065035146,0.00045786833,0.00044661626,0.00084466574,0.0006453423,0.0021030777,0.00083827606,0.00052088406,0.004673014],"category_scores_gemma":[0.0011818007,0.00020912483,0.00032646224,0.00070371083,0.0007924908,0.0014644489,0.0012407611,0.0008463512,0.0017909732],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00095543696,0.00020025176,0.0035102149,0.00046608486,0.00012417774,0.00061483786,0.00094238546,0.0140133295,0.18188913,0.30050537,0.022815466,0.4739634],"study_design_scores_gemma":[0.00019296273,0.0011611234,0.003360245,0.00019115448,0.00024940088,0.0016981707,0.00039042658,0.3521235,0.26292858,0.06930801,0.30822483,0.00017158278],"about_ca_topic_score_codex":0.00094562356,"about_ca_topic_score_gemma":0.000893575,"teacher_disagreement_score":0.004673014,"about_ca_system_score_codex":0.0005719649,"about_ca_system_score_gemma":0.001020353,"threshold_uncertainty_score":0.015632749},"labels":[],"label_agreement":null},{"id":"W2036870149","doi":"10.1109/pimrc.2007.4394754","title":"Variable Modulation and Bit Energy Optimization for Transmission of Compressed Images","year":2007,"lang":"en","type":"article","venue":"","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Quadrature amplitude modulation; Computer science; Modulation (music); QAM; Transmission (telecommunications); Bandwidth (computing); Link adaptation; Bit error rate; Algorithm; Analog transmission; Electronic engineering; Transmitter power output; Delta modulation; Telecommunications; Channel (broadcasting); Pulse-amplitude modulation; Decoding methods; Fading; Engineering; Physics; Detector","score_opus":0.010173795110447203,"score_gpt":0.25870339596878117,"score_spread":0.24852960085833398,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2036870149","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06988507,0.0009313696,0.92655426,0.00027502287,0.000021461485,0.00002771993,0.000019603283,0.000085604515,0.00219999],"genre_scores_gemma":[0.7679442,0.0005511997,0.22978234,0.00008578898,0.0000363924,0.000057050907,0.000034207227,0.00002805038,0.001480647],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997167,0.00012990678,0.000011213663,0.000026405027,0.00010071107,0.000015100156],"domain_scores_gemma":[0.99971145,0.00017799683,0.000044297067,0.000027562835,0.000032223572,0.0000064141],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036626973,0.00026417713,0.00026551494,0.00027304346,0.00014212796,0.00028017917,0.00034439453,0.00032545353,0.00068473595],"category_scores_gemma":[0.0013019069,0.00012191042,0.00013106529,0.0003791969,0.00040988796,0.0005273987,0.00030989706,0.00032907553,0.000118326265],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00035363866,0.00009167219,0.00076030195,0.00019245732,0.000059866972,0.00014252312,0.00013638602,0.5934278,0.11897506,0.056430925,0.0009435551,0.2284858],"study_design_scores_gemma":[0.000027634936,0.00008815779,0.00021905413,0.000010220393,0.000011767123,0.0000855331,0.00001217279,0.9766708,0.014061535,0.00783125,0.0009724742,0.000009493813],"about_ca_topic_score_codex":0.00029813265,"about_ca_topic_score_gemma":0.00045976063,"teacher_disagreement_score":0.00068473595,"about_ca_system_score_codex":0.0002679867,"about_ca_system_score_gemma":0.00021739597,"threshold_uncertainty_score":0.002290666},"labels":[],"label_agreement":null},{"id":"W2037776605","doi":"10.1109/isit.2007.4557311","title":"Multiple Description Quantizer Design for Space-time Orthogonal Block Coded Channels","year":2007,"lang":"en","type":"article","venue":"","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Transmitter; Algorithm; Computer science; Maximum a posteriori estimation; Decoding methods; Channel (broadcasting); Rayleigh fading; Block (permutation group theory); Upper and lower bounds; Block code; Fading; A priori and a posteriori; Theoretical computer science; Mathematics; Maximum likelihood; Telecommunications; Statistics","score_opus":0.05372447172001168,"score_gpt":0.29489975521700956,"score_spread":0.24117528349699788,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2037776605","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009188182,0.00065237,0.98916656,0.000159094,0.00002578156,0.000037685357,0.000057410063,0.00007457581,0.0006383348],"genre_scores_gemma":[0.63256663,0.001209765,0.3622782,0.00020656885,0.0001094814,0.00023369488,0.00025632043,0.000059946477,0.0030793468],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99917823,0.00029556765,0.000046902805,0.00010104307,0.00030970114,0.00006856963],"domain_scores_gemma":[0.99801755,0.0012682244,0.00021708148,0.00010583551,0.00035253214,0.00003873309],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018516955,0.00057107286,0.00064915605,0.0003845752,0.00025830005,0.0008067745,0.0009833833,0.000660619,0.0015328805],"category_scores_gemma":[0.0035822797,0.00029279303,0.00020998558,0.00061233016,0.0005313131,0.0014776912,0.00062880764,0.0008400016,0.0002941725],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00029058382,0.000057488873,0.00078870356,0.00032006548,0.00007005251,0.00013422947,0.00014786888,0.6936163,0.016736232,0.108881615,0.0023983368,0.17655863],"study_design_scores_gemma":[0.000026969165,0.000048449965,0.000057093122,0.000009596061,0.000009376022,0.000023354405,0.000008290392,0.98471385,0.0033253538,0.01082646,0.0009408308,0.000010440255],"about_ca_topic_score_codex":0.0014347018,"about_ca_topic_score_gemma":0.0019181105,"teacher_disagreement_score":0.0018516955,"about_ca_system_score_codex":0.0008456119,"about_ca_system_score_gemma":0.0008638379,"threshold_uncertainty_score":0.009792805},"labels":[],"label_agreement":null},{"id":"W2038216307","doi":"10.1109/icdsp.2011.6004888","title":"Face detection in a compressed domain","year":2011,"lang":"en","type":"preprint","venue":"","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Sherbrooke","funders":"","keywords":"Discrete cosine transform; Computer science; Lapped transform; Transform coding; Artificial intelligence; Image (mathematics); Computer vision; Face (sociological concept); Focus (optics); Algorithm; Merge (version control); Image compression; Image processing; Mathematics","score_opus":0.0312546934832722,"score_gpt":0.283949193130116,"score_spread":0.2526944996468438,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2038216307","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12607266,0.0009439617,0.85940963,0.0006617897,0.00031921678,0.00011664184,0.00048406346,0.0014378572,0.010554146],"genre_scores_gemma":[0.4630252,0.00090601086,0.5235727,0.000432275,0.00035978114,0.000118969765,0.0013015934,0.00015239352,0.010131095],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99950254,0.00004893311,0.000017672979,0.00007718599,0.00031002774,0.00004372799],"domain_scores_gemma":[0.9995327,0.00014260734,0.000033125325,0.000099343815,0.00017087783,0.000021338137],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024712613,0.00040312458,0.00045724201,0.0011750965,0.00020545365,0.0005882148,0.0005498454,0.00056778087,0.004530216],"category_scores_gemma":[0.0016763526,0.00016700863,0.0002646637,0.00083360076,0.00031981405,0.00091258076,0.00062802434,0.00041192782,0.0014425472],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005959371,0.00015000971,0.0009931726,0.00023213704,0.000055222343,0.000744915,0.00014100765,0.03199463,0.28468376,0.011520806,0.0064652064,0.6624231],"study_design_scores_gemma":[0.000062706786,0.00024445142,0.0027417173,0.000054572327,0.000044964436,0.0022924626,0.00012825592,0.76139075,0.20910218,0.009530399,0.014369562,0.000038000628],"about_ca_topic_score_codex":0.0012437416,"about_ca_topic_score_gemma":0.0010675504,"teacher_disagreement_score":0.004530216,"about_ca_system_score_codex":0.00023484389,"about_ca_system_score_gemma":0.0002666497,"threshold_uncertainty_score":0.015155077},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.021916231601956142,"score_gpt":0.2926400405790815,"score_spread":0.27072380897712534,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2038292149","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014335519,0.0002331997,0.98488116,0.00010393987,0.000016641025,0.000015064884,0.00001650557,0.0001166514,0.00028138346],"genre_scores_gemma":[0.53590965,0.0007246401,0.46113375,0.00013825712,0.00009286464,0.00010723574,0.000114575465,0.00005375926,0.0017252556],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995315,0.00015243968,0.000026912927,0.0000752105,0.00018112833,0.00003280988],"domain_scores_gemma":[0.9976888,0.001522816,0.00021993183,0.00022544773,0.0002887249,0.000054277432],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009639574,0.00053545664,0.0005401696,0.00035477898,0.00021102907,0.0004887571,0.00061925204,0.0004587642,0.00076593354],"category_scores_gemma":[0.0053499737,0.00030135384,0.00026716854,0.0005221113,0.00064947596,0.00094121596,0.000784974,0.0009833177,0.00021067505],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00038790185,0.00009735307,0.0017170905,0.00015274595,0.00003768424,0.00016825066,0.00014600052,0.71315444,0.03420292,0.020957163,0.0009564206,0.22802202],"study_design_scores_gemma":[0.0000063574566,0.000064507,0.00009084427,0.0000048614465,0.000004067977,0.000023856419,0.000004152921,0.9931687,0.004275746,0.002045959,0.00030606333,0.0000048046395],"about_ca_topic_score_codex":0.0010561474,"about_ca_topic_score_gemma":0.0013628028,"teacher_disagreement_score":0.0010561474,"about_ca_system_score_codex":0.00036750702,"about_ca_system_score_gemma":0.0005976218,"threshold_uncertainty_score":0.0050979257},"labels":[],"label_agreement":null},{"id":"W2038849281","doi":"10.1007/s11760-011-0242-8","title":"Adaptive vector-valued martingales: applications to image compression","year":2011,"lang":"en","type":"article","venue":"Signal Image and Video Processing","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Orthonormal basis; Mathematics; Martingale (probability theory); Algorithm; Scalar (mathematics); Applied mathematics; Basis function; Lossy compression; Mathematical optimization; Mathematical analysis","score_opus":0.039398520044132385,"score_gpt":0.307582814925272,"score_spread":0.2681842948811396,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2038849281","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009455982,0.0031617526,0.9848541,0.00031193104,0.00017388753,0.00001562837,0.000036291753,0.0001561947,0.0018342466],"genre_scores_gemma":[0.57633626,0.015526945,0.38713396,0.00042533604,0.0011516741,0.00019882774,0.00023056172,0.00019197322,0.018804427],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997538,0.00010101464,0.000013658333,0.000036162914,0.00007466886,0.000020580008],"domain_scores_gemma":[0.99797946,0.0015431738,0.00013702404,0.00007366783,0.00020086521,0.000065879416],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014143337,0.00087193545,0.0008181215,0.0011381329,0.00022583756,0.0010603762,0.00078852323,0.0011815142,0.0019970804],"category_scores_gemma":[0.0058353697,0.00040829158,0.00060332083,0.0014399217,0.0014822375,0.0010701332,0.00077901455,0.0016142981,0.00032840794],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016850281,0.00010298053,0.00075361354,0.00033992864,0.00008361661,0.00020037779,0.00016629735,0.23061273,0.009122278,0.5933702,0.002808501,0.162271],"study_design_scores_gemma":[0.000025424166,0.00004851586,0.00032209948,0.000033211963,0.000017101467,0.00009400275,0.00001619119,0.87290686,0.0017319301,0.12232312,0.00245715,0.00002429422],"about_ca_topic_score_codex":0.0005121888,"about_ca_topic_score_gemma":0.0005952008,"teacher_disagreement_score":0.0019970804,"about_ca_system_score_codex":0.0003958619,"about_ca_system_score_gemma":0.00036937054,"threshold_uncertainty_score":0.007479787},"labels":[],"label_agreement":null},{"id":"W2038870549","doi":"10.1109/tsp.2009.2013896","title":"Filter Banks for Prediction-Compensated Multiple Description Coding","year":2009,"lang":"en","type":"article","venue":"IEEE Transactions on Signal Processing","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Filter bank; Biorthogonal system; Algorithm; Computer science; Multiple description coding; Filter (signal processing); Sub-band coding; Coding (social sciences); Filter design; Transform coding; JPEG; Coding gain; Data compression; Theoretical computer science; Mathematics; Decoding methods; Artificial intelligence; Image (mathematics); Computer vision; Discrete cosine transform; Statistics; Wavelet transform; Wavelet","score_opus":0.040095522208420345,"score_gpt":0.2783958263703622,"score_spread":0.23830030416194187,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2038870549","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004903534,0.00044847306,0.993393,0.000094524985,0.00004097945,0.000022643673,0.000033501456,0.0001282937,0.0009350498],"genre_scores_gemma":[0.2477079,0.00097066106,0.7472191,0.00018959263,0.00010027274,0.00014057172,0.00024359295,0.000038862854,0.0033894167],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99963653,0.00008787702,0.000020152029,0.000055972894,0.00017035048,0.000029008517],"domain_scores_gemma":[0.9995828,0.00017273496,0.000038556533,0.00007886518,0.00011549263,0.000011481072],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005446426,0.00040872867,0.0003147886,0.00039497303,0.00023660346,0.0004652687,0.0005646252,0.0007099007,0.0019837315],"category_scores_gemma":[0.0011715685,0.00020146043,0.00029783664,0.00047069023,0.00036877365,0.00081513874,0.0003738972,0.0006802804,0.0005808654],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00034566058,0.00007379118,0.0005839232,0.00024157178,0.000054038817,0.00023993087,0.000114640774,0.15767057,0.08272781,0.16343778,0.005513891,0.5889963],"study_design_scores_gemma":[0.000032939854,0.00010072263,0.0002615089,0.00003583244,0.000026136539,0.00022265222,0.000018905486,0.9440214,0.027061196,0.017189698,0.010998622,0.00003038636],"about_ca_topic_score_codex":0.0013181764,"about_ca_topic_score_gemma":0.0016477917,"teacher_disagreement_score":0.0019837315,"about_ca_system_score_codex":0.00053376687,"about_ca_system_score_gemma":0.00065119157,"threshold_uncertainty_score":0.006636262},"labels":[],"label_agreement":null},{"id":"W2039284214","doi":"10.1117/12.909138","title":"Cubic-panorama image dataset compression","year":2012,"lang":"en","type":"article","venue":"Proceedings of SPIE, the International Society for Optical Engineering/Proceedings of SPIE","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Panorama; Computer science; Codec; Bitstream; Computer vision; Artificial intelligence; Epipolar geometry; Data compression; Image (mathematics); Image compression; Group of pictures; Computer graphics (images); Image processing; Decoding methods; Algorithm","score_opus":0.014504420409503763,"score_gpt":0.26467089615184825,"score_spread":0.25016647574234446,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2039284214","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11857312,0.0031768545,0.8604233,0.0008249729,0.0004425994,0.00025921373,0.002224226,0.002942491,0.011133111],"genre_scores_gemma":[0.4906134,0.0023200077,0.49237254,0.00038652375,0.00029085664,0.00024375819,0.0059796562,0.00034688102,0.007446367],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993936,0.000050320563,0.00003274852,0.00007969089,0.0003820788,0.00006152159],"domain_scores_gemma":[0.998978,0.00021810173,0.00006367797,0.00046266842,0.00025833023,0.000019211951],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039733655,0.00036151838,0.00050036353,0.0010669561,0.00034362875,0.00069844734,0.0007224094,0.00045311725,0.0031944488],"category_scores_gemma":[0.0023150225,0.00012370017,0.00033218693,0.001931985,0.00027402432,0.0010921431,0.0007432543,0.00063192367,0.0009468438],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005664605,0.00008191827,0.0018915962,0.00039586177,0.000061042985,0.00034949492,0.000104545696,0.030003734,0.06581345,0.014197971,0.017898075,0.86863583],"study_design_scores_gemma":[0.000076862176,0.00029142658,0.009022228,0.00011508433,0.00006813223,0.0030891765,0.00024917623,0.68926096,0.20648278,0.018032484,0.07323453,0.00007709497],"about_ca_topic_score_codex":0.0021911312,"about_ca_topic_score_gemma":0.0024632872,"teacher_disagreement_score":0.0031944488,"about_ca_system_score_codex":0.0003715901,"about_ca_system_score_gemma":0.00056123396,"threshold_uncertainty_score":0.010686517},"labels":[],"label_agreement":null},{"id":"W2039351044","doi":"10.1109/tmm.2007.906557","title":"Efficient Algorithms for Optimal Uneven Protection of Single and Multiple Scalable Code Streams Against Packet Erasures","year":2007,"lang":"en","type":"article","venue":"IEEE Transactions on Multimedia","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Computer science; Erasure; Scalability; Algorithm; Network packet; Set partitioning in hierarchical trees; Code (set theory); Transmission (telecommunications); Binary erasure channel; Code rate; Decoding methods; Computer network; Channel capacity; Image compression; Channel (broadcasting)","score_opus":0.03320495448483631,"score_gpt":0.2834498373875809,"score_spread":0.2502448829027446,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2039351044","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007957832,0.00006442611,0.9911942,0.000046845253,0.000010018154,0.000025416233,0.000010907061,0.00012705341,0.00056342315],"genre_scores_gemma":[0.28412223,0.00022444368,0.7134954,0.000058621597,0.000043484135,0.00020695128,0.000111214445,0.00010890194,0.0016287296],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99951017,0.00011597272,0.000028338845,0.00007658876,0.00019236316,0.00007664086],"domain_scores_gemma":[0.9985103,0.0009212265,0.00015118592,0.0001822741,0.0001828823,0.000052126717],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012612771,0.0007858913,0.0009261466,0.0007116853,0.00038526652,0.0008215514,0.0010490558,0.0007236997,0.0016438601],"category_scores_gemma":[0.005031977,0.00036698068,0.00053895894,0.0006665384,0.00087032514,0.0013762042,0.0015041456,0.0012012091,0.00034667854],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010179198,0.000042213436,0.0004046643,0.00006979853,0.00003083351,0.000053923726,0.00012440608,0.8310264,0.005203508,0.040612523,0.0010118228,0.12131815],"study_design_scores_gemma":[0.00001331745,0.000023703298,0.00003146961,0.0000045991846,0.0000032411408,0.000015806074,0.000013001696,0.98941284,0.0015484806,0.008617646,0.00031185092,0.0000040573104],"about_ca_topic_score_codex":0.0013009742,"about_ca_topic_score_gemma":0.0012449945,"teacher_disagreement_score":0.0016438601,"about_ca_system_score_codex":0.0007295242,"about_ca_system_score_gemma":0.001262327,"threshold_uncertainty_score":0.006670356},"labels":[],"label_agreement":null},{"id":"W2039988116","doi":"10.1007/s10278-010-9308-3","title":"Letter to the Editor Re: PanCanadian Evaluation of Irreversible Compression Ratios (“Lossy” Compression) for Development of National Guidelines","year":2010,"lang":"en","type":"letter","venue":"Journal of Digital Imaging","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Lossy compression; Compression (physics); Computer science; Data compression; Algorithm; Artificial intelligence; Materials science; Composite material","score_opus":0.08302255933786884,"score_gpt":0.3668809361966186,"score_spread":0.28385837685874976,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2039988116","genre_codex":"commentary","genre_gemma":"editorial","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"editorial","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000687409,0.00076066534,0.00014574858,0.96257454,0.031169906,0.000021536927,0.000055385222,0.000031072857,0.004553705],"genre_scores_gemma":[0.008926834,0.0012159247,0.00062042923,0.9134705,0.056653026,0.000070267415,0.000052621832,0.000060525497,0.018929834],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9983169,0.0003699672,0.00023988694,0.00021828897,0.0005966218,0.00025834472],"domain_scores_gemma":[0.9941181,0.0025088156,0.0004735273,0.0001515921,0.0021249058,0.0006231449],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018045873,0.0006368667,0.0012301046,0.0008327585,0.002106541,0.002290258,0.001303338,0.034830213,0.0069129197],"category_scores_gemma":[0.023508977,0.0006166817,0.0007787989,0.00057471637,0.0014068244,0.0021008262,0.0006661888,0.023992404,0.006241599],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":true,"about_ca_topic_consensus":false,"about_ca_system_candidate":true,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005439001,0.00002695792,0.00038775857,0.00003730414,0.000007686715,0.0030744176,0.000059006645,0.000054680637,0.00013374501,0.0011430748,0.98955613,0.0054648523],"study_design_scores_gemma":[0.00016887994,0.000089007044,0.0019032252,0.00043952296,0.00004651219,0.009834516,0.0004261057,0.0011144045,0.00090114784,0.0063718394,0.9786129,0.0000919055],"about_ca_topic_score_codex":0.0036660244,"about_ca_topic_score_gemma":0.0066048256,"teacher_disagreement_score":0.99633396,"about_ca_system_score_codex":0.0037126197,"about_ca_system_score_gemma":0.0037655141,"threshold_uncertainty_score":0.026937127},"labels":[],"label_agreement":null},{"id":"W2039993956","doi":"10.1109/tip.2005.860357","title":"Context quantization by kernel Fisher discriminant","year":2005,"lang":"en","type":"article","venue":"IEEE Transactions on Image Processing","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Fisher kernel; Mathematics; Discriminant; Kernel Fisher discriminant analysis; Pattern recognition (psychology); Linear discriminant analysis; Entropy (arrow of time); Artificial intelligence; Algorithm; Kernel (algebra); Kernel method; Computer science; Support vector machine; Discrete mathematics","score_opus":0.016154316381050506,"score_gpt":0.2810376654340839,"score_spread":0.2648833490530334,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2039993956","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009036752,0.00020732294,0.98985785,0.00007688843,0.00002069491,0.00001778753,0.00003510674,0.0001986644,0.0005488466],"genre_scores_gemma":[0.3871808,0.00036814623,0.610149,0.000102048565,0.00006251932,0.00011968246,0.0001645019,0.0001296423,0.0017235565],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994854,0.00012769841,0.0000313188,0.00011577192,0.00018964436,0.00005006807],"domain_scores_gemma":[0.9994111,0.00023842194,0.00005201209,0.0001003445,0.00016853187,0.000029499286],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00086780736,0.000493386,0.00070506614,0.00068511197,0.00038307993,0.0008520985,0.00083041645,0.00070723885,0.001820332],"category_scores_gemma":[0.004537148,0.00027386108,0.00043709666,0.00072228373,0.00063190405,0.0022735342,0.0012234395,0.0012791723,0.00047884262],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00030186563,0.000069116715,0.0007535408,0.00012341354,0.000032570708,0.00006729109,0.00014985683,0.2492964,0.022448774,0.14086476,0.0041864035,0.581706],"study_design_scores_gemma":[0.000011366526,0.000015444359,0.0001423825,0.000007280816,0.0000045296083,0.000021549973,0.000010230112,0.97384304,0.0033115598,0.021814857,0.0008043884,0.0000133848935],"about_ca_topic_score_codex":0.0024051436,"about_ca_topic_score_gemma":0.002094259,"teacher_disagreement_score":0.0024051436,"about_ca_system_score_codex":0.0008345963,"about_ca_system_score_gemma":0.00087833486,"threshold_uncertainty_score":0.006089568},"labels":[],"label_agreement":null},{"id":"W2040374156","doi":"10.17722/ijrbt.v1i1.6","title":"Image Compression of medical images using VQ-Huffman Coding Technique","year":2012,"lang":"en","type":"article","venue":"International Journal of Research in Business and Technology","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Huffman coding; Image compression; Computer science; Computer vision; Artificial intelligence; Compression (physics); Data compression; Tunstall coding; Image (mathematics); Image processing; Materials science; Composite material","score_opus":0.07142561978015732,"score_gpt":0.45303856506194756,"score_spread":0.38161294528179024,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2040374156","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.100981146,0.0042761914,0.8860467,0.00049463887,0.00040639838,0.00030500305,0.0003097964,0.001317923,0.0058622104],"genre_scores_gemma":[0.5000964,0.003751572,0.48539314,0.00025345324,0.00018881213,0.00026100688,0.0009178896,0.000074575546,0.009063238],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99971753,0.000030626215,0.000021955704,0.000023591068,0.00018543519,0.00002081978],"domain_scores_gemma":[0.9997223,0.00008842496,0.000035189933,0.000028827108,0.00011898709,0.000006353235],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002860405,0.0003250693,0.00042771094,0.00076176634,0.00018679198,0.00034406685,0.0004916771,0.00049298734,0.0013111477],"category_scores_gemma":[0.0010963943,0.000100947545,0.0002568455,0.00099182,0.00022278503,0.00049522595,0.00024351433,0.0003517837,0.00041658364],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00035260897,0.00016158509,0.0011628697,0.0005129452,0.0000559699,0.0007962437,0.00019961965,0.054189365,0.26149386,0.010201134,0.0049387473,0.6659351],"study_design_scores_gemma":[0.00007723235,0.0008334764,0.0047983183,0.00015186566,0.00006507295,0.003249128,0.00011445059,0.68844235,0.27967384,0.0040792217,0.01844975,0.00006527956],"about_ca_topic_score_codex":0.0016951833,"about_ca_topic_score_gemma":0.0012297637,"teacher_disagreement_score":0.0016951833,"about_ca_system_score_codex":0.0002626006,"about_ca_system_score_gemma":0.00032799836,"threshold_uncertainty_score":0.004386246},"labels":[],"label_agreement":null},{"id":"W2040901912","doi":"10.1121/1.1815244","title":"Backward compatible wideband voice over narrowband low-resolution media","year":2004,"lang":"en","type":"article","venue":"Acoustics Research Letters Online","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Institute for Microstructural Sciences","funders":"","keywords":"Narrowband; Wideband; Wideband audio; Computer science; Decoding methods; Scheme (mathematics); Channel (broadcasting); Electronic engineering; Telecommunications; Digital audio; Speech coding; Engineering; Audio signal","score_opus":0.04983186610251448,"score_gpt":0.362550627869294,"score_spread":0.3127187617667795,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2040901912","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.32638124,0.0034704853,0.64731497,0.0004961736,0.00030533178,0.00012702063,0.0002856738,0.001621867,0.019997211],"genre_scores_gemma":[0.78201205,0.0014116309,0.18681976,0.00030265498,0.00026353414,0.000081490885,0.00037577294,0.0001490872,0.028584061],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99975914,0.000036683796,0.00001745821,0.00003877194,0.00012170773,0.00002637406],"domain_scores_gemma":[0.99958175,0.00012634919,0.000060628783,0.00011203861,0.00009634633,0.000022835295],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031153698,0.00027886135,0.00033927042,0.00034740672,0.00031542635,0.0005097419,0.00056323013,0.00042172463,0.0027722428],"category_scores_gemma":[0.0006831917,0.00018172368,0.0001375544,0.00023389708,0.0003051871,0.0013968733,0.00086261233,0.00055236544,0.00094661285],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007346648,0.00005062616,0.00047583715,0.00022350864,0.000014307124,0.00032112718,0.0002987008,0.0020971498,0.81560725,0.019274127,0.0008338613,0.16006878],"study_design_scores_gemma":[0.000103232,0.00056129775,0.00077624514,0.0000851814,0.000056276076,0.0015445865,0.00013085353,0.028045084,0.9205416,0.0060685673,0.042018652,0.000068388086],"about_ca_topic_score_codex":0.00014514099,"about_ca_topic_score_gemma":0.0001957232,"teacher_disagreement_score":0.0027722428,"about_ca_system_score_codex":0.00016046669,"about_ca_system_score_gemma":0.00012405383,"threshold_uncertainty_score":0.0092740655},"labels":[],"label_agreement":null},{"id":"W2041291949","doi":"10.1109/bmsb.2011.5954910","title":"Improved adaptive arithmetic coding based on optimal segmentation of code symbols for lossless motion vector coding","year":2011,"lang":"en","type":"article","venue":"","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Communications Research Centre Canada","funders":"","keywords":"Arithmetic coding; Context-adaptive variable-length coding; Adaptive coding; Lossless compression; Coding (social sciences); Context-adaptive binary arithmetic coding; Variable-length code; Decoding methods; Computer science; Shannon–Fano coding; Algorithm; Mathematics; Data compression; Arithmetic; Theoretical computer science; Statistics","score_opus":0.05938250150870422,"score_gpt":0.29773870406739755,"score_spread":0.23835620255869333,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2041291949","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012056054,0.00054895174,0.98566866,0.000070051035,0.00006939086,0.000037952806,0.000037649195,0.00033691875,0.0011744781],"genre_scores_gemma":[0.25896057,0.00068491814,0.7365272,0.00013536887,0.000126064,0.0001449772,0.0002989456,0.000096870805,0.0030250242],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996649,0.000057609384,0.00002335033,0.000057195524,0.00017143373,0.000025428963],"domain_scores_gemma":[0.9996741,0.00009984048,0.000037508158,0.00007369502,0.000104205814,0.000010643457],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031135854,0.00046014643,0.00040238257,0.0006209405,0.00019676582,0.000378388,0.0006945702,0.00042546075,0.000997877],"category_scores_gemma":[0.0014415598,0.00014118836,0.0003216315,0.000719713,0.0004023055,0.00079624495,0.00042630357,0.0006966866,0.00034539608],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00032719772,0.00007309188,0.00062772376,0.00015753448,0.000044857516,0.00018768825,0.00017118448,0.13729584,0.24362032,0.06736506,0.0026944007,0.54743505],"study_design_scores_gemma":[0.0000307884,0.00015432917,0.0006112946,0.00002508494,0.000029024817,0.00030455703,0.000013271054,0.9273623,0.051723875,0.00840525,0.0113055855,0.000034657354],"about_ca_topic_score_codex":0.0014743733,"about_ca_topic_score_gemma":0.0019681493,"teacher_disagreement_score":0.0014743733,"about_ca_system_score_codex":0.00041823077,"about_ca_system_score_gemma":0.000491437,"threshold_uncertainty_score":0.0033382177},"labels":[],"label_agreement":null},{"id":"W2042395078","doi":"10.1109/ccece.2006.277376","title":"Reconfigurable Implementation of Wavelet Transform on an Fpga-Augmented NIOS Processor","year":2006,"lang":"en","type":"article","venue":"","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Nios II; Field-programmable gate array; Computer science; Discrete wavelet transform; Lifting scheme; Wavelet transform; Embedded system; Computer hardware; Flexibility (engineering); Image compression; Data compression; Second-generation wavelet transform; Wavelet; Image processing; Image (mathematics); Algorithm; Artificial intelligence","score_opus":0.014063534438149993,"score_gpt":0.3075072574872522,"score_spread":0.2934437230491022,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2042395078","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.42149964,0.0005815334,0.5238266,0.00024661887,0.00037857564,0.00028031875,0.00022560445,0.008496959,0.04446417],"genre_scores_gemma":[0.8854793,0.00018264611,0.103316225,0.00009289074,0.000033424658,0.00011434847,0.00019210546,0.00008842875,0.010500619],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9998933,0.000017909357,0.00001086703,0.00002005902,0.00003423948,0.000023606695],"domain_scores_gemma":[0.99991965,0.000013430124,0.000013480066,0.000019748593,0.000025713507,0.000008000068],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000078105964,0.00028915616,0.00018694648,0.00020684961,0.00013323147,0.00034885443,0.0005935743,0.00013840209,0.0044362326],"category_scores_gemma":[0.0002301773,0.00009153109,0.000106093474,0.00016173323,0.00010935852,0.00026065198,0.00016695815,0.00024106656,0.0008673097],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0022087272,0.00027682347,0.0033021718,0.00052853423,0.00009560397,0.0016536539,0.000276035,0.034820832,0.57623684,0.01969269,0.009384705,0.3515234],"study_design_scores_gemma":[0.00041222994,0.0020939845,0.005415323,0.00009202923,0.00018691499,0.0025279215,0.00015121845,0.35190848,0.5505237,0.0028221451,0.083793744,0.00007230839],"about_ca_topic_score_codex":0.00049120304,"about_ca_topic_score_gemma":0.0007501707,"teacher_disagreement_score":0.0044362326,"about_ca_system_score_codex":0.00018692634,"about_ca_system_score_gemma":0.0002942673,"threshold_uncertainty_score":0.0148406625},"labels":[],"label_agreement":null},{"id":"W2043703498","doi":"10.1109/isit.2013.6620646","title":"Randomized quantization and optimal design with a marginal constraint","year":2013,"lang":"en","type":"article","venue":"","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Mathematics; Quantization (signal processing); Vector quantization; Mathematical optimization; Constraint (computer-aided design); Regular polygon; Measure (data warehouse); Probability distribution; Joint probability distribution; Applied mathematics; Algorithm; Computer science; Statistics","score_opus":0.0179390282139085,"score_gpt":0.24753345926973427,"score_spread":0.22959443105582578,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2043703498","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010608151,0.00022504263,0.98691887,0.0003353268,0.00002455248,0.000020861997,0.00006621399,0.00009355103,0.0017073059],"genre_scores_gemma":[0.7465933,0.000748547,0.24728216,0.00030915192,0.00012216104,0.00024129412,0.00027113056,0.00013148194,0.0043006963],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976356,0.0009991108,0.00012159396,0.0004567793,0.0006099658,0.00017698754],"domain_scores_gemma":[0.9972914,0.0016888529,0.00031860586,0.00033635827,0.00028910383,0.00007559229],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002473697,0.00059315923,0.001202697,0.00041377972,0.00036859998,0.001303181,0.0012817346,0.00089562975,0.00241013],"category_scores_gemma":[0.009712264,0.00040472794,0.00049885747,0.00091559195,0.0019846067,0.0030760218,0.0016236154,0.001325451,0.00038803855],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002068614,0.000041584124,0.00034246544,0.0001332903,0.000043928078,0.000078373625,0.00006395193,0.4168113,0.006333479,0.53956264,0.0008371861,0.035544984],"study_design_scores_gemma":[0.000031922853,0.00007921058,0.00009437048,0.000018570603,0.000011433566,0.00004563362,0.000013599247,0.86405045,0.003073959,0.13134985,0.0012130267,0.000017977904],"about_ca_topic_score_codex":0.00094091694,"about_ca_topic_score_gemma":0.0006813227,"teacher_disagreement_score":0.002473697,"about_ca_system_score_codex":0.0012934991,"about_ca_system_score_gemma":0.0011916176,"threshold_uncertainty_score":0.013082325},"labels":[],"label_agreement":null},{"id":"W2046063115","doi":"10.1007/s10278-011-9387-9","title":"A Parallel Method to Improve Medical Image Transmission","year":2011,"lang":"en","type":"article","venue":"Journal of Digital Imaging","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"","keywords":"Speedup; Computer science; DICOM; Transmission (telecommunications); Data transmission; Picture archiving and communication system; Image compression; Data compression; Local area network; Protocol (science); Computer hardware; Parallel computing; Image (mathematics); Image processing; Computer vision; Artificial intelligence; Computer network; Multimedia; Telecommunications; Medicine","score_opus":0.020579215331441403,"score_gpt":0.3205233248976793,"score_spread":0.2999441095662379,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2046063115","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010002792,0.00028713603,0.9848518,0.00018443441,0.0002486648,0.000055570294,0.00006689423,0.00096226233,0.0033405165],"genre_scores_gemma":[0.105076894,0.00057711964,0.8799559,0.00019279515,0.00021360433,0.00013013437,0.00022283262,0.00042962452,0.013201137],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9996201,0.0000702512,0.000020800246,0.00006383111,0.00019799781,0.000026955846],"domain_scores_gemma":[0.9992324,0.000179019,0.000049532897,0.0002514953,0.000250351,0.000037166774],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00048833963,0.0009119501,0.00060787547,0.00073900685,0.00067434576,0.000719389,0.0008321833,0.00058281224,0.00959563],"category_scores_gemma":[0.0013877123,0.00038404047,0.00063941017,0.0009429932,0.00044968072,0.001318622,0.0010417234,0.0008699682,0.0019118777],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008940227,0.00037599716,0.00073188334,0.00028582325,0.00013366838,0.00026216387,0.00016686127,0.048754223,0.1890217,0.030675214,0.011658775,0.71703964],"study_design_scores_gemma":[0.00012858781,0.0003444823,0.0006451687,0.00002758247,0.0001484263,0.0011814232,0.00005231049,0.8158985,0.1421264,0.014406469,0.024991168,0.000049420567],"about_ca_topic_score_codex":0.0011065961,"about_ca_topic_score_gemma":0.002056244,"teacher_disagreement_score":0.00959563,"about_ca_system_score_codex":0.00033156236,"about_ca_system_score_gemma":0.0007326702,"threshold_uncertainty_score":0.032100618},"labels":[],"label_agreement":null},{"id":"W2046246430","doi":"10.1117/12.930528","title":"Content adaptive enhancement of video images","year":2012,"lang":"en","type":"article","venue":"Proceedings of SPIE, the International Society for Optical Engineering/Proceedings of SPIE","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Qualcomm (Canada)","funders":"","keywords":"Computer science; Computer vision; Artificial intelligence; Computer graphics (images); Multimedia","score_opus":0.02300405386180029,"score_gpt":0.2549961020688828,"score_spread":0.2319920482070825,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2046246430","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09417211,0.0014270297,0.892812,0.00011896343,0.00014829148,0.00026904923,0.00022921707,0.0017999572,0.009023335],"genre_scores_gemma":[0.42674074,0.0014709085,0.5551554,0.0002470055,0.00012907918,0.00020082715,0.0006735363,0.0002921029,0.015090513],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99973136,0.000025551082,0.00001346522,0.000068921974,0.00013373645,0.000026925083],"domain_scores_gemma":[0.9996264,0.00007975037,0.00003359475,0.000058771155,0.0001884645,0.000012970063],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020961372,0.00039028245,0.0002742875,0.00073025905,0.00015982747,0.00041247674,0.0005310896,0.00032701358,0.0017551206],"category_scores_gemma":[0.0007465631,0.0001516774,0.00033324034,0.00059528445,0.000193845,0.00043375944,0.00044763766,0.0003231418,0.00076419435],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019019097,0.000079771446,0.0007996228,0.00017087105,0.00002521396,0.00011629612,0.000065711385,0.0029178683,0.6392114,0.0020105767,0.001655456,0.35275698],"study_design_scores_gemma":[0.00002499566,0.00023363276,0.0068674316,0.0000271987,0.00006566997,0.00062591536,0.000037475867,0.09935808,0.87777483,0.0010363165,0.01392043,0.000027904493],"about_ca_topic_score_codex":0.00052638195,"about_ca_topic_score_gemma":0.000637471,"teacher_disagreement_score":0.0017551206,"about_ca_system_score_codex":0.00026252502,"about_ca_system_score_gemma":0.00018408992,"threshold_uncertainty_score":0.0058714747},"labels":[],"label_agreement":null},{"id":"W2046379463","doi":"10.1109/tip.2006.888344","title":"Undersampled Boundary Pre-/Postfilters for Low Bit-Rate DCT-Based Block Coders","year":2007,"lang":"en","type":"article","venue":"IEEE Transactions on Image Processing","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Discrete cosine transform; Computer science; Block (permutation group theory); Bit rate; Data compression; Transform coding; Algorithm; Computer vision; Mathematics; Computer hardware; Image (mathematics)","score_opus":0.01885804295598718,"score_gpt":0.30335261423908033,"score_spread":0.28449457128309313,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2046379463","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.047973342,0.000803261,0.9489182,0.00009667723,0.000044577526,0.000044659435,0.000027686525,0.0006254682,0.0014660641],"genre_scores_gemma":[0.32949743,0.00076606096,0.6664699,0.00012623731,0.0000759398,0.000066578235,0.00012930996,0.000066572145,0.002801986],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998242,0.000033830238,0.000013962642,0.000021263377,0.00009473151,0.000012057413],"domain_scores_gemma":[0.99967253,0.00012448149,0.000054995326,0.00004430979,0.00008977813,0.000014037476],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023983842,0.00033613527,0.00021370634,0.00031216192,0.0001840699,0.00049040094,0.00029148816,0.00035002074,0.0015541605],"category_scores_gemma":[0.000903118,0.00015465052,0.00015770129,0.0002473739,0.00027705348,0.000408659,0.00017676788,0.00038495188,0.00057702657],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00033689095,0.00004092641,0.0005741279,0.00017452089,0.00002111277,0.0003231295,0.00013911165,0.016553033,0.62768,0.016968846,0.0012770368,0.3359113],"study_design_scores_gemma":[0.000060992526,0.00085636054,0.0019587432,0.000053414024,0.00006541708,0.0014455226,0.000073694195,0.41666615,0.5510921,0.006488143,0.021190757,0.000048660975],"about_ca_topic_score_codex":0.0007780033,"about_ca_topic_score_gemma":0.0017007751,"teacher_disagreement_score":0.0015541605,"about_ca_system_score_codex":0.00031184484,"about_ca_system_score_gemma":0.0003554747,"threshold_uncertainty_score":0.005199194},"labels":[],"label_agreement":null},{"id":"W2047310979","doi":"10.1049/el:20020242","title":"Unequal error protection and source-channel decoding of CELP speech","year":2002,"lang":"en","type":"article","venue":"Electronics Letters","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Code-excited linear prediction; Computer science; Speech recognition; Rayleigh fading; Vector sum excited linear prediction; Residual; Redundancy (engineering); Decoding methods; Speech coding; Algorithm; Linear predictive coding; Fading","score_opus":0.025423999268626495,"score_gpt":0.2407280993123273,"score_spread":0.21530410004370082,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2047310979","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.46074793,0.00055702345,0.5349372,0.00031436517,0.00004348269,0.000031392974,0.00006687052,0.0002807798,0.0030209655],"genre_scores_gemma":[0.9886125,0.00013246793,0.010678586,0.00000909306,0.000007842791,0.0000073558804,0.000018540963,0.000008582624,0.00052503974],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993948,0.00021599258,0.00002394545,0.00005114197,0.00022813884,0.00008600084],"domain_scores_gemma":[0.99776053,0.0017198265,0.00020347419,0.00014631872,0.00014563199,0.000024200714],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000893859,0.00033481664,0.00036795155,0.00025783968,0.00026882914,0.00032956246,0.0004028641,0.00042641838,0.0005336707],"category_scores_gemma":[0.0035590439,0.00016930126,0.00019976054,0.00019062913,0.0007545412,0.00046048057,0.000490125,0.00037184387,0.00013715151],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012309891,0.000057416048,0.0020776358,0.00018480083,0.000057163466,0.0012751087,0.0005725425,0.7283281,0.11402948,0.0630798,0.00054376,0.08856314],"study_design_scores_gemma":[0.000015817488,0.00008246458,0.0003058924,0.000008265547,0.000008986802,0.00016663215,0.000020411728,0.9405313,0.052778684,0.0057340255,0.00033716584,0.000010388628],"about_ca_topic_score_codex":0.001149323,"about_ca_topic_score_gemma":0.00087306276,"teacher_disagreement_score":0.001149323,"about_ca_system_score_codex":0.00043859298,"about_ca_system_score_gemma":0.00045080154,"threshold_uncertainty_score":0.0047272444},"labels":[],"label_agreement":null},{"id":"W2047566984","doi":"10.1117/12.753610","title":"A real-time wavelet-based video decoder using SIMD technology","year":2008,"lang":"en","type":"article","venue":"Proceedings of SPIE, the International Society for Optical Engineering/Proceedings of SPIE","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Communications Research Centre Canada","funders":"","keywords":"Computer science; Codec; SIMD; Adaptive Multi-Rate audio codec; Intrinsics; Software; Computer hardware; Parallel computing; Real-time computing; Speech recognition; Programming language","score_opus":0.014829108723724331,"score_gpt":0.25033005200633723,"score_spread":0.2355009432826129,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2047566984","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012026091,0.0002030096,0.97682023,0.00009183781,0.00010952089,0.00011100048,0.00022068428,0.0055378084,0.004879819],"genre_scores_gemma":[0.09406138,0.00025094044,0.8970774,0.00021919984,0.000068551446,0.00018779039,0.0008692034,0.0005545676,0.00671104],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99947613,0.0000533481,0.000034776567,0.000067156434,0.00033160605,0.0000370064],"domain_scores_gemma":[0.9993849,0.0001426657,0.000042230335,0.000108889115,0.00029203444,0.00002936121],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005078045,0.0005363822,0.00043538897,0.0009419988,0.0002945516,0.0006173027,0.0009975125,0.0005297665,0.0047030323],"category_scores_gemma":[0.0013109159,0.00026960584,0.00038132444,0.0006270506,0.00028307608,0.00052335224,0.0005089486,0.00071435305,0.0027688793],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00062413665,0.00012988223,0.0015611037,0.00041932255,0.00009657515,0.00061243144,0.00020163572,0.019053929,0.3822762,0.022035724,0.015182716,0.5578064],"study_design_scores_gemma":[0.000117462645,0.00032296765,0.000753962,0.00005376899,0.000049539274,0.0012134451,0.000025289834,0.48036098,0.45376486,0.0021117667,0.0611763,0.00004965033],"about_ca_topic_score_codex":0.0006859249,"about_ca_topic_score_gemma":0.00079959916,"teacher_disagreement_score":0.0047030323,"about_ca_system_score_codex":0.0004606408,"about_ca_system_score_gemma":0.00078346266,"threshold_uncertainty_score":0.015733242},"labels":[],"label_agreement":null},{"id":"W2049683461","doi":"10.1109/tip.2010.2056378","title":"An Improved Image Compression Algorithm Using Binary Space Partition Scheme and Geometric Wavelets","year":2010,"lang":"en","type":"article","venue":"IEEE Transactions on Image Processing","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":33,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"University of Illinois at Urbana-Champaign; Ryerson University","keywords":"Image compression; Wavelet; Data compression; Image processing; Algorithm; Binary number; Mathematics; Computer science; Wavelet transform; Artificial intelligence; Set partitioning in hierarchical trees; Binary image; Partition (number theory); Image (mathematics); Computer vision; Combinatorics","score_opus":0.01489649242532609,"score_gpt":0.2975031286413781,"score_spread":0.28260663621605203,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2049683461","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.042656947,0.00038245277,0.95450956,0.00014673942,0.00010420041,0.000062786465,0.00005738365,0.00057378283,0.0015061799],"genre_scores_gemma":[0.1994544,0.00042442232,0.79623115,0.00008741859,0.00008390969,0.000076900564,0.00030128067,0.00006198304,0.0032785288],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997688,0.000029221672,0.000010205743,0.000030378254,0.00014129216,0.000019955347],"domain_scores_gemma":[0.9997886,0.0000489277,0.000023126999,0.000038587204,0.00009050935,0.000010313337],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025224107,0.00042481354,0.0004631366,0.00086030125,0.00021622531,0.0004081581,0.00056644983,0.00047002418,0.0010608895],"category_scores_gemma":[0.00075979583,0.00014508661,0.00027609736,0.0010989608,0.00029634166,0.00091747474,0.00042250325,0.00055186654,0.0004260413],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00028989997,0.000076023076,0.00053961336,0.00011431521,0.000030219018,0.00014556832,0.0001193537,0.040996224,0.16356346,0.019296875,0.0031070733,0.7717213],"study_design_scores_gemma":[0.00009394187,0.00035045328,0.001447561,0.000022431734,0.000034191853,0.0010475087,0.000049192196,0.8748134,0.10842251,0.0038964031,0.009779968,0.00004243031],"about_ca_topic_score_codex":0.0011962109,"about_ca_topic_score_gemma":0.0010722128,"teacher_disagreement_score":0.0011962109,"about_ca_system_score_codex":0.0002873531,"about_ca_system_score_gemma":0.00040829292,"threshold_uncertainty_score":0.003549099},"labels":[],"label_agreement":null},{"id":"W2049748457","doi":"10.1109/icsipa.2011.6144072","title":"Visibly accurate model-based binary image compression scheme","year":2011,"lang":"en","type":"article","venue":"","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Northern British Columbia","funders":"","keywords":"Binary image; Rectangle; Image compression; Pixel; Data compression; Logarithm; Algorithm; Binary number; Mathematics; Computer science; Image (mathematics); Cartesian coordinate system; Distortion (music); Artificial intelligence; Computer vision; Image processing; Geometry","score_opus":0.05047630216987478,"score_gpt":0.3014677541801352,"score_spread":0.2509914520102604,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2049748457","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.022177333,0.0004310646,0.97347397,0.00014879403,0.00005700229,0.000049616247,0.000059771613,0.0006102499,0.0029922316],"genre_scores_gemma":[0.5775186,0.00072881527,0.4160667,0.00016992142,0.000046383007,0.00011398881,0.00030200012,0.00006700079,0.0049865674],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997038,0.00004123825,0.000013513784,0.000033091805,0.00018341582,0.000024998762],"domain_scores_gemma":[0.9997861,0.000045486762,0.000028121915,0.000075029835,0.000055909084,0.000009405183],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023190079,0.0003426717,0.00043336744,0.0004748292,0.00022587761,0.0005583844,0.00065748004,0.0005400463,0.0014623335],"category_scores_gemma":[0.0008552518,0.0001473414,0.000307871,0.00047768964,0.00028292064,0.0012853397,0.00054056104,0.00046459283,0.0005415814],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00044809186,0.00012423331,0.0007663931,0.00025797923,0.000050417213,0.00033766092,0.00018990113,0.27782756,0.18613802,0.06537042,0.0051204506,0.4633689],"study_design_scores_gemma":[0.000022230115,0.000118653414,0.00025063223,0.000015832062,0.000014444817,0.00036633966,0.00002234843,0.9555664,0.033042032,0.005281161,0.005277707,0.000022204096],"about_ca_topic_score_codex":0.00085966865,"about_ca_topic_score_gemma":0.00069495226,"teacher_disagreement_score":0.0014623335,"about_ca_system_score_codex":0.00035290763,"about_ca_system_score_gemma":0.00036367,"threshold_uncertainty_score":0.0048919916},"labels":[],"label_agreement":null},{"id":"W2050477735","doi":"10.1109/gensips.2007.4365816","title":"Correlation Model for Uniform Scalar Quantizers with Arbitrary Representation Levels","year":2007,"lang":"en","type":"article","venue":"","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"","keywords":"Gaussian; Vector quantization; Quantization (signal processing); Algorithm; Mathematics; Correlation; Lossy compression; Scalar (mathematics); Representation (politics); Applied mathematics; Monte Carlo method; Computer science; Statistics","score_opus":0.05360000736369189,"score_gpt":0.333637763406215,"score_spread":0.2800377560425231,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2050477735","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.028850034,0.00041415007,0.96400714,0.00023109406,0.00003674638,0.000051646246,0.00009483014,0.00021329988,0.0061011305],"genre_scores_gemma":[0.89051086,0.0007350561,0.09703956,0.00025996173,0.00006216464,0.00020240663,0.00019393844,0.00009157911,0.010904451],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988813,0.00021729193,0.000047781938,0.0001908631,0.00052602583,0.0001367649],"domain_scores_gemma":[0.9980716,0.0009798481,0.00028590357,0.00021483471,0.00039434494,0.00005350036],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017366575,0.00050884817,0.0007541922,0.0006331188,0.00040203502,0.0011986295,0.0014779232,0.0008873673,0.002122348],"category_scores_gemma":[0.004666744,0.00034794785,0.000486718,0.00092330424,0.0012866007,0.001978723,0.00077538396,0.0011371175,0.00044864608],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000095909345,0.00003278686,0.00055486034,0.00006861866,0.00003469094,0.00014229091,0.000093804905,0.7417807,0.008110343,0.23681836,0.0009611033,0.011306587],"study_design_scores_gemma":[0.0000043917817,0.000011345783,0.000095929965,0.0000048655916,0.000005803619,0.000028081215,0.0000063142948,0.9886268,0.0010215461,0.009907069,0.0002788769,0.000008990458],"about_ca_topic_score_codex":0.0028773602,"about_ca_topic_score_gemma":0.001936891,"teacher_disagreement_score":0.0028773602,"about_ca_system_score_codex":0.001613788,"about_ca_system_score_gemma":0.00089232135,"threshold_uncertainty_score":0.011708856},"labels":[],"label_agreement":null},{"id":"W2052700077","doi":"10.4018/jmdem.2012040103","title":"K-Means Based Prediction of Transcoded JPEG File Size and Structural Similarity","year":2012,"lang":"en","type":"article","venue":"International Journal of Multimedia Data Engineering and Management","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"École de Technologie Supérieure; Université de Montréal","funders":"","keywords":"Transcoding; File size; Computer science; JPEG; Cluster analysis; Similarity (geometry); Data mining; JPEG 2000; Quality (philosophy); Information retrieval; Artificial intelligence; Image (mathematics); Image compression; Image processing; Operating system","score_opus":0.01866683101356901,"score_gpt":0.26537119053375513,"score_spread":0.24670435952018613,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2052700077","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15706946,0.0003622897,0.8394255,0.00009185794,0.000093041475,0.000081759536,0.00016214793,0.0017259629,0.0009880511],"genre_scores_gemma":[0.64258677,0.00027123583,0.35441658,0.00005508835,0.000037587382,0.0000781437,0.0004364198,0.00012565528,0.0019925304],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99968755,0.000035913075,0.00002384323,0.00010618341,0.000111794936,0.000034739827],"domain_scores_gemma":[0.9987494,0.00043025365,0.00014333407,0.00012563936,0.0005168766,0.000034564764],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003846256,0.0005646303,0.000714656,0.0010634075,0.00024048665,0.0005056428,0.00065225555,0.0005515753,0.00062779],"category_scores_gemma":[0.0027788419,0.0002542817,0.00042638934,0.0007779151,0.00036779357,0.0007495772,0.00030620513,0.00070155,0.0004455158],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009188391,0.00026843348,0.006596565,0.00021207515,0.00010923109,0.00012804383,0.00026170496,0.23161486,0.08936437,0.0019598817,0.003439998,0.6651259],"study_design_scores_gemma":[0.0000062945833,0.000044168748,0.002030726,0.000006168598,0.0000122464,0.00005688377,0.00002637205,0.97830385,0.018801607,0.00040271122,0.00029438574,0.000014616653],"about_ca_topic_score_codex":0.0069246916,"about_ca_topic_score_gemma":0.010828245,"teacher_disagreement_score":0.0069246916,"about_ca_system_score_codex":0.0004202704,"about_ca_system_score_gemma":0.00057454436,"threshold_uncertainty_score":0.013768792},"labels":[],"label_agreement":null},{"id":"W2052732085","doi":"10.1109/tencon.2011.6129134","title":"Statistical modeling of error resilient JPEG2000 decoding","year":2011,"lang":"en","type":"article","venue":"","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"Iran Telecommunication Research Center","keywords":"Bit plane; Decoding methods; Computer science; Algorithm; Segmentation; Symbol (formal); Bit error rate; JPEG 2000; Mathematics; Artificial intelligence; Image processing; Image (mathematics); Image compression; Bit field","score_opus":0.10910329014903976,"score_gpt":0.33649952886310097,"score_spread":0.22739623871406123,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2052732085","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03561988,0.00036403514,0.9619149,0.0002514787,0.00004965349,0.00002976419,0.00009752343,0.00028313743,0.0013896811],"genre_scores_gemma":[0.9053675,0.0013419585,0.085794255,0.00012642972,0.00012525398,0.00009650148,0.00028542912,0.00015171885,0.006710961],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99950874,0.00010854468,0.000019959805,0.00008365411,0.00021868634,0.000060446368],"domain_scores_gemma":[0.9987255,0.000572551,0.00022291491,0.000121423145,0.0003157121,0.000041950552],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00079709064,0.00064819655,0.000571225,0.00058623374,0.00029715564,0.000705492,0.0013961197,0.0007919635,0.00067953975],"category_scores_gemma":[0.0032352328,0.00043341098,0.00042427587,0.0007341666,0.00091083156,0.0010107461,0.0005722866,0.00093165995,0.00031855362],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000045566685,0.000019458997,0.0007882899,0.00003359646,0.000018639013,0.0000963537,0.00005263047,0.95120066,0.0050159125,0.029231288,0.00045935437,0.013038396],"study_design_scores_gemma":[0.0000012480335,0.0000050314025,0.000071108494,0.0000010694214,0.0000023515775,0.000011604768,0.0000014882885,0.99791485,0.00045378815,0.0014422534,0.00009124593,0.000003907798],"about_ca_topic_score_codex":0.007847721,"about_ca_topic_score_gemma":0.0048051123,"teacher_disagreement_score":0.007847721,"about_ca_system_score_codex":0.0008870364,"about_ca_system_score_gemma":0.0010222436,"threshold_uncertainty_score":0.015604079},"labels":[],"label_agreement":null},{"id":"W2052793745","doi":"10.1109/memb.2002.1032646","title":"MRI data compression using a 3-D discrete wavelet transform","year":2002,"lang":"en","type":"article","venue":"IEEE Engineering in Medicine and Biology Magazine","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":19,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"University of Washington; U.S. Department of Energy","keywords":"Computer science; Adder; Discrete wavelet transform; Computer hardware; Multiplier (economics); Cache; 16-bit; Memory bandwidth; Data compression; Wavelet; Parallel computing; Wavelet transform; Algorithm; Artificial intelligence; Telecommunications","score_opus":0.09259540186273586,"score_gpt":0.3336700293471869,"score_spread":0.24107462748445108,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2052793745","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10221435,0.00059268065,0.89115566,0.00036937173,0.000109706234,0.00010513324,0.00017532679,0.0020177015,0.0032600532],"genre_scores_gemma":[0.38452715,0.0012008004,0.60756224,0.00024392275,0.00012111761,0.0001343372,0.00048080526,0.00014979854,0.005579849],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9999082,0.000008558569,0.0000062104023,0.000009335784,0.00006203006,0.0000056950794],"domain_scores_gemma":[0.99988997,0.000039093225,0.000013283573,0.000014993849,0.00003518268,0.0000075548623],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00011916439,0.00029481374,0.00027292428,0.00039156555,0.00015882177,0.00035448503,0.00027579928,0.00033475313,0.0014012093],"category_scores_gemma":[0.00054061774,0.00014312196,0.00021991144,0.00042437174,0.00017050952,0.00035986834,0.00022587739,0.00031666024,0.0005367924],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00035511857,0.000094878305,0.0008459435,0.00018907244,0.000031554053,0.0007573572,0.00008506012,0.016631724,0.5966293,0.004469936,0.0036210679,0.376289],"study_design_scores_gemma":[0.00013844967,0.0007366613,0.0042120423,0.000041593372,0.00007211743,0.003938866,0.000048455877,0.47912556,0.47759694,0.0050616884,0.028964628,0.00006294623],"about_ca_topic_score_codex":0.00036053263,"about_ca_topic_score_gemma":0.00039615313,"teacher_disagreement_score":0.0014012093,"about_ca_system_score_codex":0.00014489568,"about_ca_system_score_gemma":0.00016979322,"threshold_uncertainty_score":0.0046875477},"labels":[],"label_agreement":null},{"id":"W2053232097","doi":"10.2316/journal.208.2007.2.208-1083","title":"SCALABLE CODING AND WIRELESS STREAMING OF LECTURE VIDEOS FOR MOBILE LEARNING","year":2007,"lang":"en","type":"article","venue":"Advanced Technology for Learning","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Computer science; Wireless network; Scalability; Wireless; Multimedia; Mobile device; Live streaming; Video streaming; Coding (social sciences); Scalable Video Coding; Mobile wireless; Computer network; World Wide Web; Telecommunications","score_opus":0.006318709962891739,"score_gpt":0.2789273420847131,"score_spread":0.27260863212182135,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2053232097","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.116930105,0.001289971,0.8740194,0.00040287827,0.00015904167,0.00016110498,0.00010796032,0.0009603687,0.0059692697],"genre_scores_gemma":[0.7600525,0.0011716754,0.23373361,0.00016005767,0.00017726299,0.00012223433,0.00027068847,0.00007508981,0.0042370004],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9998184,0.00003344286,0.000006918431,0.000018362472,0.00010542605,0.000017466906],"domain_scores_gemma":[0.9996728,0.00011805562,0.000035519173,0.00006423894,0.00008746399,0.000021930926],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027165635,0.00026040978,0.00018041584,0.00033543454,0.00013091527,0.00025551533,0.0003803705,0.00029635863,0.0010995446],"category_scores_gemma":[0.0012118166,0.00008624498,0.00017116843,0.00044023074,0.00027857968,0.00058259116,0.0003720412,0.00039117195,0.00032916965],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000338482,0.00011935486,0.0009683962,0.00022049044,0.000037411894,0.0003814323,0.00018300841,0.044908065,0.43839827,0.02207701,0.0028844073,0.48948357],"study_design_scores_gemma":[0.00007717021,0.0005063044,0.0024676507,0.00006128641,0.000052103507,0.0009894182,0.00012250183,0.7234223,0.24356087,0.014751023,0.013944264,0.000045063625],"about_ca_topic_score_codex":0.0009030238,"about_ca_topic_score_gemma":0.0012028923,"teacher_disagreement_score":0.0010995446,"about_ca_system_score_codex":0.0002019655,"about_ca_system_score_gemma":0.00027635755,"threshold_uncertainty_score":0.0036783814},"labels":[],"label_agreement":null},{"id":"W2053276955","doi":"10.1155/2008/896021","title":"Robust Transmission of Speech LSFs Using Hidden Markov Model-Based Multiple Description Index Assignments","year":2008,"lang":"en","type":"article","venue":"EURASIP Journal on Audio Speech and Music Processing","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"","keywords":"Computer science; Hidden Markov model; Index (typography); Transmission (telecommunications); Markov model; Speech recognition; Markov chain; Artificial intelligence; Natural language processing; Programming language; Machine learning; Telecommunications","score_opus":0.06740350647885139,"score_gpt":0.273563342240042,"score_spread":0.20615983576119057,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2053276955","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10242289,0.0002082575,0.8958335,0.00013043972,0.000020208208,0.000034827855,0.00005177363,0.0005976823,0.00070042873],"genre_scores_gemma":[0.819752,0.00016148222,0.17857854,0.00007247916,0.000014977961,0.0000668196,0.00018428979,0.00008033514,0.0010891099],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994892,0.00020930287,0.000030311427,0.00005672979,0.00016664481,0.00004777551],"domain_scores_gemma":[0.99812084,0.0012809763,0.00020698765,0.00019143631,0.000161015,0.00003871653],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011960053,0.00038529903,0.0005317458,0.0002539837,0.00023404209,0.0005062613,0.0006720911,0.0005033483,0.00054032897],"category_scores_gemma":[0.004186542,0.0002595821,0.00029362887,0.00028675728,0.00041280655,0.0009180965,0.0005926492,0.00076020503,0.00015979137],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004425444,0.00009699629,0.0009019386,0.000087487235,0.00004112906,0.00013525422,0.00015173937,0.8521304,0.03665347,0.0117372135,0.000558587,0.09706316],"study_design_scores_gemma":[0.000011305653,0.000036473488,0.00006519923,0.0000025810882,0.0000047910885,0.000017872411,0.0000071654445,0.98631835,0.0121667385,0.0011987762,0.00016476672,0.0000060535926],"about_ca_topic_score_codex":0.0015282967,"about_ca_topic_score_gemma":0.0017526012,"teacher_disagreement_score":0.0015282967,"about_ca_system_score_codex":0.0005443092,"about_ca_system_score_gemma":0.0006380131,"threshold_uncertainty_score":0.0063251853},"labels":[],"label_agreement":null},{"id":"W2055368218","doi":"10.1109/ccece.2012.6335011","title":"Using an adaptive UPA scheme with a channel-aware OFDM technique for wireless transmission of JPEG2000 images","year":2012,"lang":"en","type":"article","venue":"","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Orthogonal frequency-division multiplexing; Computer science; Transmitter; Coding (social sciences); Fading; Transmitter power output; Channel state information; Transmission (telecommunications); Channel (broadcasting); Multiplexing; Electronic engineering; Algorithm; Wireless; Computer network; Telecommunications; Engineering; Mathematics","score_opus":0.05474532289848458,"score_gpt":0.32416027378781437,"score_spread":0.26941495088932976,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2055368218","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06297106,0.00043585937,0.93383294,0.00009894395,0.00004578249,0.0000560789,0.000015258815,0.0002223099,0.002321834],"genre_scores_gemma":[0.702904,0.0003966632,0.2943769,0.0000815921,0.00005442166,0.000058525402,0.0000331242,0.000029925905,0.0020648895],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99985576,0.0000444426,0.000008222277,0.00002555436,0.000049006267,0.000017048626],"domain_scores_gemma":[0.9997931,0.000077566154,0.000034867775,0.000038505255,0.000046284367,0.000009711024],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020683187,0.00031549737,0.0002057993,0.0002604309,0.00034274047,0.0003120215,0.00042068388,0.00021241879,0.00065605383],"category_scores_gemma":[0.00062196254,0.000111809066,0.00017746113,0.00030481376,0.00036407897,0.00058736827,0.00030724762,0.00040654614,0.0001928962],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003765923,0.00017515039,0.0016460669,0.00020292414,0.00007336499,0.00042440902,0.00020956452,0.077644125,0.36940017,0.023158722,0.0012509988,0.5254378],"study_design_scores_gemma":[0.000045427623,0.00042983584,0.0017657614,0.00003229021,0.00008492851,0.0012270531,0.00007120318,0.78820765,0.1953269,0.004174038,0.008581898,0.000053017007],"about_ca_topic_score_codex":0.0006046206,"about_ca_topic_score_gemma":0.0010790697,"teacher_disagreement_score":0.00065605383,"about_ca_system_score_codex":0.00018444887,"about_ca_system_score_gemma":0.0002194477,"threshold_uncertainty_score":0.0021947622},"labels":[],"label_agreement":null},{"id":"W2056651359","doi":"10.1007/s00453-004-1126-x","title":"Optimal Two-Description Scalar Quantizer Design","year":2004,"lang":"en","type":"article","venue":"Algorithmica","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":22,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Mathematics; Directed acyclic graph; Theory of computation; Quantization (signal processing); Alphabet; Algorithm; Discrete mathematics; Cardinality (data modeling); Signal compression; Directed graph; Combinatorics; Mathematical optimization; Signal processing; Computer science","score_opus":0.029327999474310803,"score_gpt":0.2823486751181255,"score_spread":0.2530206756438147,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2056651359","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012110289,0.00031881206,0.9846273,0.00024876773,0.000053375115,0.00006999326,0.00009977244,0.00034811665,0.002123575],"genre_scores_gemma":[0.54174954,0.00048563702,0.4487668,0.00033733383,0.00010147568,0.00024792372,0.00041809469,0.000086780936,0.00780645],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992673,0.00019143296,0.00005997178,0.00015028955,0.00025420435,0.00007689374],"domain_scores_gemma":[0.99924797,0.00028934743,0.000059099504,0.00014014977,0.00022885752,0.000034629113],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009904376,0.00064371474,0.00073326606,0.00059040025,0.0004290203,0.0011250768,0.00094400055,0.0008281593,0.0058315145],"category_scores_gemma":[0.0022375644,0.0003794504,0.00028101224,0.000639629,0.0005410797,0.001972976,0.0010657056,0.0006709203,0.00081326393],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011194132,0.0002019845,0.0008568093,0.0005130921,0.00009353462,0.00016618881,0.00016401989,0.15920368,0.054639883,0.17430563,0.008067342,0.6006684],"study_design_scores_gemma":[0.0001601464,0.00028433622,0.00034238052,0.00003715883,0.000043584834,0.0002272424,0.000048749007,0.90264,0.030377114,0.060975466,0.004815982,0.000047860678],"about_ca_topic_score_codex":0.00072370726,"about_ca_topic_score_gemma":0.0013825143,"teacher_disagreement_score":0.0058315145,"about_ca_system_score_codex":0.0005575404,"about_ca_system_score_gemma":0.0012898067,"threshold_uncertainty_score":0.019508362},"labels":[],"label_agreement":null},{"id":"W2059135756","doi":"10.1145/1027527.1027618","title":"Index-frame audio transmission","year":2004,"lang":"en","type":"article","venue":"","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Computer science; Table (database); Phone; Frame (networking); Data compression; Bandwidth (computing); Transmission (telecommunications); Audio over Ethernet; Index (typography); Audio signal; Audio signal flow; Software; Audio signal processing; Speech coding; Telecommunications; Database; Operating system; Artificial intelligence","score_opus":0.009411743944966263,"score_gpt":0.2599198660216792,"score_spread":0.25050812207671297,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2059135756","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.038762584,0.0032068195,0.6418697,0.00075027416,0.0032971147,0.0008242307,0.004001899,0.02078035,0.286507],"genre_scores_gemma":[0.34413552,0.0022096757,0.327169,0.0008963216,0.0014151098,0.0005088088,0.007714737,0.001940242,0.31401053],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99957246,0.000019473704,0.000018762394,0.000068815076,0.00026089494,0.00005973906],"domain_scores_gemma":[0.9993474,0.00007361082,0.000026823342,0.00019273505,0.00030546563,0.000054029424],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030386727,0.000719171,0.0006898886,0.00093350274,0.00085541146,0.0010825482,0.0012168376,0.0009441827,0.05942865],"category_scores_gemma":[0.0017079203,0.00022268732,0.00026890452,0.00076759554,0.00023812018,0.0011715785,0.0011877901,0.0005828047,0.02675176],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0013515053,0.00015571952,0.0006007271,0.0003909504,0.000035344085,0.0007035332,0.00027014498,0.0025099665,0.14952512,0.017282257,0.09300796,0.73416686],"study_design_scores_gemma":[0.00033432673,0.0006776011,0.003178699,0.00023171058,0.00013748117,0.002986513,0.00027243892,0.0892056,0.38192552,0.015170364,0.50572646,0.00015328606],"about_ca_topic_score_codex":0.0019204754,"about_ca_topic_score_gemma":0.0027932979,"teacher_disagreement_score":0.05942865,"about_ca_system_score_codex":0.0005109985,"about_ca_system_score_gemma":0.00055722403,"threshold_uncertainty_score":0.19880861},"labels":[],"label_agreement":null},{"id":"W2059510432","doi":"10.1049/ip-com:20040548","title":"Quantiser design for AWGN and Rayleigh fading BPSK channels with soft output decoding","year":2004,"lang":"en","type":"article","venue":"IEE Proceedings - Communications","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Additive white Gaussian noise; Phase-shift keying; Rayleigh fading; Demodulation; Decoding methods; Fading; Algorithm; Mathematics; Channel (broadcasting); Telecommunications; Computer science; Electronic engineering; Bit error rate; Engineering","score_opus":0.08265149304813776,"score_gpt":0.3166412969365811,"score_spread":0.23398980388844334,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2059510432","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010393265,0.00031414913,0.98779154,0.000055119144,0.000028897211,0.000048826616,0.00002670731,0.00016741411,0.001174122],"genre_scores_gemma":[0.5873587,0.0006404899,0.4079728,0.00007038745,0.00006653924,0.00022239744,0.00009537499,0.000059111007,0.0035142996],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99933213,0.00016529283,0.000039948256,0.00006616175,0.00035994002,0.00003657857],"domain_scores_gemma":[0.9991159,0.00048521356,0.00010459524,0.00005513769,0.0002212331,0.000018037474],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000958911,0.0005913326,0.0004980137,0.000388697,0.00030301817,0.001004213,0.0007788597,0.00058421516,0.0021283622],"category_scores_gemma":[0.0020360027,0.0002964417,0.0001830127,0.00042346978,0.00057223154,0.00090366375,0.0006490676,0.0006498533,0.0004030308],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005041796,0.00006663643,0.0006975194,0.000472462,0.00011471174,0.00023003813,0.0003286838,0.5935388,0.08296702,0.07496037,0.0014946108,0.24462487],"study_design_scores_gemma":[0.000045464567,0.00012009934,0.000115482435,0.000021325504,0.000018799188,0.00010608711,0.00002293135,0.970554,0.020965578,0.006083988,0.001926643,0.000019526748],"about_ca_topic_score_codex":0.0007274928,"about_ca_topic_score_gemma":0.0013506841,"teacher_disagreement_score":0.0021283622,"about_ca_system_score_codex":0.0005443912,"about_ca_system_score_gemma":0.00056649116,"threshold_uncertainty_score":0.007120073},"labels":[],"label_agreement":null},{"id":"W2060939244","doi":"10.1109/ccece.2010.5575244","title":"Mcl.jit library for scalable live video in Max/Msp/Jitter","year":2010,"lang":"en","type":"article","venue":"","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Jitter; Computer science; Codec; Scalability; Coding (social sciences); Multimedia; Transmission (telecommunications); Software; Computer architecture; Computer hardware; Operating system; Telecommunications","score_opus":0.010589199275983712,"score_gpt":0.2588816378682946,"score_spread":0.2482924385923109,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2060939244","genre_codex":"methods","genre_gemma":"software","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"software","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0021241724,0.0002868021,0.658017,0.00009824424,0.000119909615,0.0002455531,0.0025021217,0.32330245,0.013303682],"genre_scores_gemma":[0.10445641,0.0012511102,0.63576937,0.0010580553,0.00040175012,0.0021496867,0.025963169,0.15252323,0.0764272],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99908435,0.00006309148,0.00007970142,0.00009519973,0.0005499372,0.0001278321],"domain_scores_gemma":[0.9987043,0.00036965468,0.00014244921,0.0002818279,0.00040155608,0.00010009105],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001198363,0.0013098408,0.0008325458,0.0018748777,0.0006754591,0.001415936,0.0030107198,0.0007823652,0.06396892],"category_scores_gemma":[0.0031457609,0.00088751025,0.0007532358,0.0010999459,0.00046795234,0.0022154262,0.0015972797,0.0018325808,0.023375576],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00095942203,0.00023586008,0.0015441603,0.0014769435,0.00012256161,0.00074420864,0.0005812184,0.0104907155,0.053806916,0.030483125,0.37788394,0.5216709],"study_design_scores_gemma":[0.0005138862,0.00033063634,0.001977062,0.0002945981,0.00009922742,0.0013130544,0.000096018804,0.15000898,0.16240478,0.015528079,0.6671733,0.00026034116],"about_ca_topic_score_codex":0.0028886003,"about_ca_topic_score_gemma":0.002993344,"teacher_disagreement_score":0.06396892,"about_ca_system_score_codex":0.0011243123,"about_ca_system_score_gemma":0.0013237201,"threshold_uncertainty_score":0.21399736},"labels":[],"label_agreement":null},{"id":"W2062680734","doi":"10.1109/iscas.2013.6571832","title":"Multiple description coding with randomly offset quantizers","year":2013,"lang":"en","type":"article","venue":"","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Quantization (signal processing); Algorithm; Coding (social sciences); Offset (computer science); Discrete cosine transform; Mathematics; Vector quantization; Transform coding; Trellis quantization; Rate–distortion theory; Computer science; Theoretical computer science; Artificial intelligence; Data compression; Image processing; Image (mathematics); Image compression; Statistics","score_opus":0.020685836796784415,"score_gpt":0.23579057041446436,"score_spread":0.21510473361767996,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2062680734","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0068471595,0.0004282939,0.99157774,0.0001345583,0.000046558325,0.000047200992,0.00007628836,0.00018353443,0.00065861014],"genre_scores_gemma":[0.37801918,0.00085853913,0.6159683,0.00025627675,0.00010978349,0.00027524494,0.0006258255,0.00005482642,0.0038320506],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992275,0.00018660886,0.000045353783,0.00009138643,0.00038937456,0.00005966869],"domain_scores_gemma":[0.9990864,0.0003434179,0.000097358025,0.00019061595,0.00025075808,0.000031577125],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00091247464,0.000552972,0.00075792824,0.0005981606,0.00030357164,0.0006364386,0.0016524525,0.0007142672,0.001355254],"category_scores_gemma":[0.0025951676,0.00025141297,0.00044709418,0.0011691354,0.00052139943,0.0016471784,0.0010550091,0.0011652563,0.00036529996],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00047933526,0.00008903336,0.00051690976,0.00029465204,0.000065226835,0.00041450522,0.00014832518,0.35558835,0.0470728,0.15323623,0.005454576,0.43664005],"study_design_scores_gemma":[0.000048594273,0.000065686385,0.00009593703,0.00001584265,0.0000147261335,0.00012341488,0.000010043635,0.97727126,0.0106483605,0.00935528,0.002322883,0.000027943985],"about_ca_topic_score_codex":0.002388461,"about_ca_topic_score_gemma":0.0020317642,"teacher_disagreement_score":0.002388461,"about_ca_system_score_codex":0.0006657448,"about_ca_system_score_gemma":0.00089557254,"threshold_uncertainty_score":0.004830301},"labels":[],"label_agreement":null},{"id":"W2063168458","doi":"10.1109/icecs.2011.6122390","title":"A GPGPU-based software implementation of the PBDI deinterlacing algorithm","year":2011,"lang":"en","type":"article","venue":"","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Computer science; General-purpose computing on graphics processing units; Software; Interpolation (computer graphics); Computation; Algorithm; Parallel computing; Pixel; Bandwidth (computing); CUDA; Field (mathematics); Computer engineering; Computational science; Computer architecture; Computer graphics (images); Graphics; Artificial intelligence; Image (mathematics); Operating system","score_opus":0.02517449494439227,"score_gpt":0.286139383964147,"score_spread":0.26096488901975473,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2063168458","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014856726,0.00008271036,0.9736365,0.00007915652,0.000048000697,0.000058292266,0.000115069306,0.006800293,0.004323307],"genre_scores_gemma":[0.08595388,0.000103496546,0.90830904,0.00006982201,0.000014646294,0.00012015088,0.00053510244,0.00061882037,0.0042750533],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9997638,0.000019745778,0.000014639376,0.0000342168,0.00014050512,0.000027036938],"domain_scores_gemma":[0.9996605,0.000051527444,0.000024247029,0.00009742205,0.000145904,0.000020494948],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023516722,0.0004298249,0.00031053647,0.00045037313,0.0002889674,0.0006333276,0.0013874513,0.00037659032,0.005200099],"category_scores_gemma":[0.0010641275,0.0003008655,0.00023832372,0.0006194362,0.00024676116,0.00045083827,0.00049225014,0.0009305944,0.0021118734],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00044654508,0.0002088046,0.002176349,0.0002763725,0.0000817732,0.0003444596,0.00030811917,0.06470412,0.18834572,0.022368211,0.015008574,0.705731],"study_design_scores_gemma":[0.00010652272,0.00018914086,0.0009287537,0.000021959051,0.000023841305,0.00055629725,0.00003595294,0.7632304,0.18693353,0.002967452,0.044958457,0.000047764916],"about_ca_topic_score_codex":0.0018174943,"about_ca_topic_score_gemma":0.0020717406,"teacher_disagreement_score":0.005200099,"about_ca_system_score_codex":0.00029983782,"about_ca_system_score_gemma":0.0007023166,"threshold_uncertainty_score":0.017396033},"labels":[],"label_agreement":null},{"id":"W2064317439","doi":"10.1109/mmsp.2007.4412852","title":"On Design of Linear Minimum-Entropy Predictor","year":2007,"lang":"en","type":"article","venue":"","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Quasiconvex function; Lossless compression; Entropy (arrow of time); Entropy encoding; Gaussian; Mathematics; Mathematical optimization; Computer science; Data compression; Linear programming; Convex optimization; Algorithm; Regular polygon; Convex combination","score_opus":0.02534982702814357,"score_gpt":0.2954477519228276,"score_spread":0.270097924894684,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2064317439","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003463612,0.00020845467,0.9952887,0.00009308642,0.00001579037,0.00002106852,0.0000124864355,0.00008378301,0.000813071],"genre_scores_gemma":[0.5692777,0.0012712977,0.42343137,0.00026232158,0.00012983,0.0003407977,0.00014820973,0.00007263811,0.005065863],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993315,0.00027174203,0.00002962001,0.00011779291,0.00020082683,0.000048504247],"domain_scores_gemma":[0.9986946,0.0008287336,0.00012656071,0.00006299395,0.00025701814,0.000030102887],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013346894,0.0006092118,0.0007506634,0.00030085864,0.0003216269,0.0007540804,0.00066254707,0.00083124416,0.001599925],"category_scores_gemma":[0.0038010566,0.00042008076,0.00022572819,0.00047286478,0.0007389572,0.00092069554,0.000749764,0.0009837468,0.0004977334],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001854085,0.000060707625,0.0006028798,0.00026588395,0.00003798417,0.00012966382,0.00012966295,0.7969669,0.014692086,0.049151003,0.001998658,0.13577917],"study_design_scores_gemma":[0.000011314228,0.00006833922,0.000057230613,0.000015737232,0.000006060616,0.000032355627,0.0000058756077,0.9894338,0.003576987,0.005904106,0.0008807047,0.000007472138],"about_ca_topic_score_codex":0.000634594,"about_ca_topic_score_gemma":0.0007504931,"teacher_disagreement_score":0.001599925,"about_ca_system_score_codex":0.00040356404,"about_ca_system_score_gemma":0.0009737539,"threshold_uncertainty_score":0.007058561},"labels":[],"label_agreement":null},{"id":"W2065716530","doi":"10.1049/ip-com:20050440","title":"Spectra of multimode coded signals","year":2006,"lang":"en","type":"article","venue":"IEE Proceedings - Communications","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Encoder; Code word; Randomness; Computer science; Algorithm; Coding (social sciences); Spectral density; Multi-mode optical fiber; Theoretical computer science; Mathematics; Decoding methods; Telecommunications; Statistics","score_opus":0.028654702087234467,"score_gpt":0.30284309049186614,"score_spread":0.27418838840463167,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2065716530","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15282814,0.00074293104,0.82193625,0.00025459952,0.00009338179,0.0000598616,0.00041625364,0.00025794853,0.023410685],"genre_scores_gemma":[0.8401379,0.00092287053,0.14937443,0.00012393552,0.00007580593,0.00012367693,0.00030588548,0.00012424105,0.008811217],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996087,0.000061005037,0.000013231116,0.00005947876,0.00022692446,0.00003075593],"domain_scores_gemma":[0.99884474,0.0005456201,0.00013054226,0.00014242006,0.00029590778,0.000040789248],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036967665,0.000331272,0.00021501131,0.0009750931,0.00023362807,0.00072250445,0.00029742147,0.00050119247,0.0024841216],"category_scores_gemma":[0.00218049,0.00013611393,0.00015061509,0.0006167476,0.0005545029,0.0009196286,0.00048313887,0.00049409264,0.000600869],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00046506248,0.000079801874,0.0020283863,0.00027500102,0.00004161208,0.0010579731,0.00092458463,0.11510889,0.26328948,0.43303207,0.0023273013,0.18136975],"study_design_scores_gemma":[0.000023977385,0.00019893305,0.0047460063,0.00008770245,0.000015351909,0.0012032139,0.00026957341,0.66716325,0.083796844,0.23006721,0.012341825,0.00008616919],"about_ca_topic_score_codex":0.00030123547,"about_ca_topic_score_gemma":0.00017756796,"teacher_disagreement_score":0.0024841216,"about_ca_system_score_codex":0.00032687455,"about_ca_system_score_gemma":0.00023041134,"threshold_uncertainty_score":0.008310199},"labels":[],"label_agreement":null},{"id":"W2065774877","doi":"10.1109/ccece.2014.6901106","title":"Weighted Ratio-Based Adaptive Lossless image coding","year":2014,"lang":"en","type":"article","venue":"","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Lossless compression; Computer science; Pixel; Data compression; ENCODE; Sign (mathematics); Codec; Algorithm; Image compression; Compression ratio; Adaptive coding; Artificial intelligence; Encoding (memory); Image (mathematics); Coding (social sciences); Decoding methods; Pattern recognition (psychology); Mathematics; Image processing; Statistics","score_opus":0.015337359989396011,"score_gpt":0.264960384097794,"score_spread":0.24962302410839798,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2065774877","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03215738,0.0008068505,0.96167374,0.00013652087,0.00008812163,0.00008254674,0.00007470745,0.0016661349,0.00331396],"genre_scores_gemma":[0.44333038,0.00072586094,0.54774284,0.00033735493,0.00011807831,0.000113383496,0.0003278269,0.0003144669,0.00698976],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9995208,0.000052367457,0.000019820096,0.00006656084,0.00030760723,0.000032879598],"domain_scores_gemma":[0.9994542,0.0001300809,0.000072407485,0.00012836537,0.00019735948,0.000017647166],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036803697,0.0005813401,0.0003596432,0.00092494633,0.00021655046,0.0005089947,0.0014050846,0.0004056869,0.0015064463],"category_scores_gemma":[0.0016844157,0.00014991587,0.00027600312,0.0005495769,0.00042871633,0.0012217044,0.0006635711,0.0006981219,0.00092433934],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00052492926,0.00013405221,0.00086748734,0.00014150528,0.000065447326,0.0002070434,0.00009030154,0.07027593,0.15434463,0.01719077,0.0041728,0.751985],"study_design_scores_gemma":[0.00003566829,0.00021502464,0.000823008,0.00002445755,0.00003450107,0.00084013084,0.00001832551,0.8428708,0.14319311,0.004800426,0.0071047046,0.00003996172],"about_ca_topic_score_codex":0.0008469292,"about_ca_topic_score_gemma":0.0010653954,"teacher_disagreement_score":0.0015064463,"about_ca_system_score_codex":0.00033032274,"about_ca_system_score_gemma":0.0003012774,"threshold_uncertainty_score":0.0050395727},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.10157895037489442,"score_gpt":0.35504891600125743,"score_spread":0.25346996562636304,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2067522308","genre_codex":"review","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":"review","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00046261968,0.99037725,0.005832283,0.000259833,0.0003086079,0.000022601103,0.00006233323,0.000034490942,0.0026400296],"genre_scores_gemma":[0.0026783831,0.98904,0.006131517,0.00024382466,0.00033958175,0.00002084965,0.00011090461,0.000011597243,0.0014234073],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99966717,0.000032500895,0.000052002993,0.000056131877,0.0001699633,0.000022302076],"domain_scores_gemma":[0.99901843,0.0004943999,0.00009591416,0.000037549748,0.00032561447,0.00002813792],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00070443953,0.0008647726,0.0010623625,0.0031500373,0.00029249897,0.0008819145,0.0013470069,0.0009335201,0.004258981],"category_scores_gemma":[0.0016517367,0.0003921911,0.0005026495,0.0032391408,0.0004552829,0.0016848479,0.00064181606,0.0012572963,0.0015615588],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000033688022,0.00005694585,0.00010653892,0.0072755683,0.00004840764,0.000094164374,0.000025536807,0.0007967226,0.003274541,0.0032058603,0.01034893,0.97473305],"study_design_scores_gemma":[0.000029271809,0.00036482586,0.0013041494,0.0055573178,0.00029617152,0.0032028651,0.000089470224,0.0039819363,0.011382596,0.0043382607,0.9693378,0.00011529781],"about_ca_topic_score_codex":0.0017233882,"about_ca_topic_score_gemma":0.0016684819,"teacher_disagreement_score":0.004258981,"about_ca_system_score_codex":0.0005789241,"about_ca_system_score_gemma":0.00097603415,"threshold_uncertainty_score":0.0142477155},"labels":[],"label_agreement":null},{"id":"W2069454499","doi":"10.1007/s11042-014-2214-9","title":"Use of symmetry in prediction-error field for lossless compression of 3D MRI images","year":2014,"lang":"en","type":"article","venue":"Multimedia Tools and Applications","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Lossless compression; Computer science; Artificial intelligence; Symmetry (geometry); Block (permutation group theory); Compression (physics); Pixel; Data compression; Lossy compression; Image compression; Computer vision; Matching (statistics); Algorithm; Image (mathematics); Pattern recognition (psychology); Image processing; Mathematics","score_opus":0.03625042697519362,"score_gpt":0.30672212278148675,"score_spread":0.27047169580629316,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2069454499","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04351292,0.0002600684,0.9530194,0.00021623213,0.000087200606,0.000055905875,0.00010398297,0.00052540324,0.0022189743],"genre_scores_gemma":[0.66957366,0.00049914635,0.32683286,0.00014764801,0.00009682753,0.0000949299,0.00026190025,0.0001527384,0.0023403422],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99953735,0.00015743652,0.000038900325,0.000048661546,0.00018398122,0.000033814405],"domain_scores_gemma":[0.998393,0.00072740996,0.00015864043,0.00040988985,0.00025911728,0.00005194592],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010074674,0.00046295783,0.00032862157,0.00052519725,0.00022476862,0.0005335209,0.0005173171,0.00046986272,0.0018487384],"category_scores_gemma":[0.003881719,0.00018137728,0.0003051496,0.00055497186,0.0005095005,0.0011042152,0.0005790537,0.0005802186,0.00039362305],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0014420314,0.0002957324,0.002117608,0.00021340538,0.000053590837,0.0005970835,0.00016591752,0.13460167,0.22284742,0.13096912,0.003956003,0.5027404],"study_design_scores_gemma":[0.000041496663,0.00020452078,0.00071489275,0.000021691656,0.000017878105,0.00061217224,0.000022322754,0.8646258,0.11727425,0.014595166,0.0018380209,0.00003179188],"about_ca_topic_score_codex":0.00076108606,"about_ca_topic_score_gemma":0.00067559944,"teacher_disagreement_score":0.0018487384,"about_ca_system_score_codex":0.00034012928,"about_ca_system_score_gemma":0.00061949756,"threshold_uncertainty_score":0.0061846375},"labels":[],"label_agreement":null},{"id":"W2070998618","doi":"10.1121/1.4744557","title":"Development of the MLS technique at IRC/NRC, Canada","year":2001,"lang":"en","type":"article","venue":"The Journal of the Acoustical Society of America","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"National Research Council Canada","funders":"","keywords":"Computer science; Sequence (biology); Pseudorandom number generator; Noise (video); Acoustics; Set (abstract data type); Electronics; TRACE (psycholinguistics); White noise; Algorithm; Electrical engineering; Telecommunications; Physics; Engineering; Programming language; Artificial intelligence","score_opus":0.011853951153157143,"score_gpt":0.2493925753096988,"score_spread":0.23753862415654164,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2070998618","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015909782,0.004350189,0.92414916,0.0025905808,0.00081383414,0.0005496436,0.00096290815,0.003950531,0.046723437],"genre_scores_gemma":[0.10897944,0.003639659,0.78760874,0.00060625066,0.00033070912,0.0002583972,0.0013959871,0.00051365024,0.09666717],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9977985,0.00014108943,0.00006397344,0.0002500809,0.001616112,0.00013020445],"domain_scores_gemma":[0.99659556,0.00019791181,0.00006547892,0.00021018035,0.0028075902,0.000123283],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021085506,0.00053726125,0.00052932964,0.002577683,0.00082190655,0.0013202087,0.0012239418,0.0008388278,0.009197174],"category_scores_gemma":[0.0029150043,0.00038212977,0.0003041861,0.002256053,0.0010419531,0.0011903828,0.0009869495,0.0013482897,0.0045603043],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002874445,0.00009162179,0.0014144521,0.00022176758,0.000021098025,0.00047156183,0.0006016213,0.011078206,0.11767871,0.065362714,0.02643138,0.7763394],"study_design_scores_gemma":[0.0001235838,0.00033291976,0.0041005695,0.00027476612,0.00003817237,0.0009077834,0.0003518353,0.15750334,0.26965135,0.009735547,0.55680174,0.00017830636],"about_ca_topic_score_codex":0.13759372,"about_ca_topic_score_gemma":0.11580633,"teacher_disagreement_score":0.13759372,"about_ca_system_score_codex":0.0045147063,"about_ca_system_score_gemma":0.010428121,"threshold_uncertainty_score":0.27358568},"labels":[],"label_agreement":null},{"id":"W2073187478","doi":"10.1109/cjece.2005.1541727","title":"A practical software-only noncausal predictive video codec for low-bit-rate multimedia applications","year":2005,"lang":"en","type":"article","venue":"Canadian Journal of Electrical and Computer Engineering","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"York University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Codec; Computer science; Coding (social sciences); Quantization (signal processing); Bit rate; Data compression; Video quality; Algorithm; Software; Vector quantization; Artificial intelligence; Computer engineering; Computer hardware; Mathematics; Statistics","score_opus":0.008392993306939567,"score_gpt":0.24396561391962412,"score_spread":0.23557262061268455,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2073187478","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0147967925,0.00034509233,0.982186,0.00020610374,0.00007146801,0.00010994034,0.00004246022,0.0006609027,0.0015811921],"genre_scores_gemma":[0.37875798,0.0004591408,0.6170599,0.00022922922,0.00006663461,0.00017877332,0.00014108307,0.000057319714,0.003049969],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99962974,0.000047074376,0.00001554308,0.000044921253,0.00023804964,0.000024619512],"domain_scores_gemma":[0.99958867,0.00011365515,0.000039083865,0.00006363406,0.0001745639,0.000020350251],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004729313,0.0003464205,0.0003636336,0.0002783354,0.00030083625,0.00045193615,0.00086459174,0.000744996,0.0013190277],"category_scores_gemma":[0.0011440308,0.00015239093,0.00014943119,0.00030676907,0.00049621944,0.0006463474,0.00042660764,0.0008210955,0.00038526708],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00031330003,0.00015173535,0.0011132079,0.00024252792,0.000037945414,0.0006299623,0.00018818656,0.08441498,0.2708953,0.06674152,0.006777223,0.5684941],"study_design_scores_gemma":[0.00005345369,0.00030232384,0.00042737572,0.000026845388,0.000023407105,0.0007107648,0.000018384102,0.9278949,0.05499427,0.0036814467,0.011830668,0.00003607419],"about_ca_topic_score_codex":0.0016070824,"about_ca_topic_score_gemma":0.0037341479,"teacher_disagreement_score":0.0016070824,"about_ca_system_score_codex":0.00048511097,"about_ca_system_score_gemma":0.00093997753,"threshold_uncertainty_score":0.0044125915},"labels":[],"label_agreement":null},{"id":"W2073350441","doi":"10.1002/ett.1169","title":"Vector quantisation for finite‐state Markov channels and application to wireless communications","year":2007,"lang":"en","type":"article","venue":"European Transactions on Telecommunications","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"University of Manitoba","keywords":"Decoding methods; Algorithm; Fading; Channel (broadcasting); Maximum a posteriori estimation; Computer science; Markov chain; Channel state information; Markov process; Markov model; Wireless; Hidden Markov model; Electronic engineering; Speech recognition; Mathematics; Telecommunications; Engineering; Statistics; Maximum likelihood","score_opus":0.02581371447252368,"score_gpt":0.3026467157225275,"score_spread":0.2768330012500038,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2073350441","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013154983,0.0006626627,0.9844044,0.0002013383,0.000045857087,0.000028934666,0.000037536916,0.00023470308,0.0012295943],"genre_scores_gemma":[0.81333035,0.0009268485,0.18289655,0.00011222039,0.00008429821,0.00012438712,0.00014408148,0.00003823602,0.002343078],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993449,0.00022370355,0.000042078296,0.00007709159,0.00026222927,0.000050086197],"domain_scores_gemma":[0.9981421,0.0012919079,0.00014278865,0.00013285017,0.00026800742,0.000022345379],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011954488,0.0003177662,0.00044856887,0.0003365058,0.0002552431,0.0007571945,0.00055400026,0.0004832128,0.0013947509],"category_scores_gemma":[0.0041239136,0.00020982188,0.00021825786,0.000593966,0.00063728326,0.00070564693,0.0005240838,0.00071376946,0.0001967013],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013347583,0.000030217034,0.00037235985,0.000121092766,0.00002973591,0.00007281281,0.00011555237,0.7459414,0.0087664705,0.111334234,0.0014586732,0.131624],"study_design_scores_gemma":[0.000007175233,0.000020095786,0.000041064228,0.00000988219,0.0000036780975,0.0000156787,0.000005771491,0.98770905,0.001850218,0.009650053,0.00068148394,0.0000058017267],"about_ca_topic_score_codex":0.0032846045,"about_ca_topic_score_gemma":0.0023746723,"teacher_disagreement_score":0.0032846045,"about_ca_system_score_codex":0.0007883113,"about_ca_system_score_gemma":0.0008565203,"threshold_uncertainty_score":0.0065309405},"labels":[],"label_agreement":null},{"id":"W2075116490","doi":"10.1109/cjece.2006.259203","title":"Image compression with a multiresolution neural network","year":2006,"lang":"en","type":"article","venue":"Canadian Journal of Electrical and Computer Engineering","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"University of Guelph","funders":"","keywords":"Image compression; Artificial neural network; Computer science; Artificial intelligence; Compression (physics); Data compression; Multiresolution analysis; Computer vision; Image (mathematics); Pattern recognition (psychology); Image processing; Wavelet; Wavelet transform; Materials science; Discrete wavelet transform","score_opus":0.003554565684909997,"score_gpt":0.17521698633000732,"score_spread":0.17166242064509732,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2075116490","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06056078,0.0010877138,0.9328343,0.00038995774,0.00021718186,0.00006887175,0.00009091505,0.0009253811,0.0038247728],"genre_scores_gemma":[0.44976267,0.0010888058,0.540654,0.00020371654,0.00017234361,0.00006707653,0.00014159169,0.00009725684,0.0078126015],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99985695,0.000019949324,0.000009095254,0.000028059398,0.00007125029,0.000014683807],"domain_scores_gemma":[0.9997931,0.000067515895,0.00001962841,0.000049130096,0.000058400274,0.000012139834],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033742006,0.0003634908,0.00038524557,0.0004943049,0.0002542325,0.000446326,0.00045827441,0.0006269045,0.0022343423],"category_scores_gemma":[0.0009500097,0.00025665504,0.00039813507,0.0005821507,0.00022804875,0.0008335047,0.0005627,0.0007160477,0.00043513978],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00046340676,0.00016068593,0.00075163564,0.00013772669,0.000099318386,0.00025638996,0.000063544365,0.1471827,0.15320179,0.007678489,0.0025521645,0.68745214],"study_design_scores_gemma":[0.000010590225,0.00005818678,0.00041593993,0.000010299699,0.000026746462,0.00012810611,0.0000062032996,0.97165406,0.025485305,0.001049245,0.0011461563,0.000009178196],"about_ca_topic_score_codex":0.0020113047,"about_ca_topic_score_gemma":0.0026161615,"teacher_disagreement_score":0.0022343423,"about_ca_system_score_codex":0.00030721308,"about_ca_system_score_gemma":0.00022622873,"threshold_uncertainty_score":0.0074746013},"labels":[],"label_agreement":null},{"id":"W2076178488","doi":"10.5539/mas.v3n2p134","title":"A Novel Method of Image Compression Using Multiwavelets and Set Partitioning Algorithm","year":2009,"lang":"en","type":"article","venue":"Modern Applied Science","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Set partitioning in hierarchical trees; Algorithm; JPEG; Image compression; Computer science; Wavelet; Quantization (signal processing); Data compression; Wavelet transform; Discrete cosine transform; JPEG 2000; Artificial intelligence; Discrete wavelet transform; Mathematics; Pattern recognition (psychology); Image processing; Image (mathematics)","score_opus":0.036441571598004534,"score_gpt":0.3457152103712693,"score_spread":0.30927363877326475,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2076178488","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002277053,0.00032839665,0.9954514,0.000079401834,0.00013878678,0.000053091284,0.000028629322,0.0002810163,0.0013623115],"genre_scores_gemma":[0.030411597,0.00054816046,0.96502584,0.00008792475,0.00011440613,0.00013497936,0.00015165935,0.00008734525,0.003438061],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994444,0.00006718583,0.000031259362,0.000074104275,0.00035614998,0.000026923159],"domain_scores_gemma":[0.999671,0.00009284852,0.000028306775,0.00006096278,0.00013301687,0.000013818676],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035490582,0.0006735733,0.0007300517,0.0012939699,0.00048774644,0.00075669563,0.0009960581,0.00085932994,0.0028196885],"category_scores_gemma":[0.0009223717,0.00030338878,0.0007111148,0.0013232764,0.00049769285,0.001356478,0.0006998122,0.0012238433,0.0014286968],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016319878,0.00010389407,0.00024529922,0.00030955867,0.00007352333,0.00022801253,0.00016798086,0.033406667,0.112437695,0.038947724,0.0068368902,0.80707955],"study_design_scores_gemma":[0.00006815049,0.00028979333,0.000720539,0.00005630354,0.000060737435,0.0016665534,0.0000582842,0.82927096,0.105649635,0.015796233,0.04628474,0.00007801489],"about_ca_topic_score_codex":0.00052969524,"about_ca_topic_score_gemma":0.00067858805,"teacher_disagreement_score":0.0028196885,"about_ca_system_score_codex":0.0004179247,"about_ca_system_score_gemma":0.00044986766,"threshold_uncertainty_score":0.009432793},"labels":[],"label_agreement":null},{"id":"W2076772558","doi":"10.1109/icsmc.2012.6378314","title":"HW/SW co-design of an embedded omni-imaging system","year":2012,"lang":"en","type":"article","venue":"","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Field-programmable gate array; Computer science; Software; Computer hardware; Embedded system; Digital signal processing; Software design; Systems design; Hardware architecture; Embedded software; Software development","score_opus":0.027761231026265504,"score_gpt":0.3121509183145227,"score_spread":0.2843896872882572,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2076772558","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07496672,0.00020520789,0.91609484,0.00010536083,0.00007304335,0.00028098526,0.000040615607,0.0022461056,0.0059871767],"genre_scores_gemma":[0.61044616,0.00012460155,0.38256097,0.00012805905,0.000036174766,0.0003637472,0.00011788063,0.00015127426,0.0060712015],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99962187,0.000060804585,0.000031992513,0.00007990508,0.00015062015,0.00005488895],"domain_scores_gemma":[0.99963915,0.000059381953,0.00005485285,0.000055391836,0.00015919695,0.00003198416],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003637832,0.00048031946,0.00029305276,0.00032074013,0.00021581254,0.00050238246,0.0009948745,0.0002714319,0.002661686],"category_scores_gemma":[0.00042242368,0.00023250742,0.00024386794,0.0001223356,0.00018259679,0.00036707023,0.0003162499,0.0003263082,0.00078435644],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008608889,0.00034940962,0.0040962766,0.000679646,0.0002030516,0.0006866881,0.00035910963,0.07709512,0.56807435,0.009220804,0.003518404,0.33485627],"study_design_scores_gemma":[0.00020089623,0.001610196,0.0029602442,0.000043868284,0.00015668107,0.0009330838,0.000074486736,0.63683283,0.3329342,0.0015214382,0.022686167,0.00004596747],"about_ca_topic_score_codex":0.0004346937,"about_ca_topic_score_gemma":0.00058704003,"teacher_disagreement_score":0.002661686,"about_ca_system_score_codex":0.00021962037,"about_ca_system_score_gemma":0.0005595917,"threshold_uncertainty_score":0.008904219},"labels":[],"label_agreement":null},{"id":"W2078337120","doi":"10.1109/tip.2006.888332","title":"Wiener Filter-Based Error Resilient Time-Domain Lapped Transform","year":2007,"lang":"en","type":"article","venue":"IEEE Transactions on Image Processing","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Lapped transform; Wiener filter; Computer science; Wiener deconvolution; Artificial intelligence; Computer vision; Mathematics; Algorithm; Discrete cosine transform; Speech recognition; Transform coding; Image (mathematics); Deconvolution","score_opus":0.01536728177222463,"score_gpt":0.2899996638482461,"score_spread":0.2746323820760215,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2078337120","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0022295355,0.00006176871,0.9971986,0.000017953893,0.000010191589,0.0000075951134,0.000006653142,0.000075448785,0.00039225363],"genre_scores_gemma":[0.19872765,0.00045558423,0.79546297,0.00011440625,0.0000601214,0.00011312622,0.00014158603,0.00009182443,0.0048327483],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996475,0.00007950221,0.000019314377,0.000060456547,0.0001706875,0.000022528333],"domain_scores_gemma":[0.9996686,0.00014096293,0.000040693765,0.000044602835,0.00009159983,0.000013554146],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006336138,0.000615125,0.0006078925,0.00033333056,0.00019224087,0.0007106237,0.0006867344,0.00081641553,0.0021160278],"category_scores_gemma":[0.0016033885,0.00029025823,0.00051538186,0.00035727976,0.00043945442,0.0009999707,0.00057520054,0.0008035287,0.00088846334],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003950066,0.00008797865,0.00052202685,0.0003238615,0.000104544415,0.00028818136,0.00017598491,0.35546646,0.16368845,0.07890285,0.0021921343,0.3978525],"study_design_scores_gemma":[0.00001733412,0.0001313348,0.00009870869,0.000016361168,0.00002323294,0.00021871406,0.00001235866,0.9591568,0.032139134,0.0049103894,0.003254392,0.000021301534],"about_ca_topic_score_codex":0.0003245336,"about_ca_topic_score_gemma":0.00036813313,"teacher_disagreement_score":0.0021160278,"about_ca_system_score_codex":0.00026894707,"about_ca_system_score_gemma":0.00047721658,"threshold_uncertainty_score":0.0070788264},"labels":[],"label_agreement":null},{"id":"W2079514273","doi":"10.1016/j.sigpro.2011.03.023","title":"A three-layer scheme for M-channel multiple description image coding","year":2011,"lang":"en","type":"article","venue":"Signal Processing","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Coding (social sciences); Algorithm; Iterative reconstruction; Multiple description coding; Channel (broadcasting); Image (mathematics); Sub-band coding; Layer (electronics); Mathematics; Transform coding; Computer science; Decoding methods; Artificial intelligence; Pattern recognition (psychology); Discrete cosine transform; Telecommunications; Statistics","score_opus":0.106396677333911,"score_gpt":0.29739387616166235,"score_spread":0.19099719882775135,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2079514273","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014972363,0.0007205273,0.97724724,0.00033905957,0.00017814948,0.0001525474,0.0002003086,0.0011316307,0.005058177],"genre_scores_gemma":[0.41701916,0.0007415384,0.5705815,0.00053065456,0.00014293316,0.00025923387,0.0005371486,0.00007111056,0.0101168165],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99950814,0.00009727316,0.00003991389,0.000048598627,0.0002030851,0.000103017606],"domain_scores_gemma":[0.9994235,0.00011301591,0.000042087428,0.00021659864,0.00016638091,0.00003844311],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000693618,0.00067711325,0.0005630165,0.0006960592,0.000849295,0.0009873093,0.0012123846,0.0009800975,0.0038990595],"category_scores_gemma":[0.001149439,0.0002413577,0.0004969803,0.0007227024,0.00046357737,0.0011746058,0.001960436,0.0010143096,0.0013165309],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00080522953,0.00027563242,0.00088438264,0.0004223948,0.00013525602,0.00039854395,0.00026974652,0.04194969,0.18981448,0.12474337,0.013407825,0.62689346],"study_design_scores_gemma":[0.00010112614,0.00032109974,0.00071439345,0.00008027325,0.00011144177,0.000679643,0.00006097881,0.83855087,0.10846209,0.028771862,0.021993117,0.0001531378],"about_ca_topic_score_codex":0.0030637314,"about_ca_topic_score_gemma":0.005152044,"teacher_disagreement_score":0.0038990595,"about_ca_system_score_codex":0.0006210521,"about_ca_system_score_gemma":0.001062364,"threshold_uncertainty_score":0.013043702},"labels":[],"label_agreement":null},{"id":"W2079681413","doi":"10.1109/icip.2014.7026135","title":"An efficient DCT-based image compression system based on transparent composite model","year":2014,"lang":"en","type":"article","venue":"","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Image compression; Discrete cosine transform; Entropy encoding; Transform coding; Data compression; Artificial intelligence; Context-adaptive binary arithmetic coding; Quantization (signal processing); Entropy (arrow of time); Algorithm; Coding (social sciences); Predictive coding; Outlier; Computer vision; Mathematics; Image (mathematics); Image processing; Statistics","score_opus":0.017690092318023935,"score_gpt":0.2819701301800331,"score_spread":0.26428003786200915,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2079681413","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04625957,0.0002252908,0.94971776,0.0001289307,0.00006023149,0.000045213856,0.000099977435,0.0006979786,0.0027650632],"genre_scores_gemma":[0.7775947,0.00038617064,0.21610384,0.00013396912,0.00006224987,0.000063586216,0.00033001075,0.000080815174,0.0052446756],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998344,0.000021958982,0.0000073576593,0.000031993583,0.00009186762,0.00001230234],"domain_scores_gemma":[0.9998247,0.00005004911,0.000018426268,0.000033875967,0.000059111793,0.000013811131],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023722193,0.00028278583,0.00036560203,0.00037683378,0.00022898104,0.00033620643,0.00048389382,0.00035033972,0.0011018446],"category_scores_gemma":[0.0005159321,0.00014386122,0.00035859575,0.00048676392,0.00023213949,0.00059163844,0.00031451863,0.0004983173,0.00036287465],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000554081,0.00015949599,0.0017310434,0.00019942502,0.000058551115,0.0004935323,0.000118422555,0.21189123,0.42343992,0.027031677,0.004527372,0.32979524],"study_design_scores_gemma":[0.0000091015545,0.00007673707,0.0003784886,0.000004530107,0.000010047051,0.00020856038,0.0000055967744,0.97233737,0.024460481,0.0011033359,0.0013912023,0.000014618597],"about_ca_topic_score_codex":0.0015275534,"about_ca_topic_score_gemma":0.0018455453,"teacher_disagreement_score":0.0015275534,"about_ca_system_score_codex":0.0002795716,"about_ca_system_score_gemma":0.00048278368,"threshold_uncertainty_score":0.0036860704},"labels":[],"label_agreement":null},{"id":"W2080833106","doi":"10.1109/mmsp.2006.285315","title":"Robust Index Assignment for MDSQ Encoder Over Noisy Channels","year":2006,"lang":"en","type":"article","venue":"","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Encoder; Algorithm; Computer science; Distortion (music); Decoding methods; Residual; Coding (social sciences); Rate–distortion theory; Error detection and correction; Mathematics; Data compression; Bandwidth (computing)","score_opus":0.02563278424534054,"score_gpt":0.2659110688624788,"score_spread":0.24027828461713824,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2080833106","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.034176584,0.00019498538,0.96463126,0.00009155652,0.000023562687,0.000030525956,0.000048347214,0.00035827063,0.00044490272],"genre_scores_gemma":[0.60534155,0.00016476934,0.39246064,0.00006587553,0.0000273948,0.00009714319,0.00016699801,0.000041732146,0.0016339318],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993624,0.00017946864,0.000043528522,0.00010577336,0.00026845819,0.00004047651],"domain_scores_gemma":[0.99917954,0.00031062443,0.00018893152,0.00012175706,0.00017384383,0.000025246976],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00094205706,0.0004602695,0.00068840594,0.00036645084,0.0003230023,0.00044982156,0.0006476763,0.00044524964,0.00063033204],"category_scores_gemma":[0.0025590933,0.00017247221,0.00019910812,0.0004347099,0.00042785855,0.0005796985,0.00061032875,0.0005402569,0.00021379335],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00068829954,0.00008823279,0.0011576604,0.00024022444,0.000057529873,0.00026629044,0.00028879626,0.4449412,0.13449408,0.056892924,0.0023693175,0.35851544],"study_design_scores_gemma":[0.000025842583,0.00007096474,0.00011994542,0.000009503673,0.000007836124,0.00008234747,0.000013185084,0.9684342,0.025826897,0.004509649,0.0008885689,0.000010999858],"about_ca_topic_score_codex":0.0009672476,"about_ca_topic_score_gemma":0.000876582,"teacher_disagreement_score":0.0009672476,"about_ca_system_score_codex":0.0005543726,"about_ca_system_score_gemma":0.00082029076,"threshold_uncertainty_score":0.004982114},"labels":[],"label_agreement":null},{"id":"W2081258946","doi":"10.1109/iscas.2012.6271419","title":"A low-power subsample-based image compression algorithm for capsule endoscopy","year":2012,"lang":"en","type":"article","venue":"","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Saskatchewan","funders":"","keywords":"Discrete cosine transform; Quantization (signal processing); Algorithm; Compression ratio; Computer science; Image compression; Data compression; RGB color model; Artificial intelligence; Computer vision; Image processing; Image (mathematics); Engineering","score_opus":0.017792212571415514,"score_gpt":0.3043838904480465,"score_spread":0.286591677876631,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2081258946","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03927188,0.001256751,0.95631623,0.00013944776,0.00011081638,0.00009850388,0.00007230751,0.000704464,0.0020295929],"genre_scores_gemma":[0.22534905,0.0013858215,0.7647139,0.00015934903,0.00013210838,0.000112597365,0.00042149762,0.00008501411,0.0076405914],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99984586,0.000012472572,0.000007780077,0.000016667542,0.00011045267,0.000006736204],"domain_scores_gemma":[0.99988747,0.000023801327,0.000019034598,0.000018384244,0.00004452453,0.0000067429114],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013095074,0.00038603693,0.00031474748,0.0004689184,0.00018313121,0.00029006044,0.00046076858,0.00026652106,0.0016020698],"category_scores_gemma":[0.00036715405,0.00012118036,0.00021098563,0.0005145923,0.00013915956,0.0004837977,0.00022573293,0.00033272099,0.00065758283],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020311134,0.000053167794,0.00040400214,0.00013883058,0.000030209276,0.00014311208,0.000054639047,0.006633674,0.264023,0.0031780626,0.0022733088,0.72286487],"study_design_scores_gemma":[0.00007817593,0.0009490231,0.0041798493,0.000037544974,0.00009498021,0.003323339,0.000057259676,0.543464,0.40594214,0.0016359661,0.040165346,0.00007235575],"about_ca_topic_score_codex":0.00073667313,"about_ca_topic_score_gemma":0.0012020933,"teacher_disagreement_score":0.0016020698,"about_ca_system_score_codex":0.00020812523,"about_ca_system_score_gemma":0.00026967295,"threshold_uncertainty_score":0.0053595304},"labels":[],"label_agreement":null},{"id":"W2081650391","doi":"10.1109/vcip.2012.6410852","title":"Low bit-rate video coding via mode-dependent adaptive regression for wireless visual communications","year":2012,"lang":"en","type":"article","venue":"","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Computer science; Upsampling; Encoder; Coding tree unit; Coding (social sciences); Algorithm; Artificial intelligence; Real-time computing; Multiview Video Coding; Decoding methods; Computer vision; Video processing; Video tracking; Mathematics","score_opus":0.046666020023286056,"score_gpt":0.3547516758240206,"score_spread":0.30808565580073455,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2081650391","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011495667,0.00042761586,0.9866535,0.00010186188,0.00002540071,0.000024615949,0.000017833767,0.00026617036,0.0009872915],"genre_scores_gemma":[0.38985285,0.0012023315,0.604737,0.00013950361,0.0000734597,0.0000992326,0.00014739213,0.000071384915,0.0036767717],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99979395,0.000061979044,0.000007847804,0.000025323578,0.000098009885,0.00001292689],"domain_scores_gemma":[0.99981993,0.00007053299,0.000027258813,0.0000267615,0.00005049546,0.0000050154536],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035403075,0.00033782722,0.00020445972,0.0002877742,0.0001188691,0.00022932798,0.00050834205,0.00035973886,0.000882902],"category_scores_gemma":[0.0010204784,0.0000969433,0.00017317041,0.00035811885,0.00021817423,0.00046045904,0.00027361338,0.00047048207,0.00037932108],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00024810043,0.0000786967,0.00078302954,0.00023447824,0.000037469315,0.00024556028,0.00012438103,0.13342778,0.31552652,0.05140658,0.002878003,0.49500942],"study_design_scores_gemma":[0.000012341064,0.00008368555,0.00029045483,0.000018297622,0.0000115835655,0.00014823867,0.000009619832,0.9564568,0.035522886,0.0038096807,0.003622237,0.000014238357],"about_ca_topic_score_codex":0.0010882176,"about_ca_topic_score_gemma":0.0012735946,"teacher_disagreement_score":0.0010882176,"about_ca_system_score_codex":0.00024257813,"about_ca_system_score_gemma":0.0002779475,"threshold_uncertainty_score":0.002953589},"labels":[],"label_agreement":null},{"id":"W2081869022","doi":"10.1109/tasl.2007.907332","title":"Fast Recovery for a CELP-Like Speech Codec After a Frame Erasure","year":2007,"lang":"en","type":"article","venue":"IEEE Transactions on Audio Speech and Language Processing","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Sherbrooke","funders":"","keywords":"Code-excited linear prediction; Codebook; Computer science; Codec; Erasure; Adaptive Multi-Rate audio codec; Inter frame; Speech coding; Speech recognition; Encoder; Frame (networking); Intra-frame; Decoding methods; Algorithm; Linear predictive coding; Voice activity detection; Reference frame; Speech processing; Computer hardware; Telecommunications","score_opus":0.009709254996344667,"score_gpt":0.27364011124835413,"score_spread":0.26393085625200946,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2081869022","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.095661804,0.00033720996,0.90126956,0.00025167858,0.000074854936,0.00006599552,0.00007544577,0.00086220755,0.0014012746],"genre_scores_gemma":[0.6159523,0.00035788325,0.37896183,0.00015755868,0.000043080472,0.000099413955,0.00032383465,0.00014123794,0.003962882],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99949896,0.000072865514,0.000028524204,0.0000617544,0.00028860287,0.000049359634],"domain_scores_gemma":[0.9984421,0.0007773512,0.00014107693,0.00029132716,0.00030704823,0.00004115389],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00075696176,0.000459556,0.00040004877,0.00041745484,0.0003386808,0.0003172903,0.00044786627,0.0007017406,0.0011235119],"category_scores_gemma":[0.004079705,0.00019601811,0.00027792098,0.00033368476,0.00047898619,0.00065447827,0.00074260344,0.00085325056,0.00062312157],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011464588,0.00010582937,0.0015730237,0.00022260872,0.000056457673,0.001287217,0.00028552956,0.09941743,0.44670904,0.028602047,0.0024997978,0.41809455],"study_design_scores_gemma":[0.00004282408,0.0002025087,0.0009397805,0.000028556164,0.000028726634,0.0009212704,0.000041428415,0.7912656,0.19969203,0.0030770535,0.0037303038,0.000029899817],"about_ca_topic_score_codex":0.0016766422,"about_ca_topic_score_gemma":0.0029751358,"teacher_disagreement_score":0.0016766422,"about_ca_system_score_codex":0.00029849212,"about_ca_system_score_gemma":0.0007790174,"threshold_uncertainty_score":0.0040032864},"labels":[],"label_agreement":null},{"id":"W2082166804","doi":"10.1002/ett.4460110204","title":"Analysis of a Dual‐Rate Transmission Scheme for Gaussian Broadcast Channels","year":2000,"lang":"en","type":"article","venue":"European Transactions on Telecommunications","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Transmission (telecommunications); Computer science; Channel (broadcasting); Transmitter; Gaussian; Broadcasting (networking); Distortion (music); Electronic engineering; Telecommunications; Algorithm; Computer network; Bandwidth (computing); Engineering; Physics","score_opus":0.025319609387713413,"score_gpt":0.2880791669804673,"score_spread":0.2627595575927539,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2082166804","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13826005,0.0004176319,0.85032874,0.00041147115,0.000050445975,0.00008170483,0.000072026734,0.0001639403,0.010213825],"genre_scores_gemma":[0.9630188,0.0002040967,0.03305748,0.000047658876,0.00002624744,0.000038826955,0.000031099622,0.000025552055,0.0035501749],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99885094,0.0004021098,0.00002817635,0.00009084722,0.00043377484,0.00019412539],"domain_scores_gemma":[0.9973827,0.0013884641,0.0003153111,0.00021596781,0.00058109104,0.000116463016],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019048314,0.0005245201,0.0006435166,0.000548923,0.0004539947,0.0010404969,0.0010175451,0.00090969674,0.0026019304],"category_scores_gemma":[0.004037224,0.00035635062,0.00045005162,0.00059802324,0.0013463803,0.0010568378,0.0011198167,0.00066505105,0.0003345483],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00027135012,0.000052917243,0.00063755456,0.00007627862,0.000035173114,0.00019772569,0.00017322425,0.8548475,0.013486583,0.115314074,0.0008129321,0.014094776],"study_design_scores_gemma":[0.0000053670924,0.000021029316,0.000054777407,0.0000030195656,0.000005374063,0.000031820528,0.0000094767665,0.9971414,0.00060811156,0.0019631337,0.00015094971,0.000005381187],"about_ca_topic_score_codex":0.0029637981,"about_ca_topic_score_gemma":0.0017468334,"teacher_disagreement_score":0.0029637981,"about_ca_system_score_codex":0.0022692604,"about_ca_system_score_gemma":0.0009348463,"threshold_uncertainty_score":0.01646465},"labels":[],"label_agreement":null},{"id":"W2082370166","doi":"10.1109/isspa.2012.6310670","title":"Efficient color space-based compression scheme for endoscopic images","year":2012,"lang":"en","type":"article","venue":"","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Saskatchewan","funders":"","keywords":"Discrete cosine transform; Image compression; Computer science; Computer vision; Data compression; Artificial intelligence; Compression ratio; Quantization (signal processing); Data compression ratio; Transform coding; Color Cell Compression; Compression (physics); Peak signal-to-noise ratio; Image processing; Image (mathematics); Engineering; Materials science","score_opus":0.022962207134832727,"score_gpt":0.3047055975495646,"score_spread":0.2817433904147319,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2082370166","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.054960135,0.0014883128,0.9378687,0.00020862004,0.00022674623,0.0001153719,0.00015017742,0.0008886211,0.0040933504],"genre_scores_gemma":[0.40393606,0.0017679539,0.58213466,0.00019571136,0.00019297982,0.00012595938,0.0006213048,0.000081495906,0.010943851],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99983203,0.00001753835,0.000008717199,0.000017097604,0.000111411304,0.0000131957095],"domain_scores_gemma":[0.9998398,0.000027160408,0.000015946252,0.000026691887,0.00008257472,0.000007735993],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014625587,0.00036103945,0.00023105882,0.00062500255,0.00017508323,0.00028661953,0.00035213833,0.00028630462,0.0018222219],"category_scores_gemma":[0.00041487397,0.000091741764,0.00017724604,0.00069956644,0.00014958915,0.00047434578,0.0002731057,0.00032884217,0.00060228317],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00029862148,0.000058743037,0.00028013164,0.00014189925,0.000016723381,0.00018491184,0.000046104153,0.007373792,0.4328197,0.0057389513,0.003703056,0.5493373],"study_design_scores_gemma":[0.00009083213,0.0004975154,0.002230725,0.000036151305,0.00004987391,0.0025125183,0.00004285686,0.33905157,0.62395996,0.0017751558,0.029691378,0.000061428036],"about_ca_topic_score_codex":0.0006341675,"about_ca_topic_score_gemma":0.00094486575,"teacher_disagreement_score":0.0018222219,"about_ca_system_score_codex":0.00020253361,"about_ca_system_score_gemma":0.00025679162,"threshold_uncertainty_score":0.0060960054},"labels":[],"label_agreement":null},{"id":"W2083674380","doi":"10.1109/icspc.2007.4728438","title":"Speaker Accent Classification System using Fuzzy Canonical Correlation-Based Gaussian Classifier","year":2007,"lang":"en","type":"article","venue":"","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Centroid; Speech recognition; Computer science; Classifier (UML); Speaker recognition; Correlation; Stress (linguistics); Artificial intelligence; Canonical correlation; Speaker diarisation; Pattern recognition (psychology); Gaussian; Fuzzy logic; Vocal tract; Mathematics","score_opus":0.05040600514764294,"score_gpt":0.3203619079079827,"score_spread":0.26995590276033976,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2083674380","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.078362204,0.00031657642,0.91392356,0.00015464367,0.00015859427,0.000090311565,0.00012809875,0.0043492517,0.0025167852],"genre_scores_gemma":[0.6414852,0.0002918306,0.35256812,0.00015124632,0.0001182397,0.00011377618,0.0003360946,0.00009948846,0.0048359884],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992816,0.000116944655,0.000040265644,0.00018405907,0.0002865569,0.00009052325],"domain_scores_gemma":[0.9991461,0.000108132794,0.00003616569,0.00005100968,0.00060820905,0.00005039117],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012259656,0.00040589384,0.00085902464,0.0008297481,0.0006287415,0.00074525445,0.00068580074,0.0006264353,0.0014628613],"category_scores_gemma":[0.0016449554,0.00018177062,0.00041256464,0.0005595645,0.00027588606,0.0006470707,0.0004464779,0.0005324391,0.0011625034],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009901155,0.00027233994,0.006750633,0.000092627364,0.00013733766,0.00022672885,0.00037413012,0.029866975,0.08124033,0.0049714684,0.010352722,0.8647245],"study_design_scores_gemma":[0.000052038133,0.0001564925,0.004816637,0.000010941832,0.000083509236,0.0002742056,0.000074953066,0.95635605,0.033539496,0.0010944381,0.003474611,0.00006653507],"about_ca_topic_score_codex":0.007637,"about_ca_topic_score_gemma":0.005680305,"teacher_disagreement_score":0.007637,"about_ca_system_score_codex":0.00062621385,"about_ca_system_score_gemma":0.00091550604,"threshold_uncertainty_score":0.015185058},"labels":[],"label_agreement":null},{"id":"W2083983191","doi":"10.1109/tcomm.2006.876849","title":"A Low-Complexity Method for Fixed-Rate Entropy-Constrained Vector Quantization","year":2006,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Lagrange multiplier; Vector quantization; Mathematics; Mathematical optimization; Quantization (signal processing); Algorithm; Constraint algorithm; Entropy (arrow of time); Iterative method","score_opus":0.048746259002279614,"score_gpt":0.3404887353094802,"score_spread":0.29174247630720057,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2083983191","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00040934785,0.0000836748,0.9985877,0.000031731972,0.000025485737,0.000019947309,0.000013288989,0.0000871763,0.00074165745],"genre_scores_gemma":[0.047423013,0.00031061153,0.94919646,0.000079984784,0.000065177665,0.00015981334,0.00009842848,0.000111090456,0.002555468],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99938035,0.00014492689,0.000032230142,0.00007383317,0.00033616717,0.00003239346],"domain_scores_gemma":[0.9994981,0.00026082876,0.000037115053,0.00007546527,0.000113764145,0.000014711527],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00080079754,0.0006013855,0.0005877575,0.0006494883,0.00041267223,0.00071290374,0.001342814,0.00067978783,0.0044539245],"category_scores_gemma":[0.0026932496,0.00031389046,0.0005033639,0.0007495961,0.0006786466,0.0011702256,0.000973286,0.0015236079,0.0010696321],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010186451,0.00006086855,0.0002154454,0.00022210924,0.000045415858,0.00011570755,0.0001112214,0.30536905,0.016566293,0.2949717,0.0049280594,0.37729222],"study_design_scores_gemma":[0.000016856382,0.000027389533,0.00004688803,0.000019170091,0.00000682784,0.00008802403,0.000006414719,0.9647593,0.0039709723,0.024125097,0.0069146827,0.000018417455],"about_ca_topic_score_codex":0.0017201524,"about_ca_topic_score_gemma":0.0019864268,"teacher_disagreement_score":0.0044539245,"about_ca_system_score_codex":0.000669377,"about_ca_system_score_gemma":0.0011187461,"threshold_uncertainty_score":0.01489985},"labels":[],"label_agreement":null},{"id":"W2084029989","doi":"10.1016/j.rti.2004.08.006","title":"An embedded wavelet image coder with parallel encoding and sequential decoding of bit-planes","year":2004,"lang":"en","type":"article","venue":"Real-Time Imaging","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Decoding methods; Encoding (memory); Bit (key); Computer science; Wavelet; Image (mathematics); Algorithm; Arithmetic; Artificial intelligence; Mathematics","score_opus":0.008937142560488717,"score_gpt":0.2749912512121489,"score_spread":0.2660541086516602,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2084029989","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06386608,0.0003541243,0.92693377,0.00021210275,0.00022611859,0.00013417707,0.00017537514,0.0044232663,0.0036750634],"genre_scores_gemma":[0.23433739,0.00029450265,0.7518199,0.00030338846,0.00014368621,0.00013809158,0.00041915706,0.00038483314,0.012158974],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995372,0.000054025517,0.00003322013,0.000074686875,0.00025545305,0.000045332807],"domain_scores_gemma":[0.9992132,0.00019082967,0.00007719243,0.00021427257,0.00025269034,0.000051830677],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00051735307,0.00068859657,0.00072248204,0.0006230073,0.00023065646,0.0006437641,0.001022096,0.0007652649,0.002957177],"category_scores_gemma":[0.0011385948,0.00033999942,0.0002757443,0.00051456137,0.00025482874,0.0010152207,0.0007021815,0.0007345715,0.0015304332],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0015079147,0.000311667,0.000686448,0.00020702461,0.00010999934,0.0005541991,0.000086657725,0.014656431,0.57133025,0.010930766,0.005230924,0.3943877],"study_design_scores_gemma":[0.00021467205,0.00068875257,0.0012236721,0.000041884916,0.00013324639,0.0017458325,0.000019899897,0.41052806,0.5670674,0.0021267205,0.016135365,0.000074503056],"about_ca_topic_score_codex":0.0006061179,"about_ca_topic_score_gemma":0.0010707123,"teacher_disagreement_score":0.002957177,"about_ca_system_score_codex":0.00031997537,"about_ca_system_score_gemma":0.0005451605,"threshold_uncertainty_score":0.009892702},"labels":[],"label_agreement":null},{"id":"W2084516574","doi":"10.1109/icip.2008.4712189","title":"Fast index assignment for robust multiple description coding","year":2008,"lang":"en","type":"article","venue":"","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Computer science; Computational complexity theory; Robustness (evolution); Algorithm; Multiple description coding; Coding (social sciences); Decoding methods; Theoretical computer science; Mathematics","score_opus":0.07613598308293514,"score_gpt":0.26901697424223064,"score_spread":0.19288099115929552,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2084516574","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0061902297,0.0003011444,0.9921565,0.00011473368,0.00003669421,0.000037666694,0.00004463077,0.00029017503,0.000828313],"genre_scores_gemma":[0.35357195,0.00044312456,0.6425846,0.00019226575,0.00005606694,0.00017046105,0.00036455286,0.00007370135,0.002543294],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99939203,0.00015183506,0.00003982455,0.00008789232,0.00027550443,0.00005289236],"domain_scores_gemma":[0.9990465,0.00047806004,0.000093647686,0.00015838482,0.00019813742,0.000025218349],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010374498,0.00040659594,0.00054555316,0.00071047765,0.00030774542,0.000604814,0.00096083654,0.0005685737,0.0015651992],"category_scores_gemma":[0.0029565473,0.00020496703,0.00026835487,0.00083255454,0.00057003036,0.0012433508,0.0010336988,0.0010202646,0.00035976083],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00029422474,0.000066163986,0.00031173628,0.00022999148,0.000044501558,0.00016426298,0.00012309993,0.2324343,0.038779855,0.15376846,0.0044845995,0.5692988],"study_design_scores_gemma":[0.000030082156,0.000040060437,0.000060374357,0.000009896381,0.000006368771,0.00005193261,0.00000868198,0.9620546,0.012632208,0.022713393,0.0023778456,0.000014561131],"about_ca_topic_score_codex":0.0014759994,"about_ca_topic_score_gemma":0.0012629889,"teacher_disagreement_score":0.0015651992,"about_ca_system_score_codex":0.00072255335,"about_ca_system_score_gemma":0.00092675566,"threshold_uncertainty_score":0.0054866076},"labels":[],"label_agreement":null},{"id":"W2086174525","doi":"10.1109/tasl.2011.2181834","title":"Context-Based Adaptive Arithmetic Encoding of EAVQ Indices","year":2011,"lang":"en","type":"article","venue":"IEEE Transactions on Audio Speech and Language Processing","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Sherbrooke","funders":"","keywords":"Lossless compression; Computer science; Encoding (memory); Codec; Context (archaeology); Data compression; Speech recognition; Binary number; Algorithm; Arithmetic coding; Arithmetic; Context-adaptive binary arithmetic coding; Mathematics; Artificial intelligence; Computer hardware","score_opus":0.027942190794101825,"score_gpt":0.2650357053033448,"score_spread":0.237093514509243,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2086174525","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.052049793,0.0006449125,0.94364005,0.000117026444,0.0001249488,0.00007960276,0.000069341426,0.00068844244,0.002585985],"genre_scores_gemma":[0.43495774,0.0003255719,0.5613998,0.00010814165,0.000110954745,0.00009802187,0.00014940024,0.000118535,0.0027318604],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99969804,0.00005514778,0.000026441552,0.000057060668,0.0001400759,0.000023285036],"domain_scores_gemma":[0.9994118,0.00016841872,0.0000767308,0.0001254678,0.00019987555,0.000017650826],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003571623,0.00041252436,0.00028472499,0.0004698564,0.0002623291,0.00057711813,0.00069854053,0.00024770948,0.0011586733],"category_scores_gemma":[0.0022653327,0.00013073813,0.00014095215,0.00032493763,0.00035147663,0.00086895743,0.0006005996,0.00060692977,0.0003878562],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000464414,0.000062044404,0.0009675675,0.00012333343,0.000017526065,0.00013251549,0.00018074205,0.027302451,0.21597826,0.045721315,0.0013481729,0.7077017],"study_design_scores_gemma":[0.00009825158,0.0005346369,0.0016538154,0.000096466414,0.000040419924,0.0006558509,0.00006964024,0.6614758,0.29692245,0.015464493,0.02291319,0.00007494286],"about_ca_topic_score_codex":0.0004206598,"about_ca_topic_score_gemma":0.00073370466,"teacher_disagreement_score":0.0011586733,"about_ca_system_score_codex":0.00032475585,"about_ca_system_score_gemma":0.00031919294,"threshold_uncertainty_score":0.0038762093},"labels":[],"label_agreement":null},{"id":"W2087328281","doi":"10.1109/icip.2010.5650986","title":"Edge-based image coding at low bit-rate","year":2010,"lang":"en","type":"article","venue":"","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Codec; Computer science; Harmonic Vector Excitation Coding; Coding (social sciences); Enhanced Data Rates for GSM Evolution; Edge detection; Computer vision; Artificial intelligence; Residual; Intra-frame; Algorithm; Image quality; Bit rate; Image (mathematics); Mathematics; Image processing; Pixel; Telecommunications; Real-time computing","score_opus":0.01091719931222413,"score_gpt":0.26896965888473723,"score_spread":0.2580524595725131,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2087328281","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03842287,0.000510159,0.9577509,0.00010759586,0.000049171562,0.00004457911,0.00010424939,0.0006452957,0.0023651223],"genre_scores_gemma":[0.3072095,0.00072731334,0.6863201,0.00021308834,0.00006744846,0.0000826221,0.00032324606,0.00017263694,0.0048840363],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99972695,0.000029931312,0.000013840461,0.000026055763,0.00017291876,0.000030310543],"domain_scores_gemma":[0.9993105,0.00019016567,0.00006972845,0.00012549876,0.0002826435,0.00002152018],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021905011,0.00039703515,0.00029697266,0.0006611459,0.00017296545,0.00044643533,0.0008474301,0.00052854186,0.0014007324],"category_scores_gemma":[0.0010658111,0.00013560429,0.00019976341,0.00058614323,0.00032980982,0.0009080111,0.00053603057,0.0007847957,0.0007124294],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006205875,0.00010407161,0.00091312925,0.00022083845,0.000037579648,0.00027787188,0.000087395376,0.05536186,0.5158773,0.025418663,0.002777083,0.39830363],"study_design_scores_gemma":[0.00004636385,0.00021938034,0.0008248678,0.000038291,0.00003367915,0.0004508021,0.000015176415,0.6463904,0.34061292,0.0047775507,0.0065371916,0.00005342302],"about_ca_topic_score_codex":0.0010165554,"about_ca_topic_score_gemma":0.0015358025,"teacher_disagreement_score":0.0014007324,"about_ca_system_score_codex":0.00019438099,"about_ca_system_score_gemma":0.00026186355,"threshold_uncertainty_score":0.0046859384},"labels":[],"label_agreement":null},{"id":"W2088959794","doi":"10.1371/journal.pone.0045002","title":"Statistical Conditional Sampling for Variable-Resolution Video Compression","year":2012,"lang":"en","type":"article","venue":"PLoS ONE","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Sampling (signal processing); Data compression; Artificial intelligence; Video compression picture types; Video quality; Data compression ratio; Computer vision; Resolution (logic); Conditional probability; Statistical model; Statistics; Video tracking; Video processing; Mathematics; Image compression; Image processing; Image (mathematics)","score_opus":0.11127451231168178,"score_gpt":0.31770301231609477,"score_spread":0.20642850000441298,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2088959794","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017554643,0.00025491574,0.981311,0.00007035949,0.00001352529,0.000025979616,0.000029936338,0.00021199528,0.0005275928],"genre_scores_gemma":[0.58672076,0.0007260967,0.41066214,0.00013654263,0.000094566785,0.00009696811,0.00025519085,0.000110143345,0.0011975244],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99926513,0.0002524761,0.00002459636,0.00009683083,0.00032228377,0.00003861433],"domain_scores_gemma":[0.99749494,0.0017041242,0.00017476903,0.00030990088,0.00026222304,0.000054115775],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012340172,0.00033481664,0.00048823183,0.0005676851,0.00020803319,0.0003670125,0.0009493383,0.00038449877,0.0012374434],"category_scores_gemma":[0.0043108347,0.00021166082,0.00041604374,0.00076366885,0.00067290344,0.000983984,0.0005240214,0.000688202,0.00021200902],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005490248,0.00014168437,0.0022262814,0.00022018925,0.00009758863,0.00032785392,0.00019090806,0.5755529,0.053584974,0.081005864,0.0019086811,0.28419414],"study_design_scores_gemma":[0.000009689852,0.000038903276,0.0004009111,0.0000051602674,0.00000887918,0.0001144606,0.000007137521,0.9889893,0.0058866087,0.0038864827,0.00064146175,0.000011049644],"about_ca_topic_score_codex":0.0022549639,"about_ca_topic_score_gemma":0.001952125,"teacher_disagreement_score":0.0022549639,"about_ca_system_score_codex":0.0005062857,"about_ca_system_score_gemma":0.0004456798,"threshold_uncertainty_score":0.006526172},"labels":[],"label_agreement":null},{"id":"W2089694135","doi":"10.1006/rtim.2001.0271","title":"Fast Trellis-Coded Color Quantization of Images","year":2002,"lang":"en","type":"article","venue":"Real-Time Imaging","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Trellis quantization; Dither; Color quantization; RGB color model; Quantization (signal processing); Computer vision; Computer science; Vector quantization; Artificial intelligence; High color; Color depth; Color space; Color image; Mathematics; Algorithm; Image processing; Image (mathematics); Noise shaping","score_opus":0.012353611075484064,"score_gpt":0.257179868601643,"score_spread":0.24482625752615894,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2089694135","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.032506704,0.0017436524,0.95411396,0.00042215432,0.00033227925,0.00010356471,0.0004963993,0.0023198337,0.007961575],"genre_scores_gemma":[0.33959258,0.0016534787,0.63611114,0.00025210713,0.00024105469,0.0001774842,0.0011976459,0.00034860728,0.020425973],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9993635,0.00012411649,0.000031130694,0.00005960145,0.00034280153,0.00007892107],"domain_scores_gemma":[0.99847,0.0005893709,0.00010928336,0.0002988366,0.000476806,0.0000556757],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005629392,0.0006792409,0.00047932647,0.0009120126,0.00034426848,0.0009863555,0.00079174875,0.00070628343,0.006696469],"category_scores_gemma":[0.0030372806,0.00023295387,0.00027482206,0.0014361899,0.0005160504,0.0010745954,0.0006993928,0.0010457977,0.0016993296],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.001078597,0.00010475292,0.00029209137,0.00033026934,0.000065187945,0.00019491932,0.0001729693,0.091271095,0.1447226,0.07242156,0.017864373,0.67148167],"study_design_scores_gemma":[0.00011568003,0.00016280223,0.0006891594,0.000067442816,0.000028013344,0.00038134,0.00004464467,0.8234319,0.13829255,0.025903178,0.010807622,0.00007563768],"about_ca_topic_score_codex":0.0059457794,"about_ca_topic_score_gemma":0.009667135,"teacher_disagreement_score":0.006696469,"about_ca_system_score_codex":0.0008539537,"about_ca_system_score_gemma":0.0010776776,"threshold_uncertainty_score":0.022401929},"labels":[],"label_agreement":null},{"id":"W2089830671","doi":"10.1145/1089737.1089740","title":"Optimal channel rate allocation for multimedia communication over fading wireless channels","year":2005,"lang":"en","type":"article","venue":"","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Computer science; Fading; Wireless; Computer network; Network packet; Wireless network; Channel (broadcasting); Coding (social sciences); Multimedia; Telecommunications; Mathematics","score_opus":0.027419474199921565,"score_gpt":0.30680938848079303,"score_spread":0.27938991428087145,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2089830671","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08963625,0.00062712276,0.9045873,0.00027830235,0.00002983043,0.000055372606,0.00004904207,0.0001158558,0.004620887],"genre_scores_gemma":[0.9260405,0.000657848,0.071405716,0.00006026077,0.00004450726,0.00008177781,0.000036847352,0.00003966709,0.001632902],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99956316,0.0001982174,0.000013885493,0.000044422814,0.00010001808,0.00008028635],"domain_scores_gemma":[0.9990772,0.0006307439,0.00010366865,0.000053753763,0.000104485014,0.000030196585],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009271968,0.0005401763,0.0004883999,0.00040339443,0.00030752693,0.0006823806,0.00045410462,0.00046780918,0.0010554162],"category_scores_gemma":[0.0034965053,0.00023953608,0.00016396314,0.0005376214,0.00089802576,0.0009432021,0.00058501255,0.00046909138,0.00020872761],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000060123584,0.00002566521,0.00021637176,0.00004354132,0.000011374995,0.00005117677,0.000058408597,0.947064,0.003977815,0.031957828,0.00041771313,0.016115876],"study_design_scores_gemma":[0.000011096005,0.000018790959,0.00006382516,0.0000035519292,0.0000049181303,0.000018204295,0.000017465742,0.98879445,0.0010724415,0.009732472,0.00025647273,0.0000062497948],"about_ca_topic_score_codex":0.00148312,"about_ca_topic_score_gemma":0.0014010926,"teacher_disagreement_score":0.00148312,"about_ca_system_score_codex":0.0009556919,"about_ca_system_score_gemma":0.00077404623,"threshold_uncertainty_score":0.0069340467},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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)","score_opus":0.019641500906346393,"score_gpt":0.25005477281125715,"score_spread":0.23041327190491076,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2089848273","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07010277,0.00097431464,0.89505714,0.00027115954,0.00026083997,0.00022911403,0.0005471464,0.0067064967,0.025851054],"genre_scores_gemma":[0.542535,0.0010525174,0.42512044,0.00038796282,0.00026574254,0.00028202,0.001532811,0.0010488312,0.027774667],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997329,0.000013036156,0.000008116642,0.00003196054,0.00018672015,0.000027213091],"domain_scores_gemma":[0.9997031,0.00007358059,0.000021127562,0.000084807114,0.00009631412,0.000021115758],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015624538,0.0003625353,0.00030624014,0.00068499177,0.00031631233,0.00062411476,0.00092213624,0.00028679636,0.005933701],"category_scores_gemma":[0.0009167215,0.00013760818,0.0002215621,0.00080687203,0.00028462024,0.0008425131,0.00081158086,0.0005462241,0.0011121348],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00038452068,0.0001273547,0.0008866054,0.00016064265,0.00003257801,0.0005742891,0.00012882629,0.046489503,0.2597626,0.016276343,0.022053383,0.65312344],"study_design_scores_gemma":[0.00011443413,0.00019412734,0.0021902034,0.00003624658,0.0000362426,0.0013797646,0.00006145345,0.787097,0.14670672,0.009040563,0.053078104,0.00006513933],"about_ca_topic_score_codex":0.0014030961,"about_ca_topic_score_gemma":0.0017770072,"teacher_disagreement_score":0.005933701,"about_ca_system_score_codex":0.0003406787,"about_ca_system_score_gemma":0.0003006456,"threshold_uncertainty_score":0.019850194},"labels":[],"label_agreement":null},{"id":"W2090408580","doi":"10.1109/tip.2014.2358204","title":"Quantization Table Design Revisited for Image/Video Coding","year":2014,"lang":"en","type":"article","venue":"IEEE Transactions on Image Processing","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; Canada Research Chairs","keywords":"Quantization (signal processing); JPEG; Rate–distortion theory; Algorithm; Trellis quantization; Computational complexity theory; Image compression; Transform coding; Data compression; Computer science; Discrete cosine transform; Coding (social sciences); Mathematics; Theoretical computer science; Artificial intelligence; Image processing; Statistics; Image (mathematics)","score_opus":0.030388145950790455,"score_gpt":0.30467086205965754,"score_spread":0.27428271610886706,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2090408580","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0014652426,0.00085947086,0.99561137,0.0002069676,0.00010669844,0.000037552138,0.000034107943,0.0001503827,0.0015282339],"genre_scores_gemma":[0.1730158,0.0018761052,0.8199382,0.00048541813,0.00019637783,0.00015627383,0.00020168962,0.00015729596,0.0039729555],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992545,0.00021357511,0.00007382782,0.0001044393,0.00031887885,0.000034741875],"domain_scores_gemma":[0.999388,0.0001969431,0.000052136027,0.00012104453,0.00022577312,0.000016111127],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009146006,0.00045368558,0.00045994823,0.0004674918,0.0002842246,0.0012611769,0.00095895806,0.00073353935,0.002185097],"category_scores_gemma":[0.0026186984,0.00026032314,0.00039817533,0.0009733309,0.0005688711,0.0010638711,0.00058453425,0.0012225832,0.0006095472],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013613197,0.000039604387,0.00049332005,0.00030592972,0.00004570325,0.00018174046,0.00015906293,0.12238608,0.041420545,0.37533438,0.0077110566,0.45178643],"study_design_scores_gemma":[0.00005234138,0.00016862343,0.00026013452,0.000105733496,0.000041499366,0.00064695784,0.000046908484,0.7994592,0.033577982,0.11480025,0.050789595,0.000050717023],"about_ca_topic_score_codex":0.0014097227,"about_ca_topic_score_gemma":0.001660404,"teacher_disagreement_score":0.002185097,"about_ca_system_score_codex":0.0009438161,"about_ca_system_score_gemma":0.0009660205,"threshold_uncertainty_score":0.0073099136},"labels":[],"label_agreement":null},{"id":"W2090986349","doi":"10.1109/dcc.2007.2","title":"A Distortion Optimal Rate Allocation Algorithm for Transmission of Embedded Bitstreams over Noisy Channels","year":2007,"lang":"en","type":"article","venue":"","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Trellis (graph); Viterbi algorithm; Network packet; Algorithm; Space–time trellis code; Distortion (music); Computer science; Transmission (telecommunications); Dynamic programming; Viterbi decoder; Quadratic equation; Convolutional code; Mathematics; Mathematical optimization; Decoding methods; Telecommunications; Computer network; Block code; Bandwidth (computing)","score_opus":0.01373709052082705,"score_gpt":0.2973034341359195,"score_spread":0.2835663436150924,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2090986349","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003520695,0.00009309422,0.9956115,0.000049534094,0.0000144639225,0.000022032522,0.000015308551,0.0001343557,0.0005391147],"genre_scores_gemma":[0.17341442,0.00024637082,0.82211345,0.00006638795,0.000052163145,0.00014903111,0.00011985315,0.00013305128,0.003705262],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994586,0.00012735822,0.000038294434,0.00011305793,0.00020554665,0.000057265202],"domain_scores_gemma":[0.99947757,0.0002956046,0.000058623646,0.000058070713,0.000094705436,0.000015484215],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00077682873,0.0007908273,0.0008343764,0.0005083963,0.00041487417,0.00079326483,0.0011728408,0.00097075035,0.0020353952],"category_scores_gemma":[0.002419058,0.00038907165,0.00047107085,0.00052333355,0.000649536,0.0012293127,0.00089241576,0.00103462,0.00059757393],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00025015188,0.000058534457,0.00031488575,0.0001649225,0.00005170389,0.0001398293,0.00021182335,0.6313183,0.018493725,0.062201425,0.0022776045,0.2845172],"study_design_scores_gemma":[0.000024638479,0.00004050585,0.00006220794,0.000011357844,0.000009250838,0.00008931064,0.000016664424,0.98317647,0.0052206586,0.010156604,0.0011807221,0.000011619606],"about_ca_topic_score_codex":0.0013609469,"about_ca_topic_score_gemma":0.0012786576,"teacher_disagreement_score":0.0020353952,"about_ca_system_score_codex":0.00091959443,"about_ca_system_score_gemma":0.0011114076,"threshold_uncertainty_score":0.0068091154},"labels":[],"label_agreement":null},{"id":"W2091831372","doi":"10.1007/s11265-005-5268-0","title":"An Efficient Architecture for a Lifted 2D Biorthogonal DWT","year":2005,"lang":"en","type":"article","venue":"The Journal of VLSI Signal Processing Systems for Signal Image and Video Technology","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Transpose; Parallel computing; Biorthogonal system; Wavelet; Lifting scheme; Architecture; Signal processing; Discrete wavelet transform; Second-generation wavelet transform; Algorithm; Factoring; Wavelet transform; Image processing; Digital signal processing; Computer hardware; Image (mathematics); Artificial intelligence","score_opus":0.012348886256349627,"score_gpt":0.29195555628600695,"score_spread":0.27960667002965733,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2091831372","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07640184,0.0008610044,0.90449053,0.00036785373,0.00045181884,0.0001529706,0.0003104649,0.0044846525,0.012478861],"genre_scores_gemma":[0.39817965,0.0005677942,0.58396196,0.00043976214,0.00019114095,0.00019804154,0.00077276514,0.0001431009,0.015545785],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998877,0.00001175282,0.000009217032,0.000017415654,0.000057443303,0.000016535072],"domain_scores_gemma":[0.99991965,0.000012182557,0.000009862377,0.00002055794,0.000028688937,0.000008978067],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000085707805,0.0004285408,0.00031263966,0.0004628307,0.0002790084,0.00053324155,0.00066910364,0.00035785843,0.0059155812],"category_scores_gemma":[0.00019682191,0.00024937323,0.00023150092,0.00038228135,0.00011036822,0.00053742796,0.0005125795,0.00035618013,0.002277063],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00035776504,0.00010821525,0.00060929137,0.00025233996,0.00006279627,0.00051941094,0.00011053646,0.010527938,0.54618645,0.010150422,0.01040638,0.42070848],"study_design_scores_gemma":[0.00020482283,0.001884078,0.0029082226,0.00010053577,0.00017300117,0.0032386873,0.000100316545,0.5008565,0.37972143,0.008748727,0.10194319,0.000120413155],"about_ca_topic_score_codex":0.0006200904,"about_ca_topic_score_gemma":0.0019379625,"teacher_disagreement_score":0.0059155812,"about_ca_system_score_codex":0.00019337573,"about_ca_system_score_gemma":0.00031416139,"threshold_uncertainty_score":0.019789577},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.041726713411382794,"score_gpt":0.27218438468903944,"score_spread":0.23045767127765665,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2093533836","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0735093,0.0024133592,0.9163413,0.0005646747,0.00014169604,0.00016297205,0.00016875677,0.0020311489,0.0046667904],"genre_scores_gemma":[0.4829137,0.0026532328,0.492751,0.0005592998,0.00026316463,0.00014423128,0.00052177167,0.00024415023,0.019949399],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99986804,0.000011311368,0.0000070756923,0.000014906094,0.000090273345,0.000008451529],"domain_scores_gemma":[0.9998467,0.000040498282,0.000028378736,0.000020758049,0.000054428823,0.000009194846],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017726413,0.00035278537,0.0001847939,0.00041680748,0.00018907903,0.0004095948,0.00072894176,0.00027338183,0.003001702],"category_scores_gemma":[0.0005389726,0.00014914123,0.00011744744,0.00043059955,0.00019137892,0.0007959369,0.00023520287,0.00034490335,0.0007386073],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00048701282,0.00008508036,0.00074045995,0.00029748233,0.00003086521,0.0003724236,0.00009065598,0.005225336,0.47084966,0.0063798414,0.008037341,0.50740385],"study_design_scores_gemma":[0.000135539,0.0008783032,0.0026077447,0.000066849745,0.00009931965,0.002418096,0.000060579165,0.22032928,0.7245471,0.0015976558,0.047199525,0.00006001724],"about_ca_topic_score_codex":0.0005459105,"about_ca_topic_score_gemma":0.0010931616,"teacher_disagreement_score":0.003001702,"about_ca_system_score_codex":0.00031133922,"about_ca_system_score_gemma":0.00030556036,"threshold_uncertainty_score":0.010041654},"labels":[],"label_agreement":null},{"id":"W2093995354","doi":"10.1109/embc.2013.6610265","title":"Compressibility variations of JPEG2000 compressed computed tomography","year":2013,"lang":"en","type":"article","venue":"","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"École de Technologie Supérieure","funders":"","keywords":"Compressibility; Lossy compression; Compression (physics); Imaging phantom; Data compression; Image compression; Computer science; Medical imaging; Compression ratio; Tomography; Artificial intelligence; Computed tomography; Image processing; Radiology; Image (mathematics); Materials science; Medicine; Engineering; Mechanical engineering","score_opus":0.012806070113526599,"score_gpt":0.2539701225921343,"score_spread":0.2411640524786077,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2093995354","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9713396,0.0022330955,0.02259146,0.0002261298,0.0000616643,0.00009694533,0.0008470965,0.0003897177,0.0022143275],"genre_scores_gemma":[0.98787224,0.0007303449,0.009504188,0.00005299986,0.000021872307,0.000033064804,0.0008442673,0.00008916546,0.00085183897],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995522,0.000072158626,0.00004345648,0.000051988085,0.00024059023,0.00003955082],"domain_scores_gemma":[0.99521905,0.0031138118,0.0003952707,0.0002824584,0.0009067104,0.000082629216],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00063589873,0.0003520897,0.00021538968,0.0015498099,0.00023145195,0.00045535367,0.00028062297,0.0003582414,0.0013256245],"category_scores_gemma":[0.007848567,0.00012277487,0.00014637,0.0011192344,0.000446459,0.00061825744,0.0002829201,0.00031066974,0.00014172048],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.004364214,0.0004109076,0.017172731,0.00067547546,0.0001460977,0.0025098848,0.00092476973,0.094526716,0.6755493,0.0025390612,0.0016015995,0.19957927],"study_design_scores_gemma":[0.00009875804,0.0022195275,0.096829906,0.00018950796,0.0001703711,0.004385709,0.00045734682,0.23136197,0.6575613,0.0020025626,0.0045475275,0.0001756509],"about_ca_topic_score_codex":0.0019325746,"about_ca_topic_score_gemma":0.00123177,"teacher_disagreement_score":0.0019325746,"about_ca_system_score_codex":0.0003714488,"about_ca_system_score_gemma":0.0002101883,"threshold_uncertainty_score":0.004434705},"labels":[],"label_agreement":null},{"id":"W2094295862","doi":"10.1007/s11554-011-0208-7","title":"Subsample-based image compression for capsule endoscopy","year":2011,"lang":"en","type":"article","venue":"Journal of Real-Time Image Processing","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":20,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Saskatchewan","funders":"Natural Sciences and Engineering Research Council of Canada; CMC Microsystems","keywords":"Computer science; Artificial intelligence; Computer vision; Chrominance; Lossless compression; Image compression; Data compression; Clipping (morphology); Pixel; Image processing; Image (mathematics)","score_opus":0.03080377291511891,"score_gpt":0.30767892098832317,"score_spread":0.27687514807320424,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2094295862","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14667377,0.0040252176,0.84331614,0.0005806535,0.0003853698,0.00007834988,0.00024959477,0.00092036364,0.003770465],"genre_scores_gemma":[0.5364082,0.002771476,0.4509489,0.00035010203,0.00041020528,0.00008570746,0.0005442536,0.00016791001,0.008313335],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9998586,0.000028678049,0.000008899071,0.000014245949,0.00008015911,0.000009301835],"domain_scores_gemma":[0.9997756,0.0000936642,0.00002151154,0.000040524108,0.000060017737,0.000008681664],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018499594,0.00043341098,0.000274623,0.0004762757,0.00015074927,0.00031851657,0.00025775933,0.0004186799,0.002146271],"category_scores_gemma":[0.00075482094,0.00013138425,0.00022219316,0.0005104698,0.00014383954,0.00039982286,0.00024104105,0.00032115413,0.0005423586],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011932716,0.0001141012,0.0006754238,0.00021067799,0.000069720205,0.00026286935,0.00008066963,0.015227573,0.30458888,0.0035623305,0.0040624044,0.66995203],"study_design_scores_gemma":[0.00007403977,0.0005991714,0.005156083,0.000050289003,0.00013387247,0.0018083369,0.00007492639,0.64723915,0.3289594,0.0023044809,0.013553935,0.00004619798],"about_ca_topic_score_codex":0.00070783455,"about_ca_topic_score_gemma":0.001150523,"teacher_disagreement_score":0.002146271,"about_ca_system_score_codex":0.00012246397,"about_ca_system_score_gemma":0.00017400926,"threshold_uncertainty_score":0.0071799755},"labels":[],"label_agreement":null},{"id":"W2094410090","doi":"10.1117/12.829034","title":"Image compression with Iris-C","year":2009,"lang":"en","type":"article","venue":"Proceedings of SPIE, the International Society for Optical Engineering/Proceedings of SPIE","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"General Dynamics (Canada)","funders":"","keywords":"Codec; Computer science; Lossless compression; Data compression; Image compression; Computer vision; Artificial intelligence; Computer hardware; Image processing; Image (mathematics)","score_opus":0.009855603431389167,"score_gpt":0.2455570394827594,"score_spread":0.23570143605137023,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2094410090","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20800492,0.0025228169,0.6596837,0.0007932099,0.00060351426,0.0006025515,0.002139917,0.031375315,0.094274044],"genre_scores_gemma":[0.6490525,0.0010809274,0.3059817,0.0003455407,0.00013454913,0.00018643064,0.0027021435,0.00079728017,0.0397189],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.999476,0.000027015807,0.00002729542,0.00006398072,0.00036541407,0.000040304985],"domain_scores_gemma":[0.9993074,0.00009714627,0.00005848005,0.00015551047,0.0003532686,0.000028221479],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028964618,0.00039312994,0.00030534194,0.0008654172,0.00029316818,0.0004938309,0.0005598566,0.0003730635,0.0072488463],"category_scores_gemma":[0.0014926966,0.00010626844,0.00018972665,0.0011440815,0.0003157748,0.00060739735,0.0005654468,0.00066186045,0.0019046973],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0013534231,0.00016312722,0.0017225604,0.00044977412,0.000053910433,0.0007358971,0.00028367137,0.021499991,0.3692863,0.019936236,0.030085523,0.5544296],"study_design_scores_gemma":[0.00010890488,0.0005291004,0.0026799212,0.000066263,0.000038411792,0.0019323672,0.00008017525,0.20915858,0.70949835,0.0015989132,0.07422065,0.00008837969],"about_ca_topic_score_codex":0.002209343,"about_ca_topic_score_gemma":0.0015229848,"teacher_disagreement_score":0.0072488463,"about_ca_system_score_codex":0.0005156386,"about_ca_system_score_gemma":0.00041525043,"threshold_uncertainty_score":0.024249792},"labels":[],"label_agreement":null},{"id":"W2094453778","doi":"10.1109/csndsp.2014.6923887","title":"Evaluating packet erasure recovery techniques for audio streaming","year":2014,"lang":"en","type":"article","venue":"","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"","keywords":"Computer science; Packet loss; Erasure code; Computer network; Network packet; Voice over IP; Testbed; Audio over Ethernet; Erasure; Packet analyzer; Speech coding; Real-time computing; The Internet; Digital audio; Audio signal; Decoding methods; Speech recognition; Telecommunications; Operating system","score_opus":0.04633258948400729,"score_gpt":0.362978083139178,"score_spread":0.3166454936551707,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2094453778","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9798901,0.00079484703,0.017798517,0.000085808904,0.000047016125,0.00017959588,0.00009938706,0.00017876131,0.0009259419],"genre_scores_gemma":[0.9872356,0.00038311083,0.011806301,0.000017366547,0.000019229305,0.000052018586,0.00008142188,0.000018298524,0.00038673842],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99881506,0.00042669068,0.000095641015,0.00011570334,0.00042288733,0.00012402862],"domain_scores_gemma":[0.9904143,0.006862996,0.00080523366,0.00054835656,0.0011673965,0.00020169446],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020720658,0.0007104445,0.00036427163,0.0010372052,0.00035548894,0.00035785127,0.0006504516,0.0007082364,0.0005410247],"category_scores_gemma":[0.009679601,0.00016849235,0.0003006777,0.00060245313,0.00055592327,0.00097534945,0.0004341305,0.0004934065,0.00010700708],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.003912626,0.0024592178,0.009110177,0.0010380129,0.0002140365,0.0002888177,0.00021710964,0.61256826,0.23189779,0.0021904798,0.0007393557,0.13536406],"study_design_scores_gemma":[0.00018279937,0.019856617,0.0070793526,0.00003455522,0.00013211802,0.00024293039,0.00018032455,0.7774541,0.19318044,0.00075870694,0.00084598234,0.00005222476],"about_ca_topic_score_codex":0.0010602635,"about_ca_topic_score_gemma":0.0009075151,"teacher_disagreement_score":0.0020720658,"about_ca_system_score_codex":0.00059569086,"about_ca_system_score_gemma":0.0003345432,"threshold_uncertainty_score":0.010958254},"labels":[],"label_agreement":null},{"id":"W2095054567","doi":"10.1109/tip.2014.2383324","title":"An Efficient DCT-Based Image Compression System Based on Laplacian Transparent Composite Model","year":2014,"lang":"en","type":"article","venue":"IEEE Transactions on Image Processing","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":29,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; Canada Research Chairs","keywords":"Computer science; JPEG; Quantization (signal processing); Computational complexity theory; Discrete cosine transform; Image compression; Transform coding; Image quality; Artificial intelligence; Coding (social sciences); Entropy encoding; Algorithm; Data compression; Entropy (arrow of time); Computer vision; Mathematics; Image processing; Image (mathematics); Statistics","score_opus":0.017409129890966383,"score_gpt":0.28492334267145913,"score_spread":0.26751421278049275,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2095054567","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.039208177,0.00022715484,0.95591235,0.00014554724,0.000058737845,0.000059793852,0.000113440976,0.0010141826,0.003260539],"genre_scores_gemma":[0.79703397,0.0004145086,0.19537623,0.00017044316,0.000072673596,0.0000769224,0.00038867505,0.000088282846,0.006378253],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998348,0.000019426387,0.000008169674,0.000036073667,0.00008813232,0.000013385703],"domain_scores_gemma":[0.9998454,0.000037682283,0.000016086973,0.000027713484,0.000059403945,0.000013723213],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002245446,0.00030130096,0.00035241674,0.00039615334,0.00022660069,0.00036037527,0.0004956909,0.00036036255,0.0014724545],"category_scores_gemma":[0.00052350044,0.00014992287,0.000381495,0.0004525522,0.00021318614,0.00060503423,0.00033611045,0.00047078918,0.00048372848],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005846,0.00015423642,0.0018977303,0.00018860998,0.00006342297,0.0005630425,0.00012504938,0.26035893,0.29930124,0.027612029,0.006983483,0.4021676],"study_design_scores_gemma":[0.00000941592,0.000057679124,0.00027949756,0.0000034188563,0.000007902918,0.0001346018,0.000004122516,0.98530155,0.011882987,0.0010062215,0.001301305,0.000011243146],"about_ca_topic_score_codex":0.0025134257,"about_ca_topic_score_gemma":0.0025145223,"teacher_disagreement_score":0.0025134257,"about_ca_system_score_codex":0.0003161197,"about_ca_system_score_gemma":0.00049550924,"threshold_uncertainty_score":0.0049975514},"labels":[],"label_agreement":null},{"id":"W2095529104","doi":"10.1109/tcomm.2010.093010.100024","title":"Robust Multiresolution Coding","year":2010,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Codebook; Algorithm; Coding (social sciences); Robustness (evolution); Computer science; Multiresolution analysis; Distributed source coding; Shannon–Fano coding; Variable-length code; Theoretical computer science; Mathematics; Decoding methods; Wavelet; Wavelet transform; Artificial intelligence","score_opus":0.06678330363256661,"score_gpt":0.30961659334065866,"score_spread":0.24283328970809204,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2095529104","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0033586998,0.0006578019,0.99360055,0.00014114166,0.000044847904,0.000033589306,0.0000951573,0.00022419055,0.0018439408],"genre_scores_gemma":[0.29803562,0.0019626357,0.6943433,0.00034882838,0.0001834039,0.00015447133,0.00052705524,0.00014061677,0.004304008],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99863344,0.00030245195,0.00006806178,0.00018168564,0.0007069855,0.00010725466],"domain_scores_gemma":[0.99806315,0.00077172846,0.0002008742,0.0006154326,0.00029761408,0.00005133165],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014468962,0.0008273894,0.0011053918,0.0010190028,0.00043211997,0.0013843866,0.0014149986,0.0012034768,0.0024819544],"category_scores_gemma":[0.0052706804,0.0003891252,0.00072598155,0.0013879383,0.0010211184,0.002116078,0.002187169,0.0018393726,0.0011934317],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00029732127,0.0000650251,0.00039761612,0.00044611082,0.000088909626,0.0004344399,0.0002505858,0.15845247,0.08701012,0.47513354,0.0062716245,0.27115223],"study_design_scores_gemma":[0.00004121403,0.00009757923,0.00021600084,0.000075899676,0.000038759626,0.000534637,0.000040388168,0.8224123,0.043738954,0.118746534,0.013985188,0.0000725325],"about_ca_topic_score_codex":0.00069831224,"about_ca_topic_score_gemma":0.0005852763,"teacher_disagreement_score":0.0024819544,"about_ca_system_score_codex":0.000765444,"about_ca_system_score_gemma":0.00056277297,"threshold_uncertainty_score":0.008302987},"labels":[],"label_agreement":null},{"id":"W2095715309","doi":"10.1109/tip.2009.2013068","title":"Multiple Description Coding With Prediction Compensation","year":2009,"lang":"en","type":"article","venue":"IEEE Transactions on Image Processing","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":35,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Computer science; Lapped transform; Residual; Transform coding; Coding (social sciences); Algorithm; Redundancy (engineering); Variable-length code; Linear prediction; Context-adaptive binary arithmetic coding; Coding gain; Decoding methods; Artificial intelligence; Tunstall coding; Pattern recognition (psychology); Discrete cosine transform; Mathematics; Data compression; Image (mathematics)","score_opus":0.021891898906180936,"score_gpt":0.26162542135131367,"score_spread":0.23973352244513274,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2095715309","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0040009622,0.00044939885,0.99367476,0.00018128571,0.000074743424,0.000040546598,0.0001000273,0.0001824756,0.0012958557],"genre_scores_gemma":[0.24761534,0.0010640263,0.74132293,0.00040382645,0.0001879976,0.00024307641,0.00080073817,0.00006974212,0.008292301],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9996222,0.00007557923,0.000019779241,0.000043977856,0.00019985091,0.00003856754],"domain_scores_gemma":[0.9996953,0.00008290348,0.00003322551,0.00007757921,0.00009567254,0.000015251462],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00057130645,0.00046798337,0.0005352377,0.00050236494,0.0002239728,0.0005392699,0.0011754296,0.0007176207,0.0015743544],"category_scores_gemma":[0.0009253594,0.00019174826,0.00040657292,0.00083046197,0.0003342429,0.0012191166,0.0010645555,0.00092476746,0.0005315684],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000262993,0.00009238952,0.00034899794,0.00030365263,0.000056058132,0.00038167834,0.00009034429,0.12683202,0.07603541,0.17575483,0.009379698,0.6104619],"study_design_scores_gemma":[0.000058207614,0.000102929625,0.0001613391,0.000021434778,0.00002187289,0.00027528824,0.000011582841,0.9470087,0.018730223,0.023994721,0.0095763765,0.000037254722],"about_ca_topic_score_codex":0.0014562343,"about_ca_topic_score_gemma":0.00173876,"teacher_disagreement_score":0.0015743544,"about_ca_system_score_codex":0.00039250398,"about_ca_system_score_gemma":0.00073661946,"threshold_uncertainty_score":0.0052667856},"labels":[],"label_agreement":null},{"id":"W2096058054","doi":"10.1109/icme.2011.6012009","title":"A high video quality Multiple Description Coding scheme for lossy channels","year":2011,"lang":"en","type":"article","venue":"","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Multiple description coding; Lossy compression; Computer science; Coding (social sciences); Discrete cosine transform; Algorithm; Video quality; Data compression; Transform coding; Theoretical computer science; Decoding methods; Mathematics; Artificial intelligence; Statistics; Image (mathematics)","score_opus":0.14973134682205988,"score_gpt":0.32683031675439256,"score_spread":0.17709896993233268,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2096058054","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.028058175,0.0008677845,0.96761024,0.00029328477,0.0001150662,0.00018045538,0.00025933734,0.00072600006,0.0018897149],"genre_scores_gemma":[0.3564561,0.0006856,0.6311706,0.0002363126,0.00007312585,0.00026195293,0.0009397849,0.000067971174,0.010108565],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999678,0.000050609728,0.00001706129,0.000031041312,0.00018812547,0.00003512239],"domain_scores_gemma":[0.9994779,0.00011270142,0.00006629218,0.00011124478,0.00019219302,0.000039782415],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00064991834,0.00037355392,0.00034538424,0.00063929043,0.00029383358,0.0003692975,0.0008600603,0.00053673354,0.0020103678],"category_scores_gemma":[0.0010997939,0.00012736362,0.00024470038,0.00055751065,0.00028308496,0.0007215721,0.00066801725,0.0008406326,0.00051501207],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006931301,0.00016183655,0.0011009419,0.0003829312,0.00007043115,0.00044365655,0.00016596646,0.032604933,0.2551766,0.038997356,0.008213625,0.6619886],"study_design_scores_gemma":[0.00024279537,0.00048644614,0.0018172503,0.000080249956,0.000070163405,0.0012712703,0.000047290112,0.7283772,0.22382654,0.0083569,0.03530676,0.000117102885],"about_ca_topic_score_codex":0.0018436672,"about_ca_topic_score_gemma":0.0024723704,"teacher_disagreement_score":0.0020103678,"about_ca_system_score_codex":0.00052983995,"about_ca_system_score_gemma":0.00070097396,"threshold_uncertainty_score":0.006725371},"labels":[],"label_agreement":null},{"id":"W2096062303","doi":"10.1109/ccece.2011.6030677","title":"Analysis and parallelization of JPEG-2000 reference software","year":2011,"lang":"en","type":"article","venue":"","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Computer science; Parallel computing; Speedup; Granularity; Automatic parallelization; Cache; Profiling (computer programming); Multi-core processor; Software; JPEG; Workload; CPU cache; Computer architecture; Operating system; Data compression; Algorithm","score_opus":0.03910941369271092,"score_gpt":0.2677252040296713,"score_spread":0.2286157903369604,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2096062303","genre_codex":"empirical","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.81899005,0.00082733587,0.157883,0.00018265257,0.0000592847,0.00023164638,0.0005528074,0.0069480166,0.014325181],"genre_scores_gemma":[0.9023382,0.0003264655,0.09159685,0.00004907948,0.000017221226,0.000114837014,0.0017197478,0.0007706507,0.0030669693],"study_design_codex":"bench_or_experimental","study_design_gemma":"not_applicable","domain_scores_codex":[0.9989579,0.00009577334,0.000045620698,0.0001570661,0.00062722457,0.00011642477],"domain_scores_gemma":[0.9988908,0.00027575414,0.00006743315,0.00015718817,0.00057655177,0.000032288448],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005150361,0.00059755944,0.00037906677,0.00089823623,0.000434116,0.00051046733,0.00072613906,0.00022755416,0.0023225306],"category_scores_gemma":[0.002940396,0.0002340778,0.0003431068,0.0013324262,0.0003533707,0.0007491637,0.00024927696,0.0004931812,0.00043309052],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0014555324,0.0004620895,0.010803386,0.00053127523,0.00012368898,0.0004915006,0.00040766347,0.18124862,0.48056796,0.010874435,0.005850449,0.30718336],"study_design_scores_gemma":[0.000078674624,0.00044339453,0.012252468,0.00001652797,0.000048505633,0.00020126761,0.000085603526,0.5711602,0.40710357,0.0019770076,0.0065971594,0.000035656187],"about_ca_topic_score_codex":0.004774309,"about_ca_topic_score_gemma":0.004300615,"teacher_disagreement_score":0.004774309,"about_ca_system_score_codex":0.0009275776,"about_ca_system_score_gemma":0.0010353043,"threshold_uncertainty_score":0.009493053},"labels":[],"label_agreement":null},{"id":"W2096154964","doi":"10.1109/glocom.1993.318409","title":"Codebook optimization by Cauchy annealing","year":2002,"lang":"en","type":"article","venue":"","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Codebook; Simulated annealing; Linde–Buzo–Gray algorithm; Cauchy distribution; Encoder; Vector quantization; Annealing (glass); Algorithm; Computer science; Mathematical optimization; Norm (philosophy); Mathematics; Mathematical analysis; Materials science","score_opus":0.015292094757303537,"score_gpt":0.22722032606471282,"score_spread":0.2119282313074093,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2096154964","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008332534,0.00024584794,0.9871793,0.00016432529,0.0000360814,0.00005634844,0.000030457215,0.00020100364,0.0037541739],"genre_scores_gemma":[0.33283404,0.00046932642,0.65707076,0.0002349719,0.000045384266,0.00038320577,0.00028119775,0.00025561906,0.008425557],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992811,0.0002736047,0.000036975052,0.00014157302,0.00022118444,0.000045550496],"domain_scores_gemma":[0.99899405,0.0005409561,0.0000655942,0.00014866551,0.00021488483,0.00003592631],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011147015,0.00046915803,0.0007638195,0.0004863166,0.00044654688,0.00084123877,0.000825672,0.0010669535,0.0023447145],"category_scores_gemma":[0.0047169095,0.0004911389,0.0005171014,0.00061798526,0.0010848127,0.0011595914,0.0011005219,0.0009620508,0.00083071133],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010125921,0.00003558807,0.0003518243,0.00011511856,0.00004204283,0.00006804969,0.00015570401,0.783706,0.010251134,0.103251345,0.0028640183,0.09905785],"study_design_scores_gemma":[0.000010194806,0.000023321036,0.00005228187,0.000006383009,0.0000032997214,0.000019921608,0.000009155811,0.9755961,0.0023742965,0.019843692,0.002054425,0.00000700499],"about_ca_topic_score_codex":0.0022786388,"about_ca_topic_score_gemma":0.002007075,"teacher_disagreement_score":0.0023447145,"about_ca_system_score_codex":0.0010727237,"about_ca_system_score_gemma":0.0010950388,"threshold_uncertainty_score":0.007843912},"labels":[],"label_agreement":null},{"id":"W2097152760","doi":"10.1109/acssc.2004.1399222","title":"Multiple-channel optimized quantizers for Rayleigh fading channels","year":2005,"lang":"en","type":"article","venue":"","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Rayleigh fading; Fading; Phase-shift keying; Computer science; Transmitter; Channel (broadcasting); Decoding methods; Algorithm; Electronic engineering; Keying; Telecommunications; Bit error rate; Engineering","score_opus":0.03970971154089097,"score_gpt":0.3047868104103519,"score_spread":0.2650770988694609,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2097152760","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03466087,0.0009772263,0.9617073,0.00020735484,0.000036877445,0.00004646473,0.00007655313,0.00007617618,0.0022112303],"genre_scores_gemma":[0.8796094,0.0008847595,0.11715703,0.0000873147,0.00004476003,0.00007040793,0.000059005306,0.000016938402,0.0020703955],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99947613,0.00015995282,0.000028374332,0.00009979215,0.00017774935,0.000058032652],"domain_scores_gemma":[0.9990583,0.0005913697,0.00014989231,0.00006311065,0.00012171756,0.000015608548],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00080332806,0.0005939671,0.0005605892,0.00021956679,0.00023658448,0.00068239885,0.00064595515,0.0005562593,0.00095274614],"category_scores_gemma":[0.0019798959,0.00021149662,0.00027118798,0.0003832947,0.0006516352,0.0009505819,0.0005208274,0.0005807315,0.0001363454],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007381377,0.000019280773,0.00052057375,0.000097465396,0.000029422106,0.00014608716,0.00006096804,0.8955136,0.004684219,0.07530616,0.00044170284,0.023106672],"study_design_scores_gemma":[0.00001363059,0.000036278423,0.00008357963,0.000006574034,0.000009524611,0.000045311157,0.000009690133,0.98513955,0.0019742982,0.012114614,0.0005575486,0.000009501676],"about_ca_topic_score_codex":0.0017593522,"about_ca_topic_score_gemma":0.0017690667,"teacher_disagreement_score":0.0017593522,"about_ca_system_score_codex":0.0006710357,"about_ca_system_score_gemma":0.00054651004,"threshold_uncertainty_score":0.004868686},"labels":[],"label_agreement":null},{"id":"W2097287152","doi":"10.1109/icce.2009.5012391","title":"A wavelet-based intra-prediction lossless image compression scheme","year":2009,"lang":"en","type":"article","venue":"","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Lossless compression; Lossless JPEG; Computer science; Wavelet; Image compression; Data compression; JPEG; Artificial intelligence; Wavelet transform; Lossy compression; JPEG 2000; Computer vision; Lifting scheme; Pattern recognition (psychology); Algorithm; Discrete wavelet transform; Image (mathematics); Image processing","score_opus":0.01097931745923286,"score_gpt":0.2698077208867913,"score_spread":0.2588284034275584,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2097287152","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03764486,0.0005322625,0.9573242,0.00022929162,0.00013358553,0.000119735254,0.00014035738,0.0009917124,0.0028839938],"genre_scores_gemma":[0.26297894,0.0008047102,0.7241613,0.00029016018,0.00014342535,0.00015296522,0.00057279307,0.00013034392,0.010765328],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997397,0.000021544314,0.000012297937,0.000029298504,0.00017480469,0.000022357422],"domain_scores_gemma":[0.99976593,0.000024328436,0.00003113073,0.00007124115,0.00008452499,0.000022939414],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002924167,0.00045861112,0.00049891643,0.0005674796,0.00025051783,0.0003567053,0.0010412267,0.00052230747,0.0015658649],"category_scores_gemma":[0.0004903855,0.00023628018,0.00031663728,0.00047675695,0.0003223873,0.0007796379,0.0005061146,0.00087968964,0.0011372588],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000295148,0.00031273568,0.00055981695,0.0001908991,0.000058317073,0.00026349982,0.00007822628,0.024883885,0.5892972,0.012336731,0.0053540203,0.36636955],"study_design_scores_gemma":[0.0001138826,0.0005989056,0.0016114922,0.000030760282,0.000090231886,0.0013032557,0.000019178746,0.63158524,0.34124592,0.0025770182,0.020735214,0.00008885753],"about_ca_topic_score_codex":0.00043585777,"about_ca_topic_score_gemma":0.0005244706,"teacher_disagreement_score":0.0015658649,"about_ca_system_score_codex":0.00020125328,"about_ca_system_score_gemma":0.00033755857,"threshold_uncertainty_score":0.005238354},"labels":[],"label_agreement":null},{"id":"W2097341986","doi":"10.1109/dcc.1991.213374","title":"Image coding by adaptive tree-structured segmentation","year":2002,"lang":"en","type":"article","venue":"","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Image segmentation; Artificial intelligence; Minimum spanning tree-based segmentation; Piecewise; Encoder; Scale-space segmentation; Segmentation-based object categorization; Computer science; Image texture; Mathematics; Segmentation; Preprocessor; Image compression; Computer vision; Pattern recognition (psychology); Algorithm; Image (mathematics); Image processing","score_opus":0.020794126106037404,"score_gpt":0.26503476309803525,"score_spread":0.24424063699199786,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2097341986","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00992773,0.0002966023,0.98591715,0.000102172744,0.000044483702,0.000023213326,0.000071463845,0.000626926,0.0029902696],"genre_scores_gemma":[0.18852451,0.00053895,0.80482924,0.00016839088,0.000054214845,0.00010435863,0.0003487698,0.00013586719,0.005295696],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99983346,0.000028196104,0.0000076229994,0.000023984832,0.000086410844,0.000020342835],"domain_scores_gemma":[0.99979454,0.000059637965,0.000021862385,0.000048268714,0.000065274,0.000010443431],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014669317,0.00029510818,0.00024008621,0.0005562198,0.00019419816,0.00044561224,0.0006443036,0.00039652342,0.0017855164],"category_scores_gemma":[0.0005752652,0.00014317328,0.00021135913,0.00094914343,0.00040824775,0.0008447591,0.00049386546,0.00045967227,0.0006920218],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023885063,0.00005170051,0.00036506855,0.0001560781,0.00002901397,0.00021172236,0.00018875819,0.11764155,0.1832433,0.117390454,0.010886505,0.569597],"study_design_scores_gemma":[0.000025097204,0.00006383025,0.00026450874,0.000022292386,0.000010702943,0.00027137934,0.000016987029,0.9110996,0.05609869,0.019262737,0.0128422715,0.00002185867],"about_ca_topic_score_codex":0.0012769147,"about_ca_topic_score_gemma":0.0018165038,"teacher_disagreement_score":0.0017855164,"about_ca_system_score_codex":0.0004022668,"about_ca_system_score_gemma":0.00036002792,"threshold_uncertainty_score":0.0059731603},"labels":[],"label_agreement":null},{"id":"W2097448786","doi":"10.1109/icme.2003.1221272","title":"Multiple arbitrary shape ROI coding with zerotree based wavelet coders","year":2003,"lang":"en","type":"article","venue":"","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Computer science; Artificial intelligence; Coding (social sciences); Computer vision; Region of interest; Context-adaptive binary arithmetic coding; Coding tree unit; Pixel; Context-adaptive variable-length coding; Tunstall coding; Data compression; Sub-band coding; Transform coding; JPEG; Wavelet; Image compression; Algorithm; Decoding methods; Mathematics; Image processing; Speech recognition; Image (mathematics); Speech coding; Discrete cosine transform","score_opus":0.01860493553005252,"score_gpt":0.2374440941971144,"score_spread":0.21883915866706188,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2097448786","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09469227,0.000731802,0.90226173,0.00010669063,0.00002429247,0.000061307604,0.000045961784,0.00044791,0.0016280741],"genre_scores_gemma":[0.4830009,0.0006779105,0.514284,0.000062181374,0.000029501538,0.000064209205,0.00010909529,0.00010099214,0.0016712804],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999711,0.00008389652,0.000019094994,0.00002681366,0.00012867832,0.00003055253],"domain_scores_gemma":[0.9992924,0.00026461607,0.00014077181,0.00011932914,0.00015916342,0.000023757733],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005831701,0.00038191164,0.00035272771,0.00052503607,0.00012790546,0.0003779309,0.0007924497,0.00040612105,0.0007612819],"category_scores_gemma":[0.0016197707,0.0001821888,0.00034074966,0.0004660288,0.00040116275,0.00087366236,0.00050529494,0.0005157192,0.0002798164],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00049872353,0.00011741104,0.0012006183,0.00023631613,0.000049262304,0.00058782997,0.00018769692,0.116791435,0.55930275,0.070886545,0.0012885159,0.24885294],"study_design_scores_gemma":[0.000034997924,0.00029299324,0.00070143066,0.000035574805,0.000031441847,0.0007091164,0.000035500347,0.76634634,0.22336572,0.0046640146,0.0037425803,0.000040294817],"about_ca_topic_score_codex":0.0006241888,"about_ca_topic_score_gemma":0.0007879835,"teacher_disagreement_score":0.0007924497,"about_ca_system_score_codex":0.00029259265,"about_ca_system_score_gemma":0.0002820271,"threshold_uncertainty_score":0.0030841231},"labels":[],"label_agreement":null},{"id":"W2098168267","doi":"10.1109/dcc.2009.38","title":"Invertible Integer Lie Group Transforms","year":2009,"lang":"en","type":"article","venue":"","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"","keywords":"Invertible matrix; Lossless compression; Mathematics; Discrete cosine transform; Integer (computer science); Modified discrete cosine transform; Discrete mathematics; Data compression; Algebra over a field; Transform coding; Image (mathematics); Arithmetic; Algorithm; Pure mathematics; Computer science; Artificial intelligence","score_opus":0.010038447315559054,"score_gpt":0.2533929915995514,"score_spread":0.24335454428399236,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2098168267","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12480492,0.001302482,0.80127674,0.0007796825,0.0005585227,0.00009972694,0.00018549715,0.00048464292,0.07050776],"genre_scores_gemma":[0.8245363,0.0015319452,0.15239315,0.00042639868,0.000453006,0.00009149066,0.0002288817,0.00016859433,0.020170208],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999729,0.000039071125,0.000011184056,0.00003769173,0.00013850784,0.0000445636],"domain_scores_gemma":[0.999798,0.00004443431,0.000040320432,0.000051840736,0.000039344814,0.000026116528],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002910519,0.00036235977,0.00024166144,0.00050611293,0.0002738992,0.0008704052,0.0003084966,0.00047541317,0.0035119387],"category_scores_gemma":[0.0010450388,0.000116668976,0.00027168638,0.00038534697,0.000986074,0.001361,0.0009565112,0.00097484596,0.0009046523],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000058393238,0.000028253824,0.00016766063,0.000051891657,0.0000056525,0.00018670301,0.0001406643,0.008611073,0.025896898,0.9102409,0.0014732125,0.053138815],"study_design_scores_gemma":[0.000039836446,0.00018222591,0.0003661657,0.000042452735,0.000011335568,0.00067827734,0.00012591411,0.12949315,0.038278136,0.78771996,0.04301554,0.000046963207],"about_ca_topic_score_codex":0.00017200809,"about_ca_topic_score_gemma":0.0001720263,"teacher_disagreement_score":0.0035119387,"about_ca_system_score_codex":0.00021961682,"about_ca_system_score_gemma":0.00027202698,"threshold_uncertainty_score":0.011748612},"labels":[],"label_agreement":null},{"id":"W2098171489","doi":"10.1109/icassp.2004.1325973","title":"A study of design compromises for speech coders in packet networks","year":2004,"lang":"en","type":"article","venue":"","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":26,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"VoiceAge (Canada); Université de Sherbrooke","funders":"","keywords":"Computer science; Encoder; Robustness (evolution); Lossy compression; Network packet; Speech recognition; Redundancy (engineering); Speech coding; Bit rate; Real-time computing; Computer network; Artificial intelligence","score_opus":0.060754699463996906,"score_gpt":0.324203145126658,"score_spread":0.26344844566266107,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2098171489","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4380881,0.0039130594,0.5479633,0.00047473938,0.0001334913,0.0006663909,0.00015139188,0.00064134214,0.0079680905],"genre_scores_gemma":[0.8879113,0.0007260932,0.10910321,0.00009946751,0.00006495446,0.00020639395,0.000074069976,0.00018398192,0.0016305143],"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.985495,0.0077813175,0.00065119436,0.0011830286,0.0044515147,0.000437949],"domain_scores_gemma":[0.915596,0.06821174,0.006277663,0.0028838762,0.006640374,0.0003903801],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009870843,0.0018036729,0.0006797551,0.0016716182,0.00065278885,0.00185286,0.0010041944,0.0018805821,0.0017207986],"category_scores_gemma":[0.065106384,0.00046352213,0.00052181334,0.00075089623,0.00093198713,0.002042751,0.00083696714,0.0008798846,0.00046972654],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.005020621,0.00056641444,0.0076199495,0.0016585891,0.00054293807,0.00084511726,0.0010756071,0.3489319,0.29129553,0.012944707,0.0012299262,0.32826865],"study_design_scores_gemma":[0.000363528,0.013815005,0.012146176,0.00035417176,0.00087309856,0.002721021,0.00078048115,0.6454064,0.3068886,0.009376978,0.006963857,0.00031058455],"about_ca_topic_score_codex":0.00045969422,"about_ca_topic_score_gemma":0.00056939234,"teacher_disagreement_score":0.009870843,"about_ca_system_score_codex":0.0016279155,"about_ca_system_score_gemma":0.00029849782,"threshold_uncertainty_score":0.052202642},"labels":[],"label_agreement":null},{"id":"W2098283347","doi":"10.1109/tsa.2005.858560","title":"Single and double frame coding of speech LPC parameters using a lattice-based quantization scheme","year":2006,"lang":"en","type":"article","venue":"IEEE Transactions on Audio Speech and Language Processing","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Inter frame; Vector quantization; Quantization (signal processing); Mathematics; Speech coding; Algorithm; Computer science; Speech recognition; Frame (networking); Reference frame; Telecommunications","score_opus":0.026629056431784072,"score_gpt":0.28384935187241944,"score_spread":0.25722029544063535,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2098283347","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017451866,0.000283259,0.9776903,0.00016617354,0.00016524037,0.000107151354,0.0001388261,0.00095136353,0.0030458733],"genre_scores_gemma":[0.26449463,0.0003021555,0.7295177,0.00011235762,0.00010829788,0.00020862365,0.00031131366,0.00007642916,0.0048685228],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99943715,0.00012774022,0.00005221916,0.00006951146,0.00025706185,0.000056229324],"domain_scores_gemma":[0.99922395,0.00017249404,0.00006070316,0.00017588964,0.00031587723,0.000050987386],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00059569057,0.0004270941,0.0005140207,0.0005862257,0.00042954413,0.00089334993,0.0009058499,0.0006094864,0.003264894],"category_scores_gemma":[0.0017311202,0.00016826965,0.00031848982,0.0006717469,0.00054495037,0.00084306113,0.00067434635,0.001146279,0.0012774579],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008629967,0.00018523759,0.00051227305,0.00021611717,0.0000357797,0.00023562256,0.00022925372,0.08269987,0.2141273,0.08029295,0.0048294864,0.6157731],"study_design_scores_gemma":[0.00015594947,0.00047375236,0.0003542091,0.00006067379,0.000027689746,0.00041237933,0.000070162074,0.84844166,0.123790406,0.011622724,0.014483175,0.00010721439],"about_ca_topic_score_codex":0.002457336,"about_ca_topic_score_gemma":0.0032542679,"teacher_disagreement_score":0.003264894,"about_ca_system_score_codex":0.00053221965,"about_ca_system_score_gemma":0.0011901258,"threshold_uncertainty_score":0.0109221935},"labels":[],"label_agreement":null},{"id":"W2098371894","doi":"10.1109/icc.1997.605183","title":"Combined source-channel coding for the transmission of still images over a code division multiple access (CDMA) channel","year":2002,"lang":"en","type":"article","venue":"","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Code division multiple access; Channel (broadcasting); Bit error rate; Algorithm; Coding (social sciences); Telecommunications link; Channel allocation schemes; Discrete cosine transform; Decoding methods; Electronic engineering; Wireless; Computer network; Telecommunications; Mathematics; Image (mathematics); Engineering; Artificial intelligence","score_opus":0.05591425816859401,"score_gpt":0.30971917444017066,"score_spread":0.25380491627157664,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2098371894","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.028908942,0.0005134559,0.9681608,0.00012729387,0.00003977205,0.000040434177,0.000029511522,0.00013485145,0.0020448372],"genre_scores_gemma":[0.70540005,0.00094543886,0.28864235,0.00007723666,0.000087154454,0.00013285247,0.000101041944,0.000046585104,0.004567318],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99959034,0.00010309586,0.000010423927,0.000025139652,0.00023596201,0.000035093097],"domain_scores_gemma":[0.99957734,0.00023307053,0.00003531304,0.00004245161,0.000099986406,0.00001186092],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045459947,0.0004784874,0.00035466618,0.00038586967,0.00022050626,0.00040593062,0.00044543575,0.00041139073,0.0009609478],"category_scores_gemma":[0.0008831376,0.00017127357,0.00027837366,0.00047154346,0.0004337338,0.0006548514,0.00042417337,0.000548822,0.00019359047],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00046301016,0.00012916516,0.0005828199,0.00032678648,0.000095915646,0.0003580128,0.00016055988,0.6247486,0.09853126,0.086945735,0.0024002665,0.18525796],"study_design_scores_gemma":[0.000014931442,0.00006797688,0.00008902373,0.000009991176,0.000019881749,0.00005755483,0.000010557445,0.97879344,0.016608713,0.0032264346,0.0010927807,0.0000087160715],"about_ca_topic_score_codex":0.0015907313,"about_ca_topic_score_gemma":0.0031562918,"teacher_disagreement_score":0.0015907313,"about_ca_system_score_codex":0.0004145,"about_ca_system_score_gemma":0.00062945794,"threshold_uncertainty_score":0.0032146573},"labels":[],"label_agreement":null},{"id":"W2098560698","doi":"10.1109/tencon.1996.608459","title":"Multi-resolution motion estimation at low bit-rates","year":2002,"lang":"en","type":"article","venue":"","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Motion estimation; Computer science; Quantization (signal processing); Quarter-pixel motion; Motion compensation; Bit rate; Pixel; Coding tree unit; Coding (social sciences); Algorithm; Computer vision; Image resolution; Artificial intelligence; Residual; Mathematics; Real-time computing; Decoding methods; Statistics","score_opus":0.034543235175928985,"score_gpt":0.28896359209744904,"score_spread":0.25442035692152004,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2098560698","genre_codex":"empirical","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.54664034,0.002970204,0.44471323,0.00022991709,0.00004465123,0.00006389568,0.00011011687,0.0013250626,0.0039026046],"genre_scores_gemma":[0.8567207,0.00065682875,0.14033249,0.000050746617,0.00001798579,0.00003849643,0.00013619928,0.000059034646,0.001987509],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992663,0.0001988169,0.000034219775,0.00006246071,0.0003748004,0.00006348058],"domain_scores_gemma":[0.99762964,0.0014030784,0.0001911701,0.00027440162,0.00045839776,0.000043337008],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008847847,0.00033540113,0.00042849814,0.00044977912,0.00019877484,0.00048020543,0.0004580921,0.00053440675,0.0013588857],"category_scores_gemma":[0.005552326,0.00014870755,0.00015355932,0.0005032538,0.00028756054,0.00088240707,0.00049246696,0.00041565817,0.000554955],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0021534502,0.0001904784,0.0067751883,0.00048248193,0.000087881956,0.0003765194,0.0002775581,0.14863172,0.39190644,0.008611572,0.0013505518,0.4391562],"study_design_scores_gemma":[0.000056337572,0.0004792984,0.0039843326,0.00007370122,0.000051055482,0.0005540744,0.000055044642,0.72505,0.26529747,0.0019769052,0.0023673885,0.000054354918],"about_ca_topic_score_codex":0.0010526136,"about_ca_topic_score_gemma":0.00086646306,"teacher_disagreement_score":0.0013588857,"about_ca_system_score_codex":0.0003191473,"about_ca_system_score_gemma":0.000149918,"threshold_uncertainty_score":0.0046792626},"labels":[],"label_agreement":null},{"id":"W2098625285","doi":"10.1117/12.798499","title":"Enhancement of resilience to bit-errors of compressed data on-board a hyperspectral satellite using forward error correction","year":2008,"lang":"en","type":"article","venue":"Proceedings of SPIE, the International Society for Optical Engineering/Proceedings of SPIE","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"Canadian Space Agency","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Hyperspectral imaging; Lossless compression; Computer science; Algorithm; Data compression; Quantization (signal processing); Data compression ratio; Error detection and correction; Image compression; Artificial intelligence; Image processing","score_opus":0.03176216211197492,"score_gpt":0.2845138254184578,"score_spread":0.2527516633064829,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2098625285","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7012108,0.00093308766,0.29006487,0.0006625792,0.0001488645,0.000054346052,0.00018508438,0.0016127462,0.005127538],"genre_scores_gemma":[0.9268535,0.00031479954,0.07031507,0.000082323386,0.000024413452,0.00001334775,0.00016455672,0.00004195766,0.0021900611],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9997303,0.000028490998,0.000011022624,0.00003326846,0.00016430015,0.0000325796],"domain_scores_gemma":[0.9986669,0.00061212864,0.00013356679,0.00016899311,0.0003878826,0.00003058341],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039597662,0.00031975977,0.0002266052,0.00036697224,0.00026249472,0.00029749126,0.0005146573,0.0004314978,0.0009455443],"category_scores_gemma":[0.0025783032,0.00008229201,0.00011249737,0.0004720242,0.0005009689,0.00072990876,0.00044464032,0.0004303109,0.00019751283],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006208006,0.000088206514,0.004189158,0.00021477972,0.000055542354,0.00044105152,0.00047719656,0.0775204,0.618402,0.0059814234,0.0018545113,0.290155],"study_design_scores_gemma":[0.000021310274,0.00021225544,0.0027953773,0.000021776412,0.000024454635,0.0003955362,0.000099262266,0.3439308,0.64661217,0.0011757099,0.004681776,0.000029701336],"about_ca_topic_score_codex":0.0036728913,"about_ca_topic_score_gemma":0.006221012,"teacher_disagreement_score":0.0036728913,"about_ca_system_score_codex":0.00044589562,"about_ca_system_score_gemma":0.0003884923,"threshold_uncertainty_score":0.007303059},"labels":[],"label_agreement":null},{"id":"W2098918275","doi":"10.1109/scft.1997.623920","title":"Perceptual coding of narrowband audio signals at 8 kbit/s","year":2002,"lang":"en","type":"article","venue":"","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Sub-band coding; Computer science; Speech recognition; Speech coding; Narrowband; Coding (social sciences); Masking (illustration); Sound quality; Auditory masking; Energy (signal processing); Artificial intelligence; Mathematics; Telecommunications; Statistics","score_opus":0.037861789633060965,"score_gpt":0.2608925285788415,"score_spread":0.22303073894578052,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2098918275","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1665572,0.00066737493,0.82693434,0.00016258092,0.000091318085,0.000078035904,0.00011372265,0.00092171726,0.0044736625],"genre_scores_gemma":[0.76017785,0.00047062358,0.23406461,0.00010010231,0.0000671394,0.000072915005,0.00020455115,0.00009133135,0.004750975],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9998585,0.000026281892,0.000007272379,0.000019039111,0.00007147451,0.000017342718],"domain_scores_gemma":[0.9996512,0.00013966025,0.000031336334,0.000046741392,0.00010804805,0.000023000108],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022003833,0.00022843893,0.00020584915,0.00028917493,0.00016077331,0.00031475318,0.00042956046,0.0002287833,0.0014497236],"category_scores_gemma":[0.0012510928,0.00007503045,0.000104141414,0.00017011861,0.0003192313,0.0004195689,0.00034640185,0.00030945244,0.00044847312],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00074432814,0.000051068375,0.00036614636,0.00015242246,0.000009956507,0.00019461248,0.00017896136,0.024349645,0.5671298,0.010897843,0.0010702538,0.39485502],"study_design_scores_gemma":[0.00013008273,0.00091150985,0.0027396355,0.00008021635,0.000045078647,0.0006597338,0.000119937526,0.5511944,0.41173786,0.014567943,0.017754305,0.00005933059],"about_ca_topic_score_codex":0.00091273326,"about_ca_topic_score_gemma":0.0014055014,"teacher_disagreement_score":0.0014497236,"about_ca_system_score_codex":0.00018051479,"about_ca_system_score_gemma":0.00020256257,"threshold_uncertainty_score":0.004849851},"labels":[],"label_agreement":null},{"id":"W2099555798","doi":"10.1109/pacrim.1999.799530","title":"Error concealment techniques for H.263 video transmission","year":2003,"lang":"en","type":"article","venue":"","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Computer science; Error concealment; Residual; Motion estimation; Transmission (telecommunications); Computer vision; Interpolation (computer graphics); Channel (broadcasting); Overhead (engineering); Codec; Motion compensation; Video quality; Artificial intelligence; Block (permutation group theory); Video processing; Visual communication; Video compression picture types; Data compression; Decoding methods; Image (mathematics); Computer network; Video tracking; Computer hardware; Multimedia; Algorithm; Telecommunications","score_opus":0.026833256089426372,"score_gpt":0.3193977933686356,"score_spread":0.2925645372792092,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2099555798","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.026723832,0.0036636007,0.9652774,0.00026475787,0.00012479423,0.00010860254,0.00012224283,0.00055179914,0.0031630425],"genre_scores_gemma":[0.42958626,0.008485574,0.5457686,0.00016578691,0.00025036276,0.00015898324,0.0008009752,0.00012620802,0.014657221],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995777,0.000057414592,0.000025473271,0.000021523738,0.00029142748,0.00002636774],"domain_scores_gemma":[0.99957997,0.00010604225,0.00008656584,0.000054150027,0.00016499124,0.000008304176],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005034874,0.0003520026,0.00028321805,0.00048133533,0.00026783167,0.000432163,0.000517747,0.00044924222,0.0014409511],"category_scores_gemma":[0.0012778632,0.0001426689,0.00020383295,0.0005721497,0.00019895763,0.0004364192,0.00024867474,0.00051574525,0.000612245],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00090353825,0.000098649194,0.0007339072,0.00069247984,0.00006754993,0.00060424773,0.00030366163,0.052947305,0.28258494,0.021032006,0.0062787887,0.6337529],"study_design_scores_gemma":[0.00011344183,0.0007203423,0.0023782556,0.00017371858,0.00011276832,0.0018478516,0.000120221346,0.4378081,0.49793106,0.0074854726,0.051207613,0.00010113423],"about_ca_topic_score_codex":0.0016021949,"about_ca_topic_score_gemma":0.0013878305,"teacher_disagreement_score":0.0016021949,"about_ca_system_score_codex":0.00026083644,"about_ca_system_score_gemma":0.0003901846,"threshold_uncertainty_score":0.0048204064},"labels":[],"label_agreement":null},{"id":"W2099628409","doi":"10.1109/icassp.1994.389704","title":"Multi-band residual coding of CELP codecs at 8 kb/s","year":2002,"lang":"en","type":"article","venue":"","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Institut National de la Recherche Scientifique","funders":"","keywords":"Code-excited linear prediction; Vector sum excited linear prediction; Residual; Codec; Speech coding; Computer science; Speech recognition; Coding (social sciences); Codec2; Linear predictive coding; Harmonic Vector Excitation Coding; Algorithm; Mathematics; Telecommunications; Statistics","score_opus":0.05904860822654609,"score_gpt":0.28459546955291815,"score_spread":0.22554686132637206,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2099628409","genre_codex":"empirical","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5363257,0.0006660242,0.44609174,0.00037154654,0.000075819335,0.00014775922,0.00035675237,0.0031756337,0.012789035],"genre_scores_gemma":[0.7967295,0.00020602066,0.19592838,0.0000990557,0.000028425007,0.00008721908,0.000494376,0.00028385714,0.006143275],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99963284,0.000049383525,0.000020855692,0.00004455286,0.00017619855,0.00007610688],"domain_scores_gemma":[0.9989717,0.00039489032,0.000085922875,0.00018632584,0.0003238072,0.000037360143],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042147827,0.000518114,0.00027528987,0.0007416727,0.00030616135,0.00054145214,0.0007374887,0.0005786984,0.0035506545],"category_scores_gemma":[0.0014441877,0.00013518587,0.00022697668,0.00039644117,0.00042814863,0.00072947034,0.00060429913,0.0004025359,0.00097296934],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0018333544,0.00028255375,0.0019159174,0.00030354672,0.000034384444,0.0008830757,0.00038713613,0.122290894,0.50537,0.014223286,0.0022821145,0.35019368],"study_design_scores_gemma":[0.00007485014,0.00042792817,0.0010491527,0.000049219503,0.000022913373,0.00048150663,0.00008936732,0.4586593,0.5321721,0.0023257656,0.004612809,0.000035174147],"about_ca_topic_score_codex":0.002205799,"about_ca_topic_score_gemma":0.00374502,"teacher_disagreement_score":0.0035506545,"about_ca_system_score_codex":0.00041694316,"about_ca_system_score_gemma":0.0003598301,"threshold_uncertainty_score":0.011878133},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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)","score_opus":0.021419837927505517,"score_gpt":0.3262134527351578,"score_spread":0.30479361480765227,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2099665608","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0496183,0.0005433961,0.9472674,0.00021206259,0.00006418485,0.00008056607,0.0001821703,0.0006426654,0.0013892564],"genre_scores_gemma":[0.4087312,0.0010960753,0.58436424,0.00030888664,0.00014706107,0.00015758042,0.00087866787,0.00017816194,0.004138121],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99968493,0.00003221651,0.00001747077,0.000021828075,0.00022593328,0.000017546443],"domain_scores_gemma":[0.9996468,0.00011357486,0.00004964217,0.00009908717,0.000071460265,0.000019397634],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037038818,0.000387659,0.00033398235,0.0005901887,0.00013257047,0.0004037353,0.00065013056,0.0003855814,0.0012572878],"category_scores_gemma":[0.001106759,0.0001818828,0.00039296973,0.0004881132,0.0003241375,0.0008044745,0.0006910725,0.0004814367,0.00057010265],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00049415266,0.000116724,0.000608365,0.00022907478,0.000058550006,0.0008089439,0.00013913777,0.088865474,0.52522707,0.0117900865,0.0049537024,0.36670884],"study_design_scores_gemma":[0.000052254123,0.00021122636,0.001091475,0.000020909934,0.00002753872,0.0019626755,0.000032114516,0.7754617,0.21214871,0.003600173,0.005352185,0.000039129925],"about_ca_topic_score_codex":0.00039544734,"about_ca_topic_score_gemma":0.00049645145,"teacher_disagreement_score":0.0012572878,"about_ca_system_score_codex":0.00019356425,"about_ca_system_score_gemma":0.00032044185,"threshold_uncertainty_score":0.0042060614},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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)","score_opus":0.013179220568266467,"score_gpt":0.27358094016143947,"score_spread":0.260401719593173,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2099675194","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.070469454,0.0022415454,0.92334276,0.0003062025,0.0001306413,0.00010039578,0.00013159137,0.00061699725,0.0026603518],"genre_scores_gemma":[0.32111776,0.0020838536,0.6702506,0.0002460851,0.0001951341,0.00010184586,0.00039394383,0.00006791258,0.005542914],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998406,0.00001846417,0.00000870757,0.000010895762,0.000111101166,0.000010202914],"domain_scores_gemma":[0.9998274,0.00006579652,0.000026592059,0.000032610616,0.000038781654,0.000008915587],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021985838,0.00037192312,0.00029148368,0.0008039136,0.00011726558,0.0002766847,0.0005010114,0.00040515317,0.00096559204],"category_scores_gemma":[0.00069664884,0.00012938521,0.00023643317,0.00040940937,0.00020874293,0.00062277546,0.0004033031,0.00042091936,0.00034799578],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00029421665,0.000055410197,0.000402089,0.00021965407,0.000035960846,0.00034828662,0.000079267804,0.032261338,0.5198412,0.009043039,0.0022651514,0.4351544],"study_design_scores_gemma":[0.000076789336,0.00049534027,0.0021791782,0.000063747226,0.00006193885,0.0031255172,0.000032581105,0.6418267,0.32804826,0.005149319,0.018875327,0.00006531206],"about_ca_topic_score_codex":0.00043697873,"about_ca_topic_score_gemma":0.00060289464,"teacher_disagreement_score":0.00096559204,"about_ca_system_score_codex":0.00015997705,"about_ca_system_score_gemma":0.00021632409,"threshold_uncertainty_score":0.0032302141},"labels":[],"label_agreement":null},{"id":"W2099841333","doi":"10.1109/icassp.1996.540326","title":"Harmonic-stochastic excitation (HSX) speech coding below 4 kbit/s","year":2002,"lang":"en","type":"article","venue":"","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Sherbrooke","funders":"","keywords":"Computer science; Speech recognition; Speech coding; Voice; Harmonic; Algorithm; Band-pass filter; Decoding methods; Harmonic analysis; Coding (social sciences); Inverse; Electronic engineering; Acoustics; Mathematics; Engineering; Physics; Statistics","score_opus":0.03972391767114267,"score_gpt":0.2779378066952313,"score_spread":0.23821388902408866,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2099841333","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.113884315,0.0002541924,0.87862986,0.00015268607,0.00005894443,0.000083185565,0.0001493679,0.002002522,0.0047848853],"genre_scores_gemma":[0.578188,0.0002582169,0.410232,0.000091890724,0.000050671733,0.00011439695,0.00041742192,0.00012570087,0.010521599],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99975544,0.000042795695,0.000014832072,0.000030069381,0.00012690821,0.00002995161],"domain_scores_gemma":[0.99961424,0.00013267575,0.000047108944,0.00007478086,0.0001196961,0.000011619575],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036641557,0.00035384417,0.00019932886,0.00030789213,0.00021331504,0.00035854755,0.0003671066,0.0003274625,0.0019650243],"category_scores_gemma":[0.0011467476,0.000087410095,0.00012203697,0.0001704996,0.00026106834,0.00037237207,0.00039395358,0.000298729,0.0009545061],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000807251,0.00006977822,0.0020765136,0.00013430083,0.000028502385,0.000323025,0.00026275727,0.06546288,0.34954175,0.04249979,0.0031275386,0.53566587],"study_design_scores_gemma":[0.000032499673,0.00036088252,0.0022330566,0.00004369853,0.000029213006,0.00076614984,0.00007147716,0.66950035,0.30199564,0.0086780675,0.016258119,0.000030802927],"about_ca_topic_score_codex":0.0012814893,"about_ca_topic_score_gemma":0.0020937945,"teacher_disagreement_score":0.0019650243,"about_ca_system_score_codex":0.00027092797,"about_ca_system_score_gemma":0.00040378803,"threshold_uncertainty_score":0.0065736175},"labels":[],"label_agreement":null},{"id":"W2099858366","doi":"10.1109/icassp.2005.1415371","title":"Wiener Filtering for Generalized Error Resilient Time Domain Lapped Transform","year":2006,"lang":"en","type":"article","venue":"","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Wiener filter; Wiener deconvolution; Computer science; Lapped transform; Algorithm; Image (mathematics); Coding (social sciences); Filter (signal processing); Domain (mathematical analysis); Transmission (telecommunications); Transform coding; Mathematics; Computer vision; Discrete cosine transform; Telecommunications; Statistics","score_opus":0.013443267884860825,"score_gpt":0.2715345956404298,"score_spread":0.258091327755569,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2099858366","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0026259155,0.00013872705,0.99650526,0.00003397766,0.000021018926,0.000012824643,0.000006730288,0.000051549272,0.0006039865],"genre_scores_gemma":[0.19608285,0.0013113478,0.7970809,0.0001899866,0.00012991285,0.00013780202,0.00008865972,0.00007292866,0.0049057286],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996482,0.00008567911,0.00002300243,0.00006659129,0.0001526376,0.000023850273],"domain_scores_gemma":[0.99970454,0.00012083556,0.000040350933,0.00005479861,0.00006811126,0.000011237677],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006569026,0.00058896904,0.00044602357,0.00029644114,0.00018054663,0.0006223254,0.0005363063,0.00084100716,0.0021457593],"category_scores_gemma":[0.0015168563,0.00020891197,0.0003774538,0.00035620184,0.0006113706,0.0009881976,0.00047190097,0.0007562599,0.0008355643],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00025644674,0.00005913318,0.00043608336,0.00056165166,0.000082728155,0.0003524176,0.0002228798,0.18059109,0.22210531,0.27752066,0.0018047233,0.31600687],"study_design_scores_gemma":[0.00003642292,0.00020352131,0.00021503166,0.00006070756,0.000037197304,0.0003598377,0.000022864006,0.9066371,0.05198781,0.027930645,0.012469505,0.000039417882],"about_ca_topic_score_codex":0.00022236738,"about_ca_topic_score_gemma":0.00024312596,"teacher_disagreement_score":0.0021457593,"about_ca_system_score_codex":0.0003117842,"about_ca_system_score_gemma":0.00028038415,"threshold_uncertainty_score":0.0071783066},"labels":[],"label_agreement":null},{"id":"W2100224524","doi":"10.1109/dcc.2004.1281519","title":"Efficient side-information context description for context-based adaptive entropy coders","year":2004,"lang":"en","type":"article","venue":"","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Computer science; Entropy (arrow of time); Context model; Data compression; Quantization (signal processing); Entropy encoding; Adaptive coding; Cluster analysis; Algorithm; Artificial intelligence; Lossless compression","score_opus":0.02478864828566574,"score_gpt":0.2605059585756771,"score_spread":0.23571731029001136,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2100224524","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011634284,0.00021064092,0.9868618,0.000082854385,0.00003452706,0.000052305964,0.00006429671,0.00032208563,0.00073716504],"genre_scores_gemma":[0.36167005,0.0003677431,0.6343984,0.00022118172,0.00013981602,0.00028706528,0.00033339064,0.00015315054,0.0024292811],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987643,0.00034266297,0.00009366775,0.00013251172,0.0005623985,0.00010441036],"domain_scores_gemma":[0.9981615,0.00074412173,0.00014578043,0.00041662264,0.00047418807,0.00005785769],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009646859,0.0007125122,0.0006451944,0.00079250097,0.0005066748,0.0010419799,0.0007861198,0.00065700244,0.0016924927],"category_scores_gemma":[0.0054312176,0.00027884488,0.00035031617,0.00069813326,0.0006895038,0.0018810504,0.0014407069,0.0013086954,0.0006823624],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009889163,0.00012801691,0.0017209784,0.00022414631,0.000049342492,0.0003340774,0.00036747375,0.11625428,0.09604297,0.08879807,0.0034382758,0.69165343],"study_design_scores_gemma":[0.000043382242,0.0001755214,0.0006512959,0.00004893466,0.000025484967,0.0003420366,0.000067431436,0.8813257,0.08364813,0.02723604,0.0063806796,0.00005542417],"about_ca_topic_score_codex":0.0007202856,"about_ca_topic_score_gemma":0.0011690068,"teacher_disagreement_score":0.0016924927,"about_ca_system_score_codex":0.00046216394,"about_ca_system_score_gemma":0.00052764686,"threshold_uncertainty_score":0.0056619644},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.01058093113311769,"score_gpt":0.27346302972456915,"score_spread":0.26288209859145145,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2100231395","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06595558,0.00095413293,0.92212886,0.0002962276,0.00016356402,0.00006704056,0.00011470102,0.0019188639,0.008401151],"genre_scores_gemma":[0.5179699,0.00075105403,0.4696485,0.00019612435,0.00015898184,0.000090943126,0.0005227921,0.0001073718,0.010554272],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998723,0.000012779092,0.000009866284,0.000024843443,0.000065482665,0.000014709486],"domain_scores_gemma":[0.9998871,0.000018021981,0.000012154542,0.000019062058,0.000055816112,0.000007829838],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015156377,0.00030975943,0.00024339014,0.00045414836,0.00026893528,0.00046092435,0.00080625684,0.0003683566,0.0030344015],"category_scores_gemma":[0.00029195205,0.00014193848,0.00018817923,0.0004693139,0.00017067493,0.00080889906,0.000356492,0.00049321225,0.0012397558],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00041567077,0.00010668356,0.00054568273,0.00022891028,0.000053832766,0.0003567709,0.00009249923,0.021378627,0.48847172,0.022475386,0.0066395025,0.4592348],"study_design_scores_gemma":[0.00012741191,0.0006088125,0.0010098177,0.000046997106,0.0001020156,0.0011900376,0.000062864136,0.6183006,0.3113413,0.015039498,0.052125074,0.000045555156],"about_ca_topic_score_codex":0.00035636761,"about_ca_topic_score_gemma":0.0008560283,"teacher_disagreement_score":0.0030344015,"about_ca_system_score_codex":0.0003333401,"about_ca_system_score_gemma":0.00027499188,"threshold_uncertainty_score":0.010151148},"labels":[],"label_agreement":null},{"id":"W2100961395","doi":"10.1109/icsmc.1995.538333","title":"Experiments in adaptive predictive coding","year":2002,"lang":"en","type":"article","venue":"","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Computer science; Image compression; Data compression; Artificial intelligence; Coding (social sciences); JPEG 2000; JPEG; Predictive coding; Sampling (signal processing); Transform coding; Compression ratio; Key (lock); Remainder; Computer vision; Sample (material); Image quality; Adaptive sampling; Adaptive coding; Encoding (memory); Image (mathematics); Image processing; Lossless compression; Mathematics; Statistics; Discrete cosine transform","score_opus":0.053983157746082505,"score_gpt":0.2930999213567923,"score_spread":0.2391167636107098,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2100961395","genre_codex":"empirical","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.84305704,0.001126973,0.1422668,0.00046705734,0.00018690946,0.00048012644,0.000469194,0.0011223159,0.010823533],"genre_scores_gemma":[0.9220328,0.0005194608,0.074038,0.00014318318,0.00003372473,0.00022248902,0.00048112564,0.00013055129,0.0023987235],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99818665,0.00040583307,0.000109049775,0.00021555914,0.00089617464,0.00018678284],"domain_scores_gemma":[0.99216014,0.005726563,0.00027061708,0.00075259927,0.00092373305,0.00016636228],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013880044,0.0005288064,0.00059170806,0.00078490376,0.000648376,0.00059664116,0.0014028397,0.0013303454,0.0029235247],"category_scores_gemma":[0.011320423,0.00031616792,0.00036634027,0.0009993055,0.0011541839,0.0014116061,0.0008632133,0.0012435799,0.00043051995],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.006524135,0.00389341,0.004165048,0.0010378789,0.00021267038,0.0017047528,0.0008365882,0.3963976,0.31223962,0.01505614,0.0040266793,0.25390545],"study_design_scores_gemma":[0.000707592,0.0054391744,0.0026262852,0.000104930295,0.000115385585,0.0011247891,0.00023947583,0.698335,0.27805096,0.007440545,0.005657049,0.00015887685],"about_ca_topic_score_codex":0.00381286,"about_ca_topic_score_gemma":0.0013076009,"teacher_disagreement_score":0.00381286,"about_ca_system_score_codex":0.00047066712,"about_ca_system_score_gemma":0.00030515596,"threshold_uncertainty_score":0.0097801685},"labels":[],"label_agreement":null},{"id":"W2101051321","doi":"10.1109/icassp.1996.540335","title":"Embedded algebraic vector quantizers (EAVQ) with application to wideband speech coding","year":2002,"lang":"en","type":"article","venue":"","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":23,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Sherbrooke","funders":"","keywords":"Codebook; Vector quantization; Linde–Buzo–Gray algorithm; Algebraic number; Speech coding; Quantization (signal processing); Computer science; Coding (social sciences); Algorithm; Wideband; Algebraic structure; Theoretical computer science; Speech recognition; Mathematics; Electronic engineering; Engineering","score_opus":0.017118819687187876,"score_gpt":0.2618465554997624,"score_spread":0.2447277358125745,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2101051321","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016193418,0.00080748514,0.9798982,0.00016718457,0.00008398475,0.000051844785,0.00005340972,0.00035955815,0.002384859],"genre_scores_gemma":[0.40565342,0.0011336667,0.58909714,0.000091782575,0.00009665627,0.000102302816,0.00015318212,0.000040215473,0.0036315843],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99966943,0.00008142963,0.000026433785,0.000034472672,0.00016876684,0.0000194171],"domain_scores_gemma":[0.9996488,0.00013780173,0.00003842018,0.000040648123,0.00011936714,0.000014996981],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003902142,0.00026194347,0.00030781055,0.00027886988,0.00020629657,0.0005204741,0.00042261241,0.00031038286,0.0013695954],"category_scores_gemma":[0.0012127536,0.00011470192,0.0001368906,0.00057666475,0.00047496613,0.0006487976,0.0005140917,0.00051563245,0.0002832899],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021218671,0.000045232428,0.0006741171,0.0001839285,0.00003081367,0.00016719704,0.00016400036,0.1428133,0.08785934,0.13382427,0.0025943408,0.6314313],"study_design_scores_gemma":[0.00004349512,0.00022855807,0.00030450572,0.000022611113,0.000018905017,0.00031267785,0.000048089187,0.92850953,0.036324862,0.01955304,0.01460235,0.00003138323],"about_ca_topic_score_codex":0.001322028,"about_ca_topic_score_gemma":0.0015351613,"teacher_disagreement_score":0.0013695954,"about_ca_system_score_codex":0.00030336418,"about_ca_system_score_gemma":0.00043447103,"threshold_uncertainty_score":0.0045817494},"labels":[],"label_agreement":null},{"id":"W2101302963","doi":"10.1109/wicom.2011.6040539","title":"Channel Aware Joint Optimization of Latency and Distortion for Image Communications","year":2011,"lang":"en","type":"article","venue":"","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Blackberry (Canada)","funders":"","keywords":"Transcoding; Computer science; Latency (audio); Wireless; Bandwidth (computing); Real-time computing; Rate–distortion theory; Computer network; Telecommunications; Data compression; Artificial intelligence","score_opus":0.07975425726724372,"score_gpt":0.2905294351591912,"score_spread":0.2107751778919475,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2101302963","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.020321695,0.0013209891,0.97447544,0.00027680275,0.00006320914,0.000042027492,0.00008376358,0.00014984027,0.0032661976],"genre_scores_gemma":[0.8444056,0.0034497178,0.14074026,0.0001328616,0.00017910227,0.000102061844,0.00013054034,0.00022722149,0.010632624],"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9993819,0.000153001,0.000024886875,0.00008975827,0.0002429467,0.000107499254],"domain_scores_gemma":[0.99844605,0.0010902076,0.00011707297,0.00006559174,0.00023163961,0.00004941685],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007732268,0.0013446548,0.00095504057,0.00039704482,0.00043263723,0.0013202965,0.0007995927,0.00093215227,0.0027791932],"category_scores_gemma":[0.0026435996,0.00039760748,0.00040858495,0.00081962394,0.00072474533,0.0014346787,0.00092540996,0.00095255836,0.0004398769],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020592606,0.000083229665,0.00046854944,0.00021093736,0.00004782336,0.0002477316,0.00008777074,0.91186154,0.025266176,0.018853743,0.0013560359,0.041310597],"study_design_scores_gemma":[0.000011116204,0.000058228536,0.00011089105,0.00000667858,0.000017096201,0.000109183195,0.000021550948,0.9911265,0.0041628047,0.0037178954,0.0006409976,0.000017090464],"about_ca_topic_score_codex":0.0043390803,"about_ca_topic_score_gemma":0.0057622814,"teacher_disagreement_score":0.0043390803,"about_ca_system_score_codex":0.0014044892,"about_ca_system_score_gemma":0.0014785181,"threshold_uncertainty_score":0.010190368},"labels":[],"label_agreement":null},{"id":"W2101402247","doi":"10.1109/mmsp.2008.4665102","title":"Standard-compliant multiple description image coding by spatial multiplexing and constrained least-squares restoration","year":2008,"lang":"en","type":"article","venue":"","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Encoder; Computer science; Algorithm; Image restoration; Autoregressive model; Coding (social sciences); Image quality; Multiple description coding; Decoding methods; Iterative reconstruction; Mathematics; Artificial intelligence; Computer vision; Image (mathematics); Image processing; Statistics","score_opus":0.03342449746247611,"score_gpt":0.265324330506268,"score_spread":0.23189983304379191,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2101402247","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0077475975,0.00013203347,0.9906929,0.000069922055,0.000020895772,0.000025824767,0.000019242598,0.00017815997,0.0011134516],"genre_scores_gemma":[0.13986431,0.00020062897,0.8569163,0.00009380817,0.00003849762,0.00008010282,0.00013118527,0.00004992307,0.0026252847],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994205,0.00013234653,0.000024633828,0.000053908716,0.00033615215,0.00003247528],"domain_scores_gemma":[0.999435,0.00015342163,0.00008671985,0.00016440221,0.00013895018,0.000021466347],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007234666,0.00043860613,0.0003720584,0.00049342785,0.00021736385,0.00047620753,0.0009872133,0.00055468763,0.0013364181],"category_scores_gemma":[0.0014915158,0.00021602563,0.0003541128,0.0007121429,0.00047379627,0.00097338937,0.0008753042,0.00075478817,0.0005122972],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00033092214,0.00012640878,0.0008468958,0.00022223504,0.000056948436,0.00028425135,0.00016999828,0.11700865,0.12413048,0.12841716,0.00422667,0.62417936],"study_design_scores_gemma":[0.00002962222,0.00014074674,0.00018423761,0.000017753453,0.000014455287,0.0004753132,0.000017904897,0.9262761,0.05747169,0.008576682,0.006763479,0.00003208312],"about_ca_topic_score_codex":0.0006968639,"about_ca_topic_score_gemma":0.0010943641,"teacher_disagreement_score":0.0013364181,"about_ca_system_score_codex":0.00030490733,"about_ca_system_score_gemma":0.00074801303,"threshold_uncertainty_score":0.0044707656},"labels":[],"label_agreement":null},{"id":"W2101455137","doi":"10.1109/acssc.2008.5074625","title":"Generalized fast index assignment for robust multiple description scalar quantizers","year":2008,"lang":"en","type":"article","venue":"","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Computer science; Robustness (evolution); Encoder; Computational complexity theory; Algorithm; Network packet; Decoding methods; Multiple description coding; Residual","score_opus":0.0707626706840624,"score_gpt":0.2745395956434032,"score_spread":0.2037769249593408,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2101455137","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011468199,0.00020987909,0.98739064,0.00006936375,0.000024747835,0.000031942323,0.000020621763,0.00022491887,0.0005596611],"genre_scores_gemma":[0.48409617,0.00022057041,0.51340073,0.00010767195,0.000038228998,0.000115824674,0.00014360581,0.000049650997,0.0018275504],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993926,0.00018696804,0.00004556575,0.00009351267,0.00023219024,0.00004922549],"domain_scores_gemma":[0.9993136,0.00027963106,0.00010892392,0.00012914797,0.00014775826,0.00002103186],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011482489,0.00045167687,0.0005042283,0.00047720547,0.00032170236,0.00058386807,0.00082619657,0.00047661513,0.0011480155],"category_scores_gemma":[0.0026741007,0.00017274905,0.00020884845,0.0005821951,0.00049286167,0.00094922615,0.00084405474,0.00073477975,0.00024229036],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003157932,0.0000646172,0.0005033981,0.00019270153,0.00003848257,0.0000997705,0.00018910035,0.27428958,0.043707285,0.10796392,0.0020042118,0.57063115],"study_design_scores_gemma":[0.000034669098,0.000072095056,0.000101779755,0.000010582859,0.0000058458036,0.000048438582,0.0000120679915,0.9727068,0.0137406355,0.011346927,0.0019063323,0.000013890226],"about_ca_topic_score_codex":0.0010011413,"about_ca_topic_score_gemma":0.0009860942,"teacher_disagreement_score":0.0011482489,"about_ca_system_score_codex":0.00060159795,"about_ca_system_score_gemma":0.0007697792,"threshold_uncertainty_score":0.0060726404},"labels":[],"label_agreement":null},{"id":"W2101865986","doi":"10.1109/icme.2006.262481","title":"Efficient Algorithm for Globally Optimal Uneven Erasure-Protected Packetization of Scalable Code Streams","year":2006,"lang":"en","type":"article","venue":"","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Erasure; Payload (computing); Computer science; Network packet; Scalability; Algorithm; Code (set theory); Fidelity; Theoretical computer science; Computer network","score_opus":0.008958574360670267,"score_gpt":0.25432115504192954,"score_spread":0.24536258068125927,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2101865986","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0036994538,0.000043456064,0.9948087,0.0000388593,0.000014148082,0.00003395046,0.00002249036,0.00057457713,0.00076442835],"genre_scores_gemma":[0.12238632,0.000097430144,0.87479377,0.000041916413,0.000022116223,0.00019644939,0.00020240295,0.0001636435,0.0020959815],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99967265,0.00005450801,0.00002252572,0.000060471735,0.00013085472,0.00005900875],"domain_scores_gemma":[0.99960977,0.00015998275,0.000039149305,0.00007215871,0.000099669385,0.000019260086],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005450989,0.00092059694,0.0008378892,0.0006915952,0.0003972133,0.00074294064,0.00090114615,0.00073240174,0.0035793686],"category_scores_gemma":[0.001768643,0.0003008268,0.00046078133,0.00067222246,0.0005464653,0.0010691589,0.001581162,0.0011130038,0.0008771293],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023761409,0.00006681753,0.00045924305,0.00011803328,0.000051110677,0.00011994875,0.00016692605,0.45668447,0.020192979,0.030668557,0.005068001,0.48616636],"study_design_scores_gemma":[0.00003853468,0.000049427817,0.00007501433,0.000007476418,0.000007895616,0.00005190123,0.000032785054,0.9829804,0.005860355,0.009234104,0.0016516733,0.000010412398],"about_ca_topic_score_codex":0.0017468743,"about_ca_topic_score_gemma":0.0020563556,"teacher_disagreement_score":0.0035793686,"about_ca_system_score_codex":0.00069820177,"about_ca_system_score_gemma":0.0013744981,"threshold_uncertainty_score":0.0119742155},"labels":[],"label_agreement":null},{"id":"W2101949144","doi":"10.1109/icassp.2006.1660120","title":"A New Post-Filtering for Artificially Replicated High-Band in Speech Coders","year":2006,"lang":"en","type":"article","venue":"","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Sherbrooke","funders":"","keywords":"Bandwidth extension; Computer science; Spectral envelope; Speech recognition; Bandwidth (computing); Wideband; Bandlimiting; Wideband audio; Speech coding; Coding (social sciences); Electronic engineering; Telecommunications; Mathematics; Engineering; Fourier transform","score_opus":0.01221369285781086,"score_gpt":0.2628662393909743,"score_spread":0.25065254653316343,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2101949144","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0648315,0.00019202821,0.9337296,0.00005630719,0.00007063636,0.00003812512,0.0000283626,0.00049199787,0.00056143355],"genre_scores_gemma":[0.4149028,0.00019293626,0.5823091,0.00007209837,0.00006363461,0.00006508492,0.00010296833,0.0000864069,0.0022050114],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996772,0.000056342036,0.000026350252,0.00006809992,0.00015004454,0.000021999438],"domain_scores_gemma":[0.9991555,0.00029160653,0.00010460648,0.00020416365,0.00021485318,0.000029288423],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035547963,0.00045411478,0.0003007574,0.00029981037,0.00024199508,0.00048405456,0.0005999663,0.00072854635,0.0009953495],"category_scores_gemma":[0.00135251,0.00017168594,0.00034529564,0.00018903108,0.00036604513,0.0004988156,0.00031540834,0.00048724184,0.0003832251],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00040551712,0.00009768061,0.00066488277,0.00014260752,0.000033116776,0.00017158578,0.00010103625,0.009983701,0.8271426,0.004001045,0.0003326986,0.1569235],"study_design_scores_gemma":[0.00004473798,0.0007556143,0.0032460156,0.000032140262,0.000104204184,0.0010133763,0.00003577526,0.34086123,0.64378357,0.001283274,0.008783869,0.000056104578],"about_ca_topic_score_codex":0.00052886136,"about_ca_topic_score_gemma":0.00097470527,"teacher_disagreement_score":0.0009953495,"about_ca_system_score_codex":0.00022778078,"about_ca_system_score_gemma":0.00025542348,"threshold_uncertainty_score":0.0033297539},"labels":[],"label_agreement":null},{"id":"W2102278828","doi":"10.1109/isit.2006.261980","title":"On Optimal Index Assignment for MAP Decoding of Markov Sequences","year":2006,"lang":"en","type":"article","venue":"","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Decoding methods; Computer science; Maximum a posteriori estimation; Markov chain; Assignment problem; Algorithm; Markov process; Mathematical optimization; Quadratic assignment problem; Index (typography); Metric (unit); Gaussian; Optimization problem; Mathematics; Statistics; Machine learning","score_opus":0.014328949879528447,"score_gpt":0.28279323199192374,"score_spread":0.2684642821123953,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2102278828","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010713564,0.00023560919,0.98719317,0.00011459898,0.000017616407,0.000025196343,0.000024250505,0.00006703446,0.0016088632],"genre_scores_gemma":[0.51731867,0.0014579128,0.47583294,0.00019428282,0.00018066923,0.00020977073,0.00019278946,0.00015286826,0.0044600437],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989436,0.0004935011,0.00004965525,0.00012319857,0.0003018669,0.00008816821],"domain_scores_gemma":[0.9977512,0.0018104053,0.00012994572,0.00009745079,0.00016768248,0.000043207005],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015149587,0.00085066137,0.00083734683,0.00059912825,0.00038175748,0.00071202073,0.00063529325,0.00078789564,0.0017862933],"category_scores_gemma":[0.007301095,0.00037314105,0.0003227136,0.0010830496,0.0012152982,0.0015620408,0.0011538903,0.0009026294,0.0004407262],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018964571,0.000064872314,0.0002907331,0.000151423,0.000025677582,0.00009075641,0.00021246988,0.7862933,0.009213763,0.10968679,0.0016091372,0.09217147],"study_design_scores_gemma":[0.00001299668,0.000044307522,0.000052144518,0.000011681389,0.000004371974,0.00003414676,0.000019011066,0.96805066,0.0027514498,0.028472597,0.00053703884,0.0000096291315],"about_ca_topic_score_codex":0.0014055455,"about_ca_topic_score_gemma":0.0012155715,"teacher_disagreement_score":0.0017862933,"about_ca_system_score_codex":0.0008518513,"about_ca_system_score_gemma":0.0011091183,"threshold_uncertainty_score":0.008011937},"labels":[],"label_agreement":null},{"id":"W2102377580","doi":"10.1109/icsmc.1993.390703","title":"Variable resolution teleconferencing","year":2002,"lang":"en","type":"article","venue":"","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":35,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Teleconference; Computer science; Variable (mathematics); Data compression; Image compression; Computer graphics (images); Scheme (mathematics); Computer vision; Resolution (logic); Artificial intelligence; Image (mathematics); Multimedia; Image processing; Mathematics","score_opus":0.02888082903891752,"score_gpt":0.23395612754281983,"score_spread":0.20507529850390233,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2102377580","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.034553133,0.0027971165,0.91687787,0.00059094594,0.0004174782,0.00030277445,0.00026410623,0.0031466032,0.04105003],"genre_scores_gemma":[0.3271394,0.0038578368,0.6311913,0.0006593762,0.0003769038,0.00025321482,0.0005433516,0.00029932638,0.035679195],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99919254,0.00015226625,0.000036192625,0.000118778844,0.0004250777,0.00007506514],"domain_scores_gemma":[0.9987196,0.00054647936,0.00008314022,0.0003030648,0.00029161692,0.000056280875],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00054129143,0.0003952109,0.00039779572,0.0005440144,0.00049865636,0.001187216,0.0009962755,0.0012108525,0.013273282],"category_scores_gemma":[0.0015373051,0.00025744518,0.00029560435,0.0006463348,0.00048473472,0.0011412812,0.0009566725,0.0008681952,0.0034736309],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00030524065,0.00007728347,0.0006831566,0.0005053354,0.000033577948,0.0012287722,0.00027895844,0.0074122897,0.3634388,0.034712635,0.01707084,0.5742531],"study_design_scores_gemma":[0.000165019,0.0014621358,0.005737876,0.00029967036,0.00013668518,0.019830968,0.00034124448,0.15385327,0.49036577,0.018158909,0.30941656,0.0002319207],"about_ca_topic_score_codex":0.0011707346,"about_ca_topic_score_gemma":0.0014225501,"teacher_disagreement_score":0.013273282,"about_ca_system_score_codex":0.00043636933,"about_ca_system_score_gemma":0.00036983794,"threshold_uncertainty_score":0.044403493},"labels":[],"label_agreement":null},{"id":"W2102440026","doi":"10.1109/lcn.2008.4664154","title":"Reconstructing the Plenoptic function from wireless multimedia sensor networks","year":2008,"lang":"en","type":"article","venue":"","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Computer science; Key (lock); Wireless; Real-time computing; Wireless sensor network; Protocol (science); Transmission (telecommunications); Image sensor; Channel (broadcasting); Computer vision; Artificial intelligence; Computer network; Telecommunications","score_opus":0.02065265629229798,"score_gpt":0.22743140408369827,"score_spread":0.2067787477914003,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2102440026","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12960885,0.00057954795,0.8672226,0.00015812216,0.000045899455,0.000051463518,0.000045986162,0.00028647,0.0020010464],"genre_scores_gemma":[0.7397077,0.0012160746,0.25614443,0.000057721107,0.00006418624,0.00007909496,0.000245146,0.00004853744,0.0024370388],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998325,0.00004760351,0.000007517717,0.000014114956,0.00008642848,0.0000118050775],"domain_scores_gemma":[0.9996965,0.00012755545,0.00003588498,0.000068425434,0.00005817812,0.000013481891],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004396625,0.00041098072,0.00027379658,0.00038833535,0.00021969077,0.00032236212,0.0003279665,0.00036463194,0.00041447356],"category_scores_gemma":[0.0013816891,0.0001643468,0.00018104156,0.00036339776,0.0003481305,0.0007974777,0.0005349108,0.00035796728,0.0001458929],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007411497,0.00008082744,0.0020764938,0.0003010311,0.00005209984,0.00092688965,0.0003351665,0.25828022,0.32385224,0.026557462,0.0017246444,0.38507172],"study_design_scores_gemma":[0.000017531149,0.00015661969,0.0012088415,0.000018408526,0.000017278571,0.0004859536,0.00009846194,0.8935624,0.090051174,0.010435718,0.003929003,0.000018635541],"about_ca_topic_score_codex":0.0004464224,"about_ca_topic_score_gemma":0.0005763018,"teacher_disagreement_score":0.0004464224,"about_ca_system_score_codex":0.00019607811,"about_ca_system_score_gemma":0.00017816883,"threshold_uncertainty_score":0.0023251772},"labels":[],"label_agreement":null},{"id":"W2102722060","doi":"10.1109/icme.2006.262413","title":"A Flexible Content-Based Approach to Adaptive Image Compression","year":2006,"lang":"en","type":"article","venue":"","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Lossy compression; Computer science; Image compression; Quantization (signal processing); Artificial intelligence; Implementation; Computer vision; Image texture; Data compression; Thresholding; Texture compression; Image quality; Human visual system model; Image processing; Image (mathematics)","score_opus":0.046134522225195214,"score_gpt":0.2719763681030567,"score_spread":0.2258418458778615,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2102722060","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007330439,0.00032226136,0.98882127,0.00012897825,0.000072389244,0.00007768781,0.000029756236,0.00077477784,0.0024424884],"genre_scores_gemma":[0.20877282,0.0007564999,0.7822483,0.00032181523,0.00024950787,0.00017020362,0.0001952064,0.00023091356,0.0070548146],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995338,0.00004799159,0.000023789007,0.000082632076,0.0002833034,0.000028482084],"domain_scores_gemma":[0.9994578,0.000100830366,0.00003507108,0.00020840141,0.00017611963,0.000021847518],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032679792,0.00048702824,0.00040379437,0.000878846,0.0003757304,0.0006961965,0.0015133496,0.0006662618,0.0017106371],"category_scores_gemma":[0.0012374411,0.00024406242,0.0003330863,0.00094574195,0.0008322333,0.0010708827,0.0010661702,0.0010511156,0.00079688104],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020112102,0.0001579269,0.00040892008,0.00014322394,0.00005216675,0.00032225015,0.00015508973,0.037665576,0.37709248,0.038044963,0.004039953,0.54171646],"study_design_scores_gemma":[0.00005654716,0.0002804767,0.0012712469,0.00004011255,0.00006838697,0.001641851,0.000046179524,0.7214975,0.22155248,0.023953319,0.029515471,0.00007655027],"about_ca_topic_score_codex":0.0006366652,"about_ca_topic_score_gemma":0.00087619416,"teacher_disagreement_score":0.0017106371,"about_ca_system_score_codex":0.00033601132,"about_ca_system_score_gemma":0.00030287434,"threshold_uncertainty_score":0.0057225823},"labels":[],"label_agreement":null},{"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.019644011928643,"score_gpt":0.30888450743310825,"score_spread":0.28924049550446523,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2102740494","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5078577,0.0070734434,0.4700848,0.00045486973,0.00016851768,0.0003287518,0.00020252384,0.0011961511,0.01263323],"genre_scores_gemma":[0.85887647,0.0048759645,0.13329154,0.000045010762,0.000075989825,0.00009520485,0.00033145695,0.000109746186,0.0022985432],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99951565,0.00007374999,0.000024934396,0.000027139902,0.00032436752,0.000034207816],"domain_scores_gemma":[0.99856275,0.00091522734,0.00012855418,0.00013986722,0.00022462879,0.00002896255],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013254206,0.0005638333,0.00041967892,0.001061713,0.0002331763,0.0006468617,0.00065344456,0.00043363005,0.0015688011],"category_scores_gemma":[0.005328138,0.0001535378,0.00025349355,0.0012823811,0.00047575452,0.0011367741,0.0003060271,0.00051152013,0.00044877653],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0018796858,0.0005205335,0.003054478,0.0007620645,0.0001003421,0.00059136073,0.00023401478,0.22752786,0.15741502,0.030103493,0.0020271218,0.575784],"study_design_scores_gemma":[0.000072949224,0.0013278746,0.002376063,0.000050375325,0.0000627734,0.00083968934,0.00008892202,0.82627326,0.1624541,0.0037499028,0.0026440246,0.000060086106],"about_ca_topic_score_codex":0.0008144353,"about_ca_topic_score_gemma":0.0010960825,"teacher_disagreement_score":0.0015688011,"about_ca_system_score_codex":0.0004228157,"about_ca_system_score_gemma":0.00035761762,"threshold_uncertainty_score":0.007009566},"labels":[],"label_agreement":null},{"id":"W2102793655","doi":"10.1109/icpr.2002.1044695","title":"Background subtraction using competing models in the block-DCT domain","year":2003,"lang":"en","type":"article","venue":"","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Background subtraction; JPEG; Discrete cosine transform; Computer science; Block (permutation group theory); Image processing; Computation; Artificial intelligence; Subtraction; Pattern recognition (psychology); Transform coding; Domain (mathematical analysis); Computer vision; Algorithm; Image (mathematics); Mathematics; Pixel; Arithmetic","score_opus":0.06633092611567074,"score_gpt":0.3185172279173889,"score_spread":0.2521863018017182,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2102793655","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016247947,0.00023508181,0.9823381,0.00006727182,0.00003127276,0.000017047989,0.00003782532,0.00034794566,0.00067752297],"genre_scores_gemma":[0.40271696,0.00081617717,0.5904018,0.00018124275,0.00007186802,0.00006138269,0.00041639048,0.00022039631,0.0051137907],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99937385,0.00012488346,0.00002618224,0.0001503714,0.00026247805,0.00006224301],"domain_scores_gemma":[0.9992442,0.0004395521,0.00005544181,0.00008629973,0.00013208324,0.00004249874],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011610548,0.0007074108,0.0009415119,0.0005876303,0.0003806966,0.0010550427,0.0013827644,0.001109836,0.0012388073],"category_scores_gemma":[0.002539864,0.00051817874,0.0009874405,0.0006488647,0.00043207448,0.0013420563,0.00083995477,0.000985241,0.00088334753],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007947161,0.0002214912,0.003573151,0.00034254012,0.00031115982,0.00044597225,0.00021036665,0.36030966,0.16523325,0.030448118,0.0018822405,0.43622738],"study_design_scores_gemma":[0.000010721559,0.000043988875,0.00080333714,0.000008145448,0.000028726057,0.00015975528,0.000011748633,0.9689603,0.023736559,0.0050796587,0.001131541,0.000025631974],"about_ca_topic_score_codex":0.0034072872,"about_ca_topic_score_gemma":0.005235503,"teacher_disagreement_score":0.0034072872,"about_ca_system_score_codex":0.0005154718,"about_ca_system_score_gemma":0.00054865936,"threshold_uncertainty_score":0.006774962},"labels":[],"label_agreement":null},{"id":"W2103091602","doi":"10.1109/glocom.1992.276543","title":"Real-time implementation of a 9.6 kbit/s ACELP wideband speech coder","year":2003,"lang":"en","type":"article","venue":"","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Sherbrooke","funders":"","keywords":"Computer science; Narrowband; Speech recognition; Wideband; Codebook; Speech coding; Linear predictive coding; Wideband audio; Algorithm; Electronic engineering; Telecommunications; Engineering; Audio signal; Digital audio","score_opus":0.014603627260607913,"score_gpt":0.31611209058665646,"score_spread":0.3015084633260485,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2103091602","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08030333,0.00034706024,0.88498014,0.00040525626,0.0003418797,0.00036450478,0.0004346347,0.020436924,0.012386238],"genre_scores_gemma":[0.51450884,0.0002521047,0.45939898,0.00041110013,0.0001574218,0.00045110428,0.0009105394,0.0007935366,0.023116304],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9995443,0.000053867087,0.000034122975,0.00006388266,0.0002510887,0.00005272836],"domain_scores_gemma":[0.99899274,0.0002643952,0.000060255203,0.000118304975,0.0004890831,0.00007517856],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00052870886,0.00049871625,0.00043066422,0.0006212155,0.00030536554,0.0006615036,0.0010351894,0.000594572,0.009960898],"category_scores_gemma":[0.0016926756,0.00020750487,0.00018890515,0.00018661113,0.0002196983,0.0005225692,0.00034677968,0.00065569946,0.004568954],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009089961,0.00022645657,0.0010274631,0.00028097743,0.00006141634,0.0009915323,0.00037349196,0.009288328,0.6242488,0.0063142646,0.010565155,0.34571314],"study_design_scores_gemma":[0.0002939581,0.001987888,0.0028170182,0.000090114314,0.000110039924,0.0027886764,0.00011863323,0.16659456,0.7483262,0.0013116727,0.07542099,0.00014023863],"about_ca_topic_score_codex":0.0010506475,"about_ca_topic_score_gemma":0.00096043525,"teacher_disagreement_score":0.009960898,"about_ca_system_score_codex":0.00034471086,"about_ca_system_score_gemma":0.00045568906,"threshold_uncertainty_score":0.033322513},"labels":[],"label_agreement":null},{"id":"W2103883117","doi":"10.1109/icassp.2004.1326901","title":"Reconstruction of multi-stage vector quantized sources over noisy channels - applications to MELP codec","year":2004,"lang":"en","type":"article","venue":"","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Codec; Computer science; Speech recognition; Redundancy (engineering); Speech coding; Residual; Decoding methods; Coding (social sciences); Algorithm; Channel (broadcasting); Telecommunications; Mathematics","score_opus":0.048752496929513965,"score_gpt":0.33572987217472,"score_spread":0.28697737524520606,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2103883117","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.037909366,0.00020117284,0.96082956,0.000134078,0.000011214495,0.000017629287,0.000039686634,0.00016584867,0.0006914733],"genre_scores_gemma":[0.6939899,0.0003638437,0.303703,0.00003349744,0.000017722112,0.00004297753,0.000081128965,0.000032212327,0.0017357795],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997826,0.00006660254,0.000011698894,0.0000152393,0.00011015987,0.000013799161],"domain_scores_gemma":[0.9993069,0.0004131661,0.00006721702,0.00007004658,0.00012844377,0.000014282219],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00068913033,0.00035624258,0.0004337545,0.00024634931,0.00016401631,0.00037897503,0.00032182506,0.0005764381,0.00058063376],"category_scores_gemma":[0.0024701052,0.00017641934,0.00016810303,0.0002962202,0.00046292253,0.0004962161,0.00055018644,0.00042779453,0.0001311902],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020108397,0.000025906846,0.00074301846,0.00010903404,0.000020743628,0.0003522229,0.00011731787,0.85653836,0.038774334,0.032081183,0.0004313377,0.07060545],"study_design_scores_gemma":[0.0000036411927,0.000012026673,0.000054222863,0.000003305153,0.0000013802259,0.0000422336,0.0000051097372,0.9928994,0.0053282534,0.0015132148,0.00013406728,0.000003127857],"about_ca_topic_score_codex":0.0009996331,"about_ca_topic_score_gemma":0.001180015,"teacher_disagreement_score":0.0009996331,"about_ca_system_score_codex":0.00033928658,"about_ca_system_score_gemma":0.00032843207,"threshold_uncertainty_score":0.003644526},"labels":[],"label_agreement":null},{"id":"W2104512634","doi":"10.1109/iscas.2005.1465518","title":"Low Redundancy Layered Multiple Description Scalable Coding Using The Subband Extension Of H.264/AVC","year":2005,"lang":"en","type":"article","venue":"","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; Multiple description coding; Scalable Video Coding; Scalability; Context-adaptive binary arithmetic coding; Redundancy (engineering); Coding (social sciences); Packet loss; Algorithmic efficiency; Coding tree unit; Network packet; Wireless; Codec; Computer network; Computer engineering; Real-time computing; Algorithm; Decoding methods; Data compression; Computer hardware; Telecommunications","score_opus":0.04895812704161184,"score_gpt":0.2893744113210887,"score_spread":0.24041628427947687,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2104512634","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.032422394,0.0009089049,0.9627809,0.00024504893,0.00008713574,0.00007613826,0.00012660632,0.0013624443,0.0019904727],"genre_scores_gemma":[0.3312828,0.0011229948,0.6626331,0.00018707658,0.000094889,0.00009639322,0.0006492067,0.00007665835,0.0038567367],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997861,0.000034535664,0.000011459382,0.000018879206,0.0001305695,0.000018474524],"domain_scores_gemma":[0.99970067,0.00007978566,0.000043697342,0.000062455874,0.000097031145,0.000016417382],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033069015,0.00033856233,0.00026522222,0.00047880018,0.00016040643,0.00032558944,0.0005553034,0.0003694526,0.0007366542],"category_scores_gemma":[0.00085596426,0.00014225893,0.00030987756,0.00039688608,0.00022634673,0.0005182047,0.00040294862,0.0005605056,0.0002768589],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00024359662,0.000085895415,0.000704889,0.00026801968,0.00006578868,0.00050113176,0.00011865612,0.06532962,0.35454297,0.020320075,0.0060485597,0.55177075],"study_design_scores_gemma":[0.00004514047,0.00017487376,0.0010928735,0.000030630785,0.000051801897,0.00055340526,0.000026468697,0.85847056,0.12046084,0.005495316,0.013544544,0.00005355683],"about_ca_topic_score_codex":0.003028772,"about_ca_topic_score_gemma":0.0033891988,"teacher_disagreement_score":0.003028772,"about_ca_system_score_codex":0.00029397508,"about_ca_system_score_gemma":0.00048831286,"threshold_uncertainty_score":0.0060222745},"labels":[],"label_agreement":null},{"id":"W2104743544","doi":"10.1109/icme.2008.4607540","title":"Zerotree data structure for 4D wavelet coefficient coding","year":2008,"lang":"en","type":"article","venue":"","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Communications Research Centre Canada","funders":"","keywords":"Wavelet; Coding (social sciences); Wavelet transform; Computer science; Artificial intelligence; Pattern recognition (psychology); Algorithm; Data structure; Mathematics; Statistics","score_opus":0.08540027767589527,"score_gpt":0.3195722079190542,"score_spread":0.23417193024315897,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2104743544","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013484381,0.0005581466,0.9827439,0.0001427943,0.00013957857,0.00009459799,0.0003525367,0.00056709343,0.0019170021],"genre_scores_gemma":[0.119524896,0.0007311706,0.8729417,0.0002213817,0.000107872875,0.00036086308,0.0019225532,0.00013934553,0.0040503265],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996338,0.00006115325,0.000036481008,0.00003274328,0.00020393632,0.000031892243],"domain_scores_gemma":[0.99910706,0.00017334287,0.00008363053,0.00020218114,0.0004010906,0.000032643547],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037068615,0.0004827211,0.00043432714,0.0016965016,0.00043727146,0.0007556641,0.00092532183,0.00060485234,0.0032584174],"category_scores_gemma":[0.0016431856,0.00024715063,0.00035123012,0.0020126414,0.0005135109,0.0013688535,0.0009574376,0.0008374478,0.0012604353],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00031621422,0.00008058841,0.0006720241,0.00036359119,0.000039364604,0.00023195952,0.00020445503,0.026873825,0.17391862,0.123921566,0.0103705,0.6630073],"study_design_scores_gemma":[0.00015171828,0.00074909034,0.0012345677,0.00020794653,0.00007240611,0.0009907088,0.00019120036,0.60061145,0.2140114,0.06694556,0.11464752,0.0001864146],"about_ca_topic_score_codex":0.0016754981,"about_ca_topic_score_gemma":0.0023895258,"teacher_disagreement_score":0.0032584174,"about_ca_system_score_codex":0.0006224191,"about_ca_system_score_gemma":0.0010138676,"threshold_uncertainty_score":0.010900438},"labels":[],"label_agreement":null},{"id":"W2104884829","doi":"10.1109/ccece.1993.332257","title":"Image coding by using trimming modified vector quantization","year":2002,"lang":"en","type":"article","venue":"","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Sharpening; Trimming; Vector quantization; Artificial intelligence; Computer science; Computer vision; Quantization (signal processing); Image compression; Pixel; Coding (social sciences); Image quality; ENCODE; Pattern recognition (psychology); Image (mathematics); Mathematics; Image processing","score_opus":0.05424689928557335,"score_gpt":0.2990854321559017,"score_spread":0.24483853287032836,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2104884829","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008232806,0.000930888,0.98637277,0.00012857266,0.000116044,0.000055362896,0.0000655103,0.0009582994,0.0031397971],"genre_scores_gemma":[0.2452857,0.0014924061,0.74282414,0.0003831825,0.00013977462,0.00014841858,0.00047608858,0.00017500563,0.0090753725],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99963784,0.00006862682,0.00002344757,0.000048773116,0.00019399228,0.000027257878],"domain_scores_gemma":[0.9996346,0.000087191074,0.00003487798,0.00007698586,0.00015437773,0.0000119208635],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000355008,0.00036594376,0.00036847618,0.0007856977,0.00021264574,0.00059052155,0.0007971677,0.0005377275,0.0022574884],"category_scores_gemma":[0.0015353601,0.00012776515,0.0003195772,0.0009322198,0.00038667078,0.00072549854,0.0005934092,0.0006083916,0.0006760947],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00025254829,0.000036395002,0.0002450449,0.0002286694,0.000050196228,0.00024130175,0.0001631453,0.072573744,0.11675218,0.049823444,0.006724888,0.7529084],"study_design_scores_gemma":[0.000051349063,0.0002445425,0.0006212112,0.00007314178,0.00003664083,0.000714372,0.000050486913,0.8535271,0.09017779,0.02337173,0.031072818,0.000058741043],"about_ca_topic_score_codex":0.0020891023,"about_ca_topic_score_gemma":0.0017190318,"teacher_disagreement_score":0.0022574884,"about_ca_system_score_codex":0.0003820713,"about_ca_system_score_gemma":0.0003776635,"threshold_uncertainty_score":0.0075520873},"labels":[],"label_agreement":null},{"id":"W2104900362","doi":"10.1109/icassp.2004.1326032","title":"Low-complexity multi-rate lattice vector quantization with application to wideband TCX speech coding at 32 kbit/s","year":2004,"lang":"en","type":"article","venue":"","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":33,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Sherbrooke","funders":"","keywords":"Codebook; Vector quantization; Speech coding; Harmonic Vector Excitation Coding; Linde–Buzo–Gray algorithm; Voronoi diagram; Lattice (music); Computer science; Coding (social sciences); Algorithm; Bandwidth extension; Quantization (signal processing); Computational complexity theory; Theoretical computer science; Speech recognition; Mathematics; Physics; Acoustics; Audio signal","score_opus":0.033453442982137684,"score_gpt":0.2995459889555244,"score_spread":0.2660925459733867,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2104900362","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018449279,0.00036933777,0.97887474,0.00007835545,0.00003297295,0.00003873708,0.000022269032,0.00036923037,0.0017650562],"genre_scores_gemma":[0.42846286,0.0003295157,0.5692528,0.000048699167,0.000035732515,0.00007530205,0.000057789075,0.00005330424,0.0016839318],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9995771,0.00012143203,0.000023219665,0.000035407924,0.00021723271,0.000025588592],"domain_scores_gemma":[0.9995485,0.00016981417,0.000048875285,0.000060591912,0.00014537794,0.000026823624],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003948953,0.00024104587,0.00031468328,0.00027861263,0.00027014388,0.0004817117,0.00046426812,0.00026871997,0.0011634246],"category_scores_gemma":[0.0012723004,0.000148891,0.00015428729,0.00038007056,0.00039466872,0.00041222203,0.00042866098,0.0003821181,0.000417099],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00040000526,0.00007498929,0.00078656897,0.00017581602,0.000029001607,0.00026106316,0.00015702676,0.27120388,0.1388528,0.06086177,0.001865913,0.5253312],"study_design_scores_gemma":[0.000034090903,0.00017855065,0.0001359569,0.000011659989,0.000008353881,0.00027947116,0.000022149781,0.93578815,0.050154384,0.006483312,0.006880998,0.000022907683],"about_ca_topic_score_codex":0.001045491,"about_ca_topic_score_gemma":0.001405383,"teacher_disagreement_score":0.0011634246,"about_ca_system_score_codex":0.00039533916,"about_ca_system_score_gemma":0.00043590076,"threshold_uncertainty_score":0.003892064},"labels":[],"label_agreement":null},{"id":"W2104955117","doi":"10.1109/titb.2009.2021159","title":"Novel Lossless fMRI Image Compression Based on Motion Compensation and Customized Entropy Coding","year":2009,"lang":"en","type":"article","venue":"IEEE Transactions on Information Technology in Biomedicine","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":19,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; Lossless compression; Motion compensation; Artificial intelligence; Data compression; Computer vision; Context-adaptive binary arithmetic coding; Context-adaptive variable-length coding; Entropy encoding; Quarter-pixel motion; JPEG 2000; Image compression; Pattern recognition (psychology); Image processing; Image (mathematics)","score_opus":0.009465778566057579,"score_gpt":0.2620009117182452,"score_spread":0.2525351331521876,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2104955117","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.031891234,0.00093278394,0.9647077,0.00024174091,0.000099519195,0.000078523866,0.000092320726,0.000597917,0.0013582796],"genre_scores_gemma":[0.19835296,0.0009061515,0.7956174,0.0003106948,0.00017746129,0.00011754795,0.0003158507,0.00010898095,0.004092951],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99979645,0.000022816123,0.000011140717,0.000023850556,0.00013223603,0.000013572243],"domain_scores_gemma":[0.9997949,0.00007337402,0.000027609098,0.000039694743,0.000052574153,0.0000118709695],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003281723,0.00045221797,0.00030177875,0.00068854535,0.00016168019,0.00033041093,0.0007208992,0.00043861804,0.00095786684],"category_scores_gemma":[0.0008656675,0.00019026377,0.0002585193,0.0004512728,0.00029215505,0.0007739061,0.0005227966,0.0004916818,0.00028243824],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003495624,0.00009851697,0.00065493805,0.00018843409,0.000044869932,0.00047065684,0.00011588878,0.024009531,0.47298455,0.013536166,0.00336273,0.484184],"study_design_scores_gemma":[0.000079942314,0.00030969226,0.0023576375,0.0000443025,0.000055199485,0.0025641934,0.00002439038,0.6293192,0.34839082,0.004054778,0.012731525,0.00006829957],"about_ca_topic_score_codex":0.0004597507,"about_ca_topic_score_gemma":0.0008880312,"teacher_disagreement_score":0.00095786684,"about_ca_system_score_codex":0.00020279545,"about_ca_system_score_gemma":0.0003170049,"threshold_uncertainty_score":0.0032044053},"labels":[],"label_agreement":null},{"id":"W2104980687","doi":"10.1109/ccece.2002.1013079","title":"Parallel filtering and thresholding of images on the SIMD DSP-RAM architecture","year":2003,"lang":"en","type":"article","venue":"","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"SIMD; Coprocessor; MMX; Computer science; Digital signal processing; Pentium; Parallel computing; Benchmark (surveying); Computer hardware; Convolution (computer science); Computer architecture; Embedded system; Artificial intelligence","score_opus":0.02047725194195485,"score_gpt":0.2640794356261871,"score_spread":0.24360218368423223,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2104980687","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.38850528,0.00033878838,0.5866708,0.0001975224,0.00005860824,0.00011873858,0.0002147547,0.0064968728,0.017398596],"genre_scores_gemma":[0.70283526,0.00016559992,0.29179937,0.000070644775,0.000015266178,0.00008632151,0.0003181273,0.00015679224,0.004552689],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998555,0.000030323807,0.0000074826553,0.000018611183,0.000071780865,0.000016253563],"domain_scores_gemma":[0.9997342,0.00010019713,0.000017789676,0.00006298266,0.000069652444,0.000015200825],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032524104,0.00028377323,0.000264415,0.00029022119,0.00018547334,0.0003267406,0.0007372768,0.00027653362,0.0034295358],"category_scores_gemma":[0.000892867,0.0001546486,0.00019443811,0.00042633465,0.00023080537,0.00041031095,0.00022621988,0.0003172268,0.00067131553],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.002247972,0.00020023671,0.003915302,0.0003014944,0.00009467917,0.0007058611,0.0002855807,0.38364074,0.30015156,0.04557258,0.008109665,0.25477427],"study_design_scores_gemma":[0.000069398324,0.0001669979,0.0006310178,0.000007802182,0.000013448219,0.00013611317,0.000021042462,0.9231847,0.06881571,0.0032393401,0.0037052596,0.0000091404245],"about_ca_topic_score_codex":0.0010421055,"about_ca_topic_score_gemma":0.0012234628,"teacher_disagreement_score":0.0034295358,"about_ca_system_score_codex":0.00032940792,"about_ca_system_score_gemma":0.00037893778,"threshold_uncertainty_score":0.01147294},"labels":[],"label_agreement":null},{"id":"W2105190415","doi":"10.1109/tcsvt.2006.888838","title":"Error Concealment for Scalable Motion-Compensated Subband/Wavelet Video Coders","year":2007,"lang":"en","type":"article","venue":"IEEE Transactions on Circuits and Systems for Video Technology","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Queensland Cyber Infrastructure Foundation","keywords":"Motion compensation; Computer science; Quarter-pixel motion; Computer vision; Artificial intelligence; Wavelet; Motion estimation; Error concealment; Scalability; Motion (physics); Block-matching algorithm; Algorithm; Video processing; Video tracking; Decoding methods","score_opus":0.032543246784931985,"score_gpt":0.29271815741675605,"score_spread":0.2601749106318241,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2105190415","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13175665,0.0007723076,0.86541563,0.0001494819,0.00006123672,0.000039507697,0.00004873736,0.00057232636,0.0011840751],"genre_scores_gemma":[0.6395909,0.00067969225,0.35480797,0.00006686395,0.000047256683,0.000039270457,0.00017814359,0.000099665376,0.0044901893],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99964666,0.0000493036,0.00002053436,0.000025724414,0.00023158311,0.000026220827],"domain_scores_gemma":[0.99917966,0.00024012425,0.00014960415,0.00016199655,0.00023236913,0.00003619903],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00057995954,0.00040885477,0.0002875523,0.00048073486,0.00018351193,0.0003480728,0.00041984295,0.00038510092,0.0009815454],"category_scores_gemma":[0.0018076643,0.000121561,0.0002195017,0.00036562487,0.00028180052,0.00067267206,0.00048786477,0.00043134834,0.0003045012],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0013082251,0.00011271083,0.001350216,0.00014444241,0.000053828153,0.00027126796,0.00016530567,0.12942177,0.33029056,0.012969996,0.0020902744,0.52182144],"study_design_scores_gemma":[0.000043817236,0.00018329111,0.0007464892,0.00002319764,0.000020520809,0.00025397117,0.000031447016,0.78779936,0.20678042,0.0019105212,0.0021863724,0.00002053279],"about_ca_topic_score_codex":0.0018921897,"about_ca_topic_score_gemma":0.002170584,"teacher_disagreement_score":0.0018921897,"about_ca_system_score_codex":0.00037621212,"about_ca_system_score_gemma":0.0003664716,"threshold_uncertainty_score":0.0037623644},"labels":[],"label_agreement":null},{"id":"W2105508851","doi":"10.1109/wescan.1995.493971","title":"A new scheme for progressive image transmission and flexible reconstruction with DCT","year":2002,"lang":"en","type":"article","venue":"","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"","keywords":"Discrete cosine transform; Iterative reconstruction; Sorting; Coding (social sciences); Image (mathematics); Computer science; Computer vision; Artificial intelligence; Transmission (telecommunications); Image quality; Scheme (mathematics); Algorithm; Mathematics; Telecommunications; Statistics","score_opus":0.016727022203883314,"score_gpt":0.25662008502251005,"score_spread":0.23989306281862674,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2105508851","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005979054,0.00066292664,0.9863235,0.00019298661,0.0003324601,0.00016018387,0.00008586324,0.00062869623,0.0056343796],"genre_scores_gemma":[0.07256337,0.0010510521,0.91197044,0.00018830817,0.00025768223,0.00018471864,0.0002783938,0.00015038486,0.013355616],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99961865,0.000037310358,0.000027391505,0.000068255096,0.00021611019,0.000032190575],"domain_scores_gemma":[0.9997389,0.000042242715,0.000021365897,0.00009092434,0.00007880802,0.000027827848],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039230293,0.00041434614,0.00046958713,0.0009360482,0.00053094863,0.0006334646,0.00085268856,0.00052949385,0.0034723682],"category_scores_gemma":[0.0007049916,0.00029722246,0.000455698,0.00073826814,0.00053631316,0.0012322523,0.0008890697,0.0010164973,0.0011165332],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003052928,0.00007656976,0.0002436085,0.0003109302,0.000039331455,0.00046187956,0.00021908575,0.011355052,0.3788004,0.117149845,0.007834664,0.48320332],"study_design_scores_gemma":[0.00030558548,0.0008629505,0.0010155715,0.00016782286,0.00014311136,0.0060418686,0.00008866495,0.3744535,0.31116405,0.03134504,0.27416113,0.00025076483],"about_ca_topic_score_codex":0.0005586812,"about_ca_topic_score_gemma":0.0009057278,"teacher_disagreement_score":0.0034723682,"about_ca_system_score_codex":0.00030161452,"about_ca_system_score_gemma":0.0004143971,"threshold_uncertainty_score":0.01161617},"labels":[],"label_agreement":null},{"id":"W2106003790","doi":"10.1109/pacrim.1991.160820","title":"Custom versus standard architectures for implementing speech coding algorithms","year":2002,"lang":"en","type":"article","venue":"","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Datapath; Computer science; Application-specific integrated circuit; Vector quantization; Algorithm; Digital signal processing; Arithmetic logic unit; Coding (social sciences); Codebook; Lattice phase equaliser; Quantization (signal processing); Digital signal processor; Computer hardware; Arithmetic; Parallel computing; Adaptive filter; Mathematics","score_opus":0.05838250794087418,"score_gpt":0.33263038925786537,"score_spread":0.2742478813169912,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2106003790","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16643755,0.0016810789,0.7666963,0.00046320536,0.00057896116,0.00045036056,0.0003766903,0.012353103,0.050962772],"genre_scores_gemma":[0.5866949,0.0010115154,0.3799818,0.0005061483,0.00021007664,0.00027042013,0.00075142994,0.0006171717,0.02995646],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993936,0.0000723474,0.000039467996,0.0001229894,0.0002805398,0.0000910471],"domain_scores_gemma":[0.99929154,0.000128676,0.00007212584,0.00017933102,0.00028991167,0.000038415023],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004279987,0.000496192,0.0001953913,0.0005998345,0.00027970437,0.0008011623,0.0019514266,0.00042315177,0.008813267],"category_scores_gemma":[0.0010964151,0.00024036679,0.00026887964,0.00072639476,0.00026408647,0.0010147812,0.00040613263,0.00058000104,0.0021209589],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00093763246,0.00035826256,0.0027486135,0.0005617576,0.00009581256,0.0003693327,0.00016193358,0.020797372,0.29453412,0.031888124,0.018935144,0.6286119],"study_design_scores_gemma":[0.00025204953,0.0016428133,0.004665346,0.00012729592,0.0003102152,0.0027307025,0.00015140585,0.3039569,0.5300415,0.008940779,0.14709121,0.00008969345],"about_ca_topic_score_codex":0.0013366224,"about_ca_topic_score_gemma":0.0034240463,"teacher_disagreement_score":0.008813267,"about_ca_system_score_codex":0.0007744178,"about_ca_system_score_gemma":0.0006900297,"threshold_uncertainty_score":0.029483318},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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)","score_opus":0.01661681195153437,"score_gpt":0.29189627944205837,"score_spread":0.275279467490524,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2106339590","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013179992,0.00035630938,0.98435795,0.00012470747,0.000037341913,0.000059465878,0.00008236006,0.0004453716,0.0013565164],"genre_scores_gemma":[0.22845218,0.00063216005,0.76726526,0.00021382363,0.000086446875,0.00014554358,0.00044817023,0.00015470902,0.0026016727],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997907,0.000018816347,0.000009047195,0.000018548528,0.0001490822,0.000013739879],"domain_scores_gemma":[0.9997639,0.000080272235,0.00003239415,0.000046267836,0.00006382131,0.000013400759],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019004513,0.00041461442,0.00026217883,0.00064352184,0.000122029174,0.00036759867,0.00049946195,0.00031734508,0.0010042656],"category_scores_gemma":[0.0009050217,0.00014497431,0.00035695737,0.0006624805,0.00024130572,0.0005047808,0.0005631217,0.00054980034,0.00034202304],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021486453,0.0000737947,0.0006691162,0.00018331913,0.000043041113,0.0004959341,0.00015927393,0.11684403,0.37250882,0.02135152,0.0053610606,0.48209515],"study_design_scores_gemma":[0.000022802997,0.000109299785,0.00090953003,0.000022315313,0.000016931968,0.0011593953,0.000020959778,0.86574167,0.119897276,0.003482712,0.008580692,0.00003645643],"about_ca_topic_score_codex":0.0008626308,"about_ca_topic_score_gemma":0.0010053933,"teacher_disagreement_score":0.0010042656,"about_ca_system_score_codex":0.00026092128,"about_ca_system_score_gemma":0.00040375552,"threshold_uncertainty_score":0.0033596754},"labels":[],"label_agreement":null},{"id":"W2106418330","doi":"10.1109/icc.1995.524436","title":"An improved 2.4 kbps class-dependent CELP speech coder","year":2002,"lang":"en","type":"article","venue":"","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Code-excited linear prediction; Speech recognition; Computer science; Speech coding; Linear predictive coding; Class (philosophy); Artificial intelligence","score_opus":0.023159980362708936,"score_gpt":0.27530426506072814,"score_spread":0.2521442846980192,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2106418330","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07892252,0.00056836836,0.89782417,0.00050901587,0.00047827102,0.00047160705,0.00056145154,0.011438837,0.0092257755],"genre_scores_gemma":[0.29284608,0.00047294653,0.6646713,0.0009676061,0.00054025406,0.0004892761,0.0021527985,0.0011893056,0.036670383],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9986987,0.0001191682,0.000058370963,0.00018046483,0.0008480675,0.00009529793],"domain_scores_gemma":[0.9979752,0.00044446858,0.000097296215,0.00025266048,0.0011222209,0.000108132015],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007931008,0.0007820525,0.0008254341,0.0009649451,0.00034425373,0.00066064356,0.0012988639,0.0010970624,0.00980608],"category_scores_gemma":[0.0029407148,0.0003282383,0.00038523896,0.00038576635,0.00028369747,0.0010268473,0.0005568646,0.0015740487,0.005515422],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011770595,0.0001715666,0.00084631616,0.00020748109,0.000055590575,0.00054978987,0.00019897937,0.0047407057,0.5853472,0.0024370651,0.0073937667,0.3968745],"study_design_scores_gemma":[0.0003884689,0.0013464445,0.0045698676,0.00008214308,0.00021623747,0.0030886964,0.00007394749,0.22714104,0.6784757,0.00077535486,0.08361062,0.00023150779],"about_ca_topic_score_codex":0.0021766287,"about_ca_topic_score_gemma":0.002662109,"teacher_disagreement_score":0.00980608,"about_ca_system_score_codex":0.0004688987,"about_ca_system_score_gemma":0.0005652531,"threshold_uncertainty_score":0.03280455},"labels":[],"label_agreement":null},{"id":"W2106830833","doi":"10.1109/dcc.2002.999970","title":"On optimal multi-resolution scalar quantization","year":2003,"lang":"en","type":"article","venue":"","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Combinatorics; Mathematics; Quantization (signal processing); Algorithm; Tree (set theory); Binary number; Discrete mathematics; Binary tree; Weighting; Bin; Physics; Arithmetic","score_opus":0.0255864627865077,"score_gpt":0.29584730579849733,"score_spread":0.2702608430119896,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2106830833","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008483095,0.0011582748,0.98596096,0.00016369949,0.000039432278,0.0000336592,0.00006052482,0.0002457828,0.00385461],"genre_scores_gemma":[0.32974327,0.001598282,0.6614255,0.00023025337,0.00010676548,0.00013901599,0.00024551706,0.00015703616,0.006354393],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99899334,0.00028623937,0.00006503859,0.00020222098,0.00036123852,0.00009202656],"domain_scores_gemma":[0.99900097,0.00059450907,0.00006855634,0.00013056866,0.00017984431,0.0000255482],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012302898,0.00074226735,0.0011384322,0.0006616032,0.00046235733,0.0010381459,0.0010450737,0.00085372303,0.0042978083],"category_scores_gemma":[0.0042317444,0.0005138189,0.00044174495,0.0013629457,0.0010321755,0.00212215,0.0013501863,0.0011967779,0.0008144442],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023737793,0.00005083824,0.00045079525,0.00020611177,0.000031099502,0.00007967875,0.00016783748,0.622812,0.008136531,0.13831113,0.004529307,0.22498734],"study_design_scores_gemma":[0.000015794169,0.000033750795,0.00007864999,0.0000135571445,0.0000057970665,0.00003186326,0.000018733766,0.95338297,0.0019772332,0.042064372,0.0023679624,0.000009425825],"about_ca_topic_score_codex":0.0019423383,"about_ca_topic_score_gemma":0.0022834819,"teacher_disagreement_score":0.0042978083,"about_ca_system_score_codex":0.0010787782,"about_ca_system_score_gemma":0.00082102045,"threshold_uncertainty_score":0.014377654},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.04666611885820893,"score_gpt":0.277397535849716,"score_spread":0.23073141699150707,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2107604367","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13601519,0.0037209191,0.8491142,0.00054227666,0.00014006814,0.00029657548,0.0003061516,0.002292574,0.0075720125],"genre_scores_gemma":[0.49806246,0.001997185,0.48113155,0.00038948064,0.00016408753,0.0001616487,0.0004991258,0.00018300382,0.017411498],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99981517,0.000019817086,0.00000895657,0.00002178221,0.00012425844,0.000010062848],"domain_scores_gemma":[0.9997851,0.00007392227,0.000036936945,0.000022643362,0.000070339425,0.000011005613],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017719991,0.00032901778,0.00021774654,0.00044688818,0.00017614503,0.00046366884,0.0005706164,0.00030526568,0.003928012],"category_scores_gemma":[0.00054409704,0.00017212375,0.00016270165,0.00051599235,0.00013552803,0.0004929519,0.00018308757,0.00028681415,0.0007950451],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004927227,0.000044151773,0.00068304385,0.0004023001,0.00003573171,0.00023727253,0.00009525685,0.0030751678,0.6098463,0.0035412994,0.0036741814,0.37787265],"study_design_scores_gemma":[0.00011769694,0.0014249434,0.0041636475,0.00007051153,0.000120873025,0.0023137832,0.000096207215,0.1370691,0.7908012,0.0010107764,0.062743224,0.00006804433],"about_ca_topic_score_codex":0.00075485156,"about_ca_topic_score_gemma":0.0013155544,"teacher_disagreement_score":0.003928012,"about_ca_system_score_codex":0.00029312458,"about_ca_system_score_gemma":0.00030166196,"threshold_uncertainty_score":0.0131405},"labels":[],"label_agreement":null},{"id":"W2108090429","doi":"10.1109/tce.2002.1037027","title":"Robust transmission of JPEG2000 images over noisy channels","year":2002,"lang":"en","type":"article","venue":"IEEE Transactions on Consumer Electronics","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":23,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Computer science; JPEG 2000; Decoding methods; Channel (broadcasting); Bitstream; Image quality; Transmission (telecommunications); Image compression; Code (set theory); Convolutional code; Artificial intelligence; Image (mathematics); Computer vision; Algorithm; Image processing; Computer network; Telecommunications","score_opus":0.023568902041985744,"score_gpt":0.25044956327781837,"score_spread":0.22688066123583261,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2108090429","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16812095,0.0017676788,0.8269193,0.00022131063,0.00010469878,0.000053378404,0.00012669811,0.0006206071,0.0020653845],"genre_scores_gemma":[0.86785245,0.0012201287,0.12784642,0.000082267674,0.00011515862,0.000049881164,0.00020101362,0.000059641436,0.0025729411],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996667,0.00005485724,0.000017685661,0.00004679671,0.00018287351,0.000031148098],"domain_scores_gemma":[0.99934405,0.00023083882,0.00017531104,0.000115278104,0.00011530669,0.00001914441],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039915467,0.00040379053,0.0004172412,0.00029392744,0.00022848816,0.00043317312,0.0004186462,0.00056641636,0.00048209203],"category_scores_gemma":[0.0018568505,0.00017209665,0.000248424,0.00024407964,0.00038693406,0.00058692007,0.00042879133,0.00046388744,0.00025078093],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008374945,0.000061285165,0.001298037,0.00044007273,0.0001033675,0.0007249566,0.00019697515,0.077684484,0.6679258,0.009938586,0.0014936967,0.23929532],"study_design_scores_gemma":[0.000051014435,0.00043863282,0.0022228959,0.000052080464,0.00011256925,0.0017417261,0.00004417989,0.5305685,0.45749006,0.0026660927,0.0045535304,0.000058741618],"about_ca_topic_score_codex":0.0004222538,"about_ca_topic_score_gemma":0.0003949877,"teacher_disagreement_score":0.00056641636,"about_ca_system_score_codex":0.00020635911,"about_ca_system_score_gemma":0.00026078746,"threshold_uncertainty_score":0.002110958},"labels":[],"label_agreement":null},{"id":"W2108631721","doi":"10.1109/icip.1995.537652","title":"Three-dimensional subband video transmission through mobile satellite channels","year":2002,"lang":"en","type":"article","venue":"Proceedings - International Conference on Image Processing","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"Queen's University","funders":"","keywords":"Computer science; Rician fading; Fading; Vector quantization; Channel (broadcasting); Companding; Data compression; Real-time computing; Algorithm; Computer network; Orthogonal frequency-division multiplexing","score_opus":0.050311198427737146,"score_gpt":0.30955753482972265,"score_spread":0.2592463364019855,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2108631721","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6171985,0.0003668,0.37623227,0.00020549004,0.000037714264,0.000028475932,0.00018347095,0.00053993956,0.005207239],"genre_scores_gemma":[0.9769667,0.00015775178,0.022078885,0.000021864069,0.000007676694,0.000007921829,0.00006354072,0.000008389587,0.00068731693],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9999281,0.000009866506,0.0000024957071,0.0000087469525,0.000036775327,0.000013946552],"domain_scores_gemma":[0.9998567,0.000046239442,0.000024241266,0.000024337769,0.00003538299,0.000013054329],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00010328446,0.0001563099,0.00019286548,0.00013553603,0.00017004985,0.00024110172,0.00016701357,0.00017697482,0.00058810407],"category_scores_gemma":[0.00036946952,0.00006926542,0.00012631199,0.0002874616,0.00022113536,0.00025925733,0.00027255708,0.00019390785,0.000105861756],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00059954997,0.000038152062,0.003141181,0.0001298842,0.000042449054,0.00047357328,0.00037498065,0.3554984,0.39077425,0.019099643,0.002095483,0.22773251],"study_design_scores_gemma":[0.000018173263,0.00008864196,0.0016547552,0.00000622306,0.000009528072,0.0001770836,0.000057162764,0.93033236,0.063645296,0.0020713757,0.0019227733,0.000016573871],"about_ca_topic_score_codex":0.00459563,"about_ca_topic_score_gemma":0.0045678196,"teacher_disagreement_score":0.00459563,"about_ca_system_score_codex":0.00032105614,"about_ca_system_score_gemma":0.00033341066,"threshold_uncertainty_score":0.00913775},"labels":[],"label_agreement":null},{"id":"W2108739393","doi":"10.1002/tee.21883","title":"Lossless compression of mammographic images with region‐based predictor selection","year":2013,"lang":"en","type":"article","venue":"IEEJ Transactions on Electrical and Electronic Engineering","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Lossless compression; Computer science; Context (archaeology); Data compression; Lossy compression; Artificial intelligence; Compression (physics); JPEG 2000; Image compression; JPEG; Categorization; Lossless JPEG; Selection (genetic algorithm); Data compression ratio; Pattern recognition (psychology); Data mining; Image (mathematics); Image processing","score_opus":0.0036297897293842587,"score_gpt":0.1842299161095685,"score_spread":0.18060012638018422,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2108739393","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.42523947,0.0033055488,0.56778926,0.0002474381,0.00014911137,0.00008317522,0.00025497557,0.0015214343,0.0014096253],"genre_scores_gemma":[0.7987398,0.0009355903,0.19799215,0.00010478608,0.000097747215,0.00005197765,0.0002819304,0.00006299363,0.0017330894],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99985194,0.000024843055,0.000008576938,0.00002288215,0.00007976951,0.000012028942],"domain_scores_gemma":[0.9996996,0.00011921872,0.000046458517,0.000048611277,0.00007235402,0.000013783351],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000309167,0.0003209561,0.0003269949,0.0006202154,0.00012618281,0.00027055034,0.00038326147,0.00024003745,0.0006271062],"category_scores_gemma":[0.0011434805,0.000115719224,0.00016647695,0.00046553378,0.00014644917,0.00035435104,0.00038834257,0.00027921546,0.00023983317],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012693544,0.0001353326,0.003681215,0.0001509046,0.000049662733,0.00039879262,0.000098915094,0.047869094,0.2020805,0.0013044296,0.0019664878,0.74099535],"study_design_scores_gemma":[0.000056650773,0.00032154957,0.009601066,0.00003711339,0.00007335246,0.00082554657,0.000043491447,0.8234155,0.16181739,0.00088191207,0.0028995445,0.000026871841],"about_ca_topic_score_codex":0.0007177691,"about_ca_topic_score_gemma":0.0010209277,"teacher_disagreement_score":0.0007177691,"about_ca_system_score_codex":0.00013487466,"about_ca_system_score_gemma":0.00022452681,"threshold_uncertainty_score":0.002097845},"labels":[],"label_agreement":null},{"id":"W2108746820","doi":"10.1109/pacrim.1999.799506","title":"Low-complexity reversible integer-to-integer wavelet transforms for image coding","year":2003,"lang":"en","type":"article","venue":"","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Integer (computer science); Wavelet transform; Wavelet; Coding (social sciences); Computer science; Image (mathematics); Algorithm; Mathematics; Theoretical computer science; Artificial intelligence; Statistics","score_opus":0.034573294521803855,"score_gpt":0.3027980246733299,"score_spread":0.26822473015152604,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2108746820","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.021780526,0.0014924998,0.965408,0.00023052917,0.000057725032,0.00007690387,0.0000474196,0.00045962693,0.0104467245],"genre_scores_gemma":[0.31579518,0.0026914703,0.67410314,0.00012567147,0.0000655275,0.00017501568,0.00014343868,0.00011173914,0.006788788],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99989045,0.00002111045,0.0000065409854,0.00001064304,0.000060921466,0.000010367346],"domain_scores_gemma":[0.99979764,0.0001264914,0.000025046547,0.000026215086,0.000019254836,0.000005362347],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002803077,0.0004435989,0.0002635286,0.00037872398,0.00021600812,0.0005138764,0.00048616502,0.00033430886,0.0037131167],"category_scores_gemma":[0.00095453835,0.00017544218,0.00022376727,0.0004195697,0.00035554843,0.00086221704,0.00028858415,0.00067963207,0.0008540571],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018646948,0.0001270958,0.00024417744,0.0006377877,0.000029715486,0.00029249405,0.00012366536,0.06690116,0.2477708,0.26326257,0.0029879054,0.41743618],"study_design_scores_gemma":[0.000115338604,0.0004860565,0.0002931989,0.00010153195,0.00006020872,0.0008799177,0.00007245664,0.62928146,0.24239156,0.09380977,0.032447476,0.00006100838],"about_ca_topic_score_codex":0.00013086747,"about_ca_topic_score_gemma":0.00048007406,"teacher_disagreement_score":0.0037131167,"about_ca_system_score_codex":0.00020658769,"about_ca_system_score_gemma":0.00029324784,"threshold_uncertainty_score":0.012421668},"labels":[],"label_agreement":null},{"id":"W2108774690","doi":"10.1109/titb.2011.2171703","title":"A Channel Differential EZW Coding Scheme for EEG Data Compression","year":2011,"lang":"en","type":"article","venue":"IEEE Transactions on Information Technology in Biomedicine","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Computer science; Electroencephalography; Cluster analysis; Wavelet; Data compression; Channel (broadcasting); Scalability; Coding (social sciences); Differential coding; Encoding (memory); SIGNAL (programming language); Compression (physics); Pattern recognition (psychology); Speech recognition; Algorithm; Artificial intelligence; Decoding methods; Mathematics; Statistics; Psychology; Telecommunications","score_opus":0.05245130010806143,"score_gpt":0.299531608179741,"score_spread":0.24708030807167958,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2108774690","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.020359756,0.00041908643,0.97729915,0.00014020191,0.00008460593,0.000059128928,0.00008463078,0.0002363527,0.0013171547],"genre_scores_gemma":[0.30892864,0.00094072113,0.68379337,0.0002198551,0.00012515143,0.00019242786,0.000493696,0.00005188904,0.0052542044],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998523,0.000025111634,0.000009464852,0.000021307456,0.00007935336,0.000012470381],"domain_scores_gemma":[0.99982613,0.000050702256,0.000016028382,0.000048624013,0.00005068055,0.000007982669],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001927629,0.0003844053,0.00023993677,0.00041301307,0.00018414838,0.00022146368,0.00051953114,0.00031413115,0.0014464642],"category_scores_gemma":[0.0006495784,0.000077296994,0.00018000757,0.0005966776,0.00025852106,0.00058095873,0.0004937245,0.00042512262,0.00037706937],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00031860257,0.0000665348,0.00034908258,0.0001539714,0.000023565939,0.00017316242,0.000083753286,0.03256924,0.24011172,0.0415048,0.0030713922,0.68157417],"study_design_scores_gemma":[0.00007735484,0.0002934039,0.0012455261,0.000045711793,0.000042264688,0.00081765704,0.00004382519,0.77618074,0.18886898,0.01241326,0.019924745,0.00004652065],"about_ca_topic_score_codex":0.000527152,"about_ca_topic_score_gemma":0.0010068647,"teacher_disagreement_score":0.0014464642,"about_ca_system_score_codex":0.00019353362,"about_ca_system_score_gemma":0.00027798777,"threshold_uncertainty_score":0.004838884},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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)","score_opus":0.008954292025601721,"score_gpt":0.29646113296411586,"score_spread":0.28750684093851414,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2108844718","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.041465513,0.0027320853,0.9493301,0.00026499023,0.00022437201,0.00013182478,0.00017302908,0.00083173683,0.0048463773],"genre_scores_gemma":[0.24133869,0.0023460928,0.7431002,0.00016444203,0.00015163679,0.00016450555,0.00055990514,0.00009770223,0.012076691],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99982387,0.000024153496,0.000012576522,0.000022345726,0.00010812444,0.000008872466],"domain_scores_gemma":[0.9998172,0.000054414864,0.000014588547,0.000022815117,0.000081242455,0.0000098206165],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031567577,0.00034718722,0.0002818142,0.0006258929,0.00018292268,0.0004591168,0.0003268428,0.00043970856,0.0022254994],"category_scores_gemma":[0.00073845003,0.00011460964,0.00025502927,0.00077610184,0.00016389826,0.00051330536,0.0002006086,0.00031391438,0.00085377437],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00032597448,0.000106263185,0.0010733902,0.0002903109,0.00006604069,0.00034345812,0.000054527518,0.025826724,0.2454373,0.010363029,0.0052064275,0.71090657],"study_design_scores_gemma":[0.0001346604,0.0005807471,0.0037200155,0.000051236162,0.00009152598,0.002794645,0.000049140624,0.7509119,0.19554451,0.005140965,0.040923685,0.000056980207],"about_ca_topic_score_codex":0.0007935847,"about_ca_topic_score_gemma":0.0012164974,"teacher_disagreement_score":0.0022254994,"about_ca_system_score_codex":0.00020485937,"about_ca_system_score_gemma":0.00034132448,"threshold_uncertainty_score":0.0074449778},"labels":[],"label_agreement":null},{"id":"W2109012182","doi":"10.1109/acssc.2004.1399572","title":"Reduced-delay mixing of compressed speech signals for voip and cellular telephony","year":2005,"lang":"en","type":"article","venue":"","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"PESQ; Computer science; Speech coding; Codebook; Voice over IP; Speech recognition; Telephony; Encoder; Linear predictive coding; Exploit; Voice activity detection; Filter (signal processing); Speech enhancement; Speech processing; Computer network; Algorithm","score_opus":0.020564873402015866,"score_gpt":0.28058079739535985,"score_spread":0.260015923993344,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2109012182","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13477735,0.0018953528,0.85630476,0.000286499,0.00016729406,0.00015461596,0.00015070465,0.0011627009,0.005100782],"genre_scores_gemma":[0.3589308,0.0012713536,0.631545,0.00011317206,0.00015465233,0.00012081251,0.0005898759,0.00021960978,0.007054799],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99980384,0.000034702018,0.000012431305,0.000025947267,0.00010823556,0.000014872692],"domain_scores_gemma":[0.9996574,0.00015486094,0.000037657523,0.000056085366,0.00007784224,0.000016241356],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022785508,0.0005693259,0.00030797906,0.00041625852,0.00026767974,0.0004842318,0.0004159291,0.00046158212,0.0031806733],"category_scores_gemma":[0.0012009288,0.00017643027,0.00031464006,0.000298065,0.00025590687,0.00063209474,0.0003967143,0.0005735909,0.001007643],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00069018983,0.00010009382,0.00042584466,0.00022790191,0.000040434814,0.00015114539,0.00014001317,0.012354377,0.6817597,0.006621523,0.0006363871,0.29685238],"study_design_scores_gemma":[0.00009221429,0.00079332275,0.0016160778,0.000063625346,0.00011132146,0.0011015288,0.00009761494,0.23738971,0.7282255,0.0030248293,0.027420573,0.00006371655],"about_ca_topic_score_codex":0.00063709344,"about_ca_topic_score_gemma":0.0018841451,"teacher_disagreement_score":0.0031806733,"about_ca_system_score_codex":0.0002900928,"about_ca_system_score_gemma":0.00030202715,"threshold_uncertainty_score":0.010640442},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.023812439932931192,"score_gpt":0.25489906340562496,"score_spread":0.23108662347269376,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2109088709","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005320384,0.0008235336,0.9874285,0.0008315206,0.0004801053,0.000048133785,0.00024965705,0.0009872564,0.0038309763],"genre_scores_gemma":[0.09573738,0.0009559022,0.8824908,0.0014481538,0.00045173286,0.00012130822,0.0010054159,0.0003694398,0.017419862],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99904317,0.00015243991,0.000073039424,0.0002227584,0.0004504356,0.000058191465],"domain_scores_gemma":[0.9990163,0.00020637923,0.000064071435,0.0002776445,0.00038515814,0.000050472536],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010232277,0.00047988608,0.0008407748,0.0006773081,0.00038378208,0.0012987086,0.0007699626,0.0015426714,0.009154087],"category_scores_gemma":[0.003268619,0.0002729927,0.0005427863,0.0013946022,0.00062923157,0.003717955,0.0010901002,0.0017903518,0.0032241663],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005428277,0.00015548077,0.00037533222,0.0003105468,0.0000707811,0.00018707098,0.00019255865,0.08601457,0.10648819,0.23715463,0.03502558,0.5334825],"study_design_scores_gemma":[0.00025896743,0.00037544814,0.000427609,0.00007560699,0.000053707245,0.0004746154,0.00004744799,0.8190269,0.029932152,0.082238294,0.06697918,0.00011004383],"about_ca_topic_score_codex":0.0020144668,"about_ca_topic_score_gemma":0.002946513,"teacher_disagreement_score":0.009154087,"about_ca_system_score_codex":0.0007055474,"about_ca_system_score_gemma":0.0010475328,"threshold_uncertainty_score":0.030623436},"labels":[],"label_agreement":null},{"id":"W2109521055","doi":"10.1109/scft.2000.878416","title":"Low-rate quantization of spectral information in a 4 kb/s pitch-synchronous CELP coder","year":2002,"lang":"en","type":"article","venue":"","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Institut National de la Recherche Scientifique","funders":"","keywords":"Code-excited linear prediction; Speech coding; Linear predictive coding; Speech recognition; Quantization (signal processing); Codec2; Computer science; Vector sum excited linear prediction; Vector quantization; Harmonic Vector Excitation Coding; Pitch detection algorithm; Linear prediction; Algorithm; Codec; Speech processing; Telecommunications","score_opus":0.01296558610496955,"score_gpt":0.23757539323739693,"score_spread":0.22460980713242737,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2109521055","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06734662,0.00018528306,0.92905074,0.000092913826,0.00004128649,0.00006444668,0.000052170308,0.0013105861,0.00185603],"genre_scores_gemma":[0.3772874,0.00018474006,0.6181724,0.000059250324,0.00003030158,0.000093710936,0.0001362241,0.000059250382,0.0039766347],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99958616,0.00006226205,0.000024301618,0.00004743455,0.0002545701,0.000025279323],"domain_scores_gemma":[0.99953115,0.00017062157,0.00007247241,0.00006146959,0.00014847374,0.000015823294],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004574391,0.00030910302,0.00022948833,0.00045370072,0.0002497713,0.00043081556,0.0005323967,0.00033065103,0.0011089742],"category_scores_gemma":[0.001260993,0.000154774,0.00012086312,0.00032948234,0.00033342908,0.00045867544,0.0002656575,0.00043392528,0.00061743805],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008299595,0.00010071697,0.0015199472,0.00015334395,0.00002490332,0.0003440621,0.0002482004,0.06756426,0.33820224,0.011847015,0.0019325711,0.5772328],"study_design_scores_gemma":[0.000077600576,0.00034747733,0.0010283289,0.000025494273,0.000024537132,0.000503863,0.000043242002,0.66747284,0.32216892,0.0016699976,0.0066038384,0.000033841196],"about_ca_topic_score_codex":0.0016774909,"about_ca_topic_score_gemma":0.0024120351,"teacher_disagreement_score":0.0016774909,"about_ca_system_score_codex":0.00042414002,"about_ca_system_score_gemma":0.0005192378,"threshold_uncertainty_score":0.0037099123},"labels":[],"label_agreement":null},{"id":"W2109590387","doi":"10.1109/icvd.1995.512111","title":"VLSI implementation of variable resolution image compression","year":2002,"lang":"en","type":"article","venue":"","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Computer science; Codec; Data compression; Very-large-scale integration; Computer hardware; Teleconference; Decoding methods; Image compression; Pixel; Computer vision; Real-time computing; Embedded system; Image processing; Image (mathematics); Multimedia; Telecommunications","score_opus":0.02074752130283243,"score_gpt":0.30272393446229845,"score_spread":0.28197641315946603,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2109590387","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14789365,0.002339785,0.7781869,0.00053847185,0.00041523506,0.0003030488,0.00032683276,0.008659876,0.061336227],"genre_scores_gemma":[0.7410901,0.0008182811,0.24212514,0.0002455254,0.00009330841,0.00012872349,0.00049588276,0.00008191619,0.01492107],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9998541,0.000017679533,0.000007989137,0.000019458581,0.00007061091,0.0000302637],"domain_scores_gemma":[0.9997731,0.000050601026,0.000013320786,0.00002684009,0.00012786048,0.000008306398],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000119780845,0.00022469257,0.00016019838,0.00032369312,0.0001766897,0.00044559862,0.0006105542,0.0003009573,0.005142489],"category_scores_gemma":[0.00056074065,0.00011278135,0.0001094065,0.0003406941,0.00014598237,0.0003091941,0.00016707441,0.0002523556,0.0010196485],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002431183,0.00011287283,0.0011578676,0.00032228694,0.00004710349,0.0003897516,0.00015035273,0.02198985,0.3953453,0.019115372,0.010008933,0.55111706],"study_design_scores_gemma":[0.0002158606,0.001386446,0.0035256122,0.00010065828,0.00010019273,0.0014530605,0.00008157428,0.32570145,0.5688757,0.004763468,0.09374592,0.000050065868],"about_ca_topic_score_codex":0.0011675283,"about_ca_topic_score_gemma":0.0015182326,"teacher_disagreement_score":0.005142489,"about_ca_system_score_codex":0.0003096493,"about_ca_system_score_gemma":0.00036640908,"threshold_uncertainty_score":0.017203331},"labels":[],"label_agreement":null},{"id":"W2109659623","doi":"10.1109/ccece.2012.6334859","title":"On the convergence and applications of mean shift type algorithms","year":2012,"lang":"en","type":"article","venue":"","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Dimensionality reduction; Algorithm; Preprocessor; Convergence (economics); Computer science; Curse of dimensionality; Subspace topology; Artificial intelligence","score_opus":0.02284797445558296,"score_gpt":0.28991546642443583,"score_spread":0.2670674919688529,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2109659623","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0077531533,0.009397995,0.967573,0.001647391,0.00033646138,0.0000432232,0.00006559418,0.00013702144,0.013046161],"genre_scores_gemma":[0.37516448,0.03356274,0.5691589,0.0015837501,0.0029918342,0.0005683351,0.0004693888,0.0007041735,0.015796412],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9953366,0.0022781338,0.00027492316,0.00053216063,0.0014017598,0.0001764561],"domain_scores_gemma":[0.9698361,0.02405007,0.000663054,0.0013995202,0.0037477794,0.00030350196],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008344,0.0015365806,0.001348761,0.0030570389,0.0012059583,0.00225858,0.0017195318,0.0027074418,0.0032721255],"category_scores_gemma":[0.052889414,0.0007823693,0.0012349414,0.003143864,0.004527914,0.0041607125,0.0038851353,0.0046779267,0.0012010827],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012417836,0.000054259966,0.00091425405,0.0003581409,0.00008199811,0.00012726946,0.00035407158,0.1749233,0.0023571872,0.7348309,0.004215159,0.0816593],"study_design_scores_gemma":[0.000019293238,0.000056275374,0.00028908867,0.00016086065,0.000017822786,0.00011708511,0.00005282107,0.53119075,0.0012435382,0.45952338,0.007297143,0.00003196353],"about_ca_topic_score_codex":0.0020254103,"about_ca_topic_score_gemma":0.0012076257,"teacher_disagreement_score":0.008344,"about_ca_system_score_codex":0.0013879812,"about_ca_system_score_gemma":0.0014517267,"threshold_uncertainty_score":0.044127762},"labels":[],"label_agreement":null},{"id":"W2109912022","doi":"10.1109/glocom.1989.64154","title":"Backward pitch prediction for low-delay speech coding","year":2003,"lang":"en","type":"article","venue":"","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":29,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Pitch detection algorithm; Initialization; Speech recognition; Computer science; Algorithm; Speech coding; Coding (social sciences); Term (time); Linear predictive coding; Speech processing; Block (permutation group theory); Mathematics; Statistics","score_opus":0.020392301094174694,"score_gpt":0.27986141255706976,"score_spread":0.2594691114628951,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2109912022","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0044488176,0.00040646462,0.9918853,0.00007597348,0.000102542246,0.000044643857,0.000063893895,0.0012021599,0.0017701938],"genre_scores_gemma":[0.1219757,0.00081021735,0.8657977,0.00010965863,0.00009667922,0.00014475283,0.00047357328,0.00024467625,0.010347027],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99979347,0.000038635004,0.000012556689,0.00002764062,0.000111490546,0.00001629688],"domain_scores_gemma":[0.99965024,0.00014783593,0.000021330858,0.00005307962,0.00011437372,0.000013098107],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038942357,0.00052071724,0.00023652246,0.00034727412,0.00038337128,0.0005492433,0.0005917557,0.0005109327,0.0056261476],"category_scores_gemma":[0.0011343997,0.00021292105,0.00016880124,0.00040703863,0.0002552572,0.0005881419,0.00048151566,0.00091020524,0.0025305082],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003371158,0.00006267749,0.00071706617,0.00016310338,0.000019633022,0.00023445844,0.00009572227,0.06284598,0.12995078,0.031988103,0.0068606935,0.76672465],"study_design_scores_gemma":[0.00003616307,0.00009215358,0.00056148786,0.000048891496,0.000019568772,0.00030392862,0.000014032787,0.88575,0.080091685,0.009839342,0.023214288,0.00002836859],"about_ca_topic_score_codex":0.0030148763,"about_ca_topic_score_gemma":0.004103139,"teacher_disagreement_score":0.0056261476,"about_ca_system_score_codex":0.00042602976,"about_ca_system_score_gemma":0.0006329519,"threshold_uncertainty_score":0.0188213},"labels":[],"label_agreement":null},{"id":"W2109918841","doi":"","title":"G.711.1: A wideband extension to ITU-T G.711","year":2008,"lang":"en","type":"article","venue":"","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"VoiceAge (Canada)","funders":"","keywords":"Codec; Computer science; Wideband audio; Wideband; Telephony; Scalability; Extension (predicate logic); Voice over IP; Computer network; Speech recognition; Speech coding; Telecommunications; Electronic engineering; The Internet; Engineering; Programming language; Operating system","score_opus":0.03312685782615935,"score_gpt":0.28055676535991114,"score_spread":0.2474299075337518,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2109918841","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04636564,0.011283276,0.716969,0.0028297424,0.004229931,0.0023025903,0.010762999,0.026331723,0.17892511],"genre_scores_gemma":[0.30602866,0.0138782635,0.46000203,0.004227996,0.002454247,0.0033995265,0.058022168,0.0064253057,0.14556177],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9982626,0.00037040107,0.00012948904,0.00015802315,0.00080968795,0.00026978494],"domain_scores_gemma":[0.99799806,0.00023643534,0.00016063754,0.0003237901,0.0011759484,0.000105233405],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013584975,0.0013639884,0.00067846844,0.002080544,0.00060672156,0.0013666371,0.0010347497,0.0020629968,0.008545155],"category_scores_gemma":[0.0033290284,0.000271523,0.00038175145,0.0014911956,0.0005499654,0.0008177131,0.00097661,0.0013590779,0.015895462],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0017479595,0.00022904592,0.0016036998,0.0011471448,0.000065168424,0.0013571488,0.0006783987,0.01732738,0.17429426,0.0578999,0.14956148,0.59408844],"study_design_scores_gemma":[0.00013891244,0.00076358655,0.0029546567,0.00033370368,0.00011279897,0.0017875767,0.00013818797,0.02503525,0.08235571,0.0069212294,0.8792673,0.00019119325],"about_ca_topic_score_codex":0.0037967092,"about_ca_topic_score_gemma":0.0027443862,"teacher_disagreement_score":0.008545155,"about_ca_system_score_codex":0.0009116165,"about_ca_system_score_gemma":0.0013726935,"threshold_uncertainty_score":0.028586388},"labels":[],"label_agreement":null},{"id":"W2109922022","doi":"10.1109/iscas.1992.229941","title":"A neural vector quantizer","year":2003,"lang":"en","type":"article","venue":"","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Vector quantization; Artificial neural network; Learning vector quantization; Linde–Buzo–Gray algorithm; Computer science; Quantization (signal processing); Artificial intelligence; Computation; Data compression; Pattern recognition (psychology); Algorithm","score_opus":0.021836505945925733,"score_gpt":0.2840735348214413,"score_spread":0.2622370288755156,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2109922022","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0042638658,0.0019536866,0.9815678,0.00041057606,0.00035539805,0.00010494461,0.00024665173,0.0012005848,0.009896408],"genre_scores_gemma":[0.2380194,0.0034887313,0.71925324,0.00084237824,0.0003941097,0.00035368762,0.0010846192,0.00024131271,0.036322527],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99939847,0.00008323269,0.000039128714,0.00012455363,0.00031846162,0.000036223395],"domain_scores_gemma":[0.9995239,0.00013134531,0.00003277473,0.00008914483,0.0002025533,0.000020263646],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006986024,0.00046311822,0.000737676,0.0006491403,0.0005352247,0.0012782058,0.0010881511,0.0008249254,0.008265443],"category_scores_gemma":[0.002121946,0.00023817648,0.00034984725,0.0012085163,0.0005523107,0.0022939884,0.0009264475,0.0011705986,0.0021764082],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020727012,0.000073244315,0.0004931077,0.00030340417,0.000068153335,0.000112427915,0.00009376027,0.06880431,0.03158473,0.12968585,0.014835057,0.7537387],"study_design_scores_gemma":[0.000081444414,0.00019520812,0.0005288902,0.00010382168,0.0000709934,0.00035876577,0.000053123345,0.8165138,0.03129993,0.06035416,0.09038247,0.000057328827],"about_ca_topic_score_codex":0.00293508,"about_ca_topic_score_gemma":0.0030761259,"teacher_disagreement_score":0.008265443,"about_ca_system_score_codex":0.00063521,"about_ca_system_score_gemma":0.0009992808,"threshold_uncertainty_score":0.027650654},"labels":[],"label_agreement":null},{"id":"W2109959396","doi":"10.1109/ccece.1998.682710","title":"Statistically optimized JPEG for image classes: a case study on financial document image compression","year":2002,"lang":"en","type":"article","venue":"","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"JPEG; Quantization (signal processing); Computer science; Table (database); Artificial intelligence; Discrete cosine transform; Computer vision; Image compression; Data compression; Image (mathematics); Point (geometry); Image quality; Lossless JPEG; Pattern recognition (psychology); Image processing; Data mining; Mathematics","score_opus":0.03124569207927155,"score_gpt":0.34024050861878724,"score_spread":0.3089948165395157,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2109959396","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8328543,0.0007841465,0.15893567,0.0008271459,0.00003688507,0.00025287634,0.00032019406,0.0005583735,0.005430469],"genre_scores_gemma":[0.9154087,0.0003058167,0.08194643,0.00007296185,0.000026865904,0.000043339256,0.00021618068,0.00009789723,0.0018820086],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992812,0.00012295585,0.000039351264,0.00006726345,0.0004313616,0.000057971556],"domain_scores_gemma":[0.997375,0.0018601925,0.0001530149,0.00028494294,0.00027510314,0.000051665706],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008450429,0.00030117604,0.00040240752,0.00076315005,0.00048985897,0.0007371883,0.0006078285,0.0008499232,0.0010710297],"category_scores_gemma":[0.006484637,0.00013731116,0.00031635698,0.0013508655,0.0006146383,0.0010163786,0.00032492337,0.0005021715,0.00017314465],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010916252,0.00071684463,0.024641018,0.0005504028,0.000107156586,0.004602528,0.00083983975,0.17390545,0.054989915,0.024717966,0.006274762,0.7075625],"study_design_scores_gemma":[0.00016689564,0.0007703793,0.02388937,0.00004565628,0.000097482494,0.009531122,0.0005191191,0.83666295,0.10509131,0.012270546,0.010838492,0.00011669752],"about_ca_topic_score_codex":0.0032752499,"about_ca_topic_score_gemma":0.005030578,"teacher_disagreement_score":0.0032752499,"about_ca_system_score_codex":0.0006668307,"about_ca_system_score_gemma":0.0003310576,"threshold_uncertainty_score":0.006512344},"labels":[],"label_agreement":null},{"id":"W2110220300","doi":"10.1109/icc.2009.5305946","title":"Improved Joint Source-Channel Decoding of JPEG2000 Images and Reed-Solomon Codes","year":2009,"lang":"en","type":"article","venue":"","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Decoding methods; Computer science; JPEG 2000; Joint (building); List decoding; Context (archaeology); Soft-decision decoder; Coding (social sciences); Error detection and correction; Sequential decoding; Algorithm; Theoretical computer science; Concatenated error correction code; Image compression; Artificial intelligence; Block code; Image (mathematics); Mathematics; Image processing; Engineering","score_opus":0.016825279874108496,"score_gpt":0.2631675894985449,"score_spread":0.2463423096244364,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2110220300","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.066129915,0.0011736469,0.92673767,0.00021464107,0.0001492503,0.00006945691,0.00009829871,0.001919689,0.0035073576],"genre_scores_gemma":[0.3770237,0.00074052345,0.61082625,0.000107487715,0.000117008094,0.00006374804,0.00042542268,0.0003224378,0.010373552],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99863845,0.00022484988,0.00006564481,0.00012290911,0.00082297035,0.00012515724],"domain_scores_gemma":[0.99867564,0.00044260797,0.00010481461,0.00034735247,0.00037845105,0.000051094205],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00097647915,0.0008923885,0.0008627594,0.0006041707,0.00025462185,0.0006925348,0.00072879734,0.0008284726,0.001577685],"category_scores_gemma":[0.0033181596,0.00033607025,0.00053359696,0.00057643757,0.00048778276,0.0013241009,0.0011186934,0.0013531317,0.0012562728],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011480221,0.0002317186,0.0018833512,0.00037903705,0.00014376624,0.0005387007,0.00029666242,0.22170718,0.27793258,0.038028117,0.0032112964,0.4544996],"study_design_scores_gemma":[0.000066186825,0.00030212812,0.00070902845,0.000032509568,0.0000620186,0.0006250558,0.00002764237,0.6969489,0.28602067,0.0048035765,0.010323448,0.000078828205],"about_ca_topic_score_codex":0.0013735514,"about_ca_topic_score_gemma":0.0022785272,"teacher_disagreement_score":0.001577685,"about_ca_system_score_codex":0.00036149408,"about_ca_system_score_gemma":0.0009375088,"threshold_uncertainty_score":0.005277872},"labels":[],"label_agreement":null},{"id":"W2110259592","doi":"10.1109/ccece.2000.849672","title":"Fixed-order decoding for vector quantization over noisy channels","year":2002,"lang":"en","type":"article","venue":"","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"","keywords":"Decoding methods; Computer science; Soft-decision decoder; Algorithm; Quantization (signal processing); Sequence (biology); Channel (broadcasting); Vector quantization; Perceptron; Artificial intelligence; Artificial neural network; Telecommunications","score_opus":0.04095458103177037,"score_gpt":0.29787115777682854,"score_spread":0.2569165767450582,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2110259592","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01916546,0.00055155536,0.9785743,0.00018125822,0.000039320064,0.000021035496,0.000040067636,0.00017255645,0.0012545462],"genre_scores_gemma":[0.6749999,0.0013939308,0.31635588,0.00018450044,0.00014081734,0.00010009672,0.00018447949,0.000102582395,0.0065377504],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990031,0.00034121893,0.000073405754,0.00015299786,0.00033740155,0.00009192141],"domain_scores_gemma":[0.9971198,0.0020590546,0.0001779427,0.00029878676,0.00030833858,0.00003613298],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015878305,0.00052077434,0.0008932179,0.00042458033,0.00043102814,0.0010585916,0.0008108531,0.0013032567,0.0016137263],"category_scores_gemma":[0.0072159576,0.00026531704,0.00032757054,0.0007184925,0.0011698406,0.001943198,0.000755905,0.0011285018,0.00037542442],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00025842438,0.000043106025,0.0004975445,0.00023315636,0.000047606845,0.0001764351,0.00017530333,0.65284187,0.008797317,0.19440533,0.0011552193,0.1413686],"study_design_scores_gemma":[0.000013147083,0.000033194003,0.000054782227,0.000013357914,0.0000068634668,0.00005372183,0.000009617327,0.95764965,0.0050572115,0.036388934,0.00070779544,0.000011744399],"about_ca_topic_score_codex":0.0025656035,"about_ca_topic_score_gemma":0.0021694305,"teacher_disagreement_score":0.0025656035,"about_ca_system_score_codex":0.0009961297,"about_ca_system_score_gemma":0.0011046986,"threshold_uncertainty_score":0.008397341},"labels":[],"label_agreement":null},{"id":"W2110315109","doi":"10.1109/ccece.2002.1015247","title":"A study of bit planes for the compression of raw synthetic aperture radar data","year":2003,"lang":"en","type":"article","venue":"","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"","keywords":"Computer science; Synthetic aperture radar; Data compression; Radar; Bit plane; Radar imaging; Lossless compression; Bandwidth (computing); Real-time computing; Electronic engineering; Computer hardware; Algorithm; Computer vision; Telecommunications; Engineering","score_opus":0.07280854037298773,"score_gpt":0.3319473504375606,"score_spread":0.25913881006457284,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2110315109","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23182496,0.006737301,0.7441465,0.00037926482,0.00008939333,0.00011007286,0.00014362056,0.00030670332,0.016262157],"genre_scores_gemma":[0.79061675,0.0053495034,0.19890593,0.00010611307,0.00006471238,0.000078645346,0.00026515455,0.00010016554,0.004513054],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996892,0.00006465191,0.000017760618,0.000021076394,0.0001805293,0.000026786061],"domain_scores_gemma":[0.9979638,0.001546828,0.00016573009,0.000119862576,0.00018149697,0.00002233142],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003712348,0.00039676332,0.00023414141,0.0005825107,0.00021026465,0.0006767816,0.00026540912,0.00032264835,0.0015139326],"category_scores_gemma":[0.0030779878,0.00016053725,0.00016511315,0.0009406467,0.00045882192,0.0009829112,0.00016533905,0.0004825486,0.0003196007],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00049045304,0.00010831852,0.0020282867,0.00048727554,0.000033825334,0.0004541797,0.00024804077,0.23920614,0.16170886,0.28833255,0.0017687691,0.30513337],"study_design_scores_gemma":[0.000019121273,0.00036643972,0.0015889994,0.000087720284,0.00001906739,0.0011313439,0.000078477184,0.83282405,0.12653437,0.028630344,0.008695265,0.000024794135],"about_ca_topic_score_codex":0.0004297196,"about_ca_topic_score_gemma":0.0004647242,"teacher_disagreement_score":0.0015139326,"about_ca_system_score_codex":0.0003525574,"about_ca_system_score_gemma":0.0002254776,"threshold_uncertainty_score":0.0050646067},"labels":[],"label_agreement":null},{"id":"W2110351882","doi":"10.1109/icip.1997.647989","title":"Stack-run coding with space-frequency quantization","year":2002,"lang":"en","type":"article","venue":"","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Quantization (signal processing); Algorithm; Trellis quantization; Wavelet; Computer science; Lossy compression; Decoding methods; Raster graphics; Coding (social sciences); Mathematics; Image compression; Artificial intelligence; Image processing; Image (mathematics); Statistics","score_opus":0.02696283646899276,"score_gpt":0.2510678407603946,"score_spread":0.22410500429140187,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2110351882","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016055118,0.00026499774,0.97969466,0.000099580495,0.000045284996,0.000038856888,0.000032921223,0.0004958893,0.0032727132],"genre_scores_gemma":[0.31991258,0.0004418682,0.6749086,0.00013328428,0.0000793924,0.00012132525,0.00014711049,0.00015614332,0.0040998035],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995407,0.00009511295,0.000029469704,0.00004024472,0.00024800826,0.00004653902],"domain_scores_gemma":[0.9994216,0.00017025945,0.000049173894,0.00016682387,0.0001695955,0.00002257046],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00070364977,0.0004487577,0.00043970125,0.00058662414,0.00036596434,0.00090762833,0.0007485036,0.0006124696,0.0017292809],"category_scores_gemma":[0.0017608393,0.00016485027,0.00039499882,0.0008952535,0.00093399605,0.0016768601,0.0012374865,0.00095781265,0.0005547582],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00039169585,0.0000775346,0.00069818017,0.00016175726,0.000046384954,0.00019375692,0.0003029312,0.12906319,0.07863796,0.27029982,0.00454096,0.51558584],"study_design_scores_gemma":[0.000046650326,0.00023557118,0.00027601197,0.000051834464,0.00003817666,0.0004071264,0.000060438386,0.8399848,0.0749466,0.07059098,0.013297988,0.00006385915],"about_ca_topic_score_codex":0.0021184706,"about_ca_topic_score_gemma":0.0031023088,"teacher_disagreement_score":0.0021184706,"about_ca_system_score_codex":0.0004485013,"about_ca_system_score_gemma":0.00093618425,"threshold_uncertainty_score":0.0057849884},"labels":[],"label_agreement":null},{"id":"W2110370208","doi":"10.1109/icme.2005.1521569","title":"Globally Optimal Uneven Erasure-Protected Multi-Group Packetization of Scalable Codes","year":2005,"lang":"en","type":"article","venue":"","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Network packet; Computer science; Erasure; Decoding methods; Scalability; Fountain code; Binary erasure channel; Transmission (telecommunications); Code (set theory); Erasure code; Sequence (biology); Algorithm; Luby transform code; Theoretical computer science; Channel (broadcasting); Computer network; Block code; Channel capacity; Linear code; Telecommunications","score_opus":0.016319858147127764,"score_gpt":0.2748074896900032,"score_spread":0.2584876315428754,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2110370208","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1047019,0.00022822575,0.892705,0.00019046603,0.000023778086,0.000044379485,0.00004319548,0.0001441325,0.0019188666],"genre_scores_gemma":[0.9052602,0.00024764732,0.09186843,0.00005956388,0.000027990982,0.00007427536,0.000085911655,0.00007298052,0.0023031672],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99956995,0.0001532306,0.000018982208,0.000064938,0.000105733394,0.00008718286],"domain_scores_gemma":[0.9984394,0.0010327983,0.00019662787,0.00016750986,0.00010579466,0.000057911562],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00087135617,0.0006755534,0.000714092,0.00029532914,0.00025139307,0.0004090325,0.0005685892,0.00048193123,0.00081827585],"category_scores_gemma":[0.0037123093,0.0002322535,0.00031033996,0.00047630494,0.00092040654,0.0011104738,0.0010565448,0.0007504255,0.00015962994],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001838414,0.000027755026,0.00031577708,0.000064451306,0.000025612497,0.00014373743,0.00009187482,0.9203128,0.009645189,0.0358473,0.00060084363,0.03274072],"study_design_scores_gemma":[0.00001635494,0.00006770399,0.00006859372,0.0000050156027,0.0000051439006,0.000043905042,0.000021624868,0.9788664,0.006833809,0.013756495,0.00030872456,0.0000061956403],"about_ca_topic_score_codex":0.00078997394,"about_ca_topic_score_gemma":0.00043402912,"teacher_disagreement_score":0.00087135617,"about_ca_system_score_codex":0.0005972992,"about_ca_system_score_gemma":0.0005798424,"threshold_uncertainty_score":0.0046082735},"labels":[],"label_agreement":null},{"id":"W2110410780","doi":"10.14288/1.0064802","title":"Progressive image transmission by linear quadtree coding and wavelet transformation","year":2009,"lang":"en","type":"article","venue":"cIRcle (University of British Columbia)","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Quadtree; Wavelet; Computer science; Coding (social sciences); Computer vision; Artificial intelligence; Transmission (telecommunications); Wavelet transform; Linear map; Image processing; Transformation (genetics); Image (mathematics); Algorithm; Mathematics; Telecommunications","score_opus":0.005854092852538442,"score_gpt":0.19926840962805017,"score_spread":0.19341431677551174,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2110410780","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.053402416,0.0007484021,0.93699795,0.00013375771,0.000057386387,0.00013656582,0.00008102933,0.0006130293,0.00782944],"genre_scores_gemma":[0.3566135,0.0016539702,0.62508714,0.00012600809,0.00006869639,0.0001566731,0.0003152853,0.00016938106,0.015809342],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998091,0.00002264209,0.0000075817707,0.00002035074,0.00011953736,0.000020747491],"domain_scores_gemma":[0.9998173,0.0000550836,0.000022859353,0.000036274778,0.000059451697,0.000008983211],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022810115,0.00025811663,0.00020947226,0.0005203791,0.00017906229,0.00041936975,0.00044448013,0.00029495065,0.0021511263],"category_scores_gemma":[0.00070053886,0.00018027071,0.00030414958,0.0006769281,0.0003185178,0.0007641554,0.00055059587,0.00039535743,0.00079564465],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016688457,0.000075762524,0.000518577,0.0002457984,0.000033560154,0.0004220656,0.00028528238,0.027092066,0.5021615,0.039605252,0.0028775004,0.42651576],"study_design_scores_gemma":[0.0001286783,0.0005529508,0.0022283448,0.00010837143,0.00008810551,0.0029303026,0.00018392666,0.5573868,0.37638643,0.023939813,0.035978843,0.00008735828],"about_ca_topic_score_codex":0.0011960053,"about_ca_topic_score_gemma":0.0014278358,"teacher_disagreement_score":0.0021511263,"about_ca_system_score_codex":0.00018709144,"about_ca_system_score_gemma":0.00028458712,"threshold_uncertainty_score":0.0071962476},"labels":[],"label_agreement":null},{"id":"W2110429185","doi":"10.1109/lsp.2004.824054","title":"Competitive Splitting for Codebook Initialization","year":2004,"lang":"en","type":"article","venue":"IEEE Signal Processing Letters","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":23,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Codebook; Initialization; Linde–Buzo–Gray algorithm; Vector quantization; Computer science; Code (set theory); Algorithm; Scheme (mathematics); Code word; Quantization (signal processing); Artificial intelligence; Pattern recognition (psychology); Mathematics; Decoding methods","score_opus":0.022905612856052852,"score_gpt":0.2849617544417169,"score_spread":0.26205614158566404,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2110429185","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005527023,0.00023642032,0.99117106,0.000052703526,0.000053468226,0.000068798756,0.000018211715,0.00034090367,0.00253142],"genre_scores_gemma":[0.37375173,0.00036146992,0.620335,0.00024660456,0.0001085607,0.00023475604,0.00026629798,0.00020328302,0.004492378],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998365,0.00047043542,0.00009116546,0.00021761916,0.00070568407,0.00015014554],"domain_scores_gemma":[0.9969849,0.0011290774,0.0001503792,0.0006731916,0.0008992883,0.00016313423],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018373101,0.00072005705,0.0007638147,0.0007165266,0.00074292475,0.0010078773,0.0017303539,0.001105613,0.0032872485],"category_scores_gemma":[0.008304587,0.00040722592,0.000458456,0.0010425042,0.0012573968,0.0018410158,0.0018087097,0.0015747336,0.0018969752],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00070897926,0.00013054103,0.00086994865,0.00021706073,0.00006283715,0.00019194126,0.0003066704,0.19861335,0.055822488,0.16646665,0.008611721,0.5679979],"study_design_scores_gemma":[0.00005321625,0.00020061337,0.00018483451,0.000021391088,0.000014505135,0.00026274638,0.000028501669,0.92721003,0.03251026,0.03253189,0.006942233,0.000039840103],"about_ca_topic_score_codex":0.0018598312,"about_ca_topic_score_gemma":0.001921805,"teacher_disagreement_score":0.0032872485,"about_ca_system_score_codex":0.0010060531,"about_ca_system_score_gemma":0.0011164189,"threshold_uncertainty_score":0.010996938},"labels":[],"label_agreement":null},{"id":"W2110522925","doi":"10.1109/tip.2012.2187529","title":"Efficient Rate–Distortion Optimal Packetization of Embedded Bitstreams Into Independent Source Packets","year":2012,"lang":"en","type":"article","venue":"IEEE Transactions on Image Processing","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Network packet; Erasure; Computer science; Algorithm; Distortion (music); Decoding methods; Interleaving; Computer network; Bandwidth (computing)","score_opus":0.011810407312742953,"score_gpt":0.27620341348650657,"score_spread":0.2643930061737636,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2110522925","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.044167813,0.00030264576,0.95330864,0.0001341271,0.000025883906,0.000076603625,0.000049830724,0.00029699533,0.0016374642],"genre_scores_gemma":[0.5562653,0.000532669,0.4385307,0.00012014125,0.000045815155,0.0001625511,0.00027774138,0.00015843907,0.003906651],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99958605,0.00010086447,0.000024560746,0.000075408745,0.00012968952,0.000083525134],"domain_scores_gemma":[0.9992829,0.00043003028,0.00007021893,0.00007818248,0.00010785283,0.00003089817],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006872824,0.0008851447,0.000959516,0.0004387805,0.00024655377,0.000831846,0.00087179086,0.0006518957,0.0013302763],"category_scores_gemma":[0.0020360567,0.00036217982,0.00050594483,0.000603349,0.0005039546,0.001367981,0.0009912513,0.0009755289,0.00025750336],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00033613582,0.00010622634,0.00044775946,0.00011789691,0.00003990937,0.0001329105,0.000096604956,0.7685071,0.0273651,0.012602973,0.0015279761,0.18871933],"study_design_scores_gemma":[0.00001257778,0.00005898689,0.000059545764,0.0000034372983,0.000004906069,0.000040260147,0.000018413391,0.9899733,0.0071352813,0.0023266065,0.0003617226,0.000004893761],"about_ca_topic_score_codex":0.0017380508,"about_ca_topic_score_gemma":0.001459485,"teacher_disagreement_score":0.0017380508,"about_ca_system_score_codex":0.00085593824,"about_ca_system_score_gemma":0.0010892801,"threshold_uncertainty_score":0.0062102675},"labels":[],"label_agreement":null},{"id":"W2111649770","doi":"10.1109/isccsp.2008.4537345","title":"Image compression through optimized linear mapping and parametrically generated features","year":2008,"lang":"en","type":"article","venue":"","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Quantization (signal processing); Algorithm; Image compression; Computer science; Computation; Mathematics; Data compression; Image processing; Image (mathematics); Artificial intelligence","score_opus":0.036944036752175044,"score_gpt":0.2927849105010156,"score_spread":0.25584087374884057,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2111649770","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.027217383,0.00015639102,0.9710977,0.000053274256,0.00001624812,0.000021395892,0.000015804364,0.00039115417,0.0010305702],"genre_scores_gemma":[0.4209,0.00023839086,0.5750376,0.00006791634,0.0000418456,0.00006795166,0.00011641916,0.00012213663,0.0034078034],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999782,0.000038556012,0.000010344199,0.00003177989,0.00012269823,0.000014589565],"domain_scores_gemma":[0.99976665,0.00008166566,0.000033807813,0.000071985414,0.00003936572,0.0000065676645],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025452257,0.00031235843,0.0003596343,0.00032686305,0.00013385825,0.00036400888,0.000595887,0.00037690098,0.0010257555],"category_scores_gemma":[0.0009249076,0.00016965241,0.00020221155,0.00045269067,0.00040183234,0.0008159038,0.00044243204,0.00046040837,0.00040604363],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002843434,0.00010229873,0.00047520956,0.00015833839,0.000029104409,0.00023767051,0.0001533533,0.20283702,0.21733361,0.039383978,0.0014317182,0.53757334],"study_design_scores_gemma":[0.000013892948,0.00014084659,0.00025382554,0.000007826186,0.0000067848177,0.00035107296,0.000009893699,0.92586774,0.06573528,0.005001948,0.0025944184,0.000016473126],"about_ca_topic_score_codex":0.00017593219,"about_ca_topic_score_gemma":0.00019228176,"teacher_disagreement_score":0.0010257555,"about_ca_system_score_codex":0.00020819649,"about_ca_system_score_gemma":0.00016281153,"threshold_uncertainty_score":0.0034315586},"labels":[],"label_agreement":null},{"id":"W2111850347","doi":"10.1109/wescan.1993.270516","title":"Codebook searching for 4.8 kbps CELP speech coder","year":2002,"lang":"en","type":"article","venue":"","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Winnipeg; University of Manitoba","funders":"","keywords":"Code-excited linear prediction; Codebook; Computer science; Speech coding; Linear predictive coding; Vector sum excited linear prediction; Speech recognition; Linear prediction; Voice activity detection; Coding (social sciences); Codec2; Speech processing; Artificial intelligence; Mathematics","score_opus":0.055370918309093325,"score_gpt":0.29928013828806677,"score_spread":0.24390921997897344,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2111850347","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010003418,0.0002950029,0.975989,0.00015758655,0.000096695665,0.00018849582,0.00046061573,0.0054053213,0.0074038426],"genre_scores_gemma":[0.09075752,0.00016802094,0.8932152,0.00013748526,0.000027300972,0.0003183625,0.0014366332,0.00043960617,0.01349991],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99945134,0.00007322064,0.000038178343,0.000060370137,0.00032329326,0.00005370164],"domain_scores_gemma":[0.9992907,0.00021128748,0.000033282642,0.000086280794,0.00035147427,0.000027017186],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004843876,0.0005867039,0.00037960632,0.000970951,0.0004690751,0.0008522203,0.0010010374,0.00072317984,0.012726104],"category_scores_gemma":[0.0025848893,0.000278466,0.00024203178,0.00066294504,0.00028145817,0.00067245343,0.00067368825,0.0005646693,0.00814925],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006749644,0.000072287294,0.0007572296,0.00027450835,0.000030107425,0.00054257497,0.0002961898,0.039371453,0.11304821,0.030380143,0.022708716,0.7918436],"study_design_scores_gemma":[0.00020724475,0.00022647383,0.0011155707,0.000105012616,0.000043349606,0.00091736426,0.00015919235,0.69260997,0.21887966,0.017356189,0.06829326,0.00008670455],"about_ca_topic_score_codex":0.0053411885,"about_ca_topic_score_gemma":0.006474737,"teacher_disagreement_score":0.012726104,"about_ca_system_score_codex":0.0008403747,"about_ca_system_score_gemma":0.0011304629,"threshold_uncertainty_score":0.042573035},"labels":[],"label_agreement":null},{"id":"W2112109461","doi":"10.1109/dcc.2008.38","title":"Improved Multiple Description Framework Based on Successively Refinable Quantization and Uneven Erasure Protection","year":2008,"lang":"en","type":"article","venue":"DCC","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Quantization (signal processing); Erasure; Algorithm; Gaussian; Computer science; Source code; Decoding methods; Rate distortion; Coding (social sciences); Theoretical computer science; Mathematics; Statistics","score_opus":0.035832012687727385,"score_gpt":0.2539604214551683,"score_spread":0.21812840876744088,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2112109461","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0076478207,0.00028688862,0.99098057,0.00007105022,0.000023641445,0.000037758567,0.00007458749,0.00022325102,0.000654452],"genre_scores_gemma":[0.25325832,0.00045650796,0.7430325,0.00013241122,0.000057593574,0.000117842785,0.00040025165,0.000083757564,0.0024607508],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990336,0.00024533563,0.000057081612,0.000111759415,0.0004802289,0.00007211251],"domain_scores_gemma":[0.9988348,0.00042077014,0.00010168121,0.00030527313,0.00029467227,0.000042769578],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014757856,0.0006387743,0.00070562144,0.0009157817,0.0003136072,0.00070100866,0.0014993501,0.0007509685,0.0018779605],"category_scores_gemma":[0.0029947532,0.00028783426,0.0005701276,0.0007885251,0.0006726794,0.0018053133,0.001173683,0.0010977063,0.0004841005],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00066663494,0.00011231937,0.00091892725,0.00023914597,0.000081103695,0.0005300744,0.0002891617,0.30898917,0.10778652,0.18763818,0.0026454555,0.39010337],"study_design_scores_gemma":[0.000048691527,0.00016921299,0.0001699712,0.000014824889,0.0000195371,0.00024175963,0.000021749569,0.9544156,0.0230441,0.017507333,0.004306867,0.000040231527],"about_ca_topic_score_codex":0.0023216424,"about_ca_topic_score_gemma":0.0019785112,"teacher_disagreement_score":0.0023216424,"about_ca_system_score_codex":0.0006372356,"about_ca_system_score_gemma":0.0011197878,"threshold_uncertainty_score":0.0078047514},"labels":[],"label_agreement":null},{"id":"W2113605853","doi":"10.1109/ccece.2009.5090158","title":"Low-complexity encoding of speech lsf parameters using multistage tree-structured vector quantization: Application to the MELP coder","year":2009,"lang":"en","type":"article","venue":"","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Institut National de la Recherche Scientifique","funders":"","keywords":"Vector quantization; Speech recognition; Computer science; Speech coding; Encoding (memory); Quantization (signal processing); Tree (set theory); Computational complexity theory; Pattern recognition (psychology); Algorithm; Artificial intelligence; Mathematics","score_opus":0.04562347240718082,"score_gpt":0.3220978197662669,"score_spread":0.27647434735908605,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2113605853","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.057094358,0.00032551863,0.94037896,0.00010874578,0.00003488682,0.00006434482,0.00008628043,0.00073683274,0.0011699861],"genre_scores_gemma":[0.35307276,0.00021936286,0.64463395,0.000036383935,0.00002113438,0.00005786252,0.00015160204,0.00004687714,0.0017600046],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99980134,0.000036622005,0.000015364503,0.00001941081,0.00011466909,0.000012591144],"domain_scores_gemma":[0.9995043,0.00020852803,0.00005438191,0.00006879752,0.00015203949,0.000011956812],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030716564,0.0002635869,0.0002659568,0.0003248537,0.00015557387,0.00028252794,0.00038547005,0.00039221055,0.0013434509],"category_scores_gemma":[0.0012216095,0.00010164815,0.00013805529,0.0004181036,0.00020647189,0.00043312937,0.00022535231,0.0002529754,0.00032094048],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00037962905,0.00006989426,0.0005759281,0.0001743833,0.00002293453,0.00022650589,0.00011985635,0.038198765,0.38066316,0.008447847,0.0016857622,0.5694353],"study_design_scores_gemma":[0.00006932557,0.0004965769,0.0013192487,0.00002944564,0.000023659491,0.00082258345,0.00003700644,0.68641657,0.3033682,0.0018027555,0.0055750925,0.00003955397],"about_ca_topic_score_codex":0.0015379552,"about_ca_topic_score_gemma":0.0024349773,"teacher_disagreement_score":0.0015379552,"about_ca_system_score_codex":0.00022704445,"about_ca_system_score_gemma":0.00035324087,"threshold_uncertainty_score":0.0044943094},"labels":[],"label_agreement":null},{"id":"W2113628590","doi":"10.1109/tip.2006.875217","title":"Fast vector quantization algorithms based on nearest partition set search","year":2006,"lang":"en","type":"article","venue":"IEEE Transactions on Image Processing","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":22,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Canadian Space Agency","funders":"","keywords":"Vector quantization; Algorithm; Linde–Buzo–Gray algorithm; Partition (number theory); Nearest neighbor search; Pattern recognition (psychology); Computer science; k-nearest neighbors algorithm; Learning vector quantization; Quantization (signal processing); Artificial intelligence; Mathematics; Combinatorics","score_opus":0.024289483105524277,"score_gpt":0.3018375041602363,"score_spread":0.27754802105471205,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2113628590","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003975764,0.0008178973,0.993554,0.00005730327,0.000093314644,0.00007678174,0.00005363098,0.000565164,0.0008062378],"genre_scores_gemma":[0.092512876,0.0007281196,0.903429,0.000084233965,0.00008543285,0.00023944063,0.0003551706,0.00011821211,0.002447571],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989693,0.00019417785,0.00007025864,0.00012573834,0.0005784422,0.00006213054],"domain_scores_gemma":[0.999119,0.00030162747,0.00008190875,0.00011235216,0.0003575814,0.00002755362],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009563244,0.000718999,0.0015448565,0.00165008,0.0006415017,0.0010928869,0.0017782816,0.0007865225,0.0026991372],"category_scores_gemma":[0.0026575525,0.0004830767,0.0004505369,0.0016916541,0.00057202944,0.0019719736,0.0011472082,0.0011598847,0.00096555485],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020423584,0.00006611,0.00035339003,0.00019565901,0.000051876574,0.000046052148,0.00013161267,0.11869143,0.010861598,0.03901612,0.005998977,0.8243829],"study_design_scores_gemma":[0.00006705953,0.000112517235,0.00027120908,0.00002703931,0.000013153122,0.00013960087,0.00004022173,0.9677871,0.0072469586,0.017437717,0.0068090498,0.000048401598],"about_ca_topic_score_codex":0.0041705375,"about_ca_topic_score_gemma":0.004071835,"teacher_disagreement_score":0.0041705375,"about_ca_system_score_codex":0.0008420236,"about_ca_system_score_gemma":0.001188331,"threshold_uncertainty_score":0.009029508},"labels":[],"label_agreement":null},{"id":"W2113737171","doi":"10.1109/icip.1998.723520","title":"Adaptive image compression based on segmentation and block classification","year":2002,"lang":"en","type":"article","venue":"","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Image compression; JPEG; Artificial intelligence; Computer science; Computer vision; Data compression; Compression ratio; Texture compression; Data compression ratio; Block (permutation group theory); JPEG 2000; Compression (physics); Standard test image; Image segmentation; Pattern recognition (psychology); Human visual system model; Image (mathematics); Image processing; Mathematics","score_opus":0.041465029611095265,"score_gpt":0.2814085684236016,"score_spread":0.23994353881250635,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2113737171","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.085983865,0.001304712,0.90760815,0.00011277948,0.00010977868,0.00014595527,0.00007652643,0.0010961345,0.0035621894],"genre_scores_gemma":[0.38619167,0.0010908407,0.60720897,0.00014357542,0.00014103038,0.00014805561,0.00037585938,0.00014657107,0.004553385],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9998042,0.000020143014,0.000011222518,0.000037007536,0.00010937555,0.000018110317],"domain_scores_gemma":[0.9997378,0.000097619406,0.00004254111,0.00004622191,0.0000632455,0.000012549801],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020234541,0.00029245016,0.0003732049,0.0008963297,0.00016429837,0.0002521021,0.0005141887,0.0003050623,0.00096396054],"category_scores_gemma":[0.0007342646,0.00013353812,0.00020978987,0.00072400115,0.0003284646,0.0006378107,0.00030248016,0.00030003,0.00042421906],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00030682344,0.00008674043,0.0010946258,0.00011536105,0.000029899002,0.0000762698,0.000083728446,0.030150766,0.2736345,0.0057887756,0.0014323697,0.68720025],"study_design_scores_gemma":[0.000059824153,0.00035017385,0.0056896615,0.00003191906,0.000057933154,0.0006870438,0.000027987884,0.79345053,0.1826418,0.005462552,0.01149801,0.000042560758],"about_ca_topic_score_codex":0.0013231322,"about_ca_topic_score_gemma":0.0016162944,"teacher_disagreement_score":0.0013231322,"about_ca_system_score_codex":0.00024680776,"about_ca_system_score_gemma":0.00022495986,"threshold_uncertainty_score":0.0032247305},"labels":[],"label_agreement":null},{"id":"W2113739207","doi":"10.1109/mwscas.1995.510319","title":"Vector quantization of the harmonic spectrum in frequency selective harmonic coding at 2400 bps","year":2002,"lang":"en","type":"article","venue":"","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Communications Research Centre Canada","funders":"","keywords":"Vector quantization; Quantization (signal processing); Speech coding; Harmonic Vector Excitation Coding; Speech recognition; Harmonic analysis; Coding (social sciences); Computer science; Algorithm; Mathematics; Electronic engineering; Engineering","score_opus":0.02889599242505433,"score_gpt":0.25612238955502664,"score_spread":0.2272263971299723,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2113739207","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14022094,0.0023310655,0.8208416,0.00061964703,0.0007209142,0.0001770132,0.00045183842,0.0014643111,0.033172656],"genre_scores_gemma":[0.7075681,0.00090557075,0.27867463,0.00017452054,0.00010606558,0.00009420084,0.0004736759,0.00011119321,0.011892044],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.999686,0.0000621757,0.00001632255,0.000026992739,0.00017772293,0.000030887975],"domain_scores_gemma":[0.99977523,0.00006267862,0.000014840883,0.00003503421,0.00010255064,0.000009716835],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030416434,0.000212984,0.00017186135,0.0003792412,0.00028669057,0.00062024524,0.00025973088,0.0003163974,0.0033716145],"category_scores_gemma":[0.00090062775,0.00008944029,0.00009077071,0.0006153018,0.00036974964,0.0005417182,0.00030009833,0.00032547553,0.00086693914],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006239632,0.00008058444,0.00061046844,0.00016620953,0.000014862108,0.000167054,0.000238841,0.032064382,0.2391416,0.11000411,0.00456648,0.6123215],"study_design_scores_gemma":[0.00009668499,0.0006169552,0.0023361205,0.00021225763,0.00004619219,0.00072925066,0.00029936322,0.4743753,0.3772464,0.069830224,0.07411765,0.00009369842],"about_ca_topic_score_codex":0.0012674532,"about_ca_topic_score_gemma":0.0018725038,"teacher_disagreement_score":0.0033716145,"about_ca_system_score_codex":0.00040487808,"about_ca_system_score_gemma":0.00041928262,"threshold_uncertainty_score":0.011279225},"labels":[],"label_agreement":null},{"id":"W2113974517","doi":"10.1109/icc.2001.936587","title":"Single and double frame quantization of LSF parameters using noise feedback coding","year":2002,"lang":"en","type":"article","venue":"","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Code-excited linear prediction; Quantization (signal processing); Speech coding; Computer science; Coding (social sciences); Algorithm; Speech recognition; Linear predictive coding; Noise shaping; Mathematics; Computer vision","score_opus":0.08637005618570823,"score_gpt":0.2876779407261047,"score_spread":0.20130788454039647,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2113974517","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.102233484,0.00063283485,0.891898,0.00022637169,0.00017578235,0.0002011852,0.00009672968,0.0012094122,0.003326241],"genre_scores_gemma":[0.5683512,0.00016134923,0.4282457,0.00009209127,0.000067291294,0.0001462809,0.000117892174,0.00005315783,0.0027650567],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99964476,0.00007174726,0.000019653422,0.00005465067,0.00017697936,0.000032199983],"domain_scores_gemma":[0.99949133,0.0001906201,0.000058743157,0.00008837073,0.00013437084,0.000036473797],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004339133,0.00057035784,0.00036392908,0.0003669105,0.0003834546,0.00040755095,0.0007988483,0.00065312086,0.0016645193],"category_scores_gemma":[0.001253935,0.00016094524,0.00017673637,0.0002901935,0.0005511629,0.0006361888,0.0005521886,0.0005764518,0.0004349704],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012001013,0.00023716166,0.0013243846,0.00021015025,0.000047669448,0.0004506086,0.00023527273,0.042372726,0.50918394,0.027694931,0.0019051232,0.41513798],"study_design_scores_gemma":[0.00012994002,0.0008221092,0.0006882426,0.000040867944,0.000040246705,0.0005251972,0.000039875657,0.56497204,0.42003077,0.004758848,0.007878957,0.000072965544],"about_ca_topic_score_codex":0.001308278,"about_ca_topic_score_gemma":0.002843856,"teacher_disagreement_score":0.0016645193,"about_ca_system_score_codex":0.00043556583,"about_ca_system_score_gemma":0.00036157918,"threshold_uncertainty_score":0.005568385},"labels":[],"label_agreement":null},{"id":"W2114639633","doi":"10.1109/icpr.2002.1048193","title":"Foveated online 3D visualization","year":2003,"lang":"en","type":"article","venue":"","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Computer science; Visualization; JPEG; Coding (social sciences); Computer graphics (images); Data compression; Computer vision; Data visualization; The Internet; Transform coding; Artificial intelligence; Image (mathematics); Discrete cosine transform; World Wide Web","score_opus":0.020287704913283324,"score_gpt":0.3172474355645799,"score_spread":0.2969597306512966,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2114639633","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.056907047,0.0006697424,0.93325734,0.00020114935,0.00006489809,0.000036481964,0.00013856748,0.004348457,0.00437626],"genre_scores_gemma":[0.52372646,0.0005071134,0.4713219,0.00015445495,0.000065732616,0.000046569283,0.00020220153,0.00032799083,0.0036475796],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99963236,0.00006056938,0.000011371623,0.000070357724,0.00017917727,0.000046117704],"domain_scores_gemma":[0.99943703,0.00017695036,0.00003611996,0.00019921435,0.00011030593,0.000040309602],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003242519,0.0003812243,0.00046916076,0.0005728687,0.00024012582,0.0009676301,0.00089383224,0.00066068134,0.0046099615],"category_scores_gemma":[0.0013792135,0.00025457816,0.00037932274,0.0004127397,0.00044573014,0.0011462382,0.0016423801,0.00045390165,0.000615498],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006932509,0.00013591476,0.0016138946,0.00020354072,0.00007367897,0.00042594812,0.00057824975,0.046729174,0.30373338,0.01965971,0.009453466,0.6166999],"study_design_scores_gemma":[0.00006708765,0.0002467006,0.0024532212,0.00004876706,0.000048231457,0.001288465,0.00018313921,0.79060495,0.16181475,0.015372765,0.02777771,0.00009422732],"about_ca_topic_score_codex":0.0016104777,"about_ca_topic_score_gemma":0.0016528529,"teacher_disagreement_score":0.0046099615,"about_ca_system_score_codex":0.00041028945,"about_ca_system_score_gemma":0.00031844733,"threshold_uncertainty_score":0.015421867},"labels":[],"label_agreement":null},{"id":"W2114729870","doi":"10.1109/icassp.2008.4517668","title":"Efficient 4D motion compensated lossless compression of dynamic volumetric medical image data","year":2008,"lang":"en","type":"article","venue":"Proceedings of the ... IEEE International Conference on Acoustics, Speech, and Signal Processing","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":22,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; Lossless compression; Motion compensation; Data compression; Quarter-pixel motion; Computer vision; Inter frame; Artificial intelligence; Arithmetic coding; Context-adaptive binary arithmetic coding; Reference frame; Algorithm; Frame (networking)","score_opus":0.0549781542454062,"score_gpt":0.3196512130190963,"score_spread":0.26467305877369013,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2114729870","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21099496,0.0026412036,0.7816142,0.0004881623,0.00014794793,0.00013353878,0.0004239559,0.0011393819,0.002416697],"genre_scores_gemma":[0.5825024,0.0015197844,0.4101679,0.0002683963,0.0001231363,0.000111790374,0.0008059561,0.000116590534,0.0043840786],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99980885,0.00002311263,0.000012144009,0.0000154733,0.00012805883,0.00001242165],"domain_scores_gemma":[0.99970007,0.00011508845,0.000040589544,0.000056906018,0.00007821803,0.000009107872],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002504918,0.00032199416,0.00028594374,0.00083230506,0.00012391008,0.0003739134,0.00056362245,0.0003568585,0.0008552823],"category_scores_gemma":[0.0010395794,0.00017105944,0.00020941375,0.0006070967,0.0002081298,0.00055061135,0.0004510904,0.00034047154,0.0003164188],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005490641,0.00007493602,0.00073945447,0.00020697032,0.000034305267,0.0005875917,0.00014162083,0.04599435,0.49510807,0.0035683403,0.00315438,0.44984084],"study_design_scores_gemma":[0.000052390515,0.00021788906,0.0029085958,0.000040724568,0.000034004104,0.0025031888,0.000051066407,0.653147,0.33010295,0.0016420579,0.0092545245,0.000045696383],"about_ca_topic_score_codex":0.0008280764,"about_ca_topic_score_gemma":0.00085365353,"teacher_disagreement_score":0.0008552823,"about_ca_system_score_codex":0.00021003284,"about_ca_system_score_gemma":0.00027459444,"threshold_uncertainty_score":0.0028612614},"labels":[],"label_agreement":null},{"id":"W2114963081","doi":"10.1109/ccece.1997.614808","title":"High-quality image compression using a wavelet transform and left-neighbour-parent dependencies","year":2002,"lang":"en","type":"article","venue":"","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Wavelet transform; Wavelet; Entropy (arrow of time); Mathematics; Quantization (signal processing); Entropy encoding; Discrete wavelet transform; Pattern recognition (psychology); Algorithm; Stationary wavelet transform; Data compression; Artificial intelligence; Computer science; Physics","score_opus":0.058167325908703736,"score_gpt":0.31294179973870556,"score_spread":0.25477447383000185,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2114963081","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16267307,0.0006214318,0.8326768,0.00017382068,0.000031790874,0.00006941527,0.000074391784,0.0005668709,0.0031124367],"genre_scores_gemma":[0.64617157,0.0005683809,0.35116145,0.000061020604,0.00003855527,0.000037810012,0.00014881026,0.000073850424,0.0017385565],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997378,0.000025881374,0.000009880201,0.000026791937,0.0001834525,0.00001623766],"domain_scores_gemma":[0.99969053,0.00013383664,0.000042718624,0.00006344778,0.000052558542,0.000016969541],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039229993,0.00027666442,0.00026225983,0.0004157295,0.00016806409,0.00038692207,0.00034326973,0.00032250813,0.0008357418],"category_scores_gemma":[0.0014333746,0.0001832299,0.00025903422,0.00065139425,0.0004346966,0.00059413584,0.00041615078,0.00045693337,0.0003565494],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005245443,0.00017033875,0.001319067,0.00016547914,0.000051872612,0.000578765,0.00010771076,0.05905222,0.6311137,0.014863236,0.0009886014,0.29106456],"study_design_scores_gemma":[0.00008616689,0.0003933668,0.00461881,0.000034874818,0.000065212174,0.0020698393,0.000027191481,0.6665648,0.3169626,0.0054400573,0.0036884698,0.000048545386],"about_ca_topic_score_codex":0.0007170793,"about_ca_topic_score_gemma":0.0014389942,"teacher_disagreement_score":0.0008357418,"about_ca_system_score_codex":0.00022014808,"about_ca_system_score_gemma":0.00024749112,"threshold_uncertainty_score":0.002795875},"labels":[],"label_agreement":null},{"id":"W2114991721","doi":"10.1109/tasl.2009.2031699","title":"Glottal-Shape Codebook to Improve Robustness of CELP Codecs","year":2009,"lang":"en","type":"article","venue":"IEEE Transactions on Audio Speech and Language Processing","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Sherbrooke","funders":"","keywords":"Code-excited linear prediction; Codebook; Subframe; Codec; Computer science; Speech coding; Speech recognition; Inter frame; Robustness (evolution); Coding (social sciences); Vector sum excited linear prediction; Linear predictive coding; Algorithm; Frame (networking); Reference frame; Mathematics; Telecommunications","score_opus":0.009679860473827158,"score_gpt":0.27207370563552885,"score_spread":0.26239384516170167,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2114991721","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014249031,0.00040820244,0.97971594,0.00013225045,0.00013519393,0.00008789455,0.00015514762,0.002007722,0.003108697],"genre_scores_gemma":[0.42299843,0.0008382342,0.5618539,0.0005013853,0.00022883454,0.00025004236,0.0012415259,0.00082220946,0.011265425],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99850416,0.00018528308,0.00008334892,0.00020985915,0.0009033908,0.00011394707],"domain_scores_gemma":[0.996799,0.0011244423,0.00016346991,0.00067993894,0.001124151,0.000108945125],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009310787,0.0006622577,0.00054710783,0.00095787784,0.00041396733,0.0007414395,0.0011293321,0.000717487,0.0037953644],"category_scores_gemma":[0.008888965,0.00023411082,0.00035836114,0.00072851015,0.0006241909,0.0010178128,0.0013178826,0.0013818672,0.0022665553],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00074488926,0.00012812465,0.0011298192,0.0002294752,0.000048307622,0.00035399856,0.00023481423,0.13331637,0.19134831,0.046976287,0.0071929703,0.6182967],"study_design_scores_gemma":[0.00007713372,0.00029361199,0.00067511795,0.000062170024,0.000025496549,0.00068799173,0.00005430059,0.8062974,0.16649367,0.008221122,0.01705894,0.00005299736],"about_ca_topic_score_codex":0.0027693731,"about_ca_topic_score_gemma":0.0032560334,"teacher_disagreement_score":0.0037953644,"about_ca_system_score_codex":0.00064886874,"about_ca_system_score_gemma":0.0009972298,"threshold_uncertainty_score":0.012696743},"labels":[],"label_agreement":null},{"id":"W2115466654","doi":"10.1109/pacrim.1997.620356","title":"An adaptive silence deletion algorithm for compression of telephone speech","year":2002,"lang":"en","type":"article","venue":"","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; Waveform; Speech coding; Speech recognition; Data compression; Compression (physics); Voice activity detection; Silence; Algorithm; Sound quality; Quality (philosophy); Speech processing; Telecommunications; Acoustics","score_opus":0.0306607227311074,"score_gpt":0.2865639768645947,"score_spread":0.2559032541334873,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2115466654","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.078822486,0.00068029395,0.9180424,0.00010083183,0.00006084653,0.000088356835,0.00006408552,0.0007365033,0.0014040996],"genre_scores_gemma":[0.38115796,0.0008014868,0.6117115,0.00011564011,0.00009524369,0.00019989148,0.00047350084,0.00013040424,0.0053144326],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998363,0.000023615303,0.000012344179,0.000029585215,0.00008590314,0.000012123097],"domain_scores_gemma":[0.9997812,0.00008531004,0.00001753535,0.000031470066,0.000073383584,0.000011103434],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024468824,0.0003742315,0.0002458078,0.0004276836,0.0002457373,0.000246491,0.0005850984,0.000372475,0.0010863991],"category_scores_gemma":[0.00077167805,0.00012442155,0.00018646475,0.0003839797,0.00026156064,0.00036252715,0.00027125442,0.00045335075,0.00059107284],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000508686,0.00011121001,0.0008019539,0.00008761575,0.000026851321,0.00025861294,0.00017148818,0.044977315,0.34566805,0.0053470884,0.0015808383,0.6004603],"study_design_scores_gemma":[0.00008620241,0.0004740884,0.002027655,0.000016204445,0.000051485353,0.0009667217,0.000037656348,0.7441191,0.24092625,0.0017592529,0.009497072,0.00003835309],"about_ca_topic_score_codex":0.0010175679,"about_ca_topic_score_gemma":0.0015941581,"teacher_disagreement_score":0.0010863991,"about_ca_system_score_codex":0.00018777754,"about_ca_system_score_gemma":0.00029364962,"threshold_uncertainty_score":0.0036343932},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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)","score_opus":0.011082280633223512,"score_gpt":0.27150327463634144,"score_spread":0.2604209940031179,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2115514375","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.37900925,0.0010228083,0.6097246,0.00033985428,0.00012760649,0.00007199344,0.0003690438,0.0010302936,0.008304555],"genre_scores_gemma":[0.8417779,0.0006836902,0.15218,0.00012334733,0.00006203092,0.000037187245,0.00033420837,0.00011313236,0.004688538],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9999033,0.0000110358715,0.000003451253,0.000011430599,0.000057174966,0.000013509407],"domain_scores_gemma":[0.99978393,0.000055783643,0.000019021414,0.00006897425,0.000058831898,0.000013396452],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018438716,0.00022126654,0.00023041993,0.00040919555,0.0001457084,0.0002774119,0.00030578882,0.00023066172,0.001031997],"category_scores_gemma":[0.0007484051,0.00009198222,0.00012633283,0.00049754465,0.00026339648,0.00046738907,0.00036763283,0.00028446154,0.00024597053],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000612912,0.00009557262,0.0010472487,0.000174267,0.00003125866,0.00062143366,0.0001505827,0.06016155,0.5943302,0.019518005,0.0035887652,0.31966826],"study_design_scores_gemma":[0.000044192224,0.00017828042,0.0030589974,0.00002251874,0.000027642236,0.00093597244,0.00007220367,0.56620055,0.4120436,0.010151261,0.007240792,0.00002398445],"about_ca_topic_score_codex":0.0004503396,"about_ca_topic_score_gemma":0.00050527736,"teacher_disagreement_score":0.001031997,"about_ca_system_score_codex":0.00016414694,"about_ca_system_score_gemma":0.00016147127,"threshold_uncertainty_score":0.0034523606},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.011121236603206798,"score_gpt":0.29047570088505636,"score_spread":0.27935446428184957,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2115800223","genre_codex":"methods","genre_gemma":"software","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"software","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0030384879,0.0012127494,0.5458144,0.00029076397,0.00029997577,0.00025065205,0.043539505,0.39546996,0.010083478],"genre_scores_gemma":[0.040006142,0.0015606113,0.6601107,0.000875624,0.0003175004,0.001654092,0.19431596,0.0451741,0.055985276],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9991658,0.000071084876,0.00010715076,0.00015910168,0.00040879342,0.00008805185],"domain_scores_gemma":[0.99891174,0.0003132769,0.00011781891,0.00025808142,0.00032869828,0.00007047873],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007372937,0.0019457134,0.0014993537,0.0055139475,0.0007427219,0.0022820279,0.0029784064,0.0011145407,0.05694694],"category_scores_gemma":[0.004735607,0.0012649924,0.0014650862,0.004729433,0.0003167928,0.0031449161,0.0027362953,0.0014173115,0.055735067],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00044736618,0.00011339319,0.0013893833,0.001069517,0.0001687642,0.00034128994,0.00015108792,0.0011058758,0.0219776,0.0038173937,0.47008243,0.49933594],"study_design_scores_gemma":[0.00030413398,0.00019971709,0.005840497,0.0002375416,0.00021012328,0.001616248,0.00016978226,0.039404623,0.08082071,0.022364508,0.848563,0.0002691355],"about_ca_topic_score_codex":0.0016808521,"about_ca_topic_score_gemma":0.0035474706,"teacher_disagreement_score":0.05694694,"about_ca_system_score_codex":0.00031071476,"about_ca_system_score_gemma":0.00083520485,"threshold_uncertainty_score":0.19050646},"labels":[],"label_agreement":null},{"id":"W2115817513","doi":"10.1109/tcomm.2004.838736","title":"On Finite-State Vector Quantization for Noisy Channels","year":2004,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"","keywords":"Decoding methods; Vector quantization; Encoder; Algorithm; Channel (broadcasting); Computer science; Quantization (signal processing); Mathematics; Telecommunications","score_opus":0.04938890782892184,"score_gpt":0.32249000995779525,"score_spread":0.2731011021288734,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2115817513","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008057554,0.0011838315,0.98829824,0.00016200506,0.00004699784,0.000024492158,0.000035435725,0.00009444573,0.0020970132],"genre_scores_gemma":[0.73995924,0.0063356315,0.24672869,0.0001908737,0.00028510054,0.00022984014,0.0003193928,0.000077567536,0.005873726],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99894303,0.0004192387,0.00006302465,0.00012037008,0.00037156453,0.0000828652],"domain_scores_gemma":[0.9969619,0.002239973,0.00017423855,0.00025135855,0.0003417801,0.00003072925],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001590648,0.000603184,0.0008591097,0.00042106325,0.00043558216,0.0011903436,0.0009954063,0.0008095017,0.001437292],"category_scores_gemma":[0.0051157773,0.00031284,0.00034242935,0.0013358778,0.0014683756,0.0021333355,0.00083983317,0.0011862626,0.0003297859],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009951632,0.000025165842,0.0003422589,0.00016866803,0.000023814931,0.00011732075,0.00012890769,0.6724718,0.0033823662,0.23993714,0.0011027361,0.08220026],"study_design_scores_gemma":[0.000005010542,0.000018266464,0.00003619814,0.000013194474,0.0000036246588,0.000020796737,0.000007087445,0.9686157,0.0008313473,0.02987918,0.00056087214,0.000008787219],"about_ca_topic_score_codex":0.0049066534,"about_ca_topic_score_gemma":0.0036346845,"teacher_disagreement_score":0.0049066534,"about_ca_system_score_codex":0.0012032968,"about_ca_system_score_gemma":0.0011080701,"threshold_uncertainty_score":0.0097562075},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.021988425036650546,"score_gpt":0.3399691805892719,"score_spread":0.31798075555262134,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2116043386","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12375452,0.0014497158,0.85965323,0.00035434356,0.0002215691,0.00039396674,0.00026362643,0.004350467,0.009558554],"genre_scores_gemma":[0.44310662,0.0010541399,0.53988725,0.00024895702,0.00015210574,0.0001992137,0.0005545928,0.00017823762,0.014618901],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9998417,0.000015977246,0.00001092967,0.000022663871,0.00008920899,0.000019465653],"domain_scores_gemma":[0.99981636,0.000046428242,0.000021500317,0.00002791384,0.00007689528,0.000010955805],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014929945,0.0004820514,0.00026396767,0.0005817411,0.00025884932,0.0004170348,0.0009303183,0.00029288937,0.005385927],"category_scores_gemma":[0.00040220216,0.00016787206,0.0001646266,0.00045306582,0.0001387746,0.00051853055,0.0002343996,0.0002815231,0.0010584121],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005167461,0.00013449218,0.0010104226,0.00033079693,0.000058555197,0.0003622664,0.000088073684,0.0052704173,0.5709539,0.0041434653,0.0052971947,0.4118337],"study_design_scores_gemma":[0.00019759119,0.0012208275,0.003425581,0.000044581502,0.00011006871,0.0020058465,0.00006006035,0.15229934,0.7966956,0.00075064885,0.043131765,0.00005816554],"about_ca_topic_score_codex":0.0010757267,"about_ca_topic_score_gemma":0.0020771984,"teacher_disagreement_score":0.005385927,"about_ca_system_score_codex":0.00028211583,"about_ca_system_score_gemma":0.00043514438,"threshold_uncertainty_score":0.018017769},"labels":[],"label_agreement":null},{"id":"W2116060577","doi":"10.1109/wcnc.2008.548","title":"A Framework of Cross-Layer Superposition Coded Multicast for Robust IPTV Services over WiMAX","year":2008,"lang":"en","type":"article","venue":"","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Multicast; Computer science; Computer network; WiMAX; Source-specific multicast; Multiple description coding; Pragmatic General Multicast; IP multicast; IPTV; Wireless; Telecommunications; Network packet","score_opus":0.045548557801732927,"score_gpt":0.34526716234030846,"score_spread":0.2997186045385755,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2116060577","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0015624418,0.00024527797,0.99592245,0.00009349562,0.000025545414,0.00004231168,0.000016452075,0.000111796355,0.0019800698],"genre_scores_gemma":[0.2640122,0.0010225074,0.7302214,0.0001598728,0.00011404746,0.00037009164,0.000081786595,0.000070717644,0.0039473167],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99889743,0.00044152376,0.00004606007,0.00011371214,0.00041406494,0.00008717831],"domain_scores_gemma":[0.9996897,0.00010542605,0.00003248588,0.000063787724,0.000077529075,0.000030986837],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013366446,0.00063619093,0.0006113904,0.0004984323,0.000560726,0.0010855664,0.0015611984,0.0010428702,0.001660057],"category_scores_gemma":[0.00094848353,0.00034929486,0.0007265433,0.0005372871,0.0010327154,0.0009153948,0.0014164068,0.0012610536,0.00041585002],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000088143075,0.00008196132,0.00025205233,0.00020457736,0.00007199986,0.00055695494,0.0002092341,0.26859292,0.036252055,0.61595565,0.0031212282,0.074613266],"study_design_scores_gemma":[0.00002277521,0.0001212801,0.00010017767,0.000025273457,0.0000261351,0.00023584529,0.000021876485,0.9483467,0.005457048,0.034237124,0.011377879,0.000027835478],"about_ca_topic_score_codex":0.0014143378,"about_ca_topic_score_gemma":0.0012900463,"teacher_disagreement_score":0.001660057,"about_ca_system_score_codex":0.0012529053,"about_ca_system_score_gemma":0.0012264182,"threshold_uncertainty_score":0.009090483},"labels":[],"label_agreement":null},{"id":"W2116096293","doi":"10.1109/lsp.2003.821661","title":"Quadtree-Based Multiregion Multiquality Image Coding","year":2004,"lang":"en","type":"article","venue":"IEEE Signal Processing Letters","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Quadtree; Computer science; JPEG 2000; JPEG; Context-adaptive binary arithmetic coding; Artificial intelligence; Computer vision; Image compression; Coding (social sciences); Data compression; Coding tree unit; Image resolution; Pixel; Fidelity; Image processing; Algorithm; Decoding methods; Image (mathematics); Mathematics","score_opus":0.027739680469587417,"score_gpt":0.29771743022956054,"score_spread":0.26997774975997313,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2116096293","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.029093977,0.0005009576,0.96831256,0.000066379485,0.000019092857,0.000056601566,0.00006178587,0.00021527453,0.0016734297],"genre_scores_gemma":[0.42532998,0.00075028726,0.5704661,0.000103054415,0.000023445971,0.000060363007,0.00019951307,0.000092724076,0.0029745682],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998209,0.00003808901,0.000009421175,0.000021786054,0.00009195043,0.000017912927],"domain_scores_gemma":[0.99949574,0.00013500417,0.00006934173,0.0001300821,0.00015003675,0.000019779493],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035135,0.00027172084,0.000306404,0.00038126027,0.00013005675,0.00034531922,0.0006107038,0.00030607847,0.0015021539],"category_scores_gemma":[0.00096208876,0.00013519527,0.00024513237,0.00048482828,0.00027037502,0.0006821163,0.0004797758,0.0004421268,0.00038300015],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021333102,0.000082713195,0.0006896649,0.00020985043,0.000038969247,0.00030650076,0.00018361717,0.12178584,0.51849186,0.051993534,0.002220189,0.30378398],"study_design_scores_gemma":[0.00002181554,0.00023645758,0.0007543723,0.000031705025,0.000019454541,0.0006632262,0.000036181802,0.85435015,0.1302017,0.0058878064,0.0077670924,0.00003014259],"about_ca_topic_score_codex":0.0006754861,"about_ca_topic_score_gemma":0.0011240521,"teacher_disagreement_score":0.0015021539,"about_ca_system_score_codex":0.00023014634,"about_ca_system_score_gemma":0.00023336268,"threshold_uncertainty_score":0.005025208},"labels":[],"label_agreement":null},{"id":"W2116812790","doi":"10.1109/itng.2009.132","title":"Supporting Video Multicast in Wireless Ad Hoc Networks Using Multiple Paths and Multiple Description Coding","year":2009,"lang":"en","type":"article","venue":"","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University; École de Technologie Supérieure","funders":"","keywords":"Multicast; Computer science; Multiple description coding; Computer network; Wireless ad hoc network; Source-specific multicast; Coding (social sciences); Wireless; Pragmatic General Multicast; Xcast; Exploit; Distributed computing; Network packet","score_opus":0.032727748544044,"score_gpt":0.30248482459479753,"score_spread":0.26975707605075355,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2116812790","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10461791,0.00087000104,0.8923505,0.00023180443,0.000037339585,0.000097120486,0.00004727248,0.00031018537,0.0014378701],"genre_scores_gemma":[0.78452337,0.00059094327,0.21373111,0.00007919245,0.000044897228,0.0000835801,0.0001295843,0.000022985296,0.00079429155],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99952507,0.00018610041,0.000024316174,0.00002913839,0.00018151119,0.00005398608],"domain_scores_gemma":[0.9991172,0.0005145616,0.00008632909,0.000087746215,0.00015403188,0.000040084324],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008760134,0.00036494597,0.00042159922,0.000600735,0.00043209095,0.0004579284,0.00073071604,0.0004939135,0.00037638127],"category_scores_gemma":[0.0023047961,0.00016054306,0.0002133112,0.0005773547,0.0003074431,0.0009930525,0.00077066105,0.00046354978,0.00009542192],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004293372,0.0002110737,0.0020866327,0.00029224888,0.00007117269,0.0004643057,0.00030236354,0.3954123,0.05785717,0.035088066,0.0028705378,0.5049149],"study_design_scores_gemma":[0.00004025223,0.00015633745,0.00026490903,0.000012195184,0.000019484207,0.00014901403,0.00006122929,0.9766683,0.009012337,0.011989475,0.0016108165,0.00001561952],"about_ca_topic_score_codex":0.0013477806,"about_ca_topic_score_gemma":0.0015648976,"teacher_disagreement_score":0.0013477806,"about_ca_system_score_codex":0.00037128915,"about_ca_system_score_gemma":0.00063715025,"threshold_uncertainty_score":0.0046328306},"labels":[],"label_agreement":null},{"id":"W2116820729","doi":"10.1109/icassp.2014.6854287","title":"New bit-plane probability calculations for Scalable to Lossless Audio Coding","year":2014,"lang":"en","type":"article","venue":"","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Bit plane; Computer science; Sub-band coding; Algorithm; Clipping (morphology); Quantization (signal processing); Harmonic Vector Excitation Coding; Coding (social sciences); Lossless compression; Coding gain; Tunstall coding; Residual; Data compression; Context-adaptive binary arithmetic coding; Transform coding; Speech coding; Theoretical computer science; Speech recognition; Mathematics; Discrete cosine transform; Decoding methods; Artificial intelligence; Statistics; Bit field; Engineering","score_opus":0.028451975514096055,"score_gpt":0.29615362569238757,"score_spread":0.2677016501782915,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2116820729","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0024022604,0.00012705132,0.99563533,0.000024235802,0.00002806465,0.00003956135,0.00006902854,0.00022369811,0.0014507276],"genre_scores_gemma":[0.12213245,0.00077109237,0.87202287,0.000082199425,0.000060431707,0.00025625233,0.0005793786,0.0002866154,0.003808737],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995999,0.000056341116,0.00003297292,0.000037197107,0.00025134053,0.000022338312],"domain_scores_gemma":[0.99902,0.00037892867,0.00009095398,0.00013528304,0.00034397832,0.000030861127],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000673196,0.0008326025,0.00039498002,0.0010762285,0.00033158323,0.0009148281,0.00097390375,0.0005502053,0.006557884],"category_scores_gemma":[0.0040335217,0.00035229433,0.00042181008,0.0010152594,0.00030546772,0.0018199257,0.0006268343,0.00090323936,0.0015394834],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017652863,0.00010975382,0.0015865734,0.00042380503,0.00007164377,0.00027181656,0.00024685758,0.4141733,0.04461035,0.17544849,0.0072186887,0.3556622],"study_design_scores_gemma":[0.000008696638,0.00001799995,0.00035504016,0.000025230138,0.000016451588,0.00012462916,0.000015451478,0.9707973,0.010140361,0.013984799,0.004488004,0.000026051568],"about_ca_topic_score_codex":0.0018207445,"about_ca_topic_score_gemma":0.0032849433,"teacher_disagreement_score":0.006557884,"about_ca_system_score_codex":0.0006494824,"about_ca_system_score_gemma":0.0009013063,"threshold_uncertainty_score":0.021938324},"labels":[],"label_agreement":null},{"id":"W2117132925","doi":"10.1109/vetec.1994.345388","title":"Variable rate speech and channel coding for mobile communication","year":2002,"lang":"en","type":"article","venue":"","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Computer science; Code-excited linear prediction; Speech recognition; Full Rate; Channel (broadcasting); Speech coding; Coding (social sciences); Voice activity detection; Linear predictive coding; Real-time computing; Speech processing; Telecommunications; Mathematics; Statistics","score_opus":0.0342772323987512,"score_gpt":0.2816881457978657,"score_spread":0.24741091339911453,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2117132925","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02083861,0.025922153,0.8910735,0.0025578798,0.0020565426,0.00019804311,0.00065856037,0.0021164182,0.054578226],"genre_scores_gemma":[0.45950538,0.031078951,0.40239713,0.0025366652,0.0021473197,0.0004378949,0.0019392656,0.0005440229,0.09941335],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9996748,0.00009114206,0.000011762415,0.000039592476,0.00015627753,0.000026397021],"domain_scores_gemma":[0.9996481,0.00017112767,0.000034361718,0.00003899988,0.000095438205,0.000012024311],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023147334,0.00034767546,0.00018222077,0.00039926046,0.00018605823,0.0005023767,0.00034529335,0.0007056342,0.006569637],"category_scores_gemma":[0.0008829206,0.00009205734,0.00012615815,0.00085443066,0.0004995353,0.00048938155,0.00033997933,0.00072906166,0.0014592689],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002045813,0.000039133596,0.0005748983,0.0006230764,0.00004211266,0.00031294295,0.00019610643,0.02583795,0.046373174,0.20536135,0.0463926,0.6740421],"study_design_scores_gemma":[0.00005246932,0.00035434563,0.0024701173,0.00047240994,0.000049777824,0.0010974992,0.00012573623,0.3709782,0.046551794,0.09613859,0.48157933,0.00012969758],"about_ca_topic_score_codex":0.0027917165,"about_ca_topic_score_gemma":0.0023727843,"teacher_disagreement_score":0.006569637,"about_ca_system_score_codex":0.00041374954,"about_ca_system_score_gemma":0.00044102123,"threshold_uncertainty_score":0.021977603},"labels":[],"label_agreement":null},{"id":"W2117224316","doi":"10.1109/acssc.2005.1599881","title":"Improved Bit Allocation for Transform Coding of Images","year":2006,"lang":"en","type":"article","venue":"","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Computer science; Transform coding; Bit (key); Coding (social sciences); Computer graphics (images); Artificial intelligence; Computer vision; Discrete cosine transform; Computer network; Image (mathematics); Mathematics","score_opus":0.011981084741823965,"score_gpt":0.2725946566429915,"score_spread":0.2606135719011675,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2117224316","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013370689,0.0006936847,0.98390263,0.00008947664,0.00006119242,0.000036066944,0.000029511724,0.000512105,0.0013045428],"genre_scores_gemma":[0.17958893,0.00084236945,0.81455916,0.00012314932,0.00005787403,0.000099043325,0.0001390162,0.00016137392,0.004429099],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996346,0.00008250056,0.00002542737,0.000052588286,0.00017348849,0.000031336207],"domain_scores_gemma":[0.99957985,0.00013130407,0.000047314974,0.0001056397,0.000120864745,0.000015101258],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041693545,0.00050843996,0.000493829,0.0007708527,0.0003453105,0.00064477633,0.00068394415,0.00047726845,0.0026049835],"category_scores_gemma":[0.0016092294,0.0002212826,0.00024578744,0.0009450088,0.00048419397,0.0012311654,0.00065077865,0.00068460277,0.0009401548],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005682911,0.00006710665,0.00046814213,0.00018825805,0.000028020993,0.00010539433,0.00017919118,0.075118415,0.14928521,0.050861467,0.0024997157,0.7206309],"study_design_scores_gemma":[0.0000611926,0.00016238591,0.00055104657,0.000047080433,0.000033860575,0.00039776982,0.000031448526,0.8400155,0.12805374,0.015825016,0.014781584,0.00003945364],"about_ca_topic_score_codex":0.0011426323,"about_ca_topic_score_gemma":0.0018131696,"teacher_disagreement_score":0.0026049835,"about_ca_system_score_codex":0.0005255082,"about_ca_system_score_gemma":0.00039836988,"threshold_uncertainty_score":0.008714557},"labels":[],"label_agreement":null},{"id":"W2117368541","doi":"10.1109/icme.2006.262932","title":"Error Resilient Multiple Description Compression of Vector Graphics","year":2006,"lang":"en","type":"article","venue":"","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Computer science; Lossy compression; Multiple description coding; Graphics; Data compression; Network packet; Vector graphics; Coding (social sciences); Computer graphics; Wireless network; Wireless; Theoretical computer science; Artificial intelligence; Computer graphics (images); Computer network; Mathematics; Telecommunications","score_opus":0.02467748257335475,"score_gpt":0.26842824732656784,"score_spread":0.24375076475321308,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2117368541","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.030781677,0.0009732255,0.9653274,0.00030119807,0.00010761857,0.000050270097,0.00009604328,0.0006063526,0.0017561188],"genre_scores_gemma":[0.55211323,0.0012312838,0.43814075,0.00026942883,0.0001844369,0.000094455914,0.000574462,0.00017505587,0.0072168866],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993992,0.000087175446,0.000026449283,0.000072148956,0.00037478266,0.00004024577],"domain_scores_gemma":[0.9990013,0.00042400757,0.00010165017,0.00026433571,0.00018076225,0.000027842161],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000514543,0.0004093054,0.00036907344,0.00082619424,0.00018711483,0.00056121283,0.0007438616,0.00051677326,0.0010926801],"category_scores_gemma":[0.0025363946,0.00018043442,0.0002452434,0.0010705609,0.0004666741,0.0011527346,0.0008222445,0.00071756775,0.00033824518],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004218759,0.000076785,0.0009532605,0.00024425713,0.000040434188,0.00058205915,0.00021240684,0.2806166,0.10161482,0.061688233,0.0050269673,0.5485223],"study_design_scores_gemma":[0.000026108348,0.00009767173,0.00027514613,0.00001903178,0.000009859885,0.00038655015,0.000021557607,0.92784876,0.0571166,0.008235859,0.0059414315,0.0000214007],"about_ca_topic_score_codex":0.0014789777,"about_ca_topic_score_gemma":0.0012116653,"teacher_disagreement_score":0.0014789777,"about_ca_system_score_codex":0.00049916166,"about_ca_system_score_gemma":0.00038144735,"threshold_uncertainty_score":0.003655374},"labels":[],"label_agreement":null},{"id":"W2117750426","doi":"10.1109/icassp.1982.1171774","title":"4800 Bps RELP Vocoder using vector quantization for both filter and residual representations","year":2005,"lang":"en","type":"article","venue":"","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Sherbrooke","funders":"","keywords":"Residual; Algorithm; Vector quantization; Quantization (signal processing); Computer science; Mathematics","score_opus":0.06222361470715898,"score_gpt":0.3548793705940816,"score_spread":0.2926557558869226,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2117750426","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.039104383,0.0007128113,0.9240397,0.0002742268,0.0003588627,0.00030650792,0.0007974251,0.008903638,0.025502447],"genre_scores_gemma":[0.21859522,0.0008012297,0.73947006,0.0005697478,0.00024389979,0.00054139044,0.0022703141,0.0013476036,0.03616053],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.999461,0.00007634763,0.00002840374,0.00008827953,0.00027654725,0.00006954985],"domain_scores_gemma":[0.9997062,0.00009416067,0.0000129329555,0.000052171985,0.00011838957,0.00001606136],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007767529,0.0007069215,0.0005123104,0.0006369909,0.00030840156,0.00089931017,0.0008839116,0.0008009173,0.014346858],"category_scores_gemma":[0.000980345,0.00020711191,0.0003048556,0.00073530094,0.0003153879,0.00080782414,0.00049972435,0.00078339956,0.0066700308],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00057636417,0.00021933974,0.00078370713,0.00048976584,0.00008405357,0.00019601182,0.0002293097,0.011099581,0.23899327,0.011423798,0.013671462,0.7222333],"study_design_scores_gemma":[0.00020308683,0.0008144884,0.0038768458,0.0002526859,0.00015810545,0.0011386095,0.0001401527,0.37265354,0.4635192,0.004877209,0.15222338,0.0001427282],"about_ca_topic_score_codex":0.0026080231,"about_ca_topic_score_gemma":0.004353068,"teacher_disagreement_score":0.014346858,"about_ca_system_score_codex":0.00048156595,"about_ca_system_score_gemma":0.0006467976,"threshold_uncertainty_score":0.04799503},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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)","score_opus":0.019679350048585127,"score_gpt":0.3395744729389253,"score_spread":0.31989512289034017,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2117853725","genre_codex":"review","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0016262596,0.69046444,0.23320787,0.056935858,0.0077649574,0.00012943675,0.00013054341,0.00063579046,0.00910479],"genre_scores_gemma":[0.013872106,0.5861196,0.3437832,0.019717777,0.020989535,0.00032931025,0.0001675299,0.0002794596,0.014741449],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99866796,0.00047464453,0.00021190464,0.00013906656,0.0004490854,0.000057373007],"domain_scores_gemma":[0.99216425,0.0050000176,0.0003228683,0.00032189154,0.001740662,0.0004503132],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004692861,0.0012750371,0.0010060094,0.0027610061,0.00069049076,0.004349903,0.0025534907,0.005101902,0.0035671892],"category_scores_gemma":[0.00875976,0.000863619,0.00080725434,0.0014618831,0.0033552658,0.0061203586,0.0015839126,0.008334344,0.0028749136],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014920377,0.00041862877,0.0017391765,0.0027614012,0.00009715729,0.00073416164,0.0009403628,0.0025384289,0.006160306,0.05234186,0.13261636,0.79950297],"study_design_scores_gemma":[0.000032237418,0.00033315807,0.001801667,0.0030154164,0.000059698126,0.0067063374,0.0007763215,0.0056270985,0.0034923728,0.08662506,0.8914019,0.00012873796],"about_ca_topic_score_codex":0.0009520426,"about_ca_topic_score_gemma":0.0017046536,"teacher_disagreement_score":0.005101902,"about_ca_system_score_codex":0.00076083484,"about_ca_system_score_gemma":0.0014266885,"threshold_uncertainty_score":0.02481854},"labels":[],"label_agreement":null},{"id":"W2118046878","doi":"10.1109/ccece.2006.277701","title":"Conception D'un Environnement Sous Matlab Pour le Marquage D'images en Jpeg2000","year":2006,"lang":"fr","type":"article","venue":"","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec en Outaouais","funders":"","keywords":"MATLAB; Computer science; JPEG 2000; Coding (social sciences); Artificial intelligence; Mathematics; Programming language; Image compression; Image processing; Statistics","score_opus":0.010638644192073535,"score_gpt":0.2434666515439122,"score_spread":0.23282800735183867,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2118046878","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004211793,0.000089977846,0.9905195,0.00005054009,0.00005009416,0.000049479582,0.0000383755,0.0033456008,0.0016445016],"genre_scores_gemma":[0.061544195,0.0003487793,0.9292046,0.00008454646,0.000048356225,0.00019263792,0.00017846057,0.0017592309,0.0066391765],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988341,0.00032160358,0.000066448156,0.00018727795,0.0005081287,0.000082526996],"domain_scores_gemma":[0.9991574,0.00032035052,0.00005852919,0.00009415907,0.00030842435,0.00006117215],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017570591,0.0011963648,0.00057291257,0.000757985,0.00054778805,0.0021718536,0.001080835,0.0008526788,0.00505905],"category_scores_gemma":[0.0025640056,0.00050471874,0.0009663653,0.0002934464,0.0007728162,0.0010897394,0.0006542285,0.0012031501,0.002698865],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006811798,0.00036860738,0.0032936377,0.0006746543,0.00023579378,0.0025064726,0.0020613573,0.1828312,0.26090705,0.12718146,0.006412875,0.41284576],"study_design_scores_gemma":[0.0002374373,0.0004164423,0.0014323726,0.0002496884,0.00009451848,0.0016609032,0.00017094336,0.56541663,0.28450298,0.0108048525,0.13483204,0.00018121043],"about_ca_topic_score_codex":0.004032819,"about_ca_topic_score_gemma":0.0018334149,"teacher_disagreement_score":0.00505905,"about_ca_system_score_codex":0.0006312055,"about_ca_system_score_gemma":0.00093567243,"threshold_uncertainty_score":0.016924262},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.06827897961494891,"score_gpt":0.3712560710996058,"score_spread":0.3029770914846569,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2118315922","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0014037812,0.0001603281,0.9966133,0.00007289521,0.000024764073,0.00006666345,0.000010190778,0.00014633487,0.001501732],"genre_scores_gemma":[0.301873,0.0007952522,0.69242823,0.0002235309,0.00013112437,0.00067984854,0.00010780823,0.000115776566,0.0036454592],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988331,0.00030657792,0.00007488993,0.00011728052,0.00055954425,0.00010864244],"domain_scores_gemma":[0.99948883,0.0001241272,0.000075938675,0.000061326115,0.00022602298,0.000023816538],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002387791,0.00090982846,0.00043680402,0.0005195841,0.00045044694,0.0012184677,0.0013889981,0.0008300506,0.0017995755],"category_scores_gemma":[0.0017186727,0.00039577056,0.00064474595,0.0002577323,0.0005057913,0.0008621953,0.0008255301,0.0012679882,0.0004973903],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007681575,0.000093207855,0.00046747396,0.00024923668,0.000095147974,0.00047319196,0.00026750827,0.67928296,0.037092466,0.14897491,0.0033378527,0.12958914],"study_design_scores_gemma":[0.000023628108,0.00018417559,0.0001186216,0.000031895102,0.000038318718,0.00015346488,0.000026104866,0.9720713,0.0067090592,0.010925731,0.009696554,0.0000210659],"about_ca_topic_score_codex":0.0016010358,"about_ca_topic_score_gemma":0.0014309468,"teacher_disagreement_score":0.002387791,"about_ca_system_score_codex":0.0008581828,"about_ca_system_score_gemma":0.0012440248,"threshold_uncertainty_score":0.012628019},"labels":[],"label_agreement":null},{"id":"W2118414520","doi":"10.1109/icassp.2006.1661241","title":"A Two-Stage MLP+NLMS Lossless Coder for Stereo Audio","year":2006,"lang":"en","type":"article","venue":"","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Sherbrooke","funders":"","keywords":"Lossless compression; Computer science; Speech recognition; Artificial intelligence; Multilayer perceptron; Linear prediction; Data compression; Redundancy (engineering); Pattern recognition (psychology); Artificial neural network","score_opus":0.01883013613067643,"score_gpt":0.30440871487857024,"score_spread":0.28557857874789383,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2118414520","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.057838935,0.0004955527,0.93634236,0.00017147367,0.000115922245,0.0001646381,0.00015212398,0.0024988074,0.0022202407],"genre_scores_gemma":[0.45032912,0.00031738053,0.5331596,0.00038996202,0.00019982064,0.00023657388,0.00042231812,0.00021557324,0.014729587],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992244,0.000071437076,0.0000341764,0.000109142544,0.00050106796,0.00005966896],"domain_scores_gemma":[0.9993709,0.00013264344,0.000085446874,0.00013421198,0.00022725308,0.000049562917],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005895835,0.00063762226,0.0005543238,0.0005289319,0.0002751285,0.00046977785,0.0017036395,0.00086120423,0.0032134708],"category_scores_gemma":[0.00087946217,0.00027472668,0.00032691477,0.0002629511,0.00035205763,0.0010402749,0.0005754991,0.0009236408,0.0018157294],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008060919,0.00017096788,0.0010027419,0.0002584998,0.00006773208,0.00026750774,0.00007796316,0.013626806,0.59786135,0.0050779735,0.0033541007,0.37742832],"study_design_scores_gemma":[0.00013462757,0.0007601864,0.0024571035,0.000033252818,0.000096850206,0.0010938934,0.000018556018,0.39254633,0.58631647,0.00091917353,0.01553968,0.0000838754],"about_ca_topic_score_codex":0.0011645455,"about_ca_topic_score_gemma":0.0019130191,"teacher_disagreement_score":0.0032134708,"about_ca_system_score_codex":0.00047680826,"about_ca_system_score_gemma":0.0004196499,"threshold_uncertainty_score":0.010750115},"labels":[],"label_agreement":null},{"id":"W2118573057","doi":"10.1109/icme.2008.4607544","title":"Likelihood-based non-uniform allocation of Gaussian kernels in scalar dimension for HMM compression","year":2008,"lang":"en","type":"article","venue":"","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Institut National de la Recherche Scientifique","funders":"","keywords":"Representation (politics); Hidden Markov model; Gaussian; Computer science; Dimension (graph theory); Kullback–Leibler divergence; Pattern recognition (psychology); Divergence (linguistics); Scalar (mathematics); Gaussian process; Artificial intelligence; Algorithm; Mathematics","score_opus":0.019654194803347635,"score_gpt":0.2784846525677566,"score_spread":0.258830457764409,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2118573057","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009405414,0.00018942647,0.98935854,0.00009917871,0.00003475512,0.000029331963,0.00003064322,0.00049884507,0.00035390537],"genre_scores_gemma":[0.3261218,0.0004279268,0.6700855,0.00020672171,0.00009006499,0.00020352418,0.00038674587,0.0002215511,0.0022561268],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99892455,0.00029470908,0.00011964319,0.00018337758,0.00040288552,0.00007480342],"domain_scores_gemma":[0.99812454,0.0006991141,0.00013937743,0.0005456787,0.00040018023,0.00009113073],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013203167,0.0006658949,0.0008016603,0.0007486252,0.00044623733,0.0009949707,0.0016053865,0.0006710501,0.0017561736],"category_scores_gemma":[0.0073505635,0.0003384842,0.0005576786,0.001034418,0.0008342309,0.0024555228,0.0021286842,0.0012687154,0.0008296481],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00063880783,0.00036084026,0.0020265244,0.00015003806,0.00007540891,0.00019984528,0.00033674864,0.22432406,0.036847964,0.034985743,0.0041509573,0.6959031],"study_design_scores_gemma":[0.000024592398,0.000055921166,0.00036271266,0.000007961416,0.000009414799,0.000122712,0.000022850152,0.9806604,0.012140783,0.004758919,0.0018119349,0.000021891256],"about_ca_topic_score_codex":0.0015181177,"about_ca_topic_score_gemma":0.0019754064,"teacher_disagreement_score":0.0017561736,"about_ca_system_score_codex":0.00069294544,"about_ca_system_score_gemma":0.0010369379,"threshold_uncertainty_score":0.006982565},"labels":[],"label_agreement":null},{"id":"W2119099103","doi":"10.1109/glocom.1993.318418","title":"Joint source and channel coding using a non-linear receiver over Rayleigh fading channel","year":2002,"lang":"en","type":"article","venue":"","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Rayleigh fading; Fading; Algorithm; Computer science; Channel (broadcasting); SIGNAL (programming language); QAM; Channel state information; Joint (building); Quadrature amplitude modulation; Modulation (music); Estimator; Decoding methods; Mathematics; Telecommunications; Bit error rate; Statistics; Wireless; Engineering; Physics; Acoustics","score_opus":0.06327013339918304,"score_gpt":0.2790060572829579,"score_spread":0.21573592388377488,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2119099103","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.022944096,0.00029072276,0.97452873,0.0001440242,0.000016051537,0.000026001222,0.000025273212,0.00020537895,0.0018195915],"genre_scores_gemma":[0.7929769,0.00046035406,0.20078851,0.00006109636,0.000050779654,0.000061553175,0.00008695046,0.00004676426,0.0054670773],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990816,0.00040887203,0.000030413303,0.000096838354,0.0003005859,0.000081731836],"domain_scores_gemma":[0.9994093,0.0002944871,0.000071596674,0.00009728219,0.00011284156,0.000014497622],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008192479,0.0005838116,0.00068732264,0.00020787538,0.00021134262,0.0007065032,0.00048047467,0.0004967471,0.0008023221],"category_scores_gemma":[0.0017381312,0.00021967548,0.00028303693,0.00037408937,0.00058909704,0.0010136516,0.0007116809,0.0005205627,0.00034313297],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018140984,0.000034542136,0.00058705424,0.00007064049,0.00005488867,0.00012198135,0.000101151745,0.87868935,0.012191873,0.03628299,0.0006592907,0.071024805],"study_design_scores_gemma":[0.000014367208,0.000043566484,0.00012230904,0.0000052920077,0.000012175676,0.000044429275,0.00000981292,0.98926836,0.0058751046,0.004031355,0.0005647113,0.000008517609],"about_ca_topic_score_codex":0.0022486537,"about_ca_topic_score_gemma":0.002750379,"teacher_disagreement_score":0.0022486537,"about_ca_system_score_codex":0.00051254214,"about_ca_system_score_gemma":0.00091142795,"threshold_uncertainty_score":0.004471123},"labels":[],"label_agreement":null},{"id":"W2119272989","doi":"10.1109/scft.1997.623917","title":"A wideband codec at 16/24 kbit/s with 10 ms frames","year":2002,"lang":"en","type":"article","venue":"","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Sherbrooke","funders":"","keywords":"Codec; Adaptive Multi-Rate audio codec; Computer science; Speech coding; Speech recognition; Full Rate; Wideband audio; Wideband; Codec2; Linear predictive coding; Speech processing; Computer hardware; Electronic engineering; Voice activity detection; Audio signal; Digital audio; Engineering","score_opus":0.0200989101790476,"score_gpt":0.2424838685131019,"score_spread":0.2223849583340543,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2119272989","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19653378,0.0035360097,0.74646115,0.0007684398,0.0011369516,0.0017284736,0.0013252402,0.011269806,0.03724018],"genre_scores_gemma":[0.4433199,0.0012216717,0.47884244,0.0007911028,0.00039031598,0.0009978798,0.001433273,0.00068147655,0.072321974],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99966586,0.000038698323,0.000020635129,0.000052368217,0.00016167987,0.000060766273],"domain_scores_gemma":[0.9994444,0.000093399874,0.00003739383,0.00006287901,0.0002743772,0.000087525776],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044503468,0.00047379083,0.00033737902,0.0009965436,0.0004880462,0.0005936287,0.0004884155,0.0008689103,0.0071238833],"category_scores_gemma":[0.0007507059,0.00012375385,0.00018067478,0.0004453583,0.00035998778,0.000340033,0.00034071834,0.0007568806,0.0035182792],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0013113243,0.00019861115,0.0015495655,0.00023661174,0.00006067566,0.0008079293,0.00026163348,0.0051010535,0.504199,0.01208172,0.01304486,0.461147],"study_design_scores_gemma":[0.00031667072,0.0027107124,0.005833989,0.0001996907,0.00018837763,0.0049364707,0.00017830473,0.097919464,0.554875,0.0027569288,0.32983157,0.00025287384],"about_ca_topic_score_codex":0.0031888206,"about_ca_topic_score_gemma":0.004964763,"teacher_disagreement_score":0.0071238833,"about_ca_system_score_codex":0.0005385751,"about_ca_system_score_gemma":0.0007420933,"threshold_uncertainty_score":0.023831785},"labels":[],"label_agreement":null},{"id":"W2119277580","doi":"10.1109/icassp.2008.4518531","title":"Transition mode coding for source controlled celp codecs","year":2008,"lang":"en","type":"article","venue":"Proceedings of the ... IEEE International Conference on Acoustics, Speech, and Signal Processing","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Sherbrooke","funders":"","keywords":"Code-excited linear prediction; Codec; Computer science; Codebook; Speech coding; Coding (social sciences); Speech recognition; Linear predictive coding; Adaptive Multi-Rate audio codec; Intra-frame; Algorithmic efficiency; Inter frame; Frame (networking); Algorithm; Decoding methods; Reference frame; Telecommunications; Speech processing; Voice activity detection; Mathematics","score_opus":0.047054821398864556,"score_gpt":0.301062559547319,"score_spread":0.2540077381484544,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2119277580","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.030376654,0.0003706781,0.9610347,0.00016916459,0.00010601547,0.00011579991,0.0002700691,0.0017948779,0.005761983],"genre_scores_gemma":[0.68180305,0.00046858977,0.30676064,0.00027274142,0.000082991115,0.00030948332,0.00087721273,0.00031862996,0.009106694],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996024,0.0000687489,0.000017154656,0.000049174625,0.00021722038,0.000045344408],"domain_scores_gemma":[0.99895716,0.00030830724,0.00006033022,0.00018256778,0.00046387836,0.000027764567],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033597078,0.00031906093,0.00019233438,0.00048625216,0.00023692737,0.0004935257,0.0006156869,0.0003963424,0.0027318373],"category_scores_gemma":[0.0023749245,0.00010226025,0.00014991243,0.0004111022,0.00034487539,0.0004273124,0.00058094296,0.0008776622,0.0007375713],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009780024,0.000090000416,0.0008912362,0.00023455902,0.00001917938,0.0005058969,0.00027349428,0.050148528,0.27929094,0.1046723,0.00888743,0.5540083],"study_design_scores_gemma":[0.00008588826,0.0002561784,0.001041189,0.000101278434,0.000017336797,0.0005676665,0.00007125142,0.74165696,0.20442314,0.02651165,0.025212694,0.00005479179],"about_ca_topic_score_codex":0.0021773165,"about_ca_topic_score_gemma":0.0028683532,"teacher_disagreement_score":0.0027318373,"about_ca_system_score_codex":0.0005085987,"about_ca_system_score_gemma":0.00069339655,"threshold_uncertainty_score":0.009138882},"labels":[],"label_agreement":null},{"id":"W2119361621","doi":"10.1109/scft.1993.762344","title":"Tree-structured vector quantization of speech lsf parameters","year":2005,"lang":"en","type":"article","venue":"","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Codebook; Vector quantization; Speech coding; Computational complexity theory; Code-excited linear prediction; Algorithm; Linear predictive coding; Vector sum excited linear prediction; Computer science; Linde–Buzo–Gray algorithm; Encoding (memory); Coding (social sciences); Mathematics; Linear prediction; Speech recognition; Tree (set theory); Artificial intelligence; Statistics","score_opus":0.01725348255559253,"score_gpt":0.2763286633214141,"score_spread":0.2590751807658216,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2119361621","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13327956,0.0005992911,0.862098,0.000110060064,0.000071932525,0.00014643534,0.00026956864,0.00089460757,0.0025306537],"genre_scores_gemma":[0.67492867,0.00034199277,0.32151082,0.00004365261,0.000017225824,0.00008435762,0.00050773023,0.000050199975,0.0025153847],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99960953,0.00007929294,0.00002990657,0.000038818118,0.0002148885,0.00002767655],"domain_scores_gemma":[0.99876773,0.00046064524,0.000091221984,0.00011720823,0.0005401758,0.000023018209],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006158436,0.00033702076,0.0003606906,0.00043382583,0.0001912888,0.00043456734,0.0004434995,0.0003659968,0.0017636192],"category_scores_gemma":[0.0027710828,0.00009174666,0.00017131734,0.0006534194,0.00021912028,0.00065201696,0.00021646044,0.00028688746,0.00037785523],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009875052,0.00013873701,0.0016189748,0.00026593846,0.00004267794,0.00013628943,0.00015245825,0.17038584,0.20174362,0.010493728,0.0024174345,0.61161685],"study_design_scores_gemma":[0.000044235498,0.00050157995,0.0013438129,0.000023686498,0.000017191207,0.00020940244,0.0000573453,0.854578,0.1385473,0.0022343525,0.002410712,0.000032374122],"about_ca_topic_score_codex":0.0031551651,"about_ca_topic_score_gemma":0.0051617385,"teacher_disagreement_score":0.0031551651,"about_ca_system_score_codex":0.00039110222,"about_ca_system_score_gemma":0.00047311524,"threshold_uncertainty_score":0.0062736273},"labels":[],"label_agreement":null},{"id":"W2119896749","doi":"10.1109/tvt.2004.841557","title":"Quantizer Design for Channel Codes With Soft-Output Decoding","year":2005,"lang":"en","type":"article","venue":"IEEE Transactions on Vehicular Technology","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"University of Waterloo","keywords":"Decoding methods; Gaussian; Algorithm; Channel (broadcasting); Quantization (signal processing); Computer science; Source code; Distortion (music); Turbo code; Electronic engineering; Engineering; Telecommunications; Bandwidth (computing); Physics; Amplifier","score_opus":0.0303894990355147,"score_gpt":0.2747929541998762,"score_spread":0.24440345516436152,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2119896749","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009339739,0.00029796673,0.9886058,0.00008569395,0.00004162945,0.00004908143,0.000042812768,0.00023100965,0.0013062513],"genre_scores_gemma":[0.48564783,0.00046476317,0.5100939,0.00011667749,0.00007742257,0.00019650093,0.00012019034,0.0000667791,0.0032159023],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99936885,0.00013480769,0.000033479857,0.0000657846,0.00035658522,0.000040589875],"domain_scores_gemma":[0.99909973,0.0003893608,0.000097467455,0.00008506689,0.0003035108,0.000024984802],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00065174914,0.0004163615,0.0004041876,0.0004355957,0.0002774148,0.0007041519,0.0006426748,0.000549359,0.0021726484],"category_scores_gemma":[0.001974915,0.00022031543,0.00014640979,0.00046093794,0.00051387935,0.00089119386,0.00061521115,0.0006807208,0.0005296385],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005087317,0.00008002126,0.0008541195,0.00050580536,0.000077335906,0.00022360426,0.000253931,0.3843947,0.16775839,0.14960109,0.0032061755,0.29253602],"study_design_scores_gemma":[0.000051253,0.00011215683,0.00015911157,0.000028745804,0.000015746024,0.0001287617,0.000020247277,0.9371252,0.047200803,0.011200633,0.003927525,0.000029838613],"about_ca_topic_score_codex":0.00086518837,"about_ca_topic_score_gemma":0.0018468474,"teacher_disagreement_score":0.0021726484,"about_ca_system_score_codex":0.0006530001,"about_ca_system_score_gemma":0.0008043376,"threshold_uncertainty_score":0.00726825},"labels":[],"label_agreement":null},{"id":"W2120252519","doi":"10.1109/pacrim.2007.4313176","title":"Lossless Compression of Mammographic Images by Chronological Sifting of Prediction Errors","year":2007,"lang":"en","type":"article","venue":"","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Lossless compression; Computer science; Artificial intelligence; Computer vision; JPEG 2000; Lossy compression; Mammography; Compression (physics); Image compression; Data compression; JPEG; Image (mathematics); Image processing; Medicine; Breast cancer; Materials science","score_opus":0.010785547464917125,"score_gpt":0.2732158313417373,"score_spread":0.2624302838768202,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2120252519","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2866342,0.0020563756,0.7063627,0.00020645214,0.00014900399,0.000098230674,0.00014532484,0.0011985367,0.0031491588],"genre_scores_gemma":[0.81321794,0.00097237254,0.18271263,0.000035509613,0.00004738339,0.000041810432,0.00024490606,0.00005291027,0.0026744837],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99988604,0.000014558641,0.000006865731,0.000012090863,0.000069356574,0.000011075344],"domain_scores_gemma":[0.9997911,0.00009559379,0.00003296143,0.000030173785,0.00004441617,0.0000057091866],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023303495,0.00025806326,0.00020604886,0.0004874808,0.00012599777,0.00022775191,0.00040508015,0.00021453624,0.0008180583],"category_scores_gemma":[0.00089144346,0.000093401555,0.00019855017,0.0005111139,0.00021080005,0.00046539426,0.00021685605,0.00020007507,0.00016522259],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010018045,0.00016727085,0.0024966074,0.00032251127,0.00006357902,0.0008004628,0.00025615873,0.1748301,0.22773585,0.010020773,0.00289593,0.579409],"study_design_scores_gemma":[0.000075447606,0.00047155024,0.003332548,0.000022797538,0.00004704675,0.0010304605,0.000047483438,0.87512344,0.114273064,0.0014238948,0.0041253953,0.000026717129],"about_ca_topic_score_codex":0.0011700909,"about_ca_topic_score_gemma":0.0012123436,"teacher_disagreement_score":0.0011700909,"about_ca_system_score_codex":0.00016289833,"about_ca_system_score_gemma":0.00019338753,"threshold_uncertainty_score":0.002736628},"labels":[],"label_agreement":null},{"id":"W2120623902","doi":"10.1109/vetecs.2009.5073532","title":"End-to-End Performance of Robust Multiple Description Scalar Quantizer","year":2009,"lang":"en","type":"article","venue":"","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Computer science; Forward error correction; Network packet; Robustness (evolution); Bit error rate; Packet loss; Multiple description coding; Error detection and correction; Encoder; Computer network; Real-time computing; Decoding methods; Algorithm","score_opus":0.03312870539468569,"score_gpt":0.26159266285315275,"score_spread":0.22846395745846707,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2120623902","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.80474275,0.00035325435,0.1898428,0.00017679257,0.000046307196,0.00006005979,0.00023884904,0.0019883297,0.0025507985],"genre_scores_gemma":[0.9858694,0.000046005112,0.012836167,0.000035488887,0.000004544969,0.000014991171,0.00018872478,0.0000222386,0.000982421],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993697,0.00013907261,0.000048163427,0.00010648464,0.00025268563,0.00008400893],"domain_scores_gemma":[0.99735814,0.0014942476,0.0002314839,0.00021524265,0.0006147238,0.00008617415],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001357382,0.0003809722,0.00056355126,0.00033572855,0.0003004539,0.0005504364,0.0005520526,0.00062739674,0.0018237463],"category_scores_gemma":[0.0029472723,0.00015646947,0.00013789676,0.00023352516,0.0003695736,0.0008487077,0.00058313477,0.00043986097,0.000320055],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00770497,0.0007144195,0.008184642,0.0002111196,0.00017189045,0.0005076948,0.00029669577,0.6681506,0.15072282,0.005093692,0.0024040805,0.15583731],"study_design_scores_gemma":[0.000033168017,0.0002697959,0.0007712016,0.000002767239,0.000010072316,0.000047146023,0.000019755065,0.96605545,0.03221629,0.00041073837,0.00014942422,0.000014149136],"about_ca_topic_score_codex":0.0022266388,"about_ca_topic_score_gemma":0.0017715117,"teacher_disagreement_score":0.0022266388,"about_ca_system_score_codex":0.00058550114,"about_ca_system_score_gemma":0.0004133094,"threshold_uncertainty_score":0.0071786046},"labels":[],"label_agreement":null},{"id":"W2120985148","doi":"10.1109/ccece.1995.528201","title":"Nonuniform weighted subsampling for digital image compression","year":2002,"lang":"en","type":"article","venue":"","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Lossless compression; Weighting; Computer science; Autoregressive model; Autocorrelation; Artificial intelligence; Image compression; Image (mathematics); Data compression; Lossy compression; Autocorrelation matrix; Pattern recognition (psychology); Algorithm; Computer vision; Image processing; Mathematics; Statistics","score_opus":0.02819130237601471,"score_gpt":0.26956447944725526,"score_spread":0.24137317707124054,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2120985148","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03583315,0.0023157871,0.95889103,0.00012934925,0.00013020622,0.000054325927,0.000078169964,0.00043889252,0.00212908],"genre_scores_gemma":[0.4793697,0.0025321676,0.5130911,0.00015602174,0.00022747602,0.0000878056,0.00038275254,0.00008653487,0.004066418],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997911,0.000049223658,0.000011446311,0.00003182847,0.00010412751,0.0000122585],"domain_scores_gemma":[0.99977654,0.00007982901,0.000022116908,0.00006514031,0.00004894069,0.000007371589],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034423586,0.0003463467,0.00028368668,0.00049361016,0.0001441676,0.00027348872,0.00032706847,0.00025568614,0.0011722752],"category_scores_gemma":[0.000990978,0.00008814123,0.00024261652,0.0007015945,0.00025373584,0.00050381175,0.00024219288,0.00027576246,0.00031657843],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003444246,0.00003909948,0.00060245366,0.00018114038,0.000052893574,0.00018875214,0.000067939436,0.058271844,0.13548402,0.03272217,0.003062222,0.76898307],"study_design_scores_gemma":[0.000025521414,0.00026286324,0.0014657812,0.000025263247,0.000056436325,0.000649376,0.000034558045,0.85036516,0.11111506,0.013657476,0.022311702,0.000030785846],"about_ca_topic_score_codex":0.00088951364,"about_ca_topic_score_gemma":0.0012019685,"teacher_disagreement_score":0.0011722752,"about_ca_system_score_codex":0.00025593396,"about_ca_system_score_gemma":0.00018622754,"threshold_uncertainty_score":0.003921628},"labels":[],"label_agreement":null},{"id":"W2121051850","doi":"10.1109/glocom.1999.831741","title":"Symbol-MAP-based trellis vector quantization","year":2003,"lang":"en","type":"article","venue":"","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Viterbi algorithm; Algorithm; Decoding methods; Sequential decoding; Iterative Viterbi decoding; Soft output Viterbi algorithm; Computer science; Trellis quantization; Vector quantization; Encoder; Trellis (graph); Convolutional code; Viterbi decoder; List decoding; Soft-decision decoder; Concatenated error correction code; Artificial intelligence; Image compression; Block code","score_opus":0.015159880198481579,"score_gpt":0.2634638770328365,"score_spread":0.24830399683435495,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2121051850","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0036509857,0.00029628538,0.9937512,0.000088999695,0.000064149026,0.000031139953,0.000075951655,0.0003823723,0.0016588861],"genre_scores_gemma":[0.28223062,0.00081166526,0.7093106,0.00020644286,0.0001972012,0.00017941165,0.00049724535,0.00017187551,0.0063949055],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991654,0.00015683153,0.000056910627,0.00009427285,0.00046162435,0.00006487131],"domain_scores_gemma":[0.9987716,0.00047233523,0.0000942945,0.00021270376,0.0004205887,0.000028500648],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006630297,0.00039590735,0.00064994284,0.00065775303,0.00034097178,0.0009139534,0.0011171172,0.00068512565,0.0023609484],"category_scores_gemma":[0.0037814928,0.00020942652,0.00035901682,0.0011454053,0.0006343122,0.0015903309,0.0006738802,0.0010585458,0.0011473262],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002191512,0.00005523626,0.000536388,0.00020182552,0.000054444088,0.00010789805,0.00015258364,0.37290728,0.025181683,0.18786559,0.005066365,0.40765163],"study_design_scores_gemma":[0.000022038506,0.00006173217,0.00015053779,0.000014869241,0.000011186833,0.00011500567,0.0000102123195,0.9443183,0.019935144,0.030813029,0.004523272,0.00002459828],"about_ca_topic_score_codex":0.0018943255,"about_ca_topic_score_gemma":0.0024079918,"teacher_disagreement_score":0.0023609484,"about_ca_system_score_codex":0.0007852206,"about_ca_system_score_gemma":0.00088607124,"threshold_uncertainty_score":0.007898152},"labels":[],"label_agreement":null},{"id":"W2121078004","doi":"10.1109/glocom.1994.512714","title":"Classification and spectral extrapolation based packet reconstruction for low-delay speech coding","year":2002,"lang":"en","type":"article","venue":"","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Extrapolation; Computer science; Speech coding; Speech recognition; Erasure; Network packet; Linear predictive coding; Voice activity detection; Algorithm; Frame (networking); Decoding methods; Filter (signal processing); Speech processing; Mathematics; Statistics; Telecommunications; Computer network","score_opus":0.04648075994823086,"score_gpt":0.27951588864686394,"score_spread":0.23303512869863308,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2121078004","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2756762,0.0004203633,0.72131234,0.00010879375,0.000030316565,0.000080792066,0.000043414468,0.0012839438,0.0010438698],"genre_scores_gemma":[0.76038146,0.00031043874,0.23738883,0.000050502593,0.00002927148,0.000042896365,0.00013762424,0.000048702146,0.0016103269],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99966943,0.00011129135,0.000017290196,0.000037673242,0.00013972021,0.00002471895],"domain_scores_gemma":[0.9990101,0.0004852642,0.00010835363,0.00016171517,0.00021390706,0.000020677087],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007395106,0.0003061777,0.00021595477,0.00039877568,0.00016813654,0.00023624976,0.0003249395,0.00033343132,0.0007592867],"category_scores_gemma":[0.0019447745,0.00012119122,0.00017653966,0.00023772004,0.0002829374,0.00045918577,0.00024161351,0.0003898353,0.00036925735],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.001453206,0.00018947775,0.0019329671,0.00013426859,0.000035233832,0.00023392304,0.00015587582,0.08663718,0.39080074,0.0028533202,0.0007119022,0.514862],"study_design_scores_gemma":[0.000029666095,0.00044470828,0.0012549472,0.000013237331,0.000022886807,0.00028242532,0.000027003249,0.7598398,0.23599279,0.00088290544,0.0011884577,0.000021208196],"about_ca_topic_score_codex":0.0008129962,"about_ca_topic_score_gemma":0.0009579203,"teacher_disagreement_score":0.0008129962,"about_ca_system_score_codex":0.0002007368,"about_ca_system_score_gemma":0.00023587636,"threshold_uncertainty_score":0.0039109588},"labels":[],"label_agreement":null},{"id":"W2121396321","doi":"10.1109/icip.2000.899427","title":"Joint space-frequency segmentation, entropy coding and the compression of ultrasound images","year":2000,"lang":"en","type":"article","venue":"","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Computer science; Segmentation; Artificial intelligence; Data compression; Entropy (arrow of time); Algorithm; Entropy encoding; Image compression; Image segmentation; Pattern recognition (psychology); Coding (social sciences); Computer vision; Mathematics; Image processing; Image (mathematics); Statistics; Physics","score_opus":0.011239399720948931,"score_gpt":0.25648410202357663,"score_spread":0.2452447023026277,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2121396321","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07715196,0.0027265914,0.9162159,0.00022747363,0.00006352132,0.000040665083,0.000057988877,0.00034283154,0.0031730526],"genre_scores_gemma":[0.6390936,0.0022205005,0.35470262,0.00011739021,0.00014755096,0.00007048745,0.00016737837,0.000113205715,0.0033673495],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99961746,0.00010459527,0.000018024031,0.000030378698,0.00020832341,0.000021225916],"domain_scores_gemma":[0.9990897,0.0006074823,0.000093266426,0.00009800289,0.000095149946,0.000016391645],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005365064,0.00038847732,0.00034323765,0.0008782466,0.0002042304,0.0004439525,0.0002640525,0.00053406507,0.0007944132],"category_scores_gemma":[0.002635632,0.00015409749,0.00019577492,0.001008529,0.0010017983,0.0010586375,0.0005018215,0.00039383344,0.00016575468],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00056765665,0.00006632557,0.0011040239,0.0002711494,0.000051272178,0.00025471736,0.0002760684,0.26098132,0.14550814,0.06389918,0.001564344,0.5254557],"study_design_scores_gemma":[0.000026656755,0.0003309951,0.0038595821,0.000054434302,0.000031233005,0.0010394241,0.000077532786,0.79866815,0.14922439,0.040827893,0.005800028,0.000059695627],"about_ca_topic_score_codex":0.00068617275,"about_ca_topic_score_gemma":0.0011416908,"teacher_disagreement_score":0.0008782466,"about_ca_system_score_codex":0.00023474696,"about_ca_system_score_gemma":0.00021557584,"threshold_uncertainty_score":0.0028373003},"labels":[],"label_agreement":null},{"id":"W2121759716","doi":"10.1109/bigdata.2013.6691552","title":"Transparent composite model for large scale image/video processing","year":2013,"lang":"en","type":"article","venue":"","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Discrete cosine transform; Computer science; Image processing; Artificial intelligence; Quantization (signal processing); Computer vision; Entropy (arrow of time); Algorithm; Image (mathematics)","score_opus":0.029117928450665076,"score_gpt":0.3073870468655886,"score_spread":0.2782691184149235,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2121759716","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0055636694,0.00011064075,0.99261206,0.00010440807,0.00002929944,0.00001848825,0.000049214857,0.0001435177,0.0013686297],"genre_scores_gemma":[0.71093094,0.0011730354,0.27164608,0.00029588575,0.00020200567,0.00029202667,0.00045048312,0.00022522599,0.014784291],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99930406,0.00013686834,0.00003086431,0.00015039991,0.0003101194,0.00006777445],"domain_scores_gemma":[0.9985936,0.0006323276,0.00022644315,0.0002214585,0.00025079367,0.000075330645],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009832685,0.00071909494,0.00074805046,0.0007867729,0.0004047019,0.0014311771,0.0013082848,0.0010754388,0.0026915146],"category_scores_gemma":[0.0031869628,0.00040673686,0.0011720078,0.00082174956,0.0012093823,0.0021160035,0.0013156733,0.0017919436,0.00081481994],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017339036,0.00007493679,0.0008113251,0.00017811843,0.000057250647,0.00033412612,0.0001476372,0.7745984,0.013233773,0.16928983,0.0020821127,0.03901913],"study_design_scores_gemma":[0.0000023113669,0.000015253903,0.00006442308,0.0000026707667,0.000004236518,0.000030032144,0.0000055006344,0.98749626,0.0005294651,0.011395989,0.00044865382,0.0000051158822],"about_ca_topic_score_codex":0.002201662,"about_ca_topic_score_gemma":0.0013977116,"teacher_disagreement_score":0.0026915146,"about_ca_system_score_codex":0.0006620125,"about_ca_system_score_gemma":0.0006696389,"threshold_uncertainty_score":0.009003997},"labels":[],"label_agreement":null},{"id":"W2121953822","doi":"10.1109/icip.2009.5414013","title":"3D scalable lossless compression of medical images based on global and local symmetries","year":2009,"lang":"en","type":"article","venue":"","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Lossless compression; JPEG 2000; Computer science; Transform coding; Wavelet transform; Data compression; Algorithm; Wavelet; Image compression; Artificial intelligence; Computer vision; Discrete cosine transform; Image (mathematics); Image processing","score_opus":0.009883703233967287,"score_gpt":0.29715262427377,"score_spread":0.28726892103980267,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2121953822","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04997833,0.00056387874,0.947178,0.00019408156,0.000046817033,0.00005852347,0.00012197872,0.0005789118,0.0012794891],"genre_scores_gemma":[0.32426903,0.0010882858,0.671152,0.00017699301,0.000081292754,0.00009000751,0.00040010645,0.00013303883,0.002609268],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998148,0.00002448929,0.000008710709,0.000013650116,0.00012904563,0.00000934765],"domain_scores_gemma":[0.99976176,0.000091332455,0.00003258479,0.000055452227,0.000045870653,0.000013092],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033112106,0.00042956296,0.0003306173,0.0005074075,0.000105638384,0.00036891695,0.00046455298,0.0002967086,0.0009667184],"category_scores_gemma":[0.0007774027,0.00020970947,0.00036551387,0.00036891285,0.00028955535,0.0006042315,0.00049619743,0.00047695896,0.0003205063],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00038079484,0.00006693596,0.00062955887,0.00023721051,0.00005517603,0.0006258617,0.00012894986,0.10365965,0.5039407,0.0132720675,0.0028023722,0.37420076],"study_design_scores_gemma":[0.000042041862,0.00014354866,0.0011329388,0.000016922644,0.000027321208,0.0011236666,0.000019253326,0.8309784,0.15964846,0.0025341122,0.0043006716,0.000032651027],"about_ca_topic_score_codex":0.00045585746,"about_ca_topic_score_gemma":0.0007417172,"teacher_disagreement_score":0.0009667184,"about_ca_system_score_codex":0.00020572025,"about_ca_system_score_gemma":0.00027692012,"threshold_uncertainty_score":0.0032340288},"labels":[],"label_agreement":null},{"id":"W2123034937","doi":"10.1109/dcc.2008.39","title":"Filter Banks for Prediction-Compensated Multiple Description Coding","year":2008,"lang":"en","type":"article","venue":"DCC","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Biorthogonal system; Multiple description coding; Filter bank; JPEG; Algorithm; Computer science; Coding (social sciences); Filter (signal processing); Transform coding; Filter design; Sub-band coding; JPEG 2000; Data compression; Image compression; Theoretical computer science; Mathematics; Decoding methods; Artificial intelligence; Image processing; Image (mathematics); Computer vision; Discrete cosine transform; Wavelet transform; Wavelet; Statistics","score_opus":0.06031900922258013,"score_gpt":0.2629073698905953,"score_spread":0.2025883606680152,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2123034937","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005555139,0.00056691223,0.9925412,0.00009858036,0.00003292846,0.000017272368,0.000023495102,0.00008335156,0.001081106],"genre_scores_gemma":[0.27078217,0.0013159808,0.7239039,0.00016092334,0.00011809794,0.00010628191,0.00018708229,0.000039706243,0.0033858255],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99961275,0.000092294176,0.000019453586,0.00006091541,0.00018443994,0.000030231156],"domain_scores_gemma":[0.9995092,0.00023715405,0.000049389146,0.00006250295,0.00012931919,0.000012391888],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00063585694,0.0003948456,0.00030599648,0.000348295,0.00019165412,0.0004882444,0.00040058146,0.0007232515,0.0016895192],"category_scores_gemma":[0.001444198,0.0002272465,0.00026118185,0.00039897324,0.0004088364,0.00075994065,0.00031804593,0.0005884127,0.0005104554],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00036406665,0.000071459464,0.00072330463,0.0002494475,0.000050265302,0.00018880535,0.000118028605,0.19508916,0.08492469,0.15147802,0.0042745294,0.5624683],"study_design_scores_gemma":[0.000037872687,0.00011143001,0.00033595882,0.00004496035,0.000029296183,0.00021409124,0.000020934402,0.93637365,0.030402381,0.020307327,0.012089524,0.000032634292],"about_ca_topic_score_codex":0.0009610046,"about_ca_topic_score_gemma":0.0011851783,"teacher_disagreement_score":0.0016895192,"about_ca_system_score_codex":0.00053075404,"about_ca_system_score_gemma":0.00062038266,"threshold_uncertainty_score":0.0056520104},"labels":[],"label_agreement":null},{"id":"W2123833862","doi":"10.1109/icip.1995.529582","title":"Object-oriented coding using successive motion field segmentation and estimation","year":2002,"lang":"en","type":"article","venue":"Proceedings - International Conference on Image Processing","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université Laval","funders":"","keywords":"Motion estimation; Quarter-pixel motion; Motion field; Motion compensation; Block-matching algorithm; Artificial intelligence; Computer vision; Segmentation; Computer science; Maximum a posteriori estimation; Data compression; Image segmentation; Block (permutation group theory); Algorithm; Coding (social sciences); Pattern recognition (psychology); Mathematics; Object (grammar); Video tracking; Maximum likelihood","score_opus":0.04449922300831346,"score_gpt":0.33114911869576424,"score_spread":0.2866498956874508,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2123833862","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0052876123,0.00012010534,0.9937448,0.000024875453,0.000014708058,0.000029045266,0.00001340426,0.00031183063,0.00045371853],"genre_scores_gemma":[0.14318511,0.0003666754,0.8538768,0.000054105778,0.000036404526,0.00010098231,0.00017846828,0.00005880945,0.0021426114],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99966764,0.000049427792,0.000017227783,0.00003909098,0.00020453671,0.000022026434],"domain_scores_gemma":[0.99960715,0.00013724332,0.0000674949,0.00006254939,0.000110663925,0.000014891692],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042035797,0.000486512,0.00037732808,0.0010475976,0.00018221243,0.00045595848,0.0005981124,0.0004910937,0.00091450993],"category_scores_gemma":[0.001368843,0.0002225606,0.000372269,0.00085086114,0.00031586149,0.0006557713,0.00046333924,0.00038131862,0.00041723682],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002013138,0.00006882122,0.0006446718,0.000108865905,0.000053420838,0.00010645341,0.00012087579,0.175219,0.084809035,0.022061152,0.0018013765,0.71480495],"study_design_scores_gemma":[0.00001906625,0.000039806924,0.0004548635,0.000013109867,0.000011165369,0.00013863064,0.0000063741386,0.9702581,0.021860592,0.0044032848,0.0027782891,0.000016729999],"about_ca_topic_score_codex":0.002914655,"about_ca_topic_score_gemma":0.0028744955,"teacher_disagreement_score":0.002914655,"about_ca_system_score_codex":0.00047747482,"about_ca_system_score_gemma":0.00063284946,"threshold_uncertainty_score":0.005795419},"labels":[],"label_agreement":null},{"id":"W2123843869","doi":"10.1109/icce.2003.1218863","title":"Time distributed DCT architecture for multimedia applications","year":2003,"lang":"en","type":"article","venue":"","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"Natural Sciences and Engineering Research Council of Canada; University of Calgary","keywords":"Discrete cosine transform; Computer science; Computation; Redundancy (engineering); Architecture; Exploit; Coefficient matrix; Computer architecture; Computer engineering; Algorithm; Artificial intelligence; Image (mathematics); Operating system","score_opus":0.010321327387807807,"score_gpt":0.2725504268466057,"score_spread":0.26222909945879785,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2123843869","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06692695,0.0028210036,0.8949102,0.00043025505,0.00040265633,0.00014729195,0.00013374262,0.0025267566,0.03170117],"genre_scores_gemma":[0.5398963,0.0018031285,0.42788523,0.00027352036,0.00025248394,0.00014629004,0.0005505964,0.00019040937,0.029002083],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998853,0.000014589541,0.000006999678,0.000020741674,0.000058802078,0.000013493364],"domain_scores_gemma":[0.99990845,0.000012731491,0.0000073929373,0.000016797956,0.000045915505,0.000008772116],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013570557,0.00024461545,0.00015500911,0.00028475648,0.00023835733,0.0003916759,0.00045845882,0.00026689997,0.0039983164],"category_scores_gemma":[0.00029084133,0.00009503327,0.00015176304,0.0003838452,0.00014219206,0.000550236,0.00017245757,0.0003257301,0.0012400429],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00040321902,0.000090673544,0.0008520807,0.00023859982,0.000036386813,0.00033965148,0.000077424025,0.03986361,0.44082746,0.0591847,0.011774533,0.44631156],"study_design_scores_gemma":[0.00015951446,0.00073472795,0.0018877941,0.00005685239,0.000094611816,0.0018160575,0.00006225023,0.5831585,0.22446704,0.016279915,0.17123048,0.000052278563],"about_ca_topic_score_codex":0.00078191503,"about_ca_topic_score_gemma":0.0023989347,"teacher_disagreement_score":0.0039983164,"about_ca_system_score_codex":0.00042862442,"about_ca_system_score_gemma":0.0004512442,"threshold_uncertainty_score":0.0133756995},"labels":[],"label_agreement":null},{"id":"W2123880679","doi":"10.1109/ccece.2005.1557049","title":"Reconfigurable, fully scalable integer wavelet transform unit for JPEG2000","year":2006,"lang":"en","type":"article","venue":"","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Computer science; Discrete wavelet transform; Lifting scheme; Wavelet transform; JPEG 2000; Wavelet; Second-generation wavelet transform; Parallel computing; Image compression; Scalability; Stationary wavelet transform; Computational science; Algorithm; Computer hardware; Artificial intelligence; Image processing; Image (mathematics)","score_opus":0.016320215998659893,"score_gpt":0.26138246306720064,"score_spread":0.24506224706854074,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2123880679","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24975766,0.0008094644,0.71798044,0.00021440432,0.00029721734,0.00045513708,0.00050474546,0.009553303,0.020427605],"genre_scores_gemma":[0.75951326,0.0002761901,0.23015918,0.00013541747,0.00004781389,0.0001479124,0.00055134104,0.00016771608,0.009001186],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99988604,0.00001199454,0.000009477455,0.00002151954,0.000052525917,0.00001830109],"domain_scores_gemma":[0.9999076,0.000014839028,0.00001731861,0.00002733806,0.00002492867,0.000008035183],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012984646,0.00027423393,0.00020228347,0.00024281902,0.00011593383,0.00036064076,0.00060336397,0.00018096338,0.003302336],"category_scores_gemma":[0.0003781661,0.00012554157,0.00014775687,0.0002094461,0.0001025407,0.00039937068,0.00016495043,0.0002926348,0.0008350016],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008879678,0.0001367225,0.0012762542,0.0002843702,0.00004301767,0.0006806714,0.00012561232,0.01781928,0.6250916,0.013823215,0.007738843,0.33209246],"study_design_scores_gemma":[0.00027264937,0.0014756009,0.00421969,0.00006730639,0.00009263954,0.0017078022,0.000051757648,0.33872107,0.60345554,0.0021889918,0.04767214,0.00007481658],"about_ca_topic_score_codex":0.0005631005,"about_ca_topic_score_gemma":0.0006220535,"teacher_disagreement_score":0.003302336,"about_ca_system_score_codex":0.00020522965,"about_ca_system_score_gemma":0.0002443954,"threshold_uncertainty_score":0.011047423},"labels":[],"label_agreement":null},{"id":"W2124807578","doi":"10.1109/dcc.2005.1","title":"A Block-Based Inter-Band Lossless Hyperspectral Image Compressor","year":2005,"lang":"en","type":"article","venue":"Data Compression Conference","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":27,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Hyperspectral imaging; Computer science; Lossless compression; Block (permutation group theory); Artificial intelligence; Computer vision; Image (mathematics); Data compression; Mathematics","score_opus":0.06272314475331624,"score_gpt":0.3295744468571449,"score_spread":0.2668513021038286,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2124807578","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06656431,0.0009104007,0.9261245,0.0006883432,0.00012735267,0.00014024701,0.0002745107,0.0015338382,0.0036365653],"genre_scores_gemma":[0.32670888,0.0008014099,0.6558811,0.00049116777,0.00019848869,0.0001827448,0.0006299037,0.00012925036,0.014977135],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9998348,0.000021150205,0.000007082397,0.000023778202,0.00009731422,0.000015936945],"domain_scores_gemma":[0.99970835,0.000064271444,0.00003733763,0.00006387012,0.00010092645,0.000025294641],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023281598,0.0003400941,0.000426444,0.00039631347,0.00031437233,0.00038695306,0.0008851552,0.00043150442,0.0023799504],"category_scores_gemma":[0.00049116585,0.00018549545,0.00020651244,0.00048669658,0.00034036947,0.000835331,0.00040381862,0.00067515945,0.00087593583],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00067850796,0.00022649883,0.0014718839,0.00025185873,0.00007037045,0.00017277888,0.000089003595,0.038389254,0.32231176,0.0086387005,0.007596553,0.6201028],"study_design_scores_gemma":[0.000079108366,0.00036075714,0.0014902799,0.000024481586,0.000051358864,0.00047734572,0.00003371417,0.7162356,0.26257724,0.0010396829,0.017578313,0.00005214263],"about_ca_topic_score_codex":0.0025377388,"about_ca_topic_score_gemma":0.004112352,"teacher_disagreement_score":0.0025377388,"about_ca_system_score_codex":0.0003171503,"about_ca_system_score_gemma":0.00045365226,"threshold_uncertainty_score":0.00796175},"labels":[],"label_agreement":null},{"id":"W2124945154","doi":"10.1109/ccece.1995.526597","title":"An improved K-means clustering algorithm and application to combined multi-codebook/MLP neural network speech recognition","year":2002,"lang":"en","type":"article","venue":"","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Codebook; Computer science; Cluster analysis; Linde–Buzo–Gray algorithm; Artificial neural network; Unsupervised learning; Pattern recognition (psychology); Artificial intelligence; Algorithm; Computation; Neural gas; Time delay neural network","score_opus":0.025012933714848955,"score_gpt":0.27375292894855524,"score_spread":0.2487399952337063,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2124945154","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0044493144,0.00020494012,0.9938492,0.00006354316,0.000050444076,0.0000341337,0.000034052704,0.00068731734,0.00062711106],"genre_scores_gemma":[0.057600453,0.00015581449,0.93963116,0.00003789818,0.00003578228,0.00009311999,0.00015096198,0.00010497026,0.0021897857],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986066,0.00018838681,0.000097245495,0.00029037098,0.0007523567,0.000065065076],"domain_scores_gemma":[0.9989096,0.00018197276,0.00006258638,0.00012709382,0.000687796,0.00003086113],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00094038236,0.00068201293,0.0010341558,0.0013183809,0.0006768858,0.0006406744,0.0012765129,0.0012234628,0.002111367],"category_scores_gemma":[0.0025683017,0.00056053896,0.00072900363,0.0018787205,0.0005241672,0.0012602408,0.0007946308,0.0010352377,0.001419226],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018214766,0.00008129478,0.0007072854,0.00019684626,0.00010915126,0.00012722956,0.00018006387,0.1926838,0.056830913,0.006975751,0.004448503,0.737477],"study_design_scores_gemma":[0.000019887164,0.000041162308,0.0008470387,0.000011305718,0.000022745713,0.00016400935,0.00002138607,0.97512585,0.016964791,0.0019863728,0.0047528865,0.000042553143],"about_ca_topic_score_codex":0.009703568,"about_ca_topic_score_gemma":0.011752645,"teacher_disagreement_score":0.009703568,"about_ca_system_score_codex":0.00076542795,"about_ca_system_score_gemma":0.0009101154,"threshold_uncertainty_score":0.019294202},"labels":[],"label_agreement":null},{"id":"W2125160547","doi":"10.1109/icassp.1984.1172695","title":"Implementation of a full duplex 2.4 kbps LPC vocoder on a single TMS-320 microprocessor chip","year":2005,"lang":"en","type":"article","venue":"","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Communications Research Centre Canada","funders":"","keywords":"Microprocessor; Computer science; Chip; Computer hardware; Digital signal processor; Digital signal processing; Linear predictive coding; Embedded system; Speech coding; Speech recognition; Telecommunications","score_opus":0.0224978518620011,"score_gpt":0.3164457399830885,"score_spread":0.2939478881210874,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2125160547","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.36483884,0.0003730458,0.6087005,0.00024022379,0.00019664048,0.0006169993,0.0006770417,0.009789902,0.014566921],"genre_scores_gemma":[0.6585244,0.0001829494,0.3237293,0.00021164937,0.00007064651,0.00027660927,0.0007346902,0.00029047142,0.015979204],"study_design_codex":"bench_or_experimental","study_design_gemma":"not_applicable","domain_scores_codex":[0.9997435,0.000023469918,0.000022349364,0.000054615637,0.000111047164,0.000044890476],"domain_scores_gemma":[0.9996538,0.000086163775,0.000029308172,0.000047677866,0.00014923517,0.000033828343],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025956528,0.00032047267,0.0002835812,0.00043496498,0.00021555938,0.00042222842,0.00072266697,0.00028874984,0.005686683],"category_scores_gemma":[0.0006056161,0.00019102634,0.0001560365,0.00018920634,0.0001402887,0.0003578482,0.00024460125,0.00030283016,0.0013520702],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00043734044,0.00016026832,0.0012724176,0.00019971048,0.000042178774,0.00029567897,0.00015966207,0.005003416,0.8086638,0.0021001948,0.0036875606,0.1779778],"study_design_scores_gemma":[0.00017017698,0.0017087767,0.0049820086,0.000038877057,0.00008850389,0.0010844516,0.000085242114,0.10846179,0.85045063,0.0005344548,0.03233872,0.000056318495],"about_ca_topic_score_codex":0.0009710112,"about_ca_topic_score_gemma":0.00164539,"teacher_disagreement_score":0.005686683,"about_ca_system_score_codex":0.00038198772,"about_ca_system_score_gemma":0.0007203165,"threshold_uncertainty_score":0.019023836},"labels":[],"label_agreement":null},{"id":"W2125175190","doi":"10.1109/icassp.2005.1415231","title":"Increasing the Robustness of CELP-Based Coders By Constrained Optimization","year":2006,"lang":"en","type":"article","venue":"","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Sherbrooke","funders":"","keywords":"Code-excited linear prediction; Computer science; Codec; Codebook; Speech coding; Speech recognition; Encoder; Robustness (evolution); Adaptive Multi-Rate audio codec; Linear predictive coding; Vector sum excited linear prediction; Algorithm; Voice activity detection; Speech processing; Computer hardware","score_opus":0.00706002813003404,"score_gpt":0.22619548895076458,"score_spread":0.21913546082073054,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2125175190","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.062775634,0.0003353099,0.9316596,0.0001716099,0.000025833475,0.000057493908,0.00006685815,0.000540608,0.004367029],"genre_scores_gemma":[0.8019481,0.00040610213,0.19344829,0.00018568762,0.000039688777,0.00015147579,0.00018516772,0.0002682156,0.0033672927],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99920267,0.00019284042,0.000043595093,0.00011223968,0.000369861,0.00007883067],"domain_scores_gemma":[0.9969721,0.0018938048,0.0002947053,0.00034211884,0.00043904223,0.000058198628],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001184038,0.00087761757,0.00047879675,0.00048791614,0.00023436343,0.0007437135,0.00071523554,0.0009185116,0.0014170072],"category_scores_gemma":[0.008699192,0.00030511525,0.0002709192,0.00036882024,0.0008808886,0.0009780448,0.0009570545,0.00090456614,0.00061267725],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003695711,0.00006300754,0.0008837701,0.000112434005,0.000049827573,0.00017834465,0.000075693824,0.81914127,0.085734926,0.017740909,0.0009646237,0.07468549],"study_design_scores_gemma":[0.000014677038,0.00005370594,0.00014821955,0.0000098953205,0.000006504889,0.00007160692,0.000010353704,0.9798379,0.017278818,0.0019615265,0.00059289375,0.000013819079],"about_ca_topic_score_codex":0.001857752,"about_ca_topic_score_gemma":0.001500795,"teacher_disagreement_score":0.001857752,"about_ca_system_score_codex":0.0005260735,"about_ca_system_score_gemma":0.00059448415,"threshold_uncertainty_score":0.0062618256},"labels":[],"label_agreement":null},{"id":"W2125570459","doi":"10.1109/icme.2006.262770","title":"An Architecture Design of Threshold-Based Best-Basis Algorithm","year":2006,"lang":"en","type":"article","venue":"","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Computer science; Correctness; Wavelet; Algorithm; Basis (linear algebra); Wavelet packet decomposition; VHDL; Pixel; Field-programmable gate array; Filter (signal processing); Data compression; Noise (video); Image compression; Wavelet transform; Image (mathematics); Artificial intelligence; Image processing; Computer hardware; Computer vision; Mathematics","score_opus":0.016843879426297958,"score_gpt":0.2722404009297623,"score_spread":0.25539652150346437,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2125570459","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03571852,0.0006127343,0.95251477,0.00020865811,0.00013442912,0.00011406621,0.000094852694,0.0030520738,0.0075500403],"genre_scores_gemma":[0.51859653,0.00038371363,0.47368366,0.00018915292,0.00006380056,0.00014128487,0.0002954075,0.00012623971,0.006520205],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997366,0.000034798435,0.000019548675,0.00006023202,0.00011137528,0.000037326972],"domain_scores_gemma":[0.9997837,0.000022218203,0.000014094817,0.000027594338,0.00013836159,0.000014065974],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022702281,0.0002588671,0.00032948737,0.00062070356,0.00040320394,0.00091070315,0.0011157076,0.00054125086,0.0026458297],"category_scores_gemma":[0.0004914428,0.00025439615,0.0002325513,0.00042158418,0.00015927613,0.00061122206,0.0002633636,0.00035407633,0.0012265402],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00079162867,0.00012073964,0.0026772413,0.00036728117,0.00017694867,0.00034533456,0.00029690904,0.09002403,0.2734185,0.02671062,0.009125931,0.5959448],"study_design_scores_gemma":[0.0001394683,0.0005387657,0.0022351202,0.00004736697,0.000137479,0.0010179796,0.000066235974,0.80549675,0.15726815,0.0051402026,0.027845955,0.00006656729],"about_ca_topic_score_codex":0.001849938,"about_ca_topic_score_gemma":0.0018014685,"teacher_disagreement_score":0.0026458297,"about_ca_system_score_codex":0.00062836526,"about_ca_system_score_gemma":0.0007561428,"threshold_uncertainty_score":0.008851171},"labels":[],"label_agreement":null},{"id":"W2125627313","doi":"10.1109/icc.1991.162369","title":"Performance study of frame replenishment transmission systems","year":2002,"lang":"en","type":"article","venue":"","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Coding (social sciences); Computer science; Code word; Vector quantization; Quantization (signal processing); Propagation of uncertainty; Algorithm; Transmission channel; Speech recognition; Decoding methods; Transmission (telecommunications); Telecommunications; Mathematics; Statistics","score_opus":0.029531580463948267,"score_gpt":0.2566346229759691,"score_spread":0.22710304251202085,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2125627313","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.62360364,0.0025784879,0.35903582,0.00037950306,0.00009647715,0.00013675328,0.00024969404,0.0021539635,0.011765694],"genre_scores_gemma":[0.98202145,0.0002676155,0.015905552,0.00004102033,0.000022951212,0.000022664835,0.00018057432,0.000039007646,0.0014991025],"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99853384,0.00042781554,0.00006844931,0.00013216719,0.0006357507,0.00020199925],"domain_scores_gemma":[0.99387556,0.00334574,0.0003517128,0.0003708679,0.0019461595,0.00010986571],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014985779,0.00050573825,0.0005488644,0.0009074355,0.0006884132,0.0010282756,0.00078484317,0.00062009244,0.0034130532],"category_scores_gemma":[0.007452414,0.00021362341,0.00019973675,0.0008704105,0.00040037703,0.001198637,0.0005529227,0.00037305904,0.0005380846],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0029346829,0.00018327325,0.008818405,0.00041804134,0.0001463921,0.0005218102,0.00064904074,0.6277505,0.050568804,0.01511048,0.0040505575,0.28884795],"study_design_scores_gemma":[0.00003373961,0.0004535098,0.0012846369,0.000017059263,0.000037518806,0.00022913305,0.000077228746,0.97877824,0.016726717,0.0010722274,0.0012597608,0.000030366327],"about_ca_topic_score_codex":0.0074328673,"about_ca_topic_score_gemma":0.0031950849,"teacher_disagreement_score":0.0074328673,"about_ca_system_score_codex":0.0011723266,"about_ca_system_score_gemma":0.00065980793,"threshold_uncertainty_score":0.01477921},"labels":[],"label_agreement":null},{"id":"W2126409525","doi":"10.1109/nnsp.1993.471884","title":"Competitive learning and winning-weighted competition for optimal vector quantizer design","year":2002,"lang":"en","type":"article","venue":"","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Vector quantization; Codebook; Monotonic function; Learning vector quantization; Linde–Buzo–Gray algorithm; Artificial intelligence; Competitive learning; Computer science; Generalization; Distortion (music); Self-organizing map; Algorithm; Mathematics; Mathematical optimization; Unsupervised learning; Artificial neural network","score_opus":0.03404347020418967,"score_gpt":0.27814309504201484,"score_spread":0.24409962483782516,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2126409525","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009136655,0.00023037051,0.9883577,0.00009702666,0.000023410134,0.000029735762,0.000015024364,0.00011936668,0.00199072],"genre_scores_gemma":[0.6927727,0.00027223947,0.30215794,0.00018634796,0.000055427878,0.00020333017,0.000095472315,0.000069520276,0.0041869376],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99925464,0.00023629524,0.00004472106,0.00009097534,0.000297136,0.00007632859],"domain_scores_gemma":[0.99886286,0.0005877381,0.00008594359,0.00009093464,0.00032187672,0.00005066529],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019058909,0.00038534714,0.00065029104,0.0004683917,0.0003780462,0.0007626365,0.0013144691,0.0006430969,0.0025169333],"category_scores_gemma":[0.004836088,0.00025357574,0.00030044644,0.0005664377,0.0008660937,0.001160066,0.00084334635,0.000647792,0.00034995817],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000102742124,0.00005330257,0.00049371744,0.000094293784,0.000040872,0.000041423493,0.00009868098,0.6578639,0.0027959223,0.14106399,0.0021044565,0.19524674],"study_design_scores_gemma":[0.0000051820657,0.000020098512,0.000029725326,0.0000023298335,0.0000019200138,0.0000102894455,0.0000035721503,0.98559594,0.00038540448,0.013548421,0.00039324735,0.0000039470324],"about_ca_topic_score_codex":0.0039952486,"about_ca_topic_score_gemma":0.0043601934,"teacher_disagreement_score":0.0039952486,"about_ca_system_score_codex":0.00085875654,"about_ca_system_score_gemma":0.0009864005,"threshold_uncertainty_score":0.010079443},"labels":[],"label_agreement":null},{"id":"W2126540618","doi":"10.1109/tbc.2008.2000551","title":"Decoupled 3-D Zerotree Structure for Wavelet-Based Video Coding","year":2008,"lang":"en","type":"article","venue":"IEEE Transactions on Broadcasting","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Communications Research Centre Canada","funders":"","keywords":"Wavelet transform; Wavelet; Coding (social sciences); Algorithm; Computer science; Stationary wavelet transform; Discrete wavelet transform; Orientation (vector space); Second-generation wavelet transform; Artificial intelligence; Mathematics; Pattern recognition (psychology); Statistics","score_opus":0.03711958329293944,"score_gpt":0.2756683642529524,"score_spread":0.23854878096001295,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2126540618","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014348857,0.00030499842,0.9839797,0.000052956162,0.000036748992,0.00003789121,0.00010360209,0.00028899286,0.0008463118],"genre_scores_gemma":[0.22045062,0.000696556,0.77546364,0.00012092537,0.000049506656,0.00015500952,0.0007331327,0.000100502795,0.002230154],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99985087,0.00002375916,0.000011011702,0.000014287976,0.00008680882,0.000013286474],"domain_scores_gemma":[0.9996395,0.00008086814,0.000038173224,0.000078412995,0.00014310531,0.000019964567],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019134243,0.00035356244,0.00028890104,0.00075291644,0.00026138016,0.00044138168,0.0006834763,0.00038477982,0.0012775237],"category_scores_gemma":[0.0007798631,0.0001872544,0.00030254477,0.0011592811,0.0003120816,0.00073519547,0.00041682,0.00063878216,0.0006013053],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002182204,0.000096465665,0.0006444241,0.0002688001,0.000031213753,0.000193862,0.0001294564,0.042429637,0.3818128,0.0684809,0.0047841123,0.50091004],"study_design_scores_gemma":[0.00006152068,0.00030450287,0.001164649,0.000057211553,0.00004154076,0.00058313954,0.000051002633,0.8158785,0.13195275,0.027192641,0.022646135,0.00006635967],"about_ca_topic_score_codex":0.0010637013,"about_ca_topic_score_gemma":0.0022070978,"teacher_disagreement_score":0.0012775237,"about_ca_system_score_codex":0.00037653575,"about_ca_system_score_gemma":0.000621532,"threshold_uncertainty_score":0.0042737722},"labels":[],"label_agreement":null},{"id":"W2127058320","doi":"10.1109/vetec.1994.345030","title":"A low power, single chip realization of a low-speed, low-delay CELP coder/decoder for indoor wireless systems","year":2002,"lang":"en","type":"article","venue":"","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Computer science; Code-excited linear prediction; Wireless; Codec; Chip; Coding (social sciences); Speech coding; Speech recognition; Computer hardware; Linear predictive coding; Telecommunications","score_opus":0.025520675439793698,"score_gpt":0.2581663515517199,"score_spread":0.23264567611192621,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2127058320","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.25792256,0.00088042044,0.70130754,0.0005753043,0.00033668533,0.0005095392,0.00088491425,0.006975095,0.030607956],"genre_scores_gemma":[0.6743083,0.00030340208,0.3051086,0.00026887996,0.000067006506,0.00019737346,0.0007752951,0.0001605062,0.018810565],"study_design_codex":"bench_or_experimental","study_design_gemma":"not_applicable","domain_scores_codex":[0.9997483,0.000033638764,0.000014339035,0.000051938412,0.00012172684,0.00003018435],"domain_scores_gemma":[0.9996885,0.0000690392,0.000041865685,0.00006440982,0.000108179425,0.000028051194],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002147331,0.00037311186,0.00026226806,0.00031292654,0.00027932142,0.0005755194,0.001096974,0.0004417942,0.005924191],"category_scores_gemma":[0.0005089762,0.00025220573,0.00017569079,0.00019982361,0.0002025164,0.0005243669,0.00023761149,0.00040863655,0.0019615868],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00046012108,0.00020197444,0.0019927034,0.0004958694,0.00005170375,0.00056205044,0.00014346739,0.011647088,0.7776005,0.011344136,0.009244406,0.18625589],"study_design_scores_gemma":[0.00022255919,0.0025031094,0.003599495,0.000051794672,0.00009499943,0.0018284468,0.000070403,0.14567372,0.79378194,0.0017986234,0.050312825,0.00006207689],"about_ca_topic_score_codex":0.0009291361,"about_ca_topic_score_gemma":0.0017558519,"teacher_disagreement_score":0.005924191,"about_ca_system_score_codex":0.000419906,"about_ca_system_score_gemma":0.0005575444,"threshold_uncertainty_score":0.019818425},"labels":[],"label_agreement":null},{"id":"W2127641221","doi":"10.1109/igarss.2003.1294259","title":"Investigation of wavelets for raw SAR data compression","year":2004,"lang":"en","type":"article","venue":"","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Wavelet; Synthetic aperture radar; Computer science; Redundancy (engineering); Wavelet transform; Artificial intelligence; Lossy compression; Data compression; Lifting scheme; Raw data; Entropy (arrow of time); Inverse synthetic aperture radar; Wavelet packet decomposition; Computer vision; Pattern recognition (psychology); Radar imaging; Radar; Telecommunications","score_opus":0.0950785268603711,"score_gpt":0.33008727195476345,"score_spread":0.23500874509439235,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2127641221","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20466098,0.00278189,0.7880772,0.00044182604,0.000116124975,0.00007654836,0.00007854352,0.00027127753,0.003495552],"genre_scores_gemma":[0.6005795,0.0031803995,0.39453802,0.000092011716,0.00013361682,0.00007333569,0.00018160383,0.00007343058,0.0011481043],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993709,0.00015387156,0.000038679013,0.000044298322,0.00036068194,0.000031499116],"domain_scores_gemma":[0.9981791,0.0010481911,0.00009312075,0.00018820634,0.00046166065,0.000029700968],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013047477,0.0004041425,0.00039416077,0.0006517253,0.0001438327,0.0004556298,0.00029775657,0.00040778084,0.00056833454],"category_scores_gemma":[0.004660964,0.00018225795,0.0002672822,0.0007478081,0.0002902494,0.0006255318,0.00029883868,0.00042859785,0.00020422865],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005188567,0.00033787705,0.0032239086,0.0004489705,0.00009653623,0.00037105172,0.00014923859,0.23858395,0.17765844,0.029632429,0.0017638998,0.5472148],"study_design_scores_gemma":[0.000027837852,0.00039472195,0.0012966408,0.0000368216,0.00002041532,0.0002541325,0.000030263933,0.94497687,0.0468616,0.0036956177,0.002393984,0.000011085568],"about_ca_topic_score_codex":0.00016487668,"about_ca_topic_score_gemma":0.00014638368,"teacher_disagreement_score":0.0013047477,"about_ca_system_score_codex":0.00015057689,"about_ca_system_score_gemma":0.00018429242,"threshold_uncertainty_score":0.006900251},"labels":[],"label_agreement":null},{"id":"W2128054765","doi":"10.1109/scft.1993.762319","title":"Acelp speech coding at 8 kbit/s with a 10 ms frame: a candidate for ccitt standardization","year":2005,"lang":"en","type":"article","venue":"","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Sherbrooke","funders":"","keywords":"Standardization; Computer science; Coding (social sciences); Speech coding; Speech recognition; Frame (networking); Telecommunications; Mathematics","score_opus":0.01145776885146098,"score_gpt":0.2788272810435693,"score_spread":0.2673695121921083,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2128054765","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16387077,0.0022234854,0.6417942,0.008571699,0.0019908217,0.0020089373,0.0017371371,0.008437395,0.1693657],"genre_scores_gemma":[0.6192448,0.0013375552,0.28211886,0.0022119684,0.0009506691,0.00114097,0.006143484,0.0010033026,0.08584836],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99874663,0.00024604815,0.0000947169,0.00014235312,0.00041895307,0.00035121426],"domain_scores_gemma":[0.9939374,0.00034722284,0.00015885872,0.0007571979,0.004088902,0.000710467],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003717653,0.0007727263,0.00063766056,0.0013983645,0.0015540074,0.0022809673,0.0015827571,0.0018310552,0.0086888485],"category_scores_gemma":[0.0033660093,0.00018774175,0.00028933433,0.00084106805,0.00093509397,0.001170413,0.0009449881,0.0017132602,0.004551596],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0041173324,0.0010162952,0.007049167,0.00033578096,0.000083292776,0.0016285818,0.0007236229,0.0049108425,0.22403778,0.1023905,0.042209398,0.61149746],"study_design_scores_gemma":[0.0004111923,0.0043616495,0.0119733475,0.00030371713,0.00022686573,0.002145785,0.0010114842,0.061546147,0.5321278,0.022220008,0.36350724,0.00016477623],"about_ca_topic_score_codex":0.0048766043,"about_ca_topic_score_gemma":0.005695423,"teacher_disagreement_score":0.0086888485,"about_ca_system_score_codex":0.0010171769,"about_ca_system_score_gemma":0.0032642717,"threshold_uncertainty_score":0.02906704},"labels":[],"label_agreement":null},{"id":"W2128251029","doi":"10.1109/icassp.2009.4960505","title":"Combining frontend-based memory with MFCC features for Bandwidth Extension of narrowband speech","year":2009,"lang":"en","type":"article","venue":"","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Computer science; Mel-frequency cepstrum; Narrowband; Speech recognition; Bandwidth (computing); Correlation; Bandwidth extension; Artificial intelligence; Feature (linguistics); Distortion (music); Encoding (memory); Pattern recognition (psychology); Feature extraction; Speech coding; Mathematics; Telecommunications; Audio signal","score_opus":0.014506933368393886,"score_gpt":0.2696574415225063,"score_spread":0.25515050815411244,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2128251029","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13336034,0.0017642129,0.8564707,0.00022510956,0.00016948691,0.00016986458,0.00023617146,0.0041527506,0.0034513413],"genre_scores_gemma":[0.49925053,0.00096933113,0.49036804,0.00026820338,0.00021168593,0.00016011827,0.0006384831,0.00030766128,0.007825885],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99967027,0.000048328162,0.000030072784,0.00006599543,0.00014559395,0.00003975044],"domain_scores_gemma":[0.9986203,0.00067622133,0.00009800029,0.0002775244,0.00029196998,0.00003604562],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00074492896,0.00096241833,0.00067309523,0.0010157557,0.00030039746,0.00087082613,0.0011807588,0.00066018885,0.005913061],"category_scores_gemma":[0.0028253493,0.00034949556,0.0003540058,0.0006420901,0.0003516236,0.0016448795,0.00093716464,0.00069674075,0.0020209413],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00097293773,0.00018383408,0.00085223984,0.00024216092,0.00005586666,0.00023004606,0.00009891261,0.006646911,0.28468782,0.001505858,0.001032332,0.7034911],"study_design_scores_gemma":[0.000085887594,0.0007955598,0.0037097041,0.00010857976,0.00019170778,0.0010066951,0.000083716426,0.18427284,0.7933086,0.0018050408,0.01453786,0.000093766896],"about_ca_topic_score_codex":0.0006228188,"about_ca_topic_score_gemma":0.0017413924,"teacher_disagreement_score":0.005913061,"about_ca_system_score_codex":0.00021855526,"about_ca_system_score_gemma":0.00021861195,"threshold_uncertainty_score":0.019781113},"labels":[],"label_agreement":null},{"id":"W2128423253","doi":"10.1109/icc.1994.369028","title":"Sequential reconstruction of vector quantized signals transmitted over Rayleigh fading channels","year":2002,"lang":"en","type":"article","venue":"","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":23,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Decoding methods; Rayleigh fading; Fading; Algorithm; Channel state information; Computer science; Channel (broadcasting); SIGNAL (programming language); Mathematics; Speech recognition; Telecommunications; Wireless","score_opus":0.04066039754529225,"score_gpt":0.27935197697866576,"score_spread":0.23869157943337352,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2128423253","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.039281584,0.00020672755,0.95864975,0.000103614606,0.000029452083,0.00002162996,0.000044267497,0.00023999505,0.0014229886],"genre_scores_gemma":[0.63068146,0.0005065466,0.36502957,0.000058407415,0.000046071804,0.00004077367,0.00016126467,0.000043350516,0.0034325344],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99950206,0.00015443841,0.000023590437,0.000052780266,0.000226222,0.00004080142],"domain_scores_gemma":[0.99948514,0.00023339667,0.00007113819,0.000098083765,0.00010005454,0.0000121908],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00056214514,0.00039938762,0.00034029648,0.00023285972,0.00019488783,0.00047104934,0.0003361861,0.00036099728,0.0008726041],"category_scores_gemma":[0.0018099197,0.00019757477,0.00021197651,0.00031686286,0.00042338017,0.0006296881,0.00043085968,0.0003387953,0.0003148273],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006048359,0.00004768413,0.0013981711,0.00012609175,0.000057491445,0.0003101929,0.00019903757,0.5948309,0.058053453,0.050293013,0.0014480271,0.29263118],"study_design_scores_gemma":[0.000020490525,0.00008136158,0.00019949344,0.0000096680415,0.000009185883,0.00012819176,0.000014296739,0.97364354,0.017922377,0.0067660375,0.001194362,0.000011012499],"about_ca_topic_score_codex":0.0016704132,"about_ca_topic_score_gemma":0.001998324,"teacher_disagreement_score":0.0016704132,"about_ca_system_score_codex":0.00033296944,"about_ca_system_score_gemma":0.00051676756,"threshold_uncertainty_score":0.0033214092},"labels":[],"label_agreement":null},{"id":"W2128495062","doi":"10.1109/ccece.1995.526598","title":"The use of a distribution-clustering technique in HMM-based continuous-speech recognition","year":2002,"lang":"en","type":"article","venue":"","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Institut National de la Recherche Scientifique","funders":"","keywords":"Hidden Markov model; Computer science; Speech recognition; Cluster analysis; Word (group theory); Gaussian; Task (project management); Artificial intelligence; Distortion (music); Pattern recognition (psychology); Word error rate; Mathematics; Engineering","score_opus":0.063275264513594,"score_gpt":0.26415867097027285,"score_spread":0.20088340645667885,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2128495062","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012825641,0.00034613712,0.98496616,0.00011847172,0.000045579232,0.000046913596,0.000048547954,0.0010323472,0.0005702082],"genre_scores_gemma":[0.46217847,0.00075859245,0.5329515,0.00021680606,0.00012245151,0.00017357738,0.00047912498,0.00027286314,0.0028466692],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99833566,0.00049057574,0.00010545832,0.00045070553,0.00053371425,0.000083824896],"domain_scores_gemma":[0.99733883,0.0010206919,0.00016625141,0.000868903,0.0005233541,0.00008199261],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020076337,0.00073205115,0.0008327386,0.001039564,0.00066244806,0.0006920195,0.0016155973,0.0012239115,0.00080842717],"category_scores_gemma":[0.0045241923,0.00048321672,0.00072493183,0.0016268921,0.0011258663,0.0020253363,0.0014292437,0.0016246052,0.001154236],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00047203127,0.0002727638,0.0021459947,0.0002329153,0.00020765269,0.0002286699,0.0003348924,0.08701902,0.05016093,0.016628334,0.0025227575,0.8397741],"study_design_scores_gemma":[0.0000710633,0.000377953,0.0042730384,0.000035992183,0.0001061236,0.0011630065,0.00011464765,0.84841186,0.111500755,0.02335961,0.010438076,0.0001477968],"about_ca_topic_score_codex":0.0036337264,"about_ca_topic_score_gemma":0.0056590065,"teacher_disagreement_score":0.0036337264,"about_ca_system_score_codex":0.00075856375,"about_ca_system_score_gemma":0.0007576372,"threshold_uncertainty_score":0.010617495},"labels":[],"label_agreement":null},{"id":"W2128626239","doi":"10.1109/26.974248","title":"Hexacode-based quantization of the Gaussian source at 1/2 bit per sample","year":2001,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Sherbrooke","funders":"","keywords":"Binary Golay code; Decoding methods; Binary number; Quantization (signal processing); Algorithm; Gaussian; Bit (key); Algebraic number; Computer science; Mathematics; Binary code; Theoretical computer science; Discrete mathematics; Arithmetic; Physics","score_opus":0.03932801141443842,"score_gpt":0.2963049526388216,"score_spread":0.2569769412243832,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2128626239","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3997039,0.0020043193,0.5788256,0.00080056634,0.00014037473,0.000112516536,0.00040975865,0.0009230421,0.01707998],"genre_scores_gemma":[0.8038695,0.0003953106,0.19214836,0.00012297352,0.00002058181,0.000039317147,0.00021511549,0.000032491833,0.0031563034],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992092,0.00030014932,0.000037870108,0.00008237616,0.00028744098,0.0000829795],"domain_scores_gemma":[0.9986305,0.0005939827,0.00016006688,0.00020104859,0.0003660147,0.000048279555],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008791835,0.00048617084,0.0008975048,0.00024883507,0.00042609536,0.00083610264,0.0005340984,0.0005629827,0.0022085758],"category_scores_gemma":[0.003185821,0.00013892024,0.00020163629,0.00060780765,0.0008993856,0.0007112134,0.0007277535,0.00053583516,0.00052394246],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0040014954,0.00018701523,0.005021748,0.0003268931,0.00020371177,0.00030436853,0.00032926034,0.55493003,0.07547972,0.10565501,0.0039594243,0.24960122],"study_design_scores_gemma":[0.00010598712,0.00040031676,0.00088896905,0.000032199237,0.000035812514,0.00027602434,0.00006774868,0.9068319,0.076236926,0.012646225,0.0024217777,0.000056030643],"about_ca_topic_score_codex":0.0029826972,"about_ca_topic_score_gemma":0.004700132,"teacher_disagreement_score":0.0029826972,"about_ca_system_score_codex":0.00073879736,"about_ca_system_score_gemma":0.001238841,"threshold_uncertainty_score":0.0073884726},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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)","score_opus":0.011486478433701954,"score_gpt":0.3024103474440572,"score_spread":0.2909238690103553,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2128714178","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1955375,0.0021606847,0.69790214,0.00069399574,0.001332808,0.0008437897,0.0013065931,0.051536698,0.048685722],"genre_scores_gemma":[0.78955424,0.0007730045,0.17968778,0.00074165344,0.00022348744,0.00037595312,0.0010552038,0.00023088316,0.02735787],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9996947,0.000029320161,0.000018276069,0.00007973346,0.00013400272,0.00004411862],"domain_scores_gemma":[0.99979585,0.000039107257,0.000019965995,0.000024279932,0.00008690468,0.000033884622],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018987087,0.0005248394,0.0005726855,0.0009781081,0.00032725435,0.0005050229,0.00086638826,0.00048375866,0.009021124],"category_scores_gemma":[0.0003756389,0.00021535272,0.0001862176,0.0003700014,0.00014486238,0.00049928634,0.00043250344,0.00029841159,0.0032668312],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0015573656,0.00038015572,0.006912206,0.0006368767,0.00014227224,0.0012551536,0.00025016413,0.010215344,0.1923434,0.0037587837,0.038857676,0.74369055],"study_design_scores_gemma":[0.0007704541,0.0027563896,0.022612913,0.00033537787,0.0004890411,0.0064531676,0.00027291494,0.40129068,0.40315554,0.0028424347,0.15872262,0.0002984324],"about_ca_topic_score_codex":0.001552513,"about_ca_topic_score_gemma":0.0017824831,"teacher_disagreement_score":0.009021124,"about_ca_system_score_codex":0.0003329158,"about_ca_system_score_gemma":0.00034823176,"threshold_uncertainty_score":0.030178726},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.008296223714880096,"score_gpt":0.2590608214615913,"score_spread":0.2507645977467112,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2128894842","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13792038,0.0019324766,0.85368955,0.0002698427,0.00018279658,0.0001226163,0.00015976281,0.00073789293,0.0049846387],"genre_scores_gemma":[0.4773045,0.0026507766,0.5150725,0.00013173826,0.00018999529,0.000093510265,0.0003603404,0.00009995058,0.004096695],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9998105,0.000028185994,0.0000099679555,0.000015151848,0.00012379835,0.000012351915],"domain_scores_gemma":[0.99974626,0.00012153149,0.00001780936,0.000038964266,0.000068988105,0.0000064394158],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025355205,0.00027895762,0.00023697417,0.0008476562,0.00014367493,0.00028239435,0.0002231709,0.00029197935,0.0010329915],"category_scores_gemma":[0.001175387,0.000071563205,0.0001800601,0.0007959271,0.00032376967,0.00041416314,0.00020131604,0.00021220623,0.00031474687],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002938955,0.000050128965,0.0006012995,0.00025466367,0.00002047506,0.00028937246,0.00017475983,0.04601489,0.2619984,0.010741002,0.0017635865,0.67779756],"study_design_scores_gemma":[0.00003542287,0.00047951168,0.004175648,0.00006099051,0.000045372264,0.0020788216,0.00009367789,0.59656143,0.36948332,0.006949935,0.019985238,0.00005075684],"about_ca_topic_score_codex":0.00060488575,"about_ca_topic_score_gemma":0.00066784985,"teacher_disagreement_score":0.0010329915,"about_ca_system_score_codex":0.0001413651,"about_ca_system_score_gemma":0.00014008752,"threshold_uncertainty_score":0.003455639},"labels":[],"label_agreement":null},{"id":"W2129026019","doi":"10.1109/icc.1989.49901","title":"Vector quantization using image adaptive codebook","year":2003,"lang":"en","type":"article","venue":"","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Codebook; Linde–Buzo–Gray algorithm; Vector quantization; Quantization (signal processing); Learning vector quantization; Artificial intelligence; Pixel; Computer science; Coding (social sciences); Algorithm; Computer vision; Pattern recognition (psychology); Mathematics","score_opus":0.039184573343401564,"score_gpt":0.3028484063637966,"score_spread":0.26366383302039503,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2129026019","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0037748537,0.0013599514,0.9899267,0.00012118519,0.0001956064,0.000076916585,0.000065443375,0.00078760326,0.003691723],"genre_scores_gemma":[0.19010738,0.0019160548,0.7938829,0.00024651235,0.00019825759,0.00014249132,0.0005558212,0.00020575066,0.01274483],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99924576,0.00013109906,0.00005591954,0.00009916736,0.00042896494,0.000039199032],"domain_scores_gemma":[0.9993273,0.00016344579,0.00003613084,0.000108302476,0.00034237842,0.000022489308],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006388114,0.00040042342,0.00048254928,0.00077586365,0.0002623456,0.0010250391,0.0010085688,0.00053674786,0.0036463921],"category_scores_gemma":[0.0022433375,0.00019106714,0.00030441588,0.0013903766,0.00050286204,0.0012053926,0.0006910372,0.00061741157,0.0013210186],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002165754,0.000043067525,0.00036510293,0.00027690988,0.00006272793,0.000118536205,0.00013920729,0.045287594,0.060962327,0.093522705,0.0143935,0.7846117],"study_design_scores_gemma":[0.0001394719,0.00033693333,0.0005973992,0.000085454456,0.00005952367,0.0006859033,0.00007551397,0.77141553,0.09212051,0.0463162,0.08806174,0.00010578464],"about_ca_topic_score_codex":0.0025449696,"about_ca_topic_score_gemma":0.0026760523,"teacher_disagreement_score":0.0036463921,"about_ca_system_score_codex":0.00053741183,"about_ca_system_score_gemma":0.00045988508,"threshold_uncertainty_score":0.012198448},"labels":[],"label_agreement":null},{"id":"W2129204705","doi":"10.1109/pacrim.2009.5291300","title":"Error-resilient multiple-description video coding with 3-D SPIHT","year":2009,"lang":"en","type":"article","venue":"","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Set partitioning in hierarchical trees; Computer science; Redundancy (engineering); Coding (social sciences); Multiple description coding; Artificial intelligence; Algorithm; Wavelet; Wavelet transform; Video quality; Decoding methods; Computer vision; Pattern recognition (psychology); Mathematics; Discrete wavelet transform; Statistics","score_opus":0.02427874109353271,"score_gpt":0.2736619248462765,"score_spread":0.2493831837527438,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2129204705","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017179396,0.0001599757,0.9815036,0.000080586105,0.000022509954,0.000028851826,0.000047720423,0.00031304522,0.00066429196],"genre_scores_gemma":[0.31985214,0.00036921402,0.67775035,0.00013326762,0.000038813392,0.000090343725,0.00027019234,0.000059347545,0.0014363285],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99969494,0.000045566147,0.0000140907705,0.000022257967,0.00020008955,0.000023088232],"domain_scores_gemma":[0.9994874,0.00017638523,0.00007757247,0.00010457379,0.0001354357,0.000018604913],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039508074,0.00033409346,0.0003302012,0.00074957387,0.00023192423,0.00040856568,0.00076218747,0.00056512514,0.00063135807],"category_scores_gemma":[0.0013710584,0.00019162158,0.0004250752,0.0007190206,0.00034178118,0.00086826633,0.0005847121,0.000619997,0.00025917654],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002746941,0.00008258565,0.0011231791,0.00019723202,0.00008048075,0.0003521529,0.00026121922,0.3727572,0.12062241,0.030957697,0.0031502487,0.47014087],"study_design_scores_gemma":[0.000014410053,0.000076122895,0.0002189004,0.000010655445,0.000011034145,0.00025339331,0.0000152452985,0.96305865,0.03149422,0.0026697365,0.002157412,0.00002013992],"about_ca_topic_score_codex":0.0016211941,"about_ca_topic_score_gemma":0.0017336525,"teacher_disagreement_score":0.0016211941,"about_ca_system_score_codex":0.00038966682,"about_ca_system_score_gemma":0.00047004255,"threshold_uncertainty_score":0.0032234788},"labels":[],"label_agreement":null},{"id":"W2129292660","doi":"10.1109/icsmc.1998.727578","title":"Analysis and synthesis of facial expressions for MPEG-4 system","year":2002,"lang":"en","type":"article","venue":"","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Computer science; Facial expression; Optical flow; MPEG-4; Motion estimation; Artificial intelligence; Coding (social sciences); Computer vision; Bit rate; Feature (linguistics); Pattern recognition (psychology); Mathematics; Image (mathematics); Computer hardware","score_opus":0.021936511509940578,"score_gpt":0.2627899801524295,"score_spread":0.2408534686424889,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2129292660","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13556623,0.00032409976,0.8539927,0.00015336576,0.000089083114,0.00018652699,0.00027807045,0.001103102,0.0083067985],"genre_scores_gemma":[0.57204926,0.00053644856,0.4168582,0.00005958385,0.00004101548,0.00021681262,0.000632206,0.00025961176,0.009346915],"study_design_codex":"bench_or_experimental","study_design_gemma":"not_applicable","domain_scores_codex":[0.99980336,0.000043722674,0.000009105773,0.000018752808,0.00010999975,0.000015147073],"domain_scores_gemma":[0.99990535,0.000026250233,0.000007713588,0.00001102895,0.00004487069,0.000004831268],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002747128,0.00035474854,0.00016512921,0.00034584253,0.00016643172,0.00019525982,0.00014963537,0.00018275635,0.0020071666],"category_scores_gemma":[0.00060864823,0.00010199983,0.00020501157,0.00011299449,0.00012103255,0.00022253217,0.00015498755,0.00016743052,0.00044728257],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000431503,0.00003531678,0.0008514543,0.00015172714,0.000025982961,0.0002496212,0.00025823148,0.042795666,0.6810515,0.0053844983,0.0026181308,0.2661464],"study_design_scores_gemma":[0.000048546968,0.00033127712,0.0038328257,0.000039397743,0.000053051368,0.0003840156,0.00014772387,0.6315202,0.34354368,0.0026272952,0.017423844,0.000048259066],"about_ca_topic_score_codex":0.0010921172,"about_ca_topic_score_gemma":0.0011451697,"teacher_disagreement_score":0.0020071666,"about_ca_system_score_codex":0.00023920584,"about_ca_system_score_gemma":0.00023601044,"threshold_uncertainty_score":0.0067145824},"labels":[],"label_agreement":null},{"id":"W2129946704","doi":"10.1109/icassp.1985.1168057","title":"A new dynamic bit allocation scheme for sub-band coding","year":2005,"lang":"en","type":"article","venue":"","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Sherbrooke","funders":"","keywords":"Computer science; Dynamic range; Quantization (signal processing); High dynamic range; Algorithm; Autocorrelation; Coding (social sciences); Bit field; Electronic engineering; Real-time computing; Mathematics; Engineering","score_opus":0.016677928236895335,"score_gpt":0.29881582532979983,"score_spread":0.2821378970929045,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2129946704","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014908189,0.0006033954,0.9804921,0.00012136753,0.00014636481,0.00008238809,0.00004991175,0.00048643778,0.0031098307],"genre_scores_gemma":[0.23492509,0.0005777413,0.7553829,0.00028393752,0.00015599515,0.00026522257,0.00018594052,0.00011979673,0.00810339],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99948263,0.000099538636,0.00003552695,0.00010055889,0.00022733746,0.00005435574],"domain_scores_gemma":[0.99935776,0.00013838048,0.00006471546,0.00022642159,0.00017451443,0.00003828206],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003824326,0.0004068736,0.000438348,0.0006997125,0.00045241977,0.0005900861,0.0009674675,0.0006129,0.0028803307],"category_scores_gemma":[0.0011485858,0.00020159957,0.00021131421,0.00054958474,0.0005324716,0.0013624376,0.0008182785,0.0009019674,0.001110452],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00038789777,0.000115008654,0.00035186153,0.0001271855,0.00003270106,0.00009963843,0.00019562978,0.013539234,0.30874622,0.09085785,0.0024699753,0.5830769],"study_design_scores_gemma":[0.00015658175,0.0005914645,0.0009764704,0.000100345445,0.00007981824,0.0013054487,0.00006458395,0.59371245,0.26549947,0.03645079,0.10090033,0.00016221961],"about_ca_topic_score_codex":0.00045582376,"about_ca_topic_score_gemma":0.00061264366,"teacher_disagreement_score":0.0028803307,"about_ca_system_score_codex":0.00037461772,"about_ca_system_score_gemma":0.0003467387,"threshold_uncertainty_score":0.009635687},"labels":[],"label_agreement":null},{"id":"W2130186711","doi":"10.1109/icassp.1994.389241","title":"Low-complexity encoding of speech LSF parameters using constrained-storage TSVQ","year":2002,"lang":"en","type":"article","venue":"","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Vector quantization; Computational complexity theory; Algorithm; Encoding (memory); Speech coding; Computer science; Quantization (signal processing); Coding (social sciences); Theoretical computer science; Tree (set theory); Linear predictive coding; Computation; Speech recognition; Mathematics; Artificial intelligence; Statistics","score_opus":0.0976161355753597,"score_gpt":0.3030968229210413,"score_spread":0.2054806873456816,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2130186711","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017810635,0.00016433207,0.9776513,0.00010455279,0.000051976065,0.000077003555,0.00024289066,0.0019376811,0.0019596566],"genre_scores_gemma":[0.3579639,0.00029120554,0.63403684,0.00012636905,0.000057956804,0.00017848241,0.00113102,0.00021869062,0.005995596],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99962056,0.000070677685,0.00003624852,0.000032697815,0.00021152438,0.000028303513],"domain_scores_gemma":[0.9991092,0.00026196797,0.00008157757,0.0002006124,0.000324571,0.000022012178],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041431177,0.00042003972,0.00037989795,0.00051985757,0.0003090335,0.00094181293,0.0010060205,0.00044255628,0.0040927744],"category_scores_gemma":[0.0022028522,0.0001314548,0.0002111559,0.0009281553,0.00040634876,0.0010712326,0.0006412697,0.0003819089,0.0011621115],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00055708294,0.00007963412,0.000644052,0.00021611732,0.00003758089,0.00026102256,0.00029598983,0.10006005,0.16269222,0.0454991,0.011820915,0.6778362],"study_design_scores_gemma":[0.00007446169,0.00016335356,0.00046490025,0.00003201223,0.00001726907,0.0002589426,0.00007574784,0.86543566,0.10990102,0.012246103,0.011284954,0.000045555433],"about_ca_topic_score_codex":0.0049658227,"about_ca_topic_score_gemma":0.0067613525,"teacher_disagreement_score":0.0049658227,"about_ca_system_score_codex":0.0004446844,"about_ca_system_score_gemma":0.0008146771,"threshold_uncertainty_score":0.013691723},"labels":[],"label_agreement":null},{"id":"W2130323514","doi":"10.1109/icassp.2006.1659945","title":"Resynchronization of the Adaptive Codebook in a Constrained celp Codec After a Frame Erasure","year":2006,"lang":"en","type":"article","venue":"","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Sherbrooke","funders":"","keywords":"Code-excited linear prediction; Codebook; Erasure; Computer science; Codec; Speech coding; Encoder; Frame (networking); Speech recognition; Linear predictive coding; Algorithm; Telecommunications","score_opus":0.005197059745442624,"score_gpt":0.21064587960884562,"score_spread":0.205448819863403,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2130323514","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15808117,0.00038455584,0.83801347,0.00018937656,0.00015373112,0.00011016591,0.00012271601,0.0006943254,0.0022505147],"genre_scores_gemma":[0.7950873,0.0002504365,0.19985212,0.00017452668,0.000052899755,0.00014211398,0.0002313532,0.00014089607,0.004068313],"study_design_codex":"bench_or_experimental","study_design_gemma":"not_applicable","domain_scores_codex":[0.9996934,0.000041799827,0.000024616476,0.000070504015,0.0001349387,0.000034794943],"domain_scores_gemma":[0.99902654,0.00035996086,0.00011332063,0.00029610164,0.00016383865,0.00004012107],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035014455,0.00031808202,0.00030198053,0.00030308866,0.00023488644,0.0003205381,0.0006705812,0.00044779773,0.00094290206],"category_scores_gemma":[0.0025852728,0.00017875692,0.00017473666,0.00036081407,0.00053863286,0.00064805755,0.00065978314,0.0005697403,0.00036132763],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012853119,0.00011147507,0.0015733065,0.00016640217,0.000049596994,0.0018287909,0.0005648917,0.13857748,0.47067478,0.035570804,0.0017119108,0.34788528],"study_design_scores_gemma":[0.000076879725,0.00029384642,0.001288608,0.00003720168,0.000033017535,0.0012148606,0.000071121314,0.7355146,0.24827138,0.0057225167,0.007426293,0.000049588078],"about_ca_topic_score_codex":0.0018065425,"about_ca_topic_score_gemma":0.0024827195,"teacher_disagreement_score":0.0018065425,"about_ca_system_score_codex":0.00028065828,"about_ca_system_score_gemma":0.0005264194,"threshold_uncertainty_score":0.003592074},"labels":[],"label_agreement":null},{"id":"W2130396412","doi":"10.1109/pimrc.2008.4699827","title":"Multicasting JPEG2000 images over MIMO systems","year":2008,"lang":"en","type":"article","venue":"","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Computer science; Spatial multiplexing; MIMO; Computer network; Transmission (telecommunications); Antenna (radio); Multi-user MIMO; 3G MIMO; Base station; Antenna diversity; Telecommunications link; Wireless; Electronic engineering; Channel (broadcasting); Real-time computing; Telecommunications; Engineering","score_opus":0.02875943111761101,"score_gpt":0.2816834173437186,"score_spread":0.25292398622610757,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2130396412","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.30915433,0.0008961214,0.67932653,0.00039410658,0.00012621288,0.00010626528,0.00013092386,0.0009708067,0.008894675],"genre_scores_gemma":[0.9066816,0.00045007537,0.08865535,0.00011157339,0.000108517,0.0000406347,0.00009825044,0.000020635087,0.0038334967],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9997645,0.00004889881,0.000009567137,0.000026742235,0.00010690449,0.00004346455],"domain_scores_gemma":[0.99947685,0.00023871385,0.000058542202,0.000070143666,0.000119749755,0.000036044315],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038192293,0.00038631595,0.00030219622,0.00042884736,0.00030965224,0.0003239676,0.00028654168,0.00041043185,0.0012122084],"category_scores_gemma":[0.0011453202,0.00013243666,0.00017301692,0.00037808745,0.0002025761,0.0004766056,0.000412589,0.00036798086,0.0003592599],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00083318155,0.00017985723,0.0030848614,0.00020661372,0.000086914115,0.0012805451,0.00043918105,0.22733638,0.3034862,0.01628993,0.004275065,0.44250137],"study_design_scores_gemma":[0.00005864398,0.0002600402,0.0012888493,0.000014276154,0.000036664984,0.0006723328,0.000101644095,0.9174588,0.070795596,0.005956743,0.0033318396,0.000024623409],"about_ca_topic_score_codex":0.0012084881,"about_ca_topic_score_gemma":0.0017783348,"teacher_disagreement_score":0.0012122084,"about_ca_system_score_codex":0.00029318186,"about_ca_system_score_gemma":0.00020273028,"threshold_uncertainty_score":0.0040552616},"labels":[],"label_agreement":null},{"id":"W2130403920","doi":"10.1109/icassp.1997.598841","title":"Smoothing the evolution of the spectral parameters in linear prediction of speech using target matching","year":2002,"lang":"en","type":"article","venue":"","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Formant; Linear prediction; Linear predictive coding; Smoothing; Speech coding; Waveform; Computer science; Code-excited linear prediction; Speech recognition; Inverse filter; Frame (networking); Matching (statistics); Coding (social sciences); Similarity (geometry); Inverse; Mathematics; Algorithm; Artificial intelligence; Statistics; Telecommunications","score_opus":0.02918702583663109,"score_gpt":0.25867802333239753,"score_spread":0.22949099749576646,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2130403920","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10089114,0.00010247412,0.8975444,0.000040072195,0.000028433713,0.000025461139,0.000022271397,0.0008482058,0.00049751345],"genre_scores_gemma":[0.47169358,0.00016442561,0.5252924,0.000044974357,0.00002892646,0.00005677787,0.00016060245,0.00017653276,0.0023817783],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997029,0.00004677645,0.000020615398,0.00006995255,0.00013438056,0.000025376728],"domain_scores_gemma":[0.9992854,0.00032943173,0.00008021033,0.00012684758,0.00015723947,0.00002094208],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000623978,0.00037022794,0.00039320206,0.0004882274,0.00024622955,0.00042870062,0.00053848093,0.0005298132,0.0009418138],"category_scores_gemma":[0.002212167,0.00022635687,0.00026932583,0.0005200556,0.00031739165,0.0006038832,0.00047038027,0.0005408927,0.0005058132],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005873903,0.00018158417,0.0024907645,0.00009645215,0.000060492774,0.00016360985,0.0002573333,0.1403544,0.20512417,0.0045536165,0.0008095441,0.64532065],"study_design_scores_gemma":[0.000017835471,0.00013135203,0.0020658872,0.0000054488733,0.00002242867,0.00016818137,0.00002197905,0.89218897,0.102821596,0.0015094598,0.0010271313,0.000019657376],"about_ca_topic_score_codex":0.0013633721,"about_ca_topic_score_gemma":0.0017994068,"teacher_disagreement_score":0.0013633721,"about_ca_system_score_codex":0.00027410165,"about_ca_system_score_gemma":0.00043052368,"threshold_uncertainty_score":0.003299892},"labels":[],"label_agreement":null},{"id":"W2130428796","doi":"10.1109/isit.2010.5513257","title":"Optimal multiresolution quantization for broadcast channels with random index assignment","year":2010,"lang":"en","type":"article","venue":"","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Blackberry (Canada); University of Waterloo","funders":"","keywords":"Quantization (signal processing); Vector quantization; Computer science; Multiresolution analysis; Channel (broadcasting); Algorithm; Mathematics; Artificial intelligence; Telecommunications; Wavelet; Wavelet transform; Discrete wavelet transform","score_opus":0.013601062994103885,"score_gpt":0.2738983191663701,"score_spread":0.2602972561722662,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2130428796","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005651652,0.00034630898,0.993206,0.000071367576,0.000017524404,0.000018143008,0.000018030323,0.00007766013,0.0005933367],"genre_scores_gemma":[0.54429144,0.000908677,0.45261875,0.00012417909,0.0001016364,0.00010119199,0.0001043527,0.00006606817,0.0016837874],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985306,0.00042558988,0.00006769656,0.00020501492,0.00064992066,0.00012114016],"domain_scores_gemma":[0.99847704,0.0008397112,0.00020306783,0.00017691428,0.0002622578,0.00004100297],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014440852,0.0006160878,0.0008169338,0.00036353603,0.00037379508,0.00096153945,0.0007445006,0.00057226344,0.0012061726],"category_scores_gemma":[0.0053350567,0.00034780573,0.0003089952,0.00061121536,0.00077175716,0.001546943,0.00077815866,0.0009975866,0.00028081486],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00041190645,0.00006543142,0.0008057088,0.00028724363,0.00006511277,0.00016994406,0.0003163467,0.5512933,0.05069071,0.111197,0.0025350212,0.2821623],"study_design_scores_gemma":[0.000021938917,0.00006188802,0.00009999901,0.0000144516325,0.00001287622,0.00006497963,0.000026117192,0.9820619,0.007710835,0.008450817,0.001456768,0.000017438262],"about_ca_topic_score_codex":0.0014426785,"about_ca_topic_score_gemma":0.001406434,"teacher_disagreement_score":0.0014440852,"about_ca_system_score_codex":0.0007759121,"about_ca_system_score_gemma":0.0005901817,"threshold_uncertainty_score":0.007637143},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.011327165688543054,"score_gpt":0.3007598224798596,"score_spread":0.2894326567913166,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2130770975","genre_codex":"methods","genre_gemma":"software","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"software","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019192798,0.0006854796,0.8903881,0.00024012542,0.00036622435,0.00038244287,0.00065735943,0.07014071,0.017946785],"genre_scores_gemma":[0.16232409,0.0007405291,0.7952311,0.00053029537,0.00014328292,0.00036919652,0.0026786688,0.004065293,0.033917606],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9994293,0.000041743893,0.000031193555,0.00005270721,0.00039616495,0.000048926537],"domain_scores_gemma":[0.99933773,0.00008300561,0.000050291364,0.00009290142,0.00039140575,0.000044628483],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004733602,0.0007125217,0.00037376105,0.0013166381,0.00036238012,0.00093511445,0.0013788817,0.00062518456,0.007160845],"category_scores_gemma":[0.0021790038,0.00035335033,0.0002923565,0.0007069113,0.00031746944,0.00093900715,0.00064444554,0.001003131,0.0040703835],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011962563,0.00035009292,0.0021276544,0.00055603206,0.00013140221,0.00063225545,0.00018796686,0.018238386,0.32175347,0.03135773,0.07380679,0.54966193],"study_design_scores_gemma":[0.00046390656,0.0007073579,0.0027141257,0.000121755766,0.0001469148,0.0022942123,0.000063197935,0.4167874,0.40472886,0.0064218333,0.16534822,0.0002023505],"about_ca_topic_score_codex":0.0018513871,"about_ca_topic_score_gemma":0.0022596181,"teacher_disagreement_score":0.007160845,"about_ca_system_score_codex":0.00039382177,"about_ca_system_score_gemma":0.0008515432,"threshold_uncertainty_score":0.023955405},"labels":[],"label_agreement":null},{"id":"W2130785505","doi":"10.1109/isit.2002.1023309","title":"A note on the existence of optimal entropy-constrained vector quantizers","year":2003,"lang":"en","type":"article","venue":"","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Mathematics; Lagrangian; Lambda; Rate–distortion theory; Entropy (arrow of time); Lossy compression; Convex hull; Regular polygon; Applied mathematics; Mathematical optimization; Algorithm; Data compression","score_opus":0.026137270706310296,"score_gpt":0.28634954682346797,"score_spread":0.2602122761171577,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2130785505","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.031540375,0.0026801152,0.9485759,0.0014432644,0.00009617198,0.000044500288,0.0001180848,0.00014743171,0.0153541025],"genre_scores_gemma":[0.68904,0.0046377564,0.29708934,0.00077476376,0.00027509284,0.00018461728,0.00025042403,0.00021135816,0.0075367037],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985055,0.00049219024,0.000098239136,0.00028433322,0.00046833445,0.00015141143],"domain_scores_gemma":[0.99145097,0.006869206,0.00040271835,0.00046457886,0.0006695086,0.00014301925],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026578482,0.00071577757,0.0010509378,0.0007771264,0.00065004104,0.0013224423,0.000884944,0.0012002547,0.0026196388],"category_scores_gemma":[0.01676971,0.00067426247,0.000608178,0.00089016696,0.0030065204,0.0036218232,0.0022725814,0.0031221833,0.00034959687],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016526903,0.000027757644,0.0004234968,0.00015340818,0.00003419932,0.000118772565,0.00015972478,0.11735136,0.0067053856,0.8257305,0.0018411871,0.0472889],"study_design_scores_gemma":[0.000050727518,0.00013785908,0.0003140192,0.00007953358,0.000023829305,0.00017366778,0.00004662047,0.51943225,0.0109531,0.4625128,0.00622502,0.000050640465],"about_ca_topic_score_codex":0.0011891944,"about_ca_topic_score_gemma":0.0008165237,"teacher_disagreement_score":0.0026578482,"about_ca_system_score_codex":0.0013171335,"about_ca_system_score_gemma":0.000901854,"threshold_uncertainty_score":0.014056206},"labels":[],"label_agreement":null},{"id":"W2131180221","doi":"10.1109/wcsp.2009.5371724","title":"Multiple description coding for binary sources","year":2009,"lang":"en","type":"article","venue":"","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Binary number; Coding (social sciences); Hamming distance; Hamming code; Algorithm; Computer science; Distortion (music); Binary code; Rate distortion; Generator matrix; Variable-length code; Theoretical computer science; Block code; Mathematics; Decoding methods; Arithmetic; Statistics; Telecommunications","score_opus":0.03873175661273122,"score_gpt":0.2894912669480719,"score_spread":0.2507595103353407,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2131180221","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.028262064,0.0013353492,0.9658743,0.00062051223,0.00005330824,0.000038215472,0.000118625656,0.00009279194,0.0036049115],"genre_scores_gemma":[0.81271243,0.0017417086,0.1789541,0.00027334798,0.00015170091,0.00015375546,0.00041472053,0.00007358801,0.0055246907],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992119,0.00021286956,0.00003649435,0.00008930469,0.00035713497,0.00009233956],"domain_scores_gemma":[0.996689,0.0023886692,0.00028795816,0.0002811857,0.0002863922,0.00006681021],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014875769,0.00060300296,0.0008415647,0.00067727687,0.00036516332,0.0011655011,0.0013581637,0.0012421339,0.0018343847],"category_scores_gemma":[0.0060667647,0.00034359418,0.00048960553,0.0010061446,0.00090302335,0.002327344,0.0017139904,0.0012802436,0.0003825504],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00029337194,0.00004603495,0.00041769748,0.00037731236,0.000050031264,0.00047678538,0.0001784511,0.3868342,0.009174442,0.5175978,0.002625285,0.08192856],"study_design_scores_gemma":[0.000030476078,0.00003483293,0.00008895928,0.000024144665,0.000010292237,0.00015945011,0.000015459733,0.8823208,0.003312651,0.112674065,0.0013086366,0.000020192196],"about_ca_topic_score_codex":0.0012954478,"about_ca_topic_score_gemma":0.000715679,"teacher_disagreement_score":0.0018343847,"about_ca_system_score_codex":0.0013412053,"about_ca_system_score_gemma":0.00054832036,"threshold_uncertainty_score":0.0097311735},"labels":[],"label_agreement":null},{"id":"W2131291700","doi":"10.1109/tit.2009.2018178","title":"Multiple Description Coding for Stationary Gaussian Sources","year":2009,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Gaussian; Mathematics; Rate–distortion theory; Algorithm; Coding (social sciences); Quantization (signal processing); Variable-length code; Shannon–Fano coding; Rate distortion; Frequency domain; Computer science; Decoding methods; Data compression; Statistics; Mathematical analysis; Physics","score_opus":0.017455649650962517,"score_gpt":0.2585403780087817,"score_spread":0.2410847283578192,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2131291700","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03431387,0.0012695818,0.9595512,0.0012323869,0.00005350116,0.000042873195,0.0001978106,0.00009935734,0.0032394023],"genre_scores_gemma":[0.8311442,0.0018224535,0.16070065,0.00035953548,0.0001732927,0.00019130929,0.00053526636,0.000090742054,0.0049825646],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989158,0.00036312253,0.00005419746,0.00012409377,0.00039976824,0.00014310141],"domain_scores_gemma":[0.9962759,0.0027640131,0.00027726975,0.00024720735,0.0003525851,0.000082933555],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029443116,0.0006342932,0.0010909801,0.0006960001,0.00040239698,0.0015744976,0.0015758016,0.0013994497,0.0014901954],"category_scores_gemma":[0.007775193,0.00043053986,0.00062839186,0.0012311783,0.0013662545,0.0029056643,0.0021284653,0.0013391384,0.00030442458],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00027284704,0.000035557277,0.00030403765,0.00030183076,0.000055012984,0.0005001216,0.00021088551,0.45974818,0.0038386816,0.4772215,0.002704809,0.05480656],"study_design_scores_gemma":[0.000038940994,0.000029742396,0.0000627516,0.000021655145,0.000010851706,0.00008467407,0.000021903077,0.86329323,0.0015499232,0.13401975,0.00084561866,0.000020982063],"about_ca_topic_score_codex":0.0029327534,"about_ca_topic_score_gemma":0.0013690817,"teacher_disagreement_score":0.0029443116,"about_ca_system_score_codex":0.0016924903,"about_ca_system_score_gemma":0.0011433776,"threshold_uncertainty_score":0.015571177},"labels":[],"label_agreement":null},{"id":"W2131371355","doi":"10.1109/icassp.2006.1659946","title":"Performance Analysis of a Decoder-Based Time Scaling Algorithm for Variable Jitter Buffering of Speech Over Packet Networks","year":2006,"lang":"en","type":"article","venue":"","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"VoiceAge (Canada)","funders":"","keywords":"Jitter; Computer science; Algorithm; Network packet; Variable (mathematics); Speech recognition; Code-excited linear prediction; Soft-decision decoder; Decoding methods; Real-time computing; Speech coding; Computer network; Linear predictive coding; Mathematics; Telecommunications","score_opus":0.0074367758099230805,"score_gpt":0.2443069472721775,"score_spread":0.23687017146225442,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2131371355","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.32332486,0.00085880235,0.6688064,0.00011930688,0.000080562255,0.0001318563,0.00006200258,0.0021892744,0.004426969],"genre_scores_gemma":[0.8535178,0.00023264538,0.14377229,0.00004324047,0.000034581262,0.0000536337,0.00009754693,0.00011431244,0.002134011],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994966,0.00012632927,0.00002806408,0.00006935733,0.00022707887,0.00005244686],"domain_scores_gemma":[0.9988832,0.0006582742,0.000080624144,0.00008812943,0.0002469488,0.00004286774],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00080330437,0.00052153633,0.0003834694,0.00047878284,0.00032227792,0.0006959792,0.00051399076,0.0004120482,0.0016933009],"category_scores_gemma":[0.0029970007,0.00015396296,0.00012973904,0.00030288385,0.00023570009,0.0004912857,0.00028442085,0.0004174598,0.0003978384],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.002945301,0.0002998702,0.004705108,0.00022113849,0.00013618347,0.0001814292,0.00023843804,0.24073781,0.31676176,0.010642528,0.0014080965,0.42172238],"study_design_scores_gemma":[0.000026434922,0.00025718368,0.0006262214,0.000004532996,0.000020479503,0.00007668152,0.000009792178,0.94340414,0.05479612,0.00018186495,0.00058549386,0.000010941689],"about_ca_topic_score_codex":0.0016407634,"about_ca_topic_score_gemma":0.0014192287,"teacher_disagreement_score":0.0016933009,"about_ca_system_score_codex":0.0006430111,"about_ca_system_score_gemma":0.0005770238,"threshold_uncertainty_score":0.005664706},"labels":[],"label_agreement":null},{"id":"W2131395393","doi":"10.1109/ccece.2005.1556928","title":"A new rectangular partitioning based lossless binary image compression scheme","year":2006,"lang":"en","type":"article","venue":"","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":26,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Northern British Columbia","funders":"","keywords":"Lossless compression; Rectangle; Computer science; Binary image; Data compression; Scheme (mathematics); Binary number; Image (mathematics); Algorithm; Image compression; Theoretical computer science; Artificial intelligence; Image processing; Mathematics; Arithmetic","score_opus":0.008940972765548696,"score_gpt":0.2564524601593611,"score_spread":0.24751148739381237,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2131395393","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.031099586,0.0010649523,0.9621682,0.00018275762,0.00015449834,0.00012237873,0.00014068175,0.0013164033,0.0037504095],"genre_scores_gemma":[0.30667388,0.00095263956,0.6795,0.00034738454,0.00012947728,0.00017663653,0.00076366856,0.00013896447,0.011317386],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9996784,0.00004395114,0.000021371594,0.00005405,0.0001633173,0.00003905749],"domain_scores_gemma":[0.9996866,0.000055136472,0.0000332339,0.000102665035,0.00010252639,0.000019860243],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002481009,0.00042688323,0.00048701913,0.0007440127,0.00025500788,0.00047721775,0.0010629714,0.00041643775,0.0021011294],"category_scores_gemma":[0.0006817319,0.00020225918,0.0002494465,0.0007756918,0.00033000292,0.0012636683,0.0006127085,0.00054966356,0.0010185252],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00051596435,0.00010302747,0.00034284883,0.00024061666,0.000039751474,0.00027827104,0.00014635519,0.027739326,0.30494437,0.019347273,0.0061358893,0.64016634],"study_design_scores_gemma":[0.00012090387,0.0004904697,0.0012887082,0.000054815784,0.00006844541,0.0017293057,0.00007750579,0.69082516,0.2652018,0.0055323695,0.03452412,0.00008645794],"about_ca_topic_score_codex":0.0007191546,"about_ca_topic_score_gemma":0.0007231633,"teacher_disagreement_score":0.0021011294,"about_ca_system_score_codex":0.00030149551,"about_ca_system_score_gemma":0.00028683493,"threshold_uncertainty_score":0.0070289373},"labels":[],"label_agreement":null},{"id":"W2131424676","doi":"10.1109/igarss.2002.1025797","title":"Polarmetric SAR data compression using wavelet packets in a block coding scheme","year":2003,"lang":"en","type":"article","venue":"","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; Data compression; Wavelet; Redundancy (engineering); Coding (social sciences); Wavelet transform; Image compression; Synthetic aperture radar; Artificial intelligence; Algorithm; Computer vision; Image processing; Mathematics; Image (mathematics)","score_opus":0.10970877196546218,"score_gpt":0.35107082026558417,"score_spread":0.24136204830012198,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2131424676","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08412151,0.00023967345,0.913728,0.00011379748,0.00004459146,0.00007937349,0.00006751428,0.0002837891,0.0013217495],"genre_scores_gemma":[0.36819023,0.0005518311,0.6274395,0.000094237694,0.000052078693,0.0001655528,0.0002625249,0.00006182534,0.0031821728],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99980885,0.000041862506,0.0000138505475,0.000021685322,0.00009419001,0.000019698331],"domain_scores_gemma":[0.9996871,0.00010491836,0.00004116608,0.00008237422,0.00007229167,0.000012193263],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033173215,0.00032934544,0.0003318163,0.00046158032,0.00014820769,0.00029963063,0.0003496237,0.00031235634,0.0007562195],"category_scores_gemma":[0.00090479065,0.00017503499,0.0002101899,0.0006784872,0.00025541254,0.000692129,0.00031918017,0.00044736557,0.0003873415],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007843973,0.00021046151,0.0010588137,0.00014965345,0.000041243336,0.00017620307,0.00016982347,0.14652987,0.39548382,0.037838556,0.0017993205,0.41575783],"study_design_scores_gemma":[0.000053738906,0.00030096836,0.00066931854,0.0000196753,0.000027655084,0.00022172298,0.00001797525,0.8807371,0.107800946,0.0063158222,0.0038184042,0.000016677934],"about_ca_topic_score_codex":0.000634503,"about_ca_topic_score_gemma":0.0006949327,"teacher_disagreement_score":0.0007562195,"about_ca_system_score_codex":0.00019615235,"about_ca_system_score_gemma":0.00032454813,"threshold_uncertainty_score":0.0025298595},"labels":[],"label_agreement":null},{"id":"W2131695036","doi":"10.1109/glocom.1990.116643","title":"Low-delay analysis-by-synthesis speech coding using lattice predictors","year":2002,"lang":"en","type":"article","venue":"","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Codebook; Codec; Speech coding; Lattice phase equaliser; Computer science; Speech recognition; Algorithm; Linear predictive coding; Intelligibility (philosophy); Lattice (music); Term (time); Weighting; Coding (social sciences); Adaptive filter; Mathematics; Statistics; Telecommunications; Acoustics; Physics","score_opus":0.031446349914940865,"score_gpt":0.27520738704082703,"score_spread":0.24376103712588618,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2131695036","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.024728378,0.00062161766,0.9698635,0.0000915664,0.00005444623,0.000058016223,0.000055023553,0.0010359281,0.0034916226],"genre_scores_gemma":[0.28101358,0.00093243486,0.71085954,0.00008757104,0.00006189958,0.00013479582,0.0003863978,0.0001532646,0.006370495],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995776,0.00011526338,0.000024056066,0.000039096554,0.00020914299,0.00003481567],"domain_scores_gemma":[0.99865973,0.00084749924,0.00006455934,0.00014966956,0.0002445019,0.000034091896],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006266497,0.00043145914,0.00033871876,0.0005402703,0.00027021085,0.0006585976,0.0004984112,0.00047394852,0.0029639672],"category_scores_gemma":[0.0017374951,0.00014379458,0.00025631464,0.0005485177,0.00057079125,0.0007186743,0.0006184204,0.0006861904,0.0011511578],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007190632,0.00011207967,0.00091753504,0.00027104586,0.000044105233,0.00022179271,0.00015976287,0.09628866,0.19421385,0.045108408,0.0026211068,0.6593225],"study_design_scores_gemma":[0.0000931186,0.0003196032,0.00046783578,0.000053448177,0.000028847675,0.0003680012,0.00003295297,0.80653954,0.17680196,0.0058666556,0.009375881,0.000052212636],"about_ca_topic_score_codex":0.0025005047,"about_ca_topic_score_gemma":0.0034327463,"teacher_disagreement_score":0.0029639672,"about_ca_system_score_codex":0.0004510455,"about_ca_system_score_gemma":0.00065170537,"threshold_uncertainty_score":0.0099154115},"labels":[],"label_agreement":null},{"id":"W2132125297","doi":"10.1109/tce.2006.1649641","title":"Single-Sensor Camera Image Compression","year":2006,"lang":"en","type":"article","venue":"IEEE Transactions on Consumer Electronics","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":26,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer vision; Color filter array; Computer science; Artificial intelligence; JPEG; Image sensor; Digital camera; Image compression; Data compression; Transform coding; Pipeline transport; Demosaicing; Image processing; Color image; Bayer filter; Computer graphics (images); Color gel; Image (mathematics); Engineering; Discrete cosine transform","score_opus":0.012226031091329978,"score_gpt":0.2521196225492911,"score_spread":0.23989359145796113,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2132125297","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09624926,0.0031143103,0.8801932,0.00020526591,0.00037339536,0.0005037481,0.00039930592,0.002017977,0.016943496],"genre_scores_gemma":[0.45031315,0.0033714822,0.5268088,0.00022798714,0.00027962553,0.0002469953,0.0009830727,0.00016364602,0.017605204],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99964416,0.000015817328,0.000014592604,0.00006633597,0.00022877823,0.000030284917],"domain_scores_gemma":[0.99973756,0.000052792904,0.00002342682,0.000046833873,0.00012565372,0.00001366172],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021221755,0.00045754685,0.00050045917,0.00066871895,0.00021057203,0.0004889146,0.00073813275,0.00047945237,0.004101875],"category_scores_gemma":[0.0007220206,0.00012186881,0.0002970848,0.000712809,0.00017447445,0.0006628762,0.00038314384,0.00034137492,0.0014602023],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000251217,0.000114314294,0.0007060807,0.00046342396,0.00003495821,0.000369123,0.00008051964,0.009993389,0.30182374,0.003878407,0.004451964,0.6778327],"study_design_scores_gemma":[0.00007492007,0.0008234573,0.0063924384,0.0001125384,0.000067481036,0.004320354,0.00010165311,0.25984702,0.68155235,0.0029405344,0.043680876,0.000086397515],"about_ca_topic_score_codex":0.0004423169,"about_ca_topic_score_gemma":0.00073759235,"teacher_disagreement_score":0.004101875,"about_ca_system_score_codex":0.0002355918,"about_ca_system_score_gemma":0.00029990985,"threshold_uncertainty_score":0.013722122},"labels":[],"label_agreement":null},{"id":"W2132152398","doi":"10.1109/igarss.2000.859671","title":"Applications of wavelet data compression using modified zerotrees in remotely sensed data","year":2002,"lang":"en","type":"article","venue":"","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"Canadian Space Agency","funders":"","keywords":"Data compression; Computer science; Wavelet; Wavelet transform; Compression (physics); Lookup table; JPEG 2000; Algorithm; Compression ratio; Imaging spectrometer; Table (database); Image compression; Artificial intelligence; Computer vision; Remote sensing; Spectrometer; Image (mathematics); Image processing; Data mining; Geology; Materials science; Optics","score_opus":0.21648496763662137,"score_gpt":0.36145076208231725,"score_spread":0.14496579444569588,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2132152398","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22386754,0.0012466408,0.771272,0.00037174733,0.00012209143,0.0001256782,0.00014327737,0.0007020555,0.0021490408],"genre_scores_gemma":[0.52117187,0.0010946494,0.47565383,0.0000808804,0.000107782704,0.00005430664,0.00034338864,0.00007717529,0.0014161859],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99952555,0.00008894542,0.0000320546,0.000038956892,0.0002850526,0.000029486519],"domain_scores_gemma":[0.9990368,0.0004989522,0.000072113915,0.000142099,0.00022879147,0.000021189568],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007610099,0.0003970806,0.00026792003,0.0012716964,0.00026985633,0.00040306212,0.00038742993,0.00039643573,0.0006366413],"category_scores_gemma":[0.0030412902,0.00014825576,0.00023833597,0.0015595633,0.00050169573,0.000725531,0.00040512747,0.0003845301,0.00018546204],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003811027,0.00013684494,0.0021436159,0.00018610946,0.00004964483,0.00049734017,0.00026728396,0.12708971,0.13185872,0.015906164,0.0019137134,0.71956974],"study_design_scores_gemma":[0.000079010664,0.00050274923,0.005024468,0.00004604697,0.000042576903,0.0011827195,0.00011502146,0.79100096,0.18056628,0.01200607,0.009363557,0.00007063853],"about_ca_topic_score_codex":0.0011359601,"about_ca_topic_score_gemma":0.0013231207,"teacher_disagreement_score":0.0012716964,"about_ca_system_score_codex":0.0002839895,"about_ca_system_score_gemma":0.00031787468,"threshold_uncertainty_score":0.0040246844},"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,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.01139835198788083,"score_gpt":0.3047175451843562,"score_spread":0.29331919319647537,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2132463201","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06338389,0.0036145097,0.91543055,0.00042442008,0.00048718232,0.0001470548,0.000793568,0.006071463,0.009647347],"genre_scores_gemma":[0.27661183,0.0021152182,0.7013923,0.00021334544,0.00033610073,0.00011531052,0.002255638,0.00079709425,0.016163178],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995964,0.000051230058,0.000032808628,0.00008278033,0.00019917905,0.00003759631],"domain_scores_gemma":[0.99942243,0.00017453787,0.000056131303,0.00014446327,0.000180933,0.000021460019],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003926724,0.0008136213,0.00070328417,0.0013865253,0.0003389371,0.0012272303,0.0006827419,0.0008345581,0.0039018977],"category_scores_gemma":[0.0016362851,0.00026368545,0.00048402345,0.0017196073,0.000383856,0.0010215475,0.00055641145,0.0007147909,0.0025068077],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009700104,0.0001295872,0.00047430562,0.00022275353,0.000077535624,0.00027439266,0.00011480824,0.047409557,0.17455178,0.0086519355,0.012436049,0.7546872],"study_design_scores_gemma":[0.00012460249,0.00030446827,0.0020901456,0.000049682178,0.00008752527,0.0017420804,0.000068834735,0.7439533,0.2256796,0.00635884,0.019458704,0.00008217238],"about_ca_topic_score_codex":0.0019529539,"about_ca_topic_score_gemma":0.0023842235,"teacher_disagreement_score":0.0039018977,"about_ca_system_score_codex":0.0004748799,"about_ca_system_score_gemma":0.000507246,"threshold_uncertainty_score":0.013053179},"labels":[],"label_agreement":null},{"id":"W2132572274","doi":"10.1109/tsa.2005.851917","title":"LSP quantization by a union of locally trained codebooks","year":2005,"lang":"en","type":"article","venue":"IEEE Transactions on Speech and Audio Processing","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Codebook; Vector quantization; Algorithm; Mathematics; Encoder; Speech coding; Computational complexity theory; Code-excited linear prediction; Speech recognition; Pattern recognition (psychology); Linear predictive coding; Computer science; Artificial intelligence; Statistics","score_opus":0.012466712998972692,"score_gpt":0.2608341671625037,"score_spread":0.24836745416353098,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2132572274","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0038536994,0.00009479481,0.99495727,0.00003997937,0.000016085964,0.000018721363,0.000033096025,0.00040185486,0.00058451836],"genre_scores_gemma":[0.2187703,0.00020732409,0.775421,0.00014736291,0.000060563325,0.00020078504,0.00034933264,0.00019141949,0.004651871],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998968,0.00025914662,0.000064889486,0.00019867644,0.00045433117,0.000054958087],"domain_scores_gemma":[0.99878937,0.0003750206,0.00008447191,0.00038647288,0.0003199825,0.0000447737],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00118314,0.00053817924,0.0007995916,0.00041181003,0.0003084451,0.0007502843,0.0015131847,0.0006883538,0.0033875706],"category_scores_gemma":[0.0040501314,0.00038956173,0.00042596497,0.0007312929,0.0006800791,0.0019123844,0.0012670917,0.0011868813,0.0018575151],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00037302007,0.00009371246,0.0005050057,0.00013124642,0.000053649535,0.00007352538,0.00014865062,0.4807514,0.036024548,0.042987037,0.0054757944,0.43338242],"study_design_scores_gemma":[0.000016257476,0.00003714247,0.00007531137,0.000007655439,0.000004555343,0.000040479852,0.0000066255584,0.9885344,0.0059211343,0.0041469242,0.0012001239,0.000009423015],"about_ca_topic_score_codex":0.0021670475,"about_ca_topic_score_gemma":0.0025007236,"teacher_disagreement_score":0.0033875706,"about_ca_system_score_codex":0.00056794356,"about_ca_system_score_gemma":0.00066097104,"threshold_uncertainty_score":0.0113325715},"labels":[],"label_agreement":null},{"id":"W2132638020","doi":"10.1109/icassp.1990.115824","title":"A 450 b.p.s. vocoder with natural-sounding speech","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":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Institut National de la Recherche Scientifique","funders":"","keywords":"Vector quantization; Speech recognition; Computer science; Speech coding; Quantization (signal processing); Linear predictive coding; Coding (social sciences); Data compression; Term (time); Algorithm; Artificial intelligence; Mathematics; Physics","score_opus":0.037648874805905196,"score_gpt":0.2885850859963695,"score_spread":0.25093621119046433,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2132638020","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06555513,0.00093558966,0.856586,0.00045606674,0.00058104243,0.0013096416,0.002559517,0.017504377,0.0545126],"genre_scores_gemma":[0.31519198,0.0011383715,0.56957245,0.0011050777,0.0002778439,0.0010988154,0.0039429106,0.0010362935,0.10663619],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9997726,0.00003096223,0.00001914884,0.000046424084,0.000086301574,0.000044544428],"domain_scores_gemma":[0.9998559,0.000028372773,0.0000048524216,0.00001799027,0.0000726819,0.000020104502],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003042145,0.0005780686,0.00059967383,0.0004598384,0.00044698786,0.0006936673,0.0006938378,0.0008933521,0.017286887],"category_scores_gemma":[0.000432066,0.00020471799,0.00038041835,0.00047364636,0.00016148189,0.00029581663,0.0003338999,0.00061932136,0.008754338],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007472959,0.0003593305,0.00055468234,0.00039894736,0.00012592388,0.00041219883,0.00017784789,0.012948514,0.38703808,0.011835107,0.034776762,0.5506252],"study_design_scores_gemma":[0.00030061943,0.0010019498,0.003998043,0.000109001,0.00019734669,0.0015927113,0.00012855293,0.4384431,0.2937648,0.0040214383,0.25633934,0.00010319416],"about_ca_topic_score_codex":0.0057630297,"about_ca_topic_score_gemma":0.009642214,"teacher_disagreement_score":0.017286887,"about_ca_system_score_codex":0.00038896778,"about_ca_system_score_gemma":0.0006624363,"threshold_uncertainty_score":0.057830453},"labels":[],"label_agreement":null},{"id":"W2132676592","doi":"10.1109/icme.2008.4607394","title":"Multiple description coding of audio using phase scrambling","year":2008,"lang":"en","type":"article","venue":"","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Scrambling; Computer science; Coding (social sciences); Speech coding; Block (permutation group theory); Speech recognition; Algorithm; Mathematics; Statistics","score_opus":0.14082982743705613,"score_gpt":0.3463689165265302,"score_spread":0.20553908908947405,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2132676592","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.026612297,0.00082762336,0.9705366,0.00012024983,0.000087087894,0.000064739026,0.000043837965,0.00042036292,0.0012871069],"genre_scores_gemma":[0.35170278,0.0012300502,0.6415617,0.00022393638,0.00014951832,0.00013498518,0.00031985305,0.00012986797,0.004547312],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99949527,0.00009985023,0.000033534365,0.000054736844,0.00027761556,0.000039028964],"domain_scores_gemma":[0.9988218,0.00052609335,0.00012487925,0.00022763653,0.00026559754,0.000033920347],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005385731,0.0005639118,0.0004401057,0.0007646701,0.00022358599,0.00035399265,0.00076178444,0.0005320548,0.001206869],"category_scores_gemma":[0.00180705,0.00021330305,0.00039094657,0.0006241552,0.0004444524,0.0012575866,0.00066225295,0.0007235918,0.00042586753],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00056025555,0.00010687852,0.00031999394,0.0005151505,0.00005281685,0.00044544527,0.00023438733,0.04674475,0.4053734,0.022136873,0.0015385253,0.52197146],"study_design_scores_gemma":[0.00012757537,0.0004825313,0.00058629626,0.000086074535,0.00007458193,0.0009961771,0.000062628744,0.59252864,0.38290972,0.00692892,0.015112717,0.00010420643],"about_ca_topic_score_codex":0.0011549884,"about_ca_topic_score_gemma":0.0013981462,"teacher_disagreement_score":0.001206869,"about_ca_system_score_codex":0.0002433523,"about_ca_system_score_gemma":0.0003446683,"threshold_uncertainty_score":0.00403738},"labels":[],"label_agreement":null},{"id":"W2132783365","doi":"10.1109/icce.2008.4587972","title":"A NovelAudio/ideo Decoder for Video Recorders","year":2008,"lang":"en","type":"article","venue":"","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Magnum Semiconductor (Canada)","funders":"","keywords":"Computer science; Video decoder; Power consumption; Decoding methods; Video processing; Video capture; Video recording; Real-time computing; Power (physics); Multimedia; Computer hardware; Telecommunications","score_opus":0.03710262243663696,"score_gpt":0.2862221511568762,"score_spread":0.24911952872023926,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2132783365","genre_codex":"methods","genre_gemma":"software","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"software","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.039997753,0.0037467945,0.92517126,0.00075191667,0.000985493,0.0003617146,0.00035748686,0.003908405,0.02471922],"genre_scores_gemma":[0.1658287,0.0029437183,0.7587387,0.0015117096,0.00073230657,0.00021366648,0.00052555755,0.0004483064,0.06905736],"study_design_codex":"bench_or_experimental","study_design_gemma":"not_applicable","domain_scores_codex":[0.9994543,0.000031376632,0.000027299177,0.00008295293,0.00036587982,0.000038168993],"domain_scores_gemma":[0.9996668,0.000052301788,0.00003395241,0.000028990036,0.00016217002,0.000055699446],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031834384,0.00046196947,0.00038481283,0.00036649208,0.00036298262,0.00085344084,0.0012997196,0.0009817372,0.004558653],"category_scores_gemma":[0.0006110246,0.00037987457,0.0002801474,0.0002207246,0.00024175846,0.0008737672,0.00055715605,0.00094412913,0.0026953071],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002940435,0.0001261086,0.00049359055,0.00033552875,0.00002646548,0.0005683919,0.00011838155,0.0009935361,0.8342794,0.005891811,0.0050321156,0.15184052],"study_design_scores_gemma":[0.00014330389,0.0010299014,0.0015410146,0.00012628976,0.000107877226,0.008190569,0.00005483347,0.043575834,0.76290244,0.0008383506,0.18138713,0.00010241291],"about_ca_topic_score_codex":0.0004974083,"about_ca_topic_score_gemma":0.0012990272,"teacher_disagreement_score":0.004558653,"about_ca_system_score_codex":0.00033282282,"about_ca_system_score_gemma":0.0006282428,"threshold_uncertainty_score":0.015250206},"labels":[],"label_agreement":null},{"id":"W2132812596","doi":"10.1109/dcc.2009.11","title":"Adaptive Rate Allocation Algorithm for Transmission of Multiple Embedded Bit Streams over Time-Varying Noisy Channels","year":2009,"lang":"en","type":"article","venue":"","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Algorithm; Transmission (telecommunications); Computer science; Channel (broadcasting); Image (mathematics); Network packet; Distortion (music); Binary number; Binary symmetric channel; Time complexity; Binary image; Decoding methods; Mathematical optimization; Image processing; Mathematics; Channel code; Computer vision; Bandwidth (computing); Telecommunications; Computer network","score_opus":0.018197139752554832,"score_gpt":0.28009217186399654,"score_spread":0.2618950321114417,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2132812596","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0077842358,0.00012998775,0.9912941,0.000052051182,0.000018933813,0.000032817974,0.0000087702365,0.00019398915,0.00048518612],"genre_scores_gemma":[0.3084007,0.00032751865,0.68784654,0.000064148706,0.000048401802,0.00024302506,0.00006264084,0.00006338974,0.0029436296],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99942076,0.00015775436,0.00004206616,0.00007489777,0.0002584997,0.000045986562],"domain_scores_gemma":[0.999132,0.00041256484,0.00011381207,0.00008188841,0.0002351571,0.000024625237],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009740415,0.00050655915,0.0006570015,0.0004839097,0.00037024854,0.0006053653,0.001058642,0.0006402401,0.001025249],"category_scores_gemma":[0.0027143143,0.0002603058,0.00026851278,0.0004350529,0.00054711517,0.0008638642,0.00058239046,0.0006891503,0.0003217833],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005409435,0.00009807902,0.0006390446,0.0001345352,0.000061997685,0.00018724967,0.00029140737,0.5541101,0.04177259,0.029172765,0.0018093835,0.37118188],"study_design_scores_gemma":[0.000032171836,0.000048546157,0.00009397197,0.0000065674712,0.000010309444,0.00010317396,0.000011009977,0.9905883,0.0061695655,0.0019332994,0.000990881,0.000012076271],"about_ca_topic_score_codex":0.0012942188,"about_ca_topic_score_gemma":0.0011624187,"teacher_disagreement_score":0.0012942188,"about_ca_system_score_codex":0.00058363104,"about_ca_system_score_gemma":0.00073118205,"threshold_uncertainty_score":0.005151272},"labels":[],"label_agreement":null},{"id":"W2133008004","doi":"10.1109/icassp.2006.1660943","title":"Low-Complexity Multiple Description Vector Quantization With Constrained Central Codebook","year":2006,"lang":"en","type":"article","venue":"","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Codebook; Computational complexity theory; Vector quantization; Linde–Buzo–Gray algorithm; Signal-to-noise ratio (imaging); Computer science; Algorithm; Quantization (signal processing); Channel (broadcasting); Telecommunications","score_opus":0.023803383655501508,"score_gpt":0.2384133311438612,"score_spread":0.2146099474883597,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2133008004","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00834321,0.0009153337,0.9889792,0.00014377241,0.000053924123,0.000086715074,0.00010362039,0.00033537808,0.0010387735],"genre_scores_gemma":[0.4128054,0.0007372185,0.5821552,0.0002758328,0.00007847564,0.00026606693,0.0005878381,0.000053378775,0.0030405063],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99906605,0.00019508206,0.0000853372,0.00011426862,0.00048474883,0.000054465483],"domain_scores_gemma":[0.9984849,0.000667611,0.00014877846,0.00026822017,0.000386544,0.000044005552],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012319061,0.00046934746,0.00085868785,0.00044016738,0.00032472765,0.0009251305,0.0015953538,0.0006569154,0.0021615648],"category_scores_gemma":[0.0044518355,0.0002516528,0.0003021703,0.0011893417,0.000536797,0.0018241135,0.0012290189,0.0009566999,0.00046350906],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00050759653,0.00010683574,0.0009774849,0.0005928109,0.00008810432,0.000217852,0.0001579805,0.1527797,0.036439456,0.077799454,0.007883489,0.7224493],"study_design_scores_gemma":[0.00013069688,0.00014311256,0.00037626614,0.00003234879,0.00002322442,0.00028648085,0.000029951138,0.95788294,0.01702266,0.019002752,0.005018959,0.000050585684],"about_ca_topic_score_codex":0.0038687126,"about_ca_topic_score_gemma":0.0047552404,"teacher_disagreement_score":0.0038687126,"about_ca_system_score_codex":0.000589642,"about_ca_system_score_gemma":0.0015894216,"threshold_uncertainty_score":0.007692337},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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)","score_opus":0.0543461859741568,"score_gpt":0.3051797222874569,"score_spread":0.2508335363133001,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2133078112","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.032853186,0.00048720685,0.9638388,0.00009491618,0.00005279406,0.00008545719,0.00006903606,0.0006744408,0.0018441792],"genre_scores_gemma":[0.22335508,0.00037942434,0.772787,0.00007743612,0.000042117386,0.00012507087,0.00032052115,0.000084920335,0.0028284234],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997371,0.00003721797,0.00001683594,0.000032371572,0.00016060637,0.000015897698],"domain_scores_gemma":[0.999587,0.0001484758,0.000032651908,0.00008756899,0.00012791165,0.000016450807],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035158487,0.00036764564,0.0003291756,0.00049828645,0.00024875085,0.00040904872,0.00061752426,0.00028062725,0.0015577594],"category_scores_gemma":[0.0011499336,0.000107297994,0.00023871484,0.00076569204,0.0003275562,0.00080230105,0.00045614957,0.0004515815,0.00044771517],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00035082104,0.00010756214,0.0007995623,0.00015352825,0.000035447265,0.00010335709,0.00015817185,0.11018568,0.11237852,0.016656108,0.0028598073,0.7562114],"study_design_scores_gemma":[0.000040337836,0.0001881837,0.0007281415,0.000017573944,0.000016650072,0.00026839072,0.000038585855,0.8986896,0.0872394,0.00473138,0.0080153,0.000026493812],"about_ca_topic_score_codex":0.0022734876,"about_ca_topic_score_gemma":0.0038129597,"teacher_disagreement_score":0.0022734876,"about_ca_system_score_codex":0.00041222243,"about_ca_system_score_gemma":0.0005038903,"threshold_uncertainty_score":0.005211234},"labels":[],"label_agreement":null},{"id":"W2133450349","doi":"10.1109/hpec.2014.7040947","title":"A performance model of fast 2D-DCT parallel JPEG encoding using CUDA GPU and SMP-architecture","year":2014,"lang":"en","type":"article","venue":"","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"CUDA; JPEG; Computer science; Lossy compression; Parallel computing; Speedup; Lossless JPEG; Discrete cosine transform; Computation; Quantization (signal processing); Thread (computing); JPEG 2000; Data compression; Image compression; Algorithm; Image processing; Artificial intelligence; Image (mathematics)","score_opus":0.02734049830523772,"score_gpt":0.2668680602942763,"score_spread":0.23952756198903857,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2133450349","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.32486418,0.0020805704,0.61101764,0.0009338971,0.0001527361,0.00028504315,0.0010437907,0.0066059814,0.05301614],"genre_scores_gemma":[0.9151266,0.0006219276,0.07461685,0.0000902571,0.000020045802,0.00020216832,0.0004950577,0.00030537133,0.008521631],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99972874,0.00005030063,0.000013301484,0.000048045604,0.000109261586,0.000050308834],"domain_scores_gemma":[0.99970156,0.00006589499,0.000025221243,0.00004010991,0.0001438874,0.000023350387],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022170135,0.000733655,0.00035027877,0.00058725465,0.00033260207,0.00077095226,0.0013127945,0.00057647517,0.0032101949],"category_scores_gemma":[0.0008181448,0.0002557271,0.00030680036,0.00068444334,0.00036153887,0.0010920215,0.0002641114,0.0005629409,0.0008848453],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00026105202,0.00008734012,0.0021543324,0.00013593795,0.000034593486,0.00023199718,0.00010219551,0.91421586,0.021651486,0.031115089,0.0037281576,0.026281985],"study_design_scores_gemma":[0.0000042465244,0.00002722384,0.00019266181,0.000002922769,0.0000029171772,0.000021725487,0.000005338774,0.99623245,0.0017707915,0.0010284341,0.0007068883,0.0000044264552],"about_ca_topic_score_codex":0.011042013,"about_ca_topic_score_gemma":0.007089638,"teacher_disagreement_score":0.011042013,"about_ca_system_score_codex":0.0010166725,"about_ca_system_score_gemma":0.0008522828,"threshold_uncertainty_score":0.02195543},"labels":[],"label_agreement":null},{"id":"W2133542883","doi":"10.1109/icc.1992.268224","title":"Edge modified vector quantization for image compression","year":2003,"lang":"en","type":"article","venue":"","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Vector quantization; Quantization (signal processing); Coding (social sciences); Artificial intelligence; Image compression; Computer science; Algorithm; Computer vision; Transform coding; Data compression; Mathematics; Pattern recognition (psychology); Image (mathematics); Discrete cosine transform; Image processing","score_opus":0.03151504551475112,"score_gpt":0.31176499258705653,"score_spread":0.28024994707230544,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2133542883","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006695687,0.0045080413,0.98120904,0.00036950037,0.00030050252,0.00006815354,0.00016886221,0.00087610295,0.0058041555],"genre_scores_gemma":[0.23140107,0.0046402947,0.740888,0.0006119324,0.00039281708,0.0001609564,0.0008248559,0.00017451053,0.020905556],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9995981,0.0000754326,0.000020062644,0.000041557763,0.00024226759,0.000022624188],"domain_scores_gemma":[0.99978036,0.00006531505,0.000016214552,0.000038721144,0.000093126415,0.0000063828284],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028633466,0.0003390953,0.00027296096,0.0005660947,0.0001623381,0.00047573954,0.0005335662,0.00046896486,0.0034880617],"category_scores_gemma":[0.0009899295,0.00010108983,0.00016060293,0.0012124925,0.0003089675,0.00070663955,0.00035007097,0.0006567282,0.00084061775],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019713401,0.00004172545,0.00025668665,0.00020561658,0.000026316813,0.00017863445,0.0000706733,0.029148683,0.07909294,0.11324389,0.014141786,0.7633959],"study_design_scores_gemma":[0.000069208625,0.00020345369,0.0009430634,0.000097412805,0.000028440214,0.0007661197,0.000037366564,0.7285607,0.09636232,0.07440448,0.09846004,0.00006735346],"about_ca_topic_score_codex":0.0010011519,"about_ca_topic_score_gemma":0.0014246806,"teacher_disagreement_score":0.0034880617,"about_ca_system_score_codex":0.00033393427,"about_ca_system_score_gemma":0.00024167458,"threshold_uncertainty_score":0.011668742},"labels":[],"label_agreement":null},{"id":"W2133731319","doi":"10.1109/glocom.2009.5425996","title":"Unequal Power Allocation for Transmission of JPEG2000 Images over Wireless Channels","year":2009,"lang":"en","type":"article","venue":"","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Bitstream; Computer science; JPEG 2000; Coding (social sciences); Distortion (music); Transmission (telecommunications); Channel (broadcasting); Channel state information; Wireless; Real-time computing; Computer network; Decoding methods; Image (mathematics); Telecommunications; Computer vision; Image compression; Image processing; Mathematics","score_opus":0.01309087626915016,"score_gpt":0.29415064869072344,"score_spread":0.28105977242157326,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2133731319","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04704351,0.00038108727,0.950592,0.00007667968,0.000023473885,0.00002844553,0.000017568591,0.00013098877,0.0017061939],"genre_scores_gemma":[0.87167466,0.00050966884,0.12560816,0.000054058808,0.00003446578,0.00004758387,0.000034035336,0.00004730912,0.0019901176],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999701,0.00010413223,0.000011143511,0.000030438541,0.00013209372,0.000021206224],"domain_scores_gemma":[0.9996369,0.00021835114,0.000042671705,0.00004508161,0.00004517009,0.000011807654],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003445425,0.000279257,0.0002072075,0.0002753051,0.00021012076,0.00031485825,0.00040008267,0.00022829218,0.0009608823],"category_scores_gemma":[0.001220851,0.00012197228,0.00017912136,0.00026590965,0.00040989733,0.0006607172,0.00033825485,0.000294099,0.00017587162],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005479425,0.000099480734,0.0014477253,0.0002322812,0.000061808416,0.0004354812,0.00021177459,0.44620654,0.17272548,0.036844224,0.0013261518,0.33986118],"study_design_scores_gemma":[0.00003403207,0.00014896499,0.00059222715,0.000017356122,0.00003078106,0.00032927922,0.000037271733,0.9356774,0.05454517,0.0061202785,0.0024449578,0.00002225928],"about_ca_topic_score_codex":0.0005488887,"about_ca_topic_score_gemma":0.00057946617,"teacher_disagreement_score":0.0009608823,"about_ca_system_score_codex":0.0002914773,"about_ca_system_score_gemma":0.00017239524,"threshold_uncertainty_score":0.0032144785},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.015299177221675323,"score_gpt":0.2721690719093684,"score_spread":0.25686989468769306,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2133988432","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.043240674,0.00052621623,0.9399506,0.00020880597,0.00010688244,0.000091688846,0.0001576156,0.0010844499,0.0146330055],"genre_scores_gemma":[0.558048,0.0006572173,0.4325479,0.00014097536,0.00010200904,0.00014508258,0.000416812,0.00007825185,0.007863814],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99970156,0.000058524492,0.000010545862,0.000025168358,0.0001757902,0.000028391261],"domain_scores_gemma":[0.99946755,0.00023049599,0.000039699233,0.00007659996,0.00016706878,0.000018689101],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002649053,0.0002753534,0.00023622117,0.00048414274,0.00024000909,0.00047433426,0.0003846841,0.00032626963,0.0022332242],"category_scores_gemma":[0.0013972231,0.00011480083,0.00014876442,0.00060786324,0.0004175611,0.0004927156,0.0007345249,0.0005792229,0.0009308113],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004523668,0.00006359928,0.0005605054,0.00020436608,0.000015826568,0.00039161518,0.00021724365,0.06656943,0.1965489,0.22655457,0.0044214022,0.50400025],"study_design_scores_gemma":[0.00009941077,0.00024932303,0.00059985823,0.00006449342,0.000016962858,0.0007999471,0.00004527922,0.7923346,0.14359544,0.036378827,0.025761707,0.000054155607],"about_ca_topic_score_codex":0.0010025258,"about_ca_topic_score_gemma":0.0010960611,"teacher_disagreement_score":0.0022332242,"about_ca_system_score_codex":0.0003044693,"about_ca_system_score_gemma":0.00046937657,"threshold_uncertainty_score":0.007470906},"labels":[],"label_agreement":null},{"id":"W2134250139","doi":"10.1109/ccece.1997.614869","title":"User-interface for relative performance evaluation of compression techniques","year":2002,"lang":"en","type":"article","venue":"","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Computer science; Data compression; Quantization (signal processing); Compression (physics); Vector quantization; JPEG; Interface (matter); Compression ratio; Transform coding; Texture compression; Wavelet; Image compression; Computer vision; Artificial intelligence; Image processing; Discrete cosine transform; Image (mathematics); Engineering","score_opus":0.06484424952658858,"score_gpt":0.346235100754439,"score_spread":0.2813908512278504,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2134250139","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.027451383,0.00041254587,0.9097051,0.00014997082,0.00019421795,0.0012343895,0.0010200166,0.05195076,0.007881581],"genre_scores_gemma":[0.33661166,0.00048763296,0.6239129,0.000863821,0.00026610136,0.0047344165,0.0030441608,0.0071884003,0.022890998],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975898,0.0010491279,0.00024372413,0.00025314023,0.00074504653,0.00011924575],"domain_scores_gemma":[0.99195755,0.0040022363,0.0002584845,0.001051497,0.0023901842,0.0003400308],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003029881,0.0015291957,0.0010490722,0.0015659037,0.0002642774,0.0010805961,0.0013153846,0.001528064,0.034183323],"category_scores_gemma":[0.011394766,0.00030310458,0.00042067425,0.00055037736,0.00025580855,0.0010579262,0.0012798279,0.0007126409,0.010275156],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.008775477,0.0012187151,0.0040973173,0.0015938606,0.00018207157,0.0012579722,0.001207837,0.0025827612,0.35271892,0.0068279346,0.05225777,0.5672795],"study_design_scores_gemma":[0.001661435,0.0062257336,0.024253445,0.000725695,0.0004738545,0.007299335,0.0004101475,0.23946172,0.5031508,0.006426577,0.20919076,0.0007205003],"about_ca_topic_score_codex":0.00020488515,"about_ca_topic_score_gemma":0.0001591867,"teacher_disagreement_score":0.034183323,"about_ca_system_score_codex":0.00018568622,"about_ca_system_score_gemma":0.00017701939,"threshold_uncertainty_score":0.11435461},"labels":[],"label_agreement":null},{"id":"W2134412393","doi":"10.1109/icassp.2008.4517830","title":"Near lossless image compression by local packing of histogram","year":2008,"lang":"en","type":"article","venue":"","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Lossless compression; Histogram; Pixel; Image compression; Artificial intelligence; Computer science; Data compression; Histogram matching; Algorithm; Computer vision; Entropy (arrow of time); Lossy compression; Pattern recognition (psychology); Color Cell Compression; Mathematics; Image (mathematics); Image processing","score_opus":0.012968391572871923,"score_gpt":0.25795087521783144,"score_spread":0.24498248364495953,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2134412393","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05361084,0.0004897037,0.9433983,0.00009123815,0.000050062612,0.000038711663,0.000026594544,0.0006758955,0.0016186576],"genre_scores_gemma":[0.57440746,0.00053649006,0.42075115,0.0001522547,0.00010383156,0.0000648804,0.00016739618,0.0001475955,0.0036690077],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997588,0.00003554124,0.000010345498,0.000029642735,0.00014713238,0.000018502213],"domain_scores_gemma":[0.99963105,0.00012209643,0.00005492674,0.00010820674,0.0000627313,0.000021032642],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000224207,0.00022622762,0.00039313236,0.0005897372,0.0002540348,0.0005196433,0.00046622366,0.00026918002,0.0012500534],"category_scores_gemma":[0.0010175733,0.00019997188,0.0001996383,0.00067301316,0.00051792146,0.0014178583,0.00060683786,0.000429938,0.0005236352],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00064755004,0.00016689897,0.0012592418,0.00020673468,0.000044470184,0.00037514686,0.00024639713,0.0784946,0.1835535,0.025144095,0.0025042861,0.70735705],"study_design_scores_gemma":[0.00006775962,0.00045856964,0.0018145948,0.000033049266,0.000034710894,0.0015070286,0.00007375192,0.787117,0.18476178,0.015698405,0.008379391,0.000054057575],"about_ca_topic_score_codex":0.00031063566,"about_ca_topic_score_gemma":0.0003306485,"teacher_disagreement_score":0.0012500534,"about_ca_system_score_codex":0.0002386666,"about_ca_system_score_gemma":0.00017953601,"threshold_uncertainty_score":0.004181862},"labels":[],"label_agreement":null},{"id":"W2134436600","doi":"10.1109/dcc.2006.41","title":"Joint Source-Channel Decoding of Multiple Description Quantized Markov Sequences","year":2006,"lang":"en","type":"article","venue":"","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Decoding methods; Algorithm; Computer science; Markov process; Maximum a posteriori estimation; Encoder; Lossy compression; Soft-decision decoder; Theoretical computer science; Sequence (biology); Belief propagation; Markov chain; Gaussian; Mathematics; Artificial intelligence; Maximum likelihood; Statistics","score_opus":0.039254927513063455,"score_gpt":0.26046018360074247,"score_spread":0.22120525608767902,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2134436600","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010981511,0.00012180403,0.9877067,0.00006722706,0.000015587599,0.000015627473,0.00005581324,0.00025764797,0.0007781515],"genre_scores_gemma":[0.6101496,0.00033552144,0.38572156,0.000079480196,0.000046481782,0.00008430163,0.00033741363,0.00010455468,0.0031409978],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99917406,0.00028068342,0.000039072725,0.00011783029,0.0002967422,0.000091586226],"domain_scores_gemma":[0.9984787,0.0009895568,0.00010940131,0.00021445326,0.0001738598,0.000034026605],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010056213,0.00039511878,0.00067836436,0.00037617196,0.00034273457,0.0006675778,0.00086576527,0.00056549854,0.0010972003],"category_scores_gemma":[0.0035687098,0.00030468998,0.00036696318,0.0004860772,0.00065493,0.0013819943,0.00096325454,0.00075908436,0.00027910445],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00028596833,0.000044933524,0.00063295243,0.000104379345,0.000039619823,0.00020641721,0.00016194984,0.68857646,0.012309695,0.17253369,0.0014236216,0.123680376],"study_design_scores_gemma":[0.000007684811,0.000018898443,0.000054303157,0.0000045152638,0.00000429958,0.000029046323,0.000007060855,0.97760713,0.0042336415,0.017383857,0.00064305397,0.000006580104],"about_ca_topic_score_codex":0.0025922293,"about_ca_topic_score_gemma":0.0029454988,"teacher_disagreement_score":0.0025922293,"about_ca_system_score_codex":0.00074501237,"about_ca_system_score_gemma":0.0012072455,"threshold_uncertainty_score":0.0054054856},"labels":[],"label_agreement":null},{"id":"W2134569521","doi":"10.1109/ccece.2005.1557293","title":"An iterative m-algorithm based decoder for convolutional codes","year":2006,"lang":"en","type":"article","venue":"","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Decoding methods; Convolutional code; Algorithm; Computer science; Frame (networking); Sequential decoding; List decoding; Code (set theory); Constraint (computer-aided design); Concatenated error correction code; Mathematics; Block code; Set (abstract data type); Telecommunications","score_opus":0.012676361736772708,"score_gpt":0.3001600686096989,"score_spread":0.2874837068729262,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2134569521","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0080600595,0.00030291738,0.9889903,0.000059778835,0.00004405945,0.00003651333,0.000026913793,0.00036233518,0.0021172238],"genre_scores_gemma":[0.14260519,0.00032006286,0.8516826,0.0001126438,0.00005942442,0.00007995202,0.00011661429,0.00006841646,0.0049550375],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99938047,0.00016018817,0.00003835419,0.00007133155,0.000304232,0.000045315453],"domain_scores_gemma":[0.9993537,0.00022496693,0.00006386999,0.00011475567,0.00021814027,0.000024578374],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045654256,0.00054327905,0.00042555787,0.0005719793,0.00035499886,0.00051323,0.00079864275,0.0010125736,0.0013396472],"category_scores_gemma":[0.0016399886,0.00022976859,0.0003828054,0.00047737942,0.0004002494,0.0007679837,0.00060078746,0.0008486887,0.0009552352],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00060101034,0.0001359038,0.0018928122,0.00027779955,0.00011824926,0.0003749207,0.0002264708,0.15381658,0.1639763,0.10111257,0.00436002,0.57310736],"study_design_scores_gemma":[0.000038461498,0.00027749751,0.00052343786,0.000037761136,0.000029993807,0.0007364353,0.000016035981,0.8861188,0.09062204,0.00859869,0.01295166,0.000049051298],"about_ca_topic_score_codex":0.0010118445,"about_ca_topic_score_gemma":0.0015264838,"teacher_disagreement_score":0.0013396472,"about_ca_system_score_codex":0.0005233687,"about_ca_system_score_gemma":0.0010218794,"threshold_uncertainty_score":0.004481554},"labels":[],"label_agreement":null},{"id":"W2135435709","doi":"10.1109/tip.2005.857267","title":"On multirate optimality of JPEG2000 code stream","year":2005,"lang":"en","type":"article","venue":"IEEE Transactions on Image Processing","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"JPEG 2000; Computer science; Scalability; Algorithm; Image compression; Theoretical computer science; Mathematics; Mathematical optimization; Image processing; Artificial intelligence; Image (mathematics)","score_opus":0.020273834461494042,"score_gpt":0.3077135105603026,"score_spread":0.28743967609880855,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2135435709","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10420635,0.0011929587,0.88127047,0.0005088524,0.00005664775,0.000064504326,0.00019137535,0.00022845028,0.012280367],"genre_scores_gemma":[0.81401557,0.0019544365,0.177822,0.00026299377,0.00013023743,0.00009838894,0.00040030768,0.00034450428,0.004971596],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984333,0.00045259838,0.00006847396,0.00018893882,0.0006997784,0.0001570254],"domain_scores_gemma":[0.99463993,0.0033185834,0.0005346983,0.00047384296,0.0008793764,0.00015357372],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002898722,0.0007914964,0.00071114727,0.00087820133,0.00039497003,0.0012616238,0.000661351,0.0006492383,0.0017114946],"category_scores_gemma":[0.014421756,0.00038358112,0.00036136503,0.0007619845,0.0013958,0.002407032,0.0013118502,0.0013749329,0.00049800036],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00048171362,0.000085742904,0.0022284987,0.00014892814,0.000027373055,0.00015250729,0.00014076533,0.5985421,0.019714197,0.32290316,0.0026531054,0.052921966],"study_design_scores_gemma":[0.00001942184,0.00009408405,0.00047709566,0.000027593842,0.000006372262,0.00010175967,0.00003131029,0.9400093,0.008057442,0.050045602,0.0011139776,0.000015991794],"about_ca_topic_score_codex":0.001415824,"about_ca_topic_score_gemma":0.00096444605,"teacher_disagreement_score":0.002898722,"about_ca_system_score_codex":0.001473651,"about_ca_system_score_gemma":0.0012919971,"threshold_uncertainty_score":0.015330076},"labels":[],"label_agreement":null},{"id":"W2135448764","doi":"10.1109/icip.1994.413281","title":"Adaptive MHDCT coding of images","year":2002,"lang":"en","type":"article","venue":"","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Discrete cosine transform; Hadamard transform; Coding (social sciences); ENCODE; Transform coding; Computer science; Algorithm; Walsh function; Artificial intelligence; Decoding methods; Computer vision; Pattern recognition (psychology); Theoretical computer science; Mathematics; Image (mathematics); Statistics; Gene","score_opus":0.03910766474107353,"score_gpt":0.2671424620582969,"score_spread":0.22803479731722337,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2135448764","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04808117,0.0007689781,0.9358919,0.00032598362,0.00025459297,0.00011624257,0.00037465632,0.0007462903,0.013440243],"genre_scores_gemma":[0.5909739,0.0009488511,0.3916703,0.00029052928,0.00023948825,0.00017008856,0.00072624953,0.00011268541,0.014867994],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99979585,0.00002616179,0.000008708684,0.000025568284,0.00011794827,0.000025741187],"domain_scores_gemma":[0.9996617,0.00008551568,0.000029475212,0.00009472072,0.000113393435,0.000015163267],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015754063,0.00023045926,0.0002532119,0.00062917155,0.00024056442,0.00034740096,0.00042332226,0.00033862595,0.0023742286],"category_scores_gemma":[0.0011395529,0.00007457137,0.000221344,0.0008326743,0.0003329853,0.00034966753,0.00038503224,0.00039127524,0.0007158325],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004695264,0.00005556847,0.0007563328,0.00022196949,0.000021634638,0.00045856868,0.00014206154,0.061714273,0.2663906,0.053942554,0.00859258,0.6072344],"study_design_scores_gemma":[0.0000424737,0.00010286242,0.0021821947,0.000035431967,0.000019582047,0.0011924161,0.000041866602,0.8032837,0.15663983,0.013955149,0.022460785,0.00004362997],"about_ca_topic_score_codex":0.0015810167,"about_ca_topic_score_gemma":0.0020357303,"teacher_disagreement_score":0.0023742286,"about_ca_system_score_codex":0.00031170336,"about_ca_system_score_gemma":0.00026679033,"threshold_uncertainty_score":0.007942617},"labels":[],"label_agreement":null},{"id":"W2135530922","doi":"","title":"Developing filtering techniques for securing vector graphics images applied to ubiquitous patient records","year":2006,"lang":"en","type":"article","venue":"","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Lakehead University","funders":"","keywords":"Scalable Vector Graphics; Computer science; XML; Encryption; Filter (signal processing); Vector graphics; Graphics; Cryptography; World Wide Web; Computer security; Computer graphics (images); Computer vision","score_opus":0.016035482111461278,"score_gpt":0.2715297619181356,"score_spread":0.25549427980667433,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2135530922","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010230734,0.00020281346,0.9869533,0.00014502332,0.00005482963,0.00006605225,0.000022355898,0.0012483518,0.0010765257],"genre_scores_gemma":[0.18445915,0.0008278141,0.80888164,0.00016442713,0.00009618539,0.00009733887,0.00013355954,0.00021880557,0.0051211133],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99863166,0.00028932924,0.00011840396,0.00014179372,0.000684028,0.00013473986],"domain_scores_gemma":[0.9968881,0.0011535601,0.00037948342,0.0008558497,0.0006523974,0.00007056829],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015130399,0.0005801055,0.00041504405,0.0013281108,0.0004811991,0.0020015151,0.00076389406,0.0009766249,0.004051166],"category_scores_gemma":[0.004359523,0.00034182306,0.00061146414,0.0009852031,0.0009132401,0.0018767597,0.0010569411,0.00091702864,0.001882831],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00041338932,0.00011146125,0.0021239205,0.00029784322,0.00010101957,0.00065952353,0.0006565152,0.021128783,0.23991516,0.054417964,0.004935589,0.67523885],"study_design_scores_gemma":[0.000063990505,0.0004298693,0.0018730573,0.00012323582,0.000095475414,0.00164687,0.000457774,0.46817178,0.45853713,0.02180467,0.046729364,0.00006683425],"about_ca_topic_score_codex":0.0010338249,"about_ca_topic_score_gemma":0.0010037835,"teacher_disagreement_score":0.004051166,"about_ca_system_score_codex":0.0005986248,"about_ca_system_score_gemma":0.0005475461,"threshold_uncertainty_score":0.0135525465},"labels":[],"label_agreement":null},{"id":"W2135962321","doi":"10.1109/ccece.1993.332258","title":"Object-oriented image sequence coding using the minimum description length principle","year":2002,"lang":"en","type":"article","venue":"","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Minimum description length; Coding (social sciences); Computer science; Segmentation; Artificial intelligence; Computer vision; Motion estimation; Object (grammar); Image segmentation; Algorithm; Mathematics; Statistics","score_opus":0.0837899809299924,"score_gpt":0.32043652858234545,"score_spread":0.23664654765235305,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2135962321","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0019283595,0.0002837703,0.99600804,0.000086100015,0.000023001327,0.00003623012,0.000048484126,0.00023864908,0.0013474488],"genre_scores_gemma":[0.08649324,0.0009469586,0.90669286,0.00013697533,0.00008581258,0.00024646556,0.0005030743,0.00010901937,0.0047856644],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99954444,0.000095867246,0.000028036453,0.000032209715,0.00027097456,0.000028436141],"domain_scores_gemma":[0.9996006,0.00013551033,0.000043468786,0.000078541954,0.00012835344,0.000013492996],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00065908616,0.0004169911,0.00044492248,0.00091536605,0.00017843116,0.0007415228,0.0008043947,0.00052639656,0.0017295964],"category_scores_gemma":[0.0015049723,0.00017943367,0.00033020374,0.0010109984,0.000527878,0.0010907437,0.0005987963,0.0006922243,0.0008390377],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001730147,0.00005026902,0.00026880743,0.00026029942,0.000030564726,0.00019740763,0.00021166714,0.11449272,0.06305049,0.361489,0.0063867364,0.45338902],"study_design_scores_gemma":[0.00004221602,0.00009471621,0.00025077694,0.000060372833,0.000014177743,0.000201266,0.000022507887,0.8638795,0.03766546,0.07774764,0.01998171,0.000039644856],"about_ca_topic_score_codex":0.0013360012,"about_ca_topic_score_gemma":0.0011516623,"teacher_disagreement_score":0.0017295964,"about_ca_system_score_codex":0.0006130411,"about_ca_system_score_gemma":0.0006612454,"threshold_uncertainty_score":0.005786121},"labels":[],"label_agreement":null},{"id":"W2136333263","doi":"10.1109/isit.1998.708800","title":"Optimal use of Markov models for DPCM picture transmission over binary symmetric channels","year":2002,"lang":"en","type":"article","venue":"","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; Binary number; Viterbi algorithm; Binary symmetric channel; Markov chain; Algorithm; Redundancy (engineering); Generalization; Markov process; Decoding methods; Markov model; Residual; Channel (broadcasting); Transmission (telecommunications); Theoretical computer science; Mathematics; Arithmetic; Telecommunications; Channel code","score_opus":0.04973822583676285,"score_gpt":0.27257022324615315,"score_spread":0.2228319974093903,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2136333263","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07876492,0.00036839693,0.91874063,0.00025545186,0.000028116472,0.000034243585,0.00008741903,0.00028591958,0.00143494],"genre_scores_gemma":[0.93188876,0.0004889532,0.066136844,0.00007153724,0.00002845723,0.00007204085,0.00011320999,0.000037919333,0.0011623683],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999608,0.00015213735,0.000017674607,0.000041726,0.00010061986,0.00007995939],"domain_scores_gemma":[0.9989473,0.0007382353,0.000097714474,0.00008842015,0.000088177796,0.00004012156],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007216274,0.00039985657,0.0005146823,0.0002440573,0.0003356031,0.00052097294,0.0004965575,0.0005117311,0.000962406],"category_scores_gemma":[0.002813664,0.00037868213,0.0002532387,0.00028022807,0.0005033905,0.0011136767,0.0005709463,0.0006497146,0.00026963954],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006931979,0.000111918605,0.0007809964,0.000107077816,0.000055041877,0.00017268113,0.00011968015,0.83320755,0.024112059,0.063563146,0.0010212521,0.0760555],"study_design_scores_gemma":[0.000015189802,0.000033249984,0.00008720736,0.000007039415,0.000007536131,0.000025333424,0.000007004765,0.9877801,0.0038359205,0.007991333,0.00019435362,0.000015641936],"about_ca_topic_score_codex":0.0032515656,"about_ca_topic_score_gemma":0.0044482634,"teacher_disagreement_score":0.0032515656,"about_ca_system_score_codex":0.00060931715,"about_ca_system_score_gemma":0.0012763262,"threshold_uncertainty_score":0.006465256},"labels":[],"label_agreement":null},{"id":"W2136355314","doi":"10.1109/itw.1989.761413","title":"A Comparison of Trellis Coded SSMA to Convolutionally Coded SSMA","year":2005,"lang":"en","type":"article","venue":"","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Computer science; Convolutional code; Speech recognition; Trellis (graph); Spread spectrum; Decoding methods; Algorithm; Telecommunications; Channel (broadcasting)","score_opus":0.03785694453760965,"score_gpt":0.3539241045830868,"score_spread":0.3160671600454772,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2136355314","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4947219,0.007655623,0.43814975,0.0008403716,0.0007648143,0.0002252426,0.00084721233,0.0043911887,0.05240401],"genre_scores_gemma":[0.89642406,0.0014943213,0.0850993,0.0002187598,0.00014280496,0.00005061941,0.00059556233,0.00019422344,0.015780477],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99894303,0.00022412409,0.000036659232,0.000065025575,0.0005929079,0.0001382065],"domain_scores_gemma":[0.9942145,0.0028325042,0.00019988981,0.00052965427,0.002106573,0.00011688794],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011395253,0.00035411178,0.00041186792,0.00087261864,0.0003742622,0.001051433,0.0008069394,0.00079888524,0.008286836],"category_scores_gemma":[0.006205034,0.00011295647,0.0002466438,0.0009794688,0.00030916877,0.0010496306,0.00041619563,0.00045833085,0.0010838293],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0090771755,0.00042393865,0.003439444,0.0006030525,0.0002892977,0.00025155552,0.00021923766,0.14911836,0.17702428,0.036227126,0.0059664785,0.6173601],"study_design_scores_gemma":[0.00022711403,0.0015829122,0.0044104233,0.00009407193,0.00021593925,0.00064171344,0.0001447141,0.8501303,0.12250508,0.007146887,0.012817285,0.00008357664],"about_ca_topic_score_codex":0.005245195,"about_ca_topic_score_gemma":0.008080018,"teacher_disagreement_score":0.008286836,"about_ca_system_score_codex":0.0010980315,"about_ca_system_score_gemma":0.0011629653,"threshold_uncertainty_score":0.02772224},"labels":[],"label_agreement":null},{"id":"W2136719960","doi":"10.1109/glocom.2005.1578045","title":"Performance comparison of layered coding and multiple description coding in packet networks","year":2005,"lang":"en","type":"article","venue":"GLOBECOM '05. IEEE Global Telecommunications Conference, 2005.","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Retransmission; Go-Back-N ARQ; Computer science; Automatic repeat request; Network packet; Hybrid automatic repeat request; Selective Repeat ARQ; Packet loss; Linear network coding; Computer network; Coding (social sciences); Multiple description coding; End-to-end delay; Transmission delay; Real-time computing; Algorithm; Mathematics; Statistics; Telecommunications link","score_opus":0.05215254175720044,"score_gpt":0.3130629905788054,"score_spread":0.26091044882160497,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2136719960","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.70875305,0.0037005947,0.27611163,0.00067927205,0.00016352645,0.00013900775,0.00029406368,0.0013282029,0.008830807],"genre_scores_gemma":[0.9685707,0.0005145239,0.02985149,0.00007891593,0.000028509616,0.000037818012,0.00019930716,0.000037396137,0.0006813705],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99755955,0.0008789555,0.000093509996,0.00010983308,0.0010358804,0.00032224742],"domain_scores_gemma":[0.9810144,0.013025555,0.00072367914,0.0010992922,0.0037487398,0.00038844216],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0034580904,0.0006681179,0.000665532,0.0009441966,0.0002988848,0.0011500245,0.00086271134,0.0009145627,0.0008997632],"category_scores_gemma":[0.020813793,0.00021324774,0.0002762319,0.0010005469,0.00068708294,0.0019385832,0.0013089081,0.00070034026,0.00019950644],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0033244926,0.00036692858,0.0070446962,0.00034320404,0.00021009817,0.0002006385,0.00023939382,0.701915,0.02658585,0.01907395,0.0016941964,0.2390016],"study_design_scores_gemma":[0.000040387225,0.00050956785,0.00069941545,0.000018956915,0.00003509298,0.0000749203,0.000038280403,0.9837915,0.012276276,0.002167704,0.0003093112,0.00003865702],"about_ca_topic_score_codex":0.0052015134,"about_ca_topic_score_gemma":0.0041655344,"teacher_disagreement_score":0.0052015134,"about_ca_system_score_codex":0.0014616193,"about_ca_system_score_gemma":0.0014103082,"threshold_uncertainty_score":0.018288374},"labels":[],"label_agreement":null},{"id":"W2136774480","doi":"10.1109/tip.2003.822613","title":"Optimal Context Quantization in Lossless Compression of Image Data Sequences","year":2004,"lang":"en","type":"article","venue":"IEEE Transactions on Image Processing","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":33,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Entropy encoding; Data compression; Arithmetic coding; Quantization (signal processing); Lossless compression; Mathematics; Algorithm; Context model; Image compression; Computer science; Context-adaptive binary arithmetic coding; Artificial intelligence; Image processing; Image (mathematics)","score_opus":0.041509758887347134,"score_gpt":0.33095547144420323,"score_spread":0.2894457125568561,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2136774480","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.034580078,0.0028774058,0.9607402,0.00020595951,0.000040466548,0.00003669033,0.000063798536,0.00020192929,0.0012534236],"genre_scores_gemma":[0.6592353,0.0022880856,0.33657038,0.00013596492,0.00010579532,0.00010891944,0.00014257933,0.00006428055,0.0013487308],"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99946815,0.00015700118,0.000028439286,0.00008332157,0.0002249985,0.00003807565],"domain_scores_gemma":[0.9993285,0.00047619554,0.000060585397,0.00005417411,0.00006693943,0.000013556294],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00063082034,0.00042062294,0.0004874232,0.00042432136,0.00027363008,0.0005594,0.00047462463,0.0005213301,0.00065703876],"category_scores_gemma":[0.0038326967,0.0002521009,0.00016920848,0.00074026047,0.00074892776,0.0011730482,0.000571472,0.0006155091,0.00015810692],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00039517332,0.00005927388,0.0006246296,0.00025793357,0.000023249893,0.00022018129,0.00016334033,0.5711214,0.033208285,0.10315057,0.0014541991,0.28932163],"study_design_scores_gemma":[0.000015872201,0.00007433127,0.0002505147,0.000029298371,0.000008049672,0.0000777379,0.000016674298,0.94385844,0.011698346,0.042690124,0.0012671746,0.000013490515],"about_ca_topic_score_codex":0.001067192,"about_ca_topic_score_gemma":0.0013651372,"teacher_disagreement_score":0.001067192,"about_ca_system_score_codex":0.0005319463,"about_ca_system_score_gemma":0.00047774953,"threshold_uncertainty_score":0.00385952},"labels":[],"label_agreement":null},{"id":"W2136821495","doi":"10.1109/icip.1997.638581","title":"Adaptive rate controlling for reliable video communication over wireless packet networks","year":2002,"lang":"en","type":"article","venue":"","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Computer science; Network packet; Channel (broadcasting); Narrowband; Wireless; Real-time computing; Transmission (telecommunications); Computer network; Telecommunications","score_opus":0.029172778637029693,"score_gpt":0.26782608431130295,"score_spread":0.23865330567427326,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2136821495","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05199134,0.0032370787,0.94044596,0.00024968563,0.00010238257,0.000057255325,0.000019169482,0.000593046,0.0033040834],"genre_scores_gemma":[0.8816656,0.002985244,0.11195577,0.000097943535,0.00019803316,0.0000850377,0.000048830574,0.000059438735,0.0029040517],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996451,0.00009558338,0.00001312958,0.000030683812,0.00019152871,0.000023959718],"domain_scores_gemma":[0.999501,0.0002946585,0.00006716061,0.000040008654,0.00008741503,0.000009652887],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005042843,0.00030633478,0.00018357913,0.0002446703,0.00015391261,0.00036540136,0.00043673033,0.0003077733,0.000739383],"category_scores_gemma":[0.0018112746,0.00011454595,0.00010027147,0.00022975368,0.00026566838,0.0006921293,0.00024907122,0.00047442425,0.00021598896],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004700587,0.0000889585,0.0010382781,0.0003198982,0.00004179182,0.00048055346,0.00025957832,0.21803433,0.21011454,0.044251394,0.0026995002,0.5222011],"study_design_scores_gemma":[0.000039003888,0.00032832965,0.0005663551,0.000021320498,0.000023859453,0.00023754255,0.000037662336,0.95598435,0.029166093,0.0070619048,0.0065090857,0.000024383697],"about_ca_topic_score_codex":0.0005573576,"about_ca_topic_score_gemma":0.0004041261,"teacher_disagreement_score":0.000739383,"about_ca_system_score_codex":0.00023083706,"about_ca_system_score_gemma":0.00016688908,"threshold_uncertainty_score":0.0026669502},"labels":[],"label_agreement":null},{"id":"W2137223905","doi":"10.1109/pacrim.1993.407225","title":"Multidimensional histogram classifier design by using vector quantization","year":2002,"lang":"en","type":"article","venue":"","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Classifier (UML); Histogram; Artificial intelligence; Computer science; Pattern recognition (psychology); Vector quantization; Machine learning","score_opus":0.08534725192065575,"score_gpt":0.28890102574049464,"score_spread":0.2035537738198389,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2137223905","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0027713217,0.00020870322,0.99491817,0.000104514795,0.00010519026,0.00007738652,0.000050553357,0.00095896964,0.0008051591],"genre_scores_gemma":[0.12790595,0.00036005594,0.8662455,0.00020915222,0.00018621056,0.00035167803,0.00051591406,0.00015466766,0.004070853],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998439,0.0002530162,0.00014253339,0.00028964994,0.00077829015,0.00009749306],"domain_scores_gemma":[0.9980616,0.00034616792,0.000104190636,0.00019343257,0.0012452434,0.000049354825],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015740936,0.00042202283,0.00096278574,0.0015014668,0.0005341733,0.0014701427,0.0013838684,0.0010281771,0.0039646043],"category_scores_gemma":[0.00459536,0.00033994176,0.00042004674,0.0013755753,0.00040880157,0.0022045013,0.00067701,0.0009602471,0.0022897655],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015558177,0.000109244786,0.000995234,0.0001522981,0.000053372718,0.000043960805,0.000091461116,0.030888516,0.031656098,0.022099836,0.010997689,0.90275663],"study_design_scores_gemma":[0.000050148134,0.00015212732,0.0009232107,0.000025791238,0.00003206244,0.00019663789,0.000044065135,0.92777354,0.045594815,0.01014055,0.015017693,0.000049382903],"about_ca_topic_score_codex":0.0028915051,"about_ca_topic_score_gemma":0.00319258,"teacher_disagreement_score":0.0039646043,"about_ca_system_score_codex":0.00097121287,"about_ca_system_score_gemma":0.0010602635,"threshold_uncertainty_score":0.0132629275},"labels":[],"label_agreement":null},{"id":"W2137509276","doi":"10.1109/icassp.2005.1415417","title":"Improvement of JPEG2000 Using Curved Wavelet Transform","year":2006,"lang":"en","type":"article","venue":"","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Communications Research Centre Canada","funders":"","keywords":"Wavelet transform; Second-generation wavelet transform; Wavelet; Stationary wavelet transform; Wavelet packet decomposition; Lifting scheme; Discrete wavelet transform; Harmonic wavelet transform; Artificial intelligence; JPEG 2000; Mathematics; Computer vision; Computer science; Pattern recognition (psychology); Algorithm; Image compression; Image processing; Image (mathematics)","score_opus":0.013888913564957674,"score_gpt":0.26201326879347053,"score_spread":0.24812435522851287,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2137509276","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16008493,0.001817587,0.8257144,0.00033623306,0.00015705299,0.00011321805,0.0002860563,0.003469837,0.0080206795],"genre_scores_gemma":[0.4285594,0.002372813,0.55894035,0.0002469822,0.00010687872,0.000064058615,0.0012380726,0.00049091305,0.007980561],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99960774,0.000052807394,0.000017753631,0.000031042327,0.00025773642,0.000032943037],"domain_scores_gemma":[0.99917847,0.00016358096,0.00005789957,0.00011339397,0.00045471694,0.000031842774],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00049361604,0.000824391,0.00036656926,0.0010198423,0.00017871807,0.00047664985,0.0003846181,0.0006311072,0.0022472376],"category_scores_gemma":[0.0021458757,0.00019351406,0.0003903511,0.0012566671,0.00021719333,0.0008326354,0.0005691159,0.00053180155,0.0012808468],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00045223668,0.0001437896,0.0013023447,0.00017316951,0.000043423373,0.00029450105,0.00009236465,0.024213806,0.47350496,0.006137689,0.0044743135,0.48916736],"study_design_scores_gemma":[0.00009846309,0.0006306529,0.008223668,0.000038632978,0.000104283485,0.0017944284,0.00007647186,0.5071701,0.4558325,0.003119748,0.022813866,0.000097191405],"about_ca_topic_score_codex":0.0017500276,"about_ca_topic_score_gemma":0.0013009389,"teacher_disagreement_score":0.0022472376,"about_ca_system_score_codex":0.00025841803,"about_ca_system_score_gemma":0.00029818123,"threshold_uncertainty_score":0.007517755},"labels":[],"label_agreement":null},{"id":"W2137736481","doi":"10.1109/ccece.2008.4564668","title":"Prediction-compensated multiple description coding with optimal weighted reconstruction","year":2008,"lang":"en","type":"article","venue":"Conference proceedings - Canadian Conference on Electrical and Computer Engineering","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Weighting; Algorithm; Computer science; Coding (social sciences); Signal reconstruction; Rate–distortion theory; Distortion (music); Iterative reconstruction; Mathematical optimization; Mathematics; Signal processing; Artificial intelligence; Data compression; Statistics; Digital signal processing; Bandwidth (computing); Telecommunications","score_opus":0.022956672149857315,"score_gpt":0.18648076784809697,"score_spread":0.16352409569823967,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2137736481","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004803663,0.00030777545,0.9940171,0.00007221007,0.000033299588,0.000026745694,0.00003217807,0.00011856524,0.0005883444],"genre_scores_gemma":[0.23305243,0.0005105617,0.762562,0.00016352633,0.000068277935,0.000105853454,0.00025243175,0.000056932364,0.0032280262],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990427,0.00022478456,0.00005178883,0.00011077285,0.0005112388,0.000058686895],"domain_scores_gemma":[0.9992248,0.0002624777,0.000098372555,0.00016962341,0.00022300999,0.000021705375],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008948266,0.0006240407,0.00065729895,0.0006297436,0.000291043,0.00059332204,0.001219137,0.00070308545,0.0012609342],"category_scores_gemma":[0.002230563,0.0002931866,0.00045542116,0.00080164656,0.0005011848,0.0015643508,0.00095147756,0.0008229586,0.00044658585],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00042613334,0.00008502626,0.0006485923,0.00037269716,0.00009315288,0.00034463266,0.00015991899,0.18389118,0.05450742,0.114049494,0.003455476,0.6419663],"study_design_scores_gemma":[0.000029627805,0.000083307394,0.00012088749,0.000022444194,0.000018750878,0.00029591593,0.000013851487,0.9703197,0.017210886,0.00867007,0.0031802626,0.00003421117],"about_ca_topic_score_codex":0.0018218394,"about_ca_topic_score_gemma":0.0020243842,"teacher_disagreement_score":0.0018218394,"about_ca_system_score_codex":0.0005353844,"about_ca_system_score_gemma":0.00088849844,"threshold_uncertainty_score":0.0047323704},"labels":[],"label_agreement":null},{"id":"W2138037560","doi":"10.1109/iscas.2002.1009852","title":"Optimal adaptive bandwidth monitoring for QoS based retrieval","year":2003,"lang":"en","type":"article","venue":"","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Computer science; Bandwidth (computing); Dynamic bandwidth allocation; Quality of service; Probabilistic logic; Bandwidth allocation; Bandwidth management; Overhead (engineering); Computer network; Real-time computing; Distributed computing; Artificial intelligence","score_opus":0.036727867258441016,"score_gpt":0.30153121269893113,"score_spread":0.2648033454404901,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2138037560","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04056356,0.0005907703,0.956892,0.0001520477,0.00002167786,0.000046016583,0.000026841544,0.0008507915,0.0008563146],"genre_scores_gemma":[0.6533506,0.00020542133,0.34552073,0.000060470924,0.000042031803,0.00008382076,0.00007384751,0.00007780446,0.00058532204],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989195,0.00028718586,0.00007210634,0.00018049768,0.00043940337,0.000101237376],"domain_scores_gemma":[0.99711454,0.0019064356,0.00028542572,0.00025150474,0.00037497436,0.000067072106],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011243663,0.0005025661,0.0007016707,0.001078173,0.00048032604,0.0008089665,0.00114307,0.0008614796,0.0010372946],"category_scores_gemma":[0.009832395,0.00040386213,0.00023445705,0.00068219623,0.00071470405,0.0015060488,0.0008566292,0.0006655025,0.0003312518],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009826156,0.00019788378,0.0019304754,0.000119919496,0.000033661534,0.00009338316,0.00017370169,0.4413476,0.07502806,0.015197967,0.0018785186,0.4630162],"study_design_scores_gemma":[0.00003612468,0.000049251343,0.00026935508,0.000004828393,0.000007568989,0.00004504106,0.000013397693,0.986623,0.0070675258,0.0054968325,0.00037556075,0.000011506261],"about_ca_topic_score_codex":0.002411364,"about_ca_topic_score_gemma":0.0017935751,"teacher_disagreement_score":0.002411364,"about_ca_system_score_codex":0.0009042296,"about_ca_system_score_gemma":0.00074967823,"threshold_uncertainty_score":0.0065606833},"labels":[],"label_agreement":null},{"id":"W2138060889","doi":"10.1109/igarss.2003.1294261","title":"Evaluation and comparison of JPEG2000 and vector quantization based onboard data compression algorithm for hyperspectral imagery","year":2004,"lang":"en","type":"article","venue":"","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Canadian Space Agency","funders":"","keywords":"Vector quantization; Hyperspectral imaging; Computer science; Data compression; JPEG 2000; Artificial intelligence; Quantization (signal processing); Algorithm; Linde–Buzo–Gray algorithm; Computer vision; Image compression; Pattern recognition (psychology); Image (mathematics); Image processing","score_opus":0.08271427503564704,"score_gpt":0.38926121193501706,"score_spread":0.30654693689937,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2138060889","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8101728,0.004270892,0.17425059,0.00032350846,0.00019098024,0.00033420997,0.0005150203,0.00091578584,0.009026311],"genre_scores_gemma":[0.80774105,0.0020813383,0.18370052,0.00009064456,0.00005904207,0.00009386898,0.001506219,0.00011331964,0.004614057],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.999005,0.00017885165,0.000057929785,0.0000538581,0.0006738073,0.000030551313],"domain_scores_gemma":[0.99781346,0.00070583867,0.00011731834,0.00012106632,0.0011937906,0.000048600738],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013731028,0.00033716267,0.00023230002,0.0012443963,0.00016230035,0.0004861699,0.00035799184,0.00034916672,0.0012760577],"category_scores_gemma":[0.004981632,0.00007982861,0.0001534693,0.0010038629,0.0002251472,0.00074294454,0.0001885215,0.00017647234,0.0002390663],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0021606465,0.00039182673,0.008977667,0.0005173282,0.00014556816,0.00017670651,0.00017726672,0.051792257,0.16521354,0.0044213803,0.0028392037,0.76318663],"study_design_scores_gemma":[0.00021335467,0.0040130634,0.03370806,0.00007920268,0.00014204747,0.0011881801,0.0002563185,0.5928993,0.3537238,0.001805932,0.0118716685,0.00009891576],"about_ca_topic_score_codex":0.002107581,"about_ca_topic_score_gemma":0.0029027383,"teacher_disagreement_score":0.002107581,"about_ca_system_score_codex":0.00049400365,"about_ca_system_score_gemma":0.00035696995,"threshold_uncertainty_score":0.0072616935},"labels":[],"label_agreement":null},{"id":"W2138358573","doi":"10.1109/icip.1997.647805","title":"Interframe coding using deformable triangles of variable size","year":2002,"lang":"en","type":"article","venue":"","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université Laval","funders":"","keywords":"Inter frame; Motion compensation; Algorithm; Triangle mesh; Quadtree; Mathematics; Polygon mesh; Point cloud; Computer science; Motion estimation; Grid; Coding (social sciences); Computer vision; Artificial intelligence; Geometry; Reference frame; Frame (networking)","score_opus":0.04626244078541639,"score_gpt":0.2728857889944877,"score_spread":0.2266233482090713,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2138358573","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.101362854,0.000324578,0.8924544,0.00017184076,0.00011132052,0.00008112059,0.00012482917,0.00079655397,0.0045725517],"genre_scores_gemma":[0.5497738,0.00040193603,0.44455785,0.00009390708,0.00003200932,0.00007529207,0.0002925851,0.00015518272,0.004617433],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998264,0.000027310483,0.000011926835,0.000020861857,0.00009495595,0.000018546853],"domain_scores_gemma":[0.9994122,0.0002193844,0.00005410687,0.0001638286,0.00012677889,0.000023779105],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024392492,0.00029702563,0.00029654204,0.00048611913,0.00012344224,0.00029722022,0.000531818,0.0004646808,0.0027599891],"category_scores_gemma":[0.001553528,0.00013603983,0.0002629659,0.00078640145,0.00027203115,0.000667172,0.00044193026,0.00042352424,0.00041470455],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00045325994,0.000077553545,0.0005767901,0.00014799724,0.000030713283,0.00038072848,0.00017295271,0.0992123,0.3802169,0.02078594,0.0027490822,0.49519575],"study_design_scores_gemma":[0.00004600948,0.00019101014,0.0006385932,0.000017566223,0.000013150359,0.000394571,0.000042879215,0.8602692,0.12603255,0.0052845045,0.007039004,0.000030893574],"about_ca_topic_score_codex":0.0014387298,"about_ca_topic_score_gemma":0.0017922225,"teacher_disagreement_score":0.0027599891,"about_ca_system_score_codex":0.0002330063,"about_ca_system_score_gemma":0.00013281353,"threshold_uncertainty_score":0.009233117},"labels":[],"label_agreement":null},{"id":"W2138384328","doi":"10.1109/cwit.2011.5872126","title":"Hybrid digital-analog source-channel coding with one-to-three bandwidth expansion","year":2011,"lang":"en","type":"article","venue":"","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Bandwidth (computing); Computer science; Gaussian; Lossy compression; Channel code; Sub-band coding; Algorithm; Nonlinear system; Coding (social sciences); Electronic engineering; Decoding methods; Mathematics; Topology (electrical circuits); Speech recognition; Telecommunications; Speech coding; Physics; Engineering; Artificial intelligence","score_opus":0.042184338389777296,"score_gpt":0.23561136014705672,"score_spread":0.19342702175727944,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2138384328","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08119001,0.0005469991,0.9147073,0.00016876924,0.000031472875,0.000045482408,0.00005150299,0.0002342186,0.003024265],"genre_scores_gemma":[0.8972898,0.000261548,0.10001846,0.00007541071,0.000031490377,0.000054741362,0.00004229685,0.000016817628,0.0022094816],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99970263,0.00009033816,0.000012329235,0.00003871824,0.000119887314,0.000036080317],"domain_scores_gemma":[0.999297,0.00043996787,0.00007524745,0.00007117677,0.00008995108,0.000026607373],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00056725537,0.00037853594,0.00039880077,0.00024269032,0.0002622711,0.00039914003,0.00063131057,0.0004508789,0.0017019908],"category_scores_gemma":[0.001102931,0.00010864695,0.00017925157,0.00045667597,0.0005478241,0.0008952304,0.00080752245,0.00048516784,0.00023431984],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007579896,0.00013275674,0.0009637873,0.0003856447,0.00006378467,0.00045373992,0.0002357862,0.5239205,0.09893285,0.14640349,0.0017827882,0.22596681],"study_design_scores_gemma":[0.000024616307,0.000095701726,0.00012928022,0.000011514842,0.000011918413,0.00013781483,0.000018907991,0.96776026,0.01978842,0.010799275,0.0012077532,0.0000145910235],"about_ca_topic_score_codex":0.0008444472,"about_ca_topic_score_gemma":0.0011514868,"teacher_disagreement_score":0.0017019908,"about_ca_system_score_codex":0.00041953434,"about_ca_system_score_gemma":0.00039415288,"threshold_uncertainty_score":0.005693674},"labels":[],"label_agreement":null},{"id":"W2138486055","doi":"10.1109/iscas.1996.541846","title":"3-D model based coding-a very low bit rate coding scheme for video-conferencing","year":2002,"lang":"en","type":"article","venue":"","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Computer science; Coding (social sciences); Videoconferencing; Teleconference; Coding tree unit; Tunstall coding; Context-adaptive binary arithmetic coding; Bit rate; Multiview Video Coding; Multimedia; Artificial intelligence; Decoding methods; Real-time computing; Algorithm; Video processing; Data compression; Video tracking; Mathematics","score_opus":0.06513038761723448,"score_gpt":0.2848768072746902,"score_spread":0.21974641965745573,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2138486055","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010042482,0.00040702298,0.9847873,0.00020707335,0.00005288053,0.000060499595,0.00013908002,0.000699819,0.0036037993],"genre_scores_gemma":[0.47201678,0.0012877067,0.5163753,0.0003269252,0.0000679773,0.00019616942,0.0005224648,0.00014655382,0.009060018],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99981076,0.000043246837,0.0000061749433,0.000013622153,0.00010287784,0.000023379454],"domain_scores_gemma":[0.99978083,0.00006776864,0.000023050348,0.000080508034,0.00003650667,0.000011480674],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028309255,0.00038272623,0.00029675727,0.00042765817,0.0002577603,0.0005695419,0.0006373984,0.0006919183,0.0026606799],"category_scores_gemma":[0.0006264482,0.000141541,0.00042974603,0.0004732136,0.0004948838,0.00052307296,0.00054431625,0.0007098192,0.00081235805],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00032715048,0.00009782235,0.0006629744,0.00021990505,0.000035170062,0.0002607652,0.00021394217,0.093580864,0.40140244,0.12940706,0.0073165386,0.36647534],"study_design_scores_gemma":[0.000039129325,0.00019879719,0.0007426642,0.000047280115,0.000023647239,0.00073748094,0.00003783816,0.78817004,0.15573938,0.02400962,0.030197762,0.000056377943],"about_ca_topic_score_codex":0.001667422,"about_ca_topic_score_gemma":0.0031486303,"teacher_disagreement_score":0.0026606799,"about_ca_system_score_codex":0.00047966518,"about_ca_system_score_gemma":0.00042512608,"threshold_uncertainty_score":0.008900881},"labels":[],"label_agreement":null},{"id":"W2138713902","doi":"10.1109/tcsvt.2005.857304","title":"A multiresolution motion estimation technique with indexing","year":2006,"lang":"en","type":"article","venue":"IEEE Transactions on Circuits and Systems for Video Technology","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Motion estimation; Quarter-pixel motion; Algorithm; Motion vector; Motion field; Motion (physics); Mathematics; Search engine indexing; Artificial intelligence; Structure from motion; Wavelet; Computer science; Coding (social sciences); Computer vision; Image (mathematics)","score_opus":0.014760467002749566,"score_gpt":0.24957872666502645,"score_spread":0.23481825966227687,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2138713902","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0030074997,0.0009871256,0.99368876,0.0000736594,0.00013355509,0.00006780659,0.00006527554,0.00066129793,0.0013150778],"genre_scores_gemma":[0.04439848,0.00088779844,0.9509808,0.00011655547,0.00017733952,0.000093516435,0.000247824,0.00008977433,0.003007951],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99930894,0.000077020246,0.000055336743,0.00013151609,0.0003789291,0.000048148333],"domain_scores_gemma":[0.99953616,0.000089013396,0.00006259931,0.00015534653,0.00013220779,0.00002473855],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00062433607,0.0006979746,0.0011049265,0.0014721453,0.0004121776,0.0007830529,0.0010872714,0.0008892234,0.0030051258],"category_scores_gemma":[0.0019309188,0.0003586879,0.0009938271,0.0018924321,0.00028745199,0.0018720254,0.0010148243,0.0010629406,0.002104331],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001875783,0.00008802206,0.0003950492,0.00024933935,0.000055394717,0.00013475912,0.00009756543,0.0068103527,0.15473264,0.014512904,0.0032783183,0.8194582],"study_design_scores_gemma":[0.00014049785,0.0007471736,0.0034554626,0.00012839261,0.00025301264,0.003306789,0.000082789775,0.6264833,0.2504457,0.011242852,0.10349419,0.00021986323],"about_ca_topic_score_codex":0.0009442384,"about_ca_topic_score_gemma":0.001154422,"teacher_disagreement_score":0.0030051258,"about_ca_system_score_codex":0.00029744674,"about_ca_system_score_gemma":0.0005118991,"threshold_uncertainty_score":0.010053098},"labels":[],"label_agreement":null},{"id":"W2138962228","doi":"10.1002/ett.905","title":"An efficient approach to lattice-based fixed-rate entropy-coded vector quantization","year":2003,"lang":"en","type":"article","venue":"European Transactions on Telecommunications","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Vector quantization; Lattice (music); Mathematics; Algorithm; Applied mathematics; Computer science; Mathematical optimization; Statistical physics; Physics","score_opus":0.026070857222368734,"score_gpt":0.27553316122211313,"score_spread":0.2494623039997444,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2138962228","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0016354016,0.00014547963,0.99692875,0.00006444492,0.000026703461,0.000032691314,0.000024993597,0.00021361496,0.00092799176],"genre_scores_gemma":[0.106329925,0.00030633187,0.8910773,0.000085011365,0.000056304674,0.0001625009,0.000120366276,0.00008794184,0.0017742891],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9989116,0.00034050082,0.000067664216,0.00010132959,0.00051465596,0.00006427775],"domain_scores_gemma":[0.99917173,0.0003717499,0.00007161776,0.00017571445,0.00016819288,0.000041073785],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010360715,0.00054316514,0.00083870516,0.00083316676,0.0004808059,0.0010494341,0.0013217051,0.0007049973,0.0023026876],"category_scores_gemma":[0.0033987516,0.00034301585,0.00044613585,0.0012966687,0.0011464052,0.0014013501,0.0014747741,0.001794271,0.0008857825],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000230883,0.00010894341,0.00025799044,0.00019216666,0.00003705072,0.000090510664,0.00016940544,0.31883496,0.029141927,0.23455238,0.0037807524,0.41260293],"study_design_scores_gemma":[0.000027045586,0.000045864068,0.000041525203,0.000017040202,0.000006160292,0.00006721545,0.000012144507,0.95830464,0.008887642,0.029239329,0.003329035,0.000022382566],"about_ca_topic_score_codex":0.0015246948,"about_ca_topic_score_gemma":0.00197554,"teacher_disagreement_score":0.0023026876,"about_ca_system_score_codex":0.0008916648,"about_ca_system_score_gemma":0.0012950673,"threshold_uncertainty_score":0.0077032447},"labels":[],"label_agreement":null},{"id":"W2139149233","doi":"10.1109/ccece.2006.277530","title":"A New Efficient Algorithm for Lossless Binary Image Compression","year":2006,"lang":"en","type":"article","venue":"","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Northern British Columbia","funders":"","keywords":"Lossless compression; Computer science; Data compression; Image compression; Context-adaptive binary arithmetic coding; Redundancy (engineering); Facsimile; Algorithm; Binary image; Binary number; Arithmetic coding; Image (mathematics); Image processing; Artificial intelligence; Mathematics; Arithmetic; Transmission (telecommunications)","score_opus":0.00940847891307317,"score_gpt":0.2759941983406142,"score_spread":0.26658571942754106,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2139149233","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0046421434,0.00048559342,0.99186945,0.00015626273,0.00013612746,0.000086801956,0.0000447317,0.0007059018,0.0018729671],"genre_scores_gemma":[0.060078457,0.00056428526,0.9320255,0.00018439905,0.000099476296,0.00015719252,0.00027539147,0.00008960935,0.0065256134],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99951875,0.000037788024,0.000031102234,0.00006702513,0.00030899467,0.00003641536],"domain_scores_gemma":[0.9997162,0.000045860692,0.000025408595,0.000064344684,0.00013424018,0.000013962066],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041329366,0.00064959296,0.0005454838,0.0011722227,0.00047611498,0.00078643596,0.0009298079,0.0007744669,0.0021744117],"category_scores_gemma":[0.0011364705,0.0002383864,0.00028513736,0.0009114393,0.0004490761,0.001592402,0.00086653314,0.0010870342,0.0013088444],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021292527,0.00007582164,0.0003006341,0.00014531477,0.000027661117,0.00015131054,0.000091112925,0.01450165,0.08458926,0.03149211,0.008340072,0.86007214],"study_design_scores_gemma":[0.00021232966,0.0004197781,0.001090866,0.000078167825,0.000061555475,0.002328799,0.00007467296,0.68373764,0.19631574,0.024486948,0.09110103,0.00009250888],"about_ca_topic_score_codex":0.00055288634,"about_ca_topic_score_gemma":0.0008951328,"teacher_disagreement_score":0.0021744117,"about_ca_system_score_codex":0.0003882219,"about_ca_system_score_gemma":0.00057768024,"threshold_uncertainty_score":0.0072740912},"labels":[],"label_agreement":null},{"id":"W2140214166","doi":"10.1109/tcsvt.2002.808442","title":"A texture replacement method at the encoder for bit-rate reduction of compressed video","year":2003,"lang":"en","type":"article","venue":"IEEE Transactions on Circuits and Systems for Video Technology","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":19,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"National Research Council Canada","keywords":"Computer science; Computer vision; Encoder; Artificial intelligence; Reduction (mathematics); Bit rate; Data compression; Algorithm; Computer hardware; Mathematics","score_opus":0.02840254170718915,"score_gpt":0.301065186407058,"score_spread":0.27266264469986884,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2140214166","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03289023,0.00070469367,0.9632417,0.00012323349,0.00014282293,0.00007014718,0.00005391369,0.0013720962,0.0014011714],"genre_scores_gemma":[0.20745353,0.00047690704,0.7879342,0.00010005583,0.00012391758,0.00013221132,0.00014840612,0.00011829599,0.003512463],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997459,0.00003493922,0.000011568438,0.000035603713,0.00014980591,0.000022191382],"domain_scores_gemma":[0.99970275,0.000081277416,0.000034800712,0.00006717115,0.00009334155,0.000020678128],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021722564,0.00048982,0.0004352091,0.000524927,0.00026282403,0.00033255006,0.00057799916,0.00043150558,0.0013077161],"category_scores_gemma":[0.000949559,0.00020819253,0.00032765552,0.00040896138,0.00031402844,0.00048659524,0.00030989147,0.00047224652,0.0005644896],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005005341,0.00009528767,0.00047559716,0.00017173139,0.000034588003,0.00038704937,0.00012720996,0.013037727,0.5138954,0.008034218,0.0027421566,0.46049842],"study_design_scores_gemma":[0.0001876503,0.00062117627,0.0015270337,0.00003535488,0.000083178835,0.0020494803,0.000041362593,0.5008141,0.4681285,0.0023549139,0.024083717,0.00007345535],"about_ca_topic_score_codex":0.0012516893,"about_ca_topic_score_gemma":0.0015426038,"teacher_disagreement_score":0.0013077161,"about_ca_system_score_codex":0.00025355493,"about_ca_system_score_gemma":0.00031136238,"threshold_uncertainty_score":0.004374802},"labels":[],"label_agreement":null},{"id":"W2140723426","doi":"10.1109/bsc.2010.5472952","title":"Two stage quantization of noisy hyperspectral images","year":2010,"lang":"en","type":"article","venue":"","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Hyperspectral imaging; Stage (stratigraphy); Quantization (signal processing); Computer science; Artificial intelligence; Computer vision; Pattern recognition (psychology); Geology; Paleontology","score_opus":0.011888039463993284,"score_gpt":0.3051781573744085,"score_spread":0.2932901179104152,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2140723426","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019118333,0.00031453773,0.9784201,0.00012752849,0.000056249726,0.00006758921,0.000052471427,0.0003147241,0.0015284409],"genre_scores_gemma":[0.31971863,0.00040509983,0.67406,0.00013091051,0.000044189735,0.00011777661,0.00022462041,0.00004333701,0.005255417],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99947184,0.00007832907,0.000031635886,0.00007031403,0.0003194389,0.000028442917],"domain_scores_gemma":[0.9996964,0.000081015554,0.000032826432,0.000056800836,0.000120190736,0.000012787412],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043990143,0.00035702734,0.00043878634,0.00029982405,0.00025980643,0.0005367599,0.00082740077,0.00059869647,0.0015303268],"category_scores_gemma":[0.0009896099,0.00020851675,0.00029190502,0.00037964832,0.00036389817,0.0008081995,0.0006237051,0.0006210482,0.00036799978],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000568283,0.00015322132,0.0009951289,0.00039454864,0.000046657457,0.00030286104,0.00026022817,0.12094719,0.36598,0.032273494,0.0034592834,0.47461912],"study_design_scores_gemma":[0.00003486157,0.00018503869,0.000612017,0.000016788916,0.0000130045855,0.00025712603,0.00002036304,0.85995954,0.1312489,0.0035005594,0.004114915,0.000036820627],"about_ca_topic_score_codex":0.0007729712,"about_ca_topic_score_gemma":0.0014585096,"teacher_disagreement_score":0.0015303268,"about_ca_system_score_codex":0.00032902657,"about_ca_system_score_gemma":0.00037876732,"threshold_uncertainty_score":0.005119443},"labels":[],"label_agreement":null},{"id":"W2140871325","doi":"10.1109/igarss.1994.399119","title":"Spatial and spectral decorrelation of lossless data compression for LANDSAT-TM imagery","year":2002,"lang":"en","type":"article","venue":"","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University; University of Windsor","funders":"","keywords":"Decorrelation; Lossless compression; Remote sensing; Spatial analysis; Data compression; Computer science; Compression (physics); Spectral bands; Spatial correlation; Artificial intelligence; Geology; Computer vision; Physics; Telecommunications","score_opus":0.05411555582609319,"score_gpt":0.3016802691066322,"score_spread":0.24756471328053903,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2140871325","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.117633246,0.00052592123,0.87575763,0.00023758179,0.00013289548,0.00007745577,0.00012117408,0.0012216227,0.0042925077],"genre_scores_gemma":[0.5374694,0.00062857656,0.45140773,0.0001806525,0.00020386156,0.000088245666,0.0007385543,0.00024166694,0.009041231],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99970335,0.000055940025,0.000017205215,0.000028305612,0.00017280818,0.000022394039],"domain_scores_gemma":[0.9995597,0.00013729338,0.000042585078,0.00014792536,0.00009872908,0.000013797847],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039498167,0.00035771227,0.00021317374,0.0005431359,0.00021914933,0.00036995552,0.0003676083,0.00024142422,0.0012392647],"category_scores_gemma":[0.0013126064,0.00014518444,0.0002614948,0.00049562455,0.00037992038,0.00047534067,0.00037102008,0.0002778338,0.00046602817],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00065196876,0.00015224866,0.0015789613,0.00011229506,0.00006467224,0.00036848447,0.00017129256,0.05791677,0.23508395,0.012510753,0.0052258577,0.6861627],"study_design_scores_gemma":[0.000037136942,0.00029506884,0.0032349185,0.000016871245,0.00004441854,0.0006722666,0.000038331655,0.70479864,0.2787002,0.0037304664,0.008398762,0.00003288689],"about_ca_topic_score_codex":0.00053769595,"about_ca_topic_score_gemma":0.0010910538,"teacher_disagreement_score":0.0012392647,"about_ca_system_score_codex":0.00017983156,"about_ca_system_score_gemma":0.00017264693,"threshold_uncertainty_score":0.0041457415},"labels":[],"label_agreement":null},{"id":"W2141104580","doi":"10.1109/icassp.2005.1415404","title":"Streaming video with bandwidth adaptation and error concealment for lowbit rate live wireless applications","year":2006,"lang":"en","type":"article","venue":"","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"","keywords":"Computer science; Codec; Network packet; Packet loss; Real-time computing; Wireless; Bandwidth (computing); Adaptability; Propagation of uncertainty; Video quality; Wireless sensor network; Wireless network; Quantization (signal processing); Computer network; Computer vision; Algorithm; Telecommunications","score_opus":0.01710004197647687,"score_gpt":0.2625725647964756,"score_spread":0.24547252281999873,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2141104580","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11839197,0.00060448213,0.87787616,0.0001782623,0.000057105735,0.000101683036,0.000047229227,0.0016533135,0.0010898095],"genre_scores_gemma":[0.7629803,0.00042481732,0.23454347,0.00009033159,0.000070759284,0.000059411206,0.00013261547,0.00010150425,0.001596765],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996648,0.000058733403,0.000016423352,0.00002676036,0.00020673312,0.000026494034],"domain_scores_gemma":[0.99907047,0.00027280534,0.00011191009,0.00017487003,0.00032328843,0.00004669117],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00061790284,0.000369982,0.00029592155,0.0003227985,0.00021760064,0.00035183755,0.0009767119,0.00035495916,0.0008836283],"category_scores_gemma":[0.0021322414,0.00013448374,0.00015959128,0.00042704807,0.0003264806,0.0007747211,0.00036630765,0.00068764173,0.00019592262],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007571322,0.00025377035,0.0014121915,0.00023635609,0.000042277672,0.00036572755,0.00019487443,0.116352975,0.4066983,0.010326369,0.0019790193,0.4613809],"study_design_scores_gemma":[0.00004170189,0.0003312758,0.0006755365,0.000014044977,0.000022879816,0.00025062353,0.00001776239,0.89613926,0.09899954,0.0017614643,0.0017205427,0.000025362968],"about_ca_topic_score_codex":0.0015837061,"about_ca_topic_score_gemma":0.0014874487,"teacher_disagreement_score":0.0015837061,"about_ca_system_score_codex":0.00029264792,"about_ca_system_score_gemma":0.00033821407,"threshold_uncertainty_score":0.0032678246},"labels":[],"label_agreement":null},{"id":"W2141173766","doi":"10.1109/wts.2011.5960874","title":"Combined source-channel transform for image transmission over wireless channel","year":2011,"lang":"en","type":"article","venue":"","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"École de Technologie Supérieure","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Channel (broadcasting); Orthogonal frequency-division multiplexing; Wireless; JPEG 2000; Fading; Transmission (telecommunications); Lossless compression; Coding (social sciences); Transform coding; Electronic engineering; Data compression; Real-time computing; Algorithm; Image (mathematics); Image compression; Computer network; Image processing; Telecommunications; Computer vision; Discrete cosine transform; Engineering; Mathematics","score_opus":0.0266401858625118,"score_gpt":0.26150907848806415,"score_spread":0.23486889262555236,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2141173766","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.100548625,0.00042278404,0.88906914,0.0001945323,0.000094681156,0.0001054771,0.00012898169,0.0012490544,0.008186762],"genre_scores_gemma":[0.7585467,0.00047933572,0.23086312,0.000104693994,0.0001217619,0.00013555324,0.0002399218,0.00009274693,0.00941611],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997012,0.000044611435,0.000009711557,0.00003770226,0.0001806496,0.00002610887],"domain_scores_gemma":[0.99976736,0.00006542779,0.000025926754,0.000035548055,0.00008974941,0.000015888463],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024535146,0.00035844263,0.0003061482,0.00047211963,0.00022368814,0.0004114351,0.00035182276,0.00040503326,0.0035049757],"category_scores_gemma":[0.000531322,0.00013561154,0.00021782047,0.00043484764,0.0002259278,0.0006880708,0.00054492615,0.00042033335,0.0013094286],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00079687254,0.0001630813,0.0013871369,0.0002642632,0.00006611484,0.00048072808,0.00015078817,0.017546695,0.6336308,0.010174213,0.003738079,0.33160114],"study_design_scores_gemma":[0.00013467677,0.00061532663,0.0015715974,0.0000476099,0.000108202315,0.0021257172,0.00008017214,0.50691605,0.47116014,0.0027637754,0.014408148,0.000068528054],"about_ca_topic_score_codex":0.000341817,"about_ca_topic_score_gemma":0.00071520824,"teacher_disagreement_score":0.0035049757,"about_ca_system_score_codex":0.00017573418,"about_ca_system_score_gemma":0.00031553375,"threshold_uncertainty_score":0.011725247},"labels":[],"label_agreement":null},{"id":"W2141349409","doi":"10.1109/icip.1998.723375","title":"Space-frequency motion model for subband/wavelet video coding","year":2002,"lang":"en","type":"article","venue":"","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Inter frame; Wavelet; Wavelet transform; Algorithm; Data compression; Motion compensation; Block size; Motion estimation; Discrete wavelet transform; Artificial intelligence; Computer vision; Mathematics; Reference frame; Frame (networking); Telecommunications","score_opus":0.05287133824801261,"score_gpt":0.27984106982720736,"score_spread":0.22696973157919476,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2141349409","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00886864,0.0011917527,0.9839833,0.00028453275,0.000118473654,0.00008050475,0.00025604712,0.00047923502,0.0047375886],"genre_scores_gemma":[0.47572908,0.0053487318,0.46929997,0.00041461363,0.00019316902,0.0006986754,0.0020227141,0.00028632896,0.046006728],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998349,0.000032232776,0.000007287426,0.000015144127,0.000098243545,0.000012195962],"domain_scores_gemma":[0.9999223,0.00001886583,0.000010501908,0.000018743845,0.000026182346,0.0000033775445],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021958227,0.000507684,0.00029078228,0.00034677458,0.00014857997,0.0003145414,0.00063649507,0.0005088729,0.0027234603],"category_scores_gemma":[0.0004989005,0.00014158405,0.00033915383,0.0005001351,0.00024221784,0.0005837039,0.00030027117,0.0007438375,0.0016690763],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015094427,0.00006644908,0.00050484063,0.00016341681,0.000039392387,0.00017946814,0.000086025626,0.50395465,0.036578294,0.23145169,0.009438868,0.21738599],"study_design_scores_gemma":[0.000009367078,0.00003831166,0.00017694362,0.000011006391,0.00000552352,0.00006555193,0.000006118809,0.96546537,0.003481957,0.020222584,0.010508919,0.000008337443],"about_ca_topic_score_codex":0.0030093733,"about_ca_topic_score_gemma":0.0032534855,"teacher_disagreement_score":0.0030093733,"about_ca_system_score_codex":0.0004443607,"about_ca_system_score_gemma":0.0003960904,"threshold_uncertainty_score":0.009110868},"labels":[],"label_agreement":null},{"id":"W2141381432","doi":"10.1109/ccece.2002.1013084","title":"Novel architectures for the lifting-based discrete wavelet transform","year":2003,"lang":"en","type":"article","venue":"","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Computer science; Modular design; Architecture; Lifting scheme; Discrete wavelet transform; Wavelet transform; Second-generation wavelet transform; Computational complexity theory; Wavelet; Parallel computing; Computer architecture; Computer engineering; Algorithm; Embedded system; Computer hardware; Artificial intelligence","score_opus":0.020174052514887186,"score_gpt":0.2829904020724245,"score_spread":0.2628163495575373,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2141381432","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.023445629,0.000429495,0.971264,0.00014047287,0.00012451452,0.000056952125,0.00003286362,0.00072889676,0.003777167],"genre_scores_gemma":[0.26619786,0.0010374816,0.7268437,0.00014718913,0.00019912123,0.00015883447,0.00029212277,0.000086790424,0.0050369655],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99980694,0.000023476869,0.00001607864,0.000026062968,0.000093887684,0.00003357529],"domain_scores_gemma":[0.9998273,0.00003643845,0.000018832403,0.000041749845,0.00006087499,0.0000148114395],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031808688,0.00049767934,0.00031821275,0.000490932,0.00024112563,0.00049051613,0.0007856581,0.0005242599,0.0022407998],"category_scores_gemma":[0.00064287387,0.00030647762,0.00033156172,0.0004196733,0.00029050905,0.0010085545,0.0005736557,0.00089177146,0.001416937],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00031452463,0.000111805704,0.0006342046,0.00029924038,0.00005270771,0.00038413884,0.000177326,0.027421616,0.34503338,0.094345495,0.0047085877,0.52651703],"study_design_scores_gemma":[0.0001848828,0.0006743996,0.0015065084,0.000080614394,0.00011414514,0.0011540841,0.00007480797,0.7386203,0.16900136,0.03218226,0.05631058,0.00009609841],"about_ca_topic_score_codex":0.00023394036,"about_ca_topic_score_gemma":0.0005236237,"teacher_disagreement_score":0.0022407998,"about_ca_system_score_codex":0.00020703253,"about_ca_system_score_gemma":0.00033554793,"threshold_uncertainty_score":0.0074962378},"labels":[],"label_agreement":null},{"id":"W2141462645","doi":"10.1109/tsp.2004.840713","title":"Image transmission over the polya channel via channel-optimized quantization","year":2005,"lang":"en","type":"article","venue":"IEEE Transactions on Signal Processing","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Quantization (signal processing); Channel (broadcasting); Algorithm; Computer science; Binary symmetric channel; Binary number; Exploit; Wavelet; Transmission (telecommunications); Channel capacity; Speech recognition; Theoretical computer science; Mathematics; Telecommunications; Artificial intelligence; Arithmetic","score_opus":0.017722328269941637,"score_gpt":0.27823669259484635,"score_spread":0.2605143643249047,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2141462645","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.026294015,0.00023983647,0.9699702,0.0001100304,0.000045387806,0.00004152506,0.000037935624,0.00027818227,0.0029828283],"genre_scores_gemma":[0.55096614,0.00044387687,0.44325602,0.00010600234,0.000074168376,0.0001113859,0.00006811924,0.000092013375,0.00488229],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997706,0.000051104493,0.000012046997,0.000035552235,0.00010508124,0.000025553547],"domain_scores_gemma":[0.99937063,0.00024184983,0.00007863974,0.00018142398,0.0000934214,0.000034116103],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039541587,0.0003648936,0.0003401622,0.00032191313,0.0003325285,0.00068577466,0.00066047173,0.00038377772,0.0016073035],"category_scores_gemma":[0.0013070015,0.00016779284,0.0002006042,0.00030705347,0.0008495589,0.001238057,0.00091455795,0.00066375616,0.00039500804],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00075038336,0.00018674653,0.0009372934,0.00029902946,0.00006203842,0.0003843782,0.00050138845,0.15785731,0.16817884,0.31472644,0.003483037,0.35263318],"study_design_scores_gemma":[0.00005702159,0.00017703413,0.0002821717,0.000027458953,0.00001929673,0.00031274065,0.00003853379,0.9172779,0.05151566,0.024891362,0.005354525,0.000046405465],"about_ca_topic_score_codex":0.0005354339,"about_ca_topic_score_gemma":0.00077238143,"teacher_disagreement_score":0.0016073035,"about_ca_system_score_codex":0.00030573635,"about_ca_system_score_gemma":0.00034962784,"threshold_uncertainty_score":0.005376935},"labels":[],"label_agreement":null},{"id":"W2141470981","doi":"10.1109/icassp.2011.5947536","title":"Coding of unquantized spectrum sub-bands in superwideband audio codecs","year":2011,"lang":"en","type":"article","venue":"","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"VoiceAge (Canada)","funders":"","keywords":"Codec; Vector quantization; Computer science; Adaptive Multi-Rate audio codec; Quantization (signal processing); Speech coding; Coding (social sciences); Speech recognition; Sub-band coding; Algorithm; Mathematics; Speech processing; Telecommunications; Voice activity detection; Statistics","score_opus":0.03936253251084789,"score_gpt":0.25530277580871846,"score_spread":0.21594024329787057,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2141470981","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019931609,0.0012434004,0.9744752,0.000100088306,0.00013231806,0.00007187932,0.00013386081,0.00037549675,0.0035362435],"genre_scores_gemma":[0.220877,0.0024033552,0.76317394,0.0002364961,0.00017203603,0.00025913384,0.0005258236,0.0002679093,0.012084265],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9995716,0.00006318458,0.000024109666,0.000048453203,0.00025919738,0.00003351307],"domain_scores_gemma":[0.99925715,0.00022692014,0.00008676232,0.0001942273,0.00021236963,0.000022592416],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031760114,0.00059266447,0.000318897,0.0007088546,0.00026589364,0.0006010996,0.0005989125,0.00050623383,0.0025988938],"category_scores_gemma":[0.0011080818,0.00015649185,0.00032817572,0.00068566453,0.0007140658,0.00087296334,0.0007314884,0.00096868817,0.00092264556],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004052177,0.00008189261,0.00041821986,0.0003878288,0.000037896432,0.00046399902,0.00025697277,0.056619115,0.32631528,0.09138725,0.003121944,0.5205045],"study_design_scores_gemma":[0.000054763572,0.0003153717,0.0010933138,0.00017365364,0.000063727704,0.0012256315,0.00008721217,0.46971324,0.4457725,0.026495747,0.054899458,0.00010536845],"about_ca_topic_score_codex":0.0006307485,"about_ca_topic_score_gemma":0.0012548347,"teacher_disagreement_score":0.0025988938,"about_ca_system_score_codex":0.0003193427,"about_ca_system_score_gemma":0.00035806507,"threshold_uncertainty_score":0.008694112},"labels":[],"label_agreement":null},{"id":"W2141845640","doi":"10.1109/icip.2004.1421549","title":"Multiple description wavelet coding of layered video","year":2005,"lang":"en","type":"article","venue":"","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Multiple description coding; Wavelet; Coding (social sciences); Redundancy (engineering); Coding tree unit; Wavelet transform; Algorithmic efficiency; Algorithm; Theoretical computer science; Artificial intelligence; Computer vision; Decoding methods; Mathematics","score_opus":0.030240975646658442,"score_gpt":0.2688643482082372,"score_spread":0.23862337256157873,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2141845640","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008932366,0.00030099478,0.9896673,0.00008900232,0.000043550353,0.00002121718,0.00005066829,0.00012746222,0.00076753966],"genre_scores_gemma":[0.32362762,0.0012399981,0.6708055,0.00012540257,0.00008503162,0.00010232756,0.0004035346,0.0000712848,0.0035392712],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99976116,0.00004653672,0.000011785405,0.000019690648,0.00013113991,0.000029700079],"domain_scores_gemma":[0.9996878,0.00010594432,0.00004021104,0.00006537156,0.00007727256,0.00002350151],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004805287,0.00033776605,0.0003829755,0.00059482706,0.00020948265,0.0005300071,0.00065224257,0.00048473402,0.0009314207],"category_scores_gemma":[0.0013717689,0.00019621052,0.00035025505,0.0006106552,0.0002991046,0.0010941175,0.00084053486,0.0009250962,0.00028598026],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003970598,0.00008551887,0.0006080077,0.00041985192,0.00006616805,0.0010542341,0.00024225019,0.13375911,0.134137,0.24301828,0.005240713,0.48097175],"study_design_scores_gemma":[0.00003090498,0.00008081349,0.00026269557,0.000040241743,0.000021848738,0.00039532612,0.00003233478,0.92573285,0.030894674,0.034375165,0.008101377,0.000031664702],"about_ca_topic_score_codex":0.00073204347,"about_ca_topic_score_gemma":0.0007757994,"teacher_disagreement_score":0.0009314207,"about_ca_system_score_codex":0.00037946863,"about_ca_system_score_gemma":0.00042964972,"threshold_uncertainty_score":0.0031158924},"labels":[],"label_agreement":null},{"id":"W2142531548","doi":"10.1109/scft.1995.658140","title":"Non-Square Transform Vector Quantization for Low-rate Speech Coding","year":2005,"lang":"en","type":"article","venue":"","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Vector quantization; Speech coding; Speech recognition; Harmonic Vector Excitation Coding; Computer science; Quantization (signal processing); Coding (social sciences); Linde–Buzo–Gray algorithm; Linear predictive coding; Algorithm; Mathematics; Statistics","score_opus":0.01913096817761881,"score_gpt":0.2947283331941966,"score_spread":0.2755973650165778,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2142531548","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011711679,0.0008925433,0.9846399,0.0002466707,0.00019884958,0.00004162306,0.00010661083,0.0005095958,0.0016524656],"genre_scores_gemma":[0.26859477,0.0013355868,0.7141581,0.00023503367,0.00020888247,0.00015219425,0.0007703269,0.00014992902,0.014395119],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.999617,0.000097407494,0.000029051967,0.000032737076,0.00019968774,0.000024006227],"domain_scores_gemma":[0.9993575,0.00028649945,0.000032984863,0.000103112456,0.00020626592,0.00001369],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038691267,0.00035880983,0.0003578441,0.00032398396,0.00032424816,0.0005240251,0.0004795753,0.0005193536,0.0046454254],"category_scores_gemma":[0.0020585663,0.00015904395,0.00018930454,0.00067186117,0.00034009054,0.0007913803,0.0004448932,0.0007380455,0.0013322054],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00043021402,0.0000939948,0.0003107746,0.00023219053,0.000024014584,0.00011880436,0.00010226233,0.02885733,0.12897661,0.046059262,0.007301641,0.7874929],"study_design_scores_gemma":[0.000044145603,0.00017671601,0.0006133773,0.00004291423,0.000020455895,0.00026420105,0.00004760354,0.8717664,0.10061956,0.016216831,0.010159049,0.000028686944],"about_ca_topic_score_codex":0.0017299372,"about_ca_topic_score_gemma":0.0034110066,"teacher_disagreement_score":0.0046454254,"about_ca_system_score_codex":0.00028773933,"about_ca_system_score_gemma":0.000621961,"threshold_uncertainty_score":0.01554054},"labels":[],"label_agreement":null},{"id":"W2142773845","doi":"10.1109/icip.2007.4379634","title":"Multiple Description Image Codingwith Prediction Compensation","year":2007,"lang":"en","type":"article","venue":"","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Computer science; Residual; Coding (social sciences); Transform coding; Rate–distortion theory; Algorithm; Lapped transform; Artificial intelligence; Image (mathematics); Bit rate; Theoretical computer science; Discrete cosine transform; Data compression; Mathematics; Computer engineering; Statistics","score_opus":0.024702481354635514,"score_gpt":0.2703055455291571,"score_spread":0.24560306417452157,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2142773845","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003967487,0.00046247776,0.99327564,0.00015360591,0.000071220544,0.000033290362,0.00006485657,0.00022652326,0.0017449484],"genre_scores_gemma":[0.20435317,0.0010016348,0.78340393,0.0003375007,0.0001601966,0.00013438928,0.00047769462,0.00006694292,0.010064536],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997168,0.000036790705,0.000011145047,0.00003717167,0.00016566677,0.000032324086],"domain_scores_gemma":[0.9997533,0.000058805417,0.00002676084,0.00006533801,0.00008205476,0.000013770283],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003533941,0.00042437398,0.00043450767,0.0003928055,0.00024210215,0.00047793105,0.0010203457,0.0006122269,0.0021193589],"category_scores_gemma":[0.0005616618,0.00015591648,0.0003145441,0.0004956045,0.00028524638,0.0011129737,0.000875529,0.0008941235,0.00060241006],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00024880847,0.00010145518,0.00033479385,0.00028705967,0.000044605196,0.00031162752,0.000077066165,0.069190934,0.11473027,0.1364149,0.0083585875,0.6698998],"study_design_scores_gemma":[0.00006562395,0.00013692176,0.00025533483,0.00003016726,0.000030374595,0.00052984565,0.000017379201,0.9010853,0.051755615,0.02442263,0.021627525,0.000043292548],"about_ca_topic_score_codex":0.0010532602,"about_ca_topic_score_gemma":0.0016905144,"teacher_disagreement_score":0.0021193589,"about_ca_system_score_codex":0.00035830442,"about_ca_system_score_gemma":0.0005787277,"threshold_uncertainty_score":0.0070899725},"labels":[],"label_agreement":null},{"id":"W2143155105","doi":"10.1109/72.950143","title":"Vector quantization of images using modified adaptive resonance algorithm for hierarchical clustering","year":2001,"lang":"en","type":"article","venue":"IEEE Transactions on Neural Networks","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":27,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba; University of Ottawa","funders":"","keywords":"Vector quantization; Cluster analysis; Linde–Buzo–Gray algorithm; Adaptive resonance theory; Computer science; Image compression; Algorithm; Data compression; Learning vector quantization; Quantization (signal processing); Artificial intelligence; Computation; Pattern recognition (psychology); Image processing; Artificial neural network; Image (mathematics)","score_opus":0.04287775990973145,"score_gpt":0.298381628216452,"score_spread":0.2555038683067205,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2143155105","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0032918444,0.00012842119,0.9957561,0.000051586765,0.000022259463,0.000023362045,0.000013595314,0.00015834595,0.0005544894],"genre_scores_gemma":[0.105266705,0.00022235287,0.89255524,0.000063139225,0.000035894423,0.00011544794,0.000101529775,0.000059547434,0.0015801329],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99946386,0.00017445092,0.000033816174,0.00008258785,0.00021735212,0.00002797573],"domain_scores_gemma":[0.9994832,0.00020567662,0.000049196206,0.00008771644,0.00016149502,0.000012652452],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00079565257,0.00042610022,0.0005183222,0.0006140879,0.00024508915,0.00058664824,0.0008938011,0.0007899966,0.0017280163],"category_scores_gemma":[0.0025768247,0.00017573334,0.00045580073,0.0009467427,0.00045682638,0.0009666525,0.00061100244,0.00075867074,0.0006286327],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001636838,0.000057878373,0.00024508403,0.0001892557,0.000047947906,0.00007382333,0.00019891243,0.31486177,0.04747029,0.047135632,0.0035594758,0.5859963],"study_design_scores_gemma":[0.000009382984,0.000047138758,0.00013687131,0.0000067643196,0.000004825204,0.000040998002,0.000012173117,0.98653954,0.00493585,0.006633806,0.001617592,0.000015130571],"about_ca_topic_score_codex":0.001393957,"about_ca_topic_score_gemma":0.0014397728,"teacher_disagreement_score":0.0017280163,"about_ca_system_score_codex":0.0004233814,"about_ca_system_score_gemma":0.00038714937,"threshold_uncertainty_score":0.005780816},"labels":[],"label_agreement":null},{"id":"W2143448801","doi":"10.1109/pacrim.1999.799509","title":"Experimental study of a parallel wavelets compression system for medical applications","year":2003,"lang":"en","type":"article","venue":"","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Workstation; Computer science; Synchronization (alternating current); Wavelet; Data compression; Parallel computing; Compression (physics); Parallel algorithm; Software; Parallel processing; Computer engineering; Algorithm; Artificial intelligence; Operating system; Computer network","score_opus":0.024402747380046445,"score_gpt":0.3344438637465534,"score_spread":0.31004111636650694,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2143448801","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9339872,0.00037640752,0.061443444,0.00018758065,0.00011047539,0.0003892136,0.00029997664,0.001315053,0.0018907079],"genre_scores_gemma":[0.932869,0.00042851723,0.06185042,0.00007290009,0.00007071935,0.00032299108,0.00073427125,0.00017923358,0.0034719284],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99948347,0.00011358165,0.00004425188,0.000097748176,0.00020238195,0.00005858772],"domain_scores_gemma":[0.99760455,0.0009183493,0.00016971634,0.00038452694,0.00074890716,0.00017403292],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010087822,0.00040547387,0.0005914352,0.0005535139,0.00055743626,0.00041414038,0.00071722927,0.0004412918,0.004984521],"category_scores_gemma":[0.0039149164,0.00025409655,0.00018298093,0.0007932656,0.0003894197,0.0007815578,0.00046687076,0.00043717396,0.000912712],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0060731703,0.0026964273,0.0035189614,0.0007725917,0.00011053801,0.0004939496,0.00043286686,0.021355879,0.82005954,0.0013889738,0.0025444832,0.14055252],"study_design_scores_gemma":[0.0006387519,0.01802731,0.012809191,0.00004159965,0.00015437392,0.0009128127,0.0002863299,0.12383671,0.83456755,0.0007963319,0.007855516,0.00007359302],"about_ca_topic_score_codex":0.0008972599,"about_ca_topic_score_gemma":0.00044325186,"teacher_disagreement_score":0.004984521,"about_ca_system_score_codex":0.00028101655,"about_ca_system_score_gemma":0.00038826757,"threshold_uncertainty_score":0.016674936},"labels":[],"label_agreement":null},{"id":"W2143727107","doi":"10.1109/icme.2006.262808","title":"Joint Source-Channel Decoding of Multiple Description Quantized and Variable Length Coded Markov Sequences","year":2006,"lang":"en","type":"article","venue":"","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Decoding methods; Computer science; Algorithm; Lossy compression; Belief propagation; Markov chain; Markov process; Erasure; Encoder; Entropy (arrow of time); Theoretical computer science; Soft-decision decoder; Joint (building); Channel (broadcasting); Mathematics; Artificial intelligence; Statistics; Telecommunications","score_opus":0.030287203412061956,"score_gpt":0.24520150645514555,"score_spread":0.2149143030430836,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2143727107","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007779916,0.000108082415,0.9909079,0.00007499592,0.000016990854,0.000017708753,0.00005139418,0.00016462663,0.00087842316],"genre_scores_gemma":[0.5544013,0.00044677386,0.43972725,0.00010919914,0.00007103677,0.00010118744,0.00037577323,0.00011117167,0.004656301],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990238,0.0003032074,0.00005368573,0.00012394621,0.00039818932,0.00009710055],"domain_scores_gemma":[0.99836296,0.0010497358,0.00012687428,0.0002188936,0.00020898429,0.000032532],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013405605,0.00043454248,0.0006290723,0.00044282613,0.0003391627,0.00078314025,0.0008438403,0.0006083965,0.0012249646],"category_scores_gemma":[0.0044378103,0.0002939283,0.00042347563,0.0005075514,0.00070369645,0.001408435,0.0010721837,0.00079261576,0.00032253243],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00031560092,0.00004372774,0.00074799795,0.00013454317,0.00004963563,0.00027411032,0.00024600528,0.600707,0.015071689,0.22246188,0.0013701693,0.15857762],"study_design_scores_gemma":[0.000010026788,0.00002439082,0.00007148666,0.000008673788,0.000006074217,0.00005220588,0.0000128291185,0.9711151,0.007591975,0.020187527,0.00090919255,0.000010427841],"about_ca_topic_score_codex":0.0026105375,"about_ca_topic_score_gemma":0.0030086753,"teacher_disagreement_score":0.0026105375,"about_ca_system_score_codex":0.000779836,"about_ca_system_score_gemma":0.001576215,"threshold_uncertainty_score":0.007089615},"labels":[],"label_agreement":null},{"id":"W2143929606","doi":"10.1109/11.892156","title":"Adaptive unequal error protection for subband image coding","year":2000,"lang":"en","type":"article","venue":"IEEE Transactions on Broadcasting","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Philips (Canada); University of British Columbia","funders":"","keywords":"Computer science; Channel (broadcasting); Codec; Algorithm; Convolutional code; Decoding methods; Forward error correction; Additive white Gaussian noise; Coding gain; Variable-length code; Coding (social sciences); Code rate; Binary erasure channel; Channel capacity; Mathematics; Telecommunications; Statistics","score_opus":0.05623890181415832,"score_gpt":0.29818669882437326,"score_spread":0.24194779701021496,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2143929606","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12419753,0.00043737818,0.87227565,0.000093829396,0.000036412097,0.000044274635,0.000036401612,0.00038857892,0.0024900069],"genre_scores_gemma":[0.8383938,0.00021828827,0.15923776,0.00004699604,0.000017190298,0.000036695652,0.00004315837,0.000018268374,0.0019878608],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997181,0.00007239588,0.000012687728,0.00005688241,0.000114121845,0.000025784955],"domain_scores_gemma":[0.9996137,0.00011445901,0.000073679475,0.000094700365,0.000088339584,0.000015217615],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003052258,0.00033549228,0.00033790708,0.00023158129,0.00015991466,0.00031721077,0.0004905751,0.0003134879,0.00080118794],"category_scores_gemma":[0.0007883624,0.00009271605,0.00020789698,0.00023604554,0.00026777294,0.00047906634,0.0004364405,0.00038905325,0.00020257261],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000658507,0.00009214581,0.0016170198,0.00016804806,0.00007606595,0.0002500909,0.00020603252,0.16446893,0.46224734,0.032316335,0.0010864076,0.33681315],"study_design_scores_gemma":[0.000025218298,0.00023220658,0.00065016217,0.0000133533795,0.000025563353,0.00022447993,0.000013696655,0.81923753,0.1741126,0.0026207457,0.0028219372,0.000022567583],"about_ca_topic_score_codex":0.00047926456,"about_ca_topic_score_gemma":0.0005267431,"teacher_disagreement_score":0.00080118794,"about_ca_system_score_codex":0.00031749276,"about_ca_system_score_gemma":0.00025617954,"threshold_uncertainty_score":0.0026801825},"labels":[],"label_agreement":null},{"id":"W2144132011","doi":"10.1109/tcsii.2010.2056111","title":"Area- and Power-Efficient Design of Daubechies Wavelet Transforms Using Folded AIQ Mapping","year":2010,"lang":"en","type":"article","venue":"IEEE Transactions on Circuits & Systems II Express Briefs","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":19,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Saskatchewan","funders":"","keywords":"Daubechies wavelet; Wavelet transform; CMOS; Wavelet; Point (geometry); Factorization; Computer science; Power (physics); Algorithm; Mathematics; Discrete wavelet transform; Artificial intelligence; Electronic engineering; Engineering; Physics; Geometry","score_opus":0.036742785624368515,"score_gpt":0.2537245664285112,"score_spread":0.2169817808041427,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2144132011","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.076334976,0.0003285861,0.9171842,0.00010093297,0.000053694686,0.00007729771,0.000044109656,0.0009983263,0.0048779333],"genre_scores_gemma":[0.578688,0.0002047733,0.41749856,0.00010452315,0.000038921058,0.00014007674,0.00011881721,0.00008157944,0.0031247286],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9998179,0.000031226074,0.000012789736,0.000031965938,0.000070980015,0.00003508412],"domain_scores_gemma":[0.99978703,0.000047341167,0.000027852075,0.000034152556,0.00008896427,0.000014664449],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002349216,0.00043891228,0.00026149207,0.0003450069,0.0003805493,0.0005877169,0.00080559676,0.00026104218,0.0019023238],"category_scores_gemma":[0.00043426812,0.0002008417,0.00026353187,0.0004324643,0.00023087073,0.00063438085,0.00030222477,0.0003101368,0.0007992362],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00044960485,0.00018356189,0.0017788731,0.00025672544,0.000106469175,0.0005079743,0.00037577646,0.0794863,0.4335093,0.034728553,0.005287251,0.44332963],"study_design_scores_gemma":[0.000118496144,0.0009467987,0.0013155934,0.000032214964,0.000082527826,0.0007276345,0.00016941187,0.7169487,0.24163793,0.01168325,0.026300073,0.000037374077],"about_ca_topic_score_codex":0.000645131,"about_ca_topic_score_gemma":0.0012678994,"teacher_disagreement_score":0.0019023238,"about_ca_system_score_codex":0.00043068826,"about_ca_system_score_gemma":0.0004993822,"threshold_uncertainty_score":0.0063638687},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.009559750896264157,"score_gpt":0.22328289237964716,"score_spread":0.213723141483383,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2144437575","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21609259,0.0010514584,0.7600806,0.0008232714,0.00003781687,0.00007527959,0.00030271563,0.00018203167,0.02135424],"genre_scores_gemma":[0.9132985,0.0009037977,0.079290904,0.00017183383,0.00006950154,0.00012662199,0.00026919958,0.00008413169,0.0057856566],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99953055,0.0001175626,0.00003095007,0.00008366615,0.00019319773,0.000044114662],"domain_scores_gemma":[0.99799734,0.0010722002,0.0003358656,0.00015262899,0.00036145354,0.0000805273],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007974044,0.00030355077,0.0006556076,0.0008291791,0.00040563644,0.0010027011,0.0005442138,0.0006802356,0.0029164099],"category_scores_gemma":[0.005092616,0.00036700058,0.00031234176,0.00062620343,0.0018055256,0.0016603724,0.0010920812,0.00093473995,0.00027024923],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000679005,0.000020088777,0.0003847574,0.000076560806,0.000013045079,0.0000771958,0.00014531944,0.11843735,0.005535542,0.8549379,0.0007795578,0.01952484],"study_design_scores_gemma":[0.000020139407,0.00005880466,0.00036296525,0.00002179463,0.000008361873,0.0000833093,0.000044291213,0.5749431,0.0029424157,0.41990072,0.0015903348,0.000023747543],"about_ca_topic_score_codex":0.0006084426,"about_ca_topic_score_gemma":0.00047724822,"teacher_disagreement_score":0.0029164099,"about_ca_system_score_codex":0.0009386458,"about_ca_system_score_gemma":0.0005290451,"threshold_uncertainty_score":0.009756327},"labels":[],"label_agreement":null},{"id":"W2144671291","doi":"10.1109/icip.2002.1038912","title":"An iterative algorithm for context selection in adaptive entropy coders","year":2003,"lang":"en","type":"article","venue":"Proceedings - International Conference on Image Processing","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Computer science; Data compression; Algorithm; Entropy (arrow of time); Adaptive coding; Entropy encoding; Cluster analysis; Image compression; Quantization (signal processing); Pattern recognition (psychology); Artificial intelligence; Lossless compression; Image (mathematics); Image processing","score_opus":0.03892563078033245,"score_gpt":0.33829755248784865,"score_spread":0.2993719217075162,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2144671291","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00636949,0.00008330395,0.99266607,0.000043869935,0.0000155774,0.00006848065,0.000011408109,0.0003731235,0.00036869297],"genre_scores_gemma":[0.11409199,0.0000928982,0.8841757,0.00010115954,0.000039198472,0.00030797705,0.00007529241,0.000083071696,0.0010328],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987154,0.00037200225,0.0000943571,0.00022439976,0.00047601887,0.000117793505],"domain_scores_gemma":[0.9979845,0.0010974056,0.00014326363,0.00019897282,0.00050846016,0.00006732367],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015350085,0.0007850859,0.00083771476,0.0011063406,0.000663,0.00077886897,0.0013233513,0.0011106235,0.0012885378],"category_scores_gemma":[0.0068384004,0.00050803594,0.000522192,0.0007796376,0.0009411658,0.0011814963,0.0019063478,0.0012741436,0.0005858221],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000340477,0.000120570025,0.0014908835,0.00010002061,0.00006230811,0.00019406094,0.000379683,0.16724755,0.04426979,0.022349779,0.002283411,0.76116145],"study_design_scores_gemma":[0.000041917425,0.000074971795,0.00031880988,0.000016710195,0.000013450395,0.0001316224,0.00003114976,0.9749042,0.014695236,0.008123449,0.0016250918,0.000023373654],"about_ca_topic_score_codex":0.0019958036,"about_ca_topic_score_gemma":0.003440183,"teacher_disagreement_score":0.0019958036,"about_ca_system_score_codex":0.00058752083,"about_ca_system_score_gemma":0.0010837957,"threshold_uncertainty_score":0.008118033},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.14414412810122337,"score_gpt":0.3799911628793061,"score_spread":0.23584703477808275,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2144706739","genre_codex":"commentary","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009600359,0.00532992,0.003320098,0.9024783,0.0076631187,0.0006729742,0.0022232975,0.00020023076,0.06851175],"genre_scores_gemma":[0.14006084,0.010612259,0.04915863,0.6760607,0.0057509686,0.001378308,0.0038068339,0.00030973463,0.112861805],"study_design_codex":"not_applicable","study_design_gemma":"observational","domain_scores_codex":[0.98594713,0.0021505519,0.0020382882,0.00053938973,0.0065834285,0.002741143],"domain_scores_gemma":[0.92163163,0.012234753,0.0021903364,0.0010139435,0.05618799,0.006741366],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.014925988,0.00045260784,0.0007646912,0.0019490487,0.0055116205,0.0027687687,0.0038157934,0.015506022,0.010191823],"category_scores_gemma":[0.042579617,0.000502643,0.0012788404,0.0017422994,0.002490097,0.0013169422,0.00146286,0.010111021,0.0021445141],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":true,"about_ca_topic_consensus":true,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015004085,0.000103228325,0.0063115875,0.00030070808,0.000028548893,0.0013345934,0.0006983193,0.0005433034,0.0012363947,0.015041557,0.9309962,0.04325547],"study_design_scores_gemma":[0.00020932654,0.00014869671,0.027940141,0.0016657857,0.000117578864,0.0017115076,0.0014328712,0.001634033,0.0018963541,0.0039487267,0.9591222,0.0001728108],"about_ca_topic_score_codex":0.7216592,"about_ca_topic_score_gemma":0.90341437,"teacher_disagreement_score":0.27834082,"about_ca_system_score_codex":0.031904597,"about_ca_system_score_gemma":0.1384155,"threshold_uncertainty_score":0.55996},"labels":[],"label_agreement":null},{"id":"W2144724974","doi":"10.1109/icassp.2009.4959759","title":"Progressive lossy-to-lossless coding of arbitrarily-sampled image data using the modified scattered data coding method","year":2009,"lang":"en","type":"article","venue":"","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Lossy compression; Lossless compression; Tunstall coding; Context-adaptive binary arithmetic coding; Computer science; Coding (social sciences); Coding tree unit; Context-adaptive variable-length coding; Algorithm; Data compression; Algorithmic efficiency; Decoding methods; Artificial intelligence; Mathematics; Statistics","score_opus":0.18288701456988893,"score_gpt":0.43108051104244505,"score_spread":0.24819349647255612,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2144724974","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.034000006,0.0002379745,0.9642304,0.000106408785,0.000044009565,0.000065887296,0.000047375852,0.00020584078,0.0010620921],"genre_scores_gemma":[0.33553842,0.0005812669,0.6598906,0.000120367054,0.00004535123,0.00016003691,0.00023464125,0.00007467199,0.003354545],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997563,0.000039397986,0.000015696745,0.000028292212,0.00014589197,0.000014402302],"domain_scores_gemma":[0.99928087,0.00024095955,0.00005267557,0.00016528215,0.00022946321,0.000030860618],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035079342,0.0003490419,0.00033540957,0.0006916282,0.0002052919,0.00032805122,0.000546477,0.00030110544,0.0008711337],"category_scores_gemma":[0.0017482741,0.0001488433,0.0002997989,0.0006591156,0.0006206917,0.00071239,0.00054838334,0.0006651968,0.00020228657],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004934954,0.00010697981,0.00075933296,0.00023916645,0.000048159418,0.00051597954,0.00035218295,0.075984225,0.40759045,0.05962679,0.001886693,0.45239654],"study_design_scores_gemma":[0.00006556694,0.00022449603,0.0008426353,0.000043652642,0.000025654943,0.0010813726,0.0000618393,0.73056555,0.2461037,0.011756762,0.009162613,0.00006618564],"about_ca_topic_score_codex":0.0011252655,"about_ca_topic_score_gemma":0.0011819769,"teacher_disagreement_score":0.0011252655,"about_ca_system_score_codex":0.000301965,"about_ca_system_score_gemma":0.000471361,"threshold_uncertainty_score":0.0029141903},"labels":[],"label_agreement":null},{"id":"W2144727565","doi":"10.1109/icce.1996.517275","title":"COLOR SCALABILITY USING JPEG STANDARD","year":2005,"lang":"en","type":"article","venue":"International Conference on Consumer Electronics","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Computer science; Scalability; JPEG; JPEG 2000; Computer vision; Artificial intelligence; Computer graphics (images); Data compression; Image processing; Database; Image compression; Image (mathematics)","score_opus":0.04529032502325659,"score_gpt":0.3503791708918536,"score_spread":0.305088845868597,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2144727565","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06407521,0.005138057,0.6128452,0.0013371942,0.0010370828,0.001192875,0.004105135,0.04127767,0.26899156],"genre_scores_gemma":[0.44235948,0.00541734,0.38731796,0.00083527534,0.00040008093,0.00067864545,0.009286319,0.0028581524,0.15084675],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99950826,0.000025455838,0.000020861087,0.00006834004,0.00032528455,0.00005179241],"domain_scores_gemma":[0.99947876,0.000029766172,0.000021316402,0.00009032989,0.00035432342,0.000025486544],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033763595,0.00048193656,0.00021653456,0.0013797272,0.00034789942,0.00089204893,0.0005645009,0.0003496809,0.020222038],"category_scores_gemma":[0.0010317075,0.00019017309,0.00025671624,0.0015176971,0.0002494686,0.001218737,0.00067884714,0.0006062903,0.006676125],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023538139,0.000105033905,0.0012530702,0.00032368166,0.000033172622,0.00039577263,0.00015211821,0.004185785,0.310197,0.031280708,0.08942202,0.5624163],"study_design_scores_gemma":[0.0001333777,0.00029497436,0.00689215,0.00013793635,0.00006964211,0.0023176023,0.00018381563,0.0707512,0.41329774,0.011220856,0.49454024,0.00016051273],"about_ca_topic_score_codex":0.0037452031,"about_ca_topic_score_gemma":0.003576302,"teacher_disagreement_score":0.020222038,"about_ca_system_score_codex":0.000463313,"about_ca_system_score_gemma":0.0006517295,"threshold_uncertainty_score":0.06764948},"labels":[],"label_agreement":null},{"id":"W2144860123","doi":"10.1109/wescan.1995.494066","title":"Neural code-excited linear prediction for low power speech compression","year":2002,"lang":"en","type":"article","venue":"","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Winnipeg; University of Manitoba","funders":"","keywords":"Codebook; Computer science; Code-excited linear prediction; Vector quantization; Speech coding; Unsupervised learning; Speech recognition; Learning vector quantization; Artificial intelligence; Competitive learning; Vector sum excited linear prediction; Data compression; Linear predictive coding; Artificial neural network; Linear prediction; Supervised learning; Machine learning; Pattern recognition (psychology)","score_opus":0.02960649507325002,"score_gpt":0.28341821694513425,"score_spread":0.2538117218718842,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2144860123","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.044822417,0.0013595347,0.94556814,0.00029902914,0.000079980215,0.000037732952,0.000036842564,0.0009731224,0.006823133],"genre_scores_gemma":[0.6650408,0.0008885595,0.32628605,0.0001889418,0.0000967276,0.00007950671,0.000119930715,0.00007828415,0.0072211064],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998325,0.00003927801,0.0000066548046,0.000016866894,0.0000945059,0.000010177904],"domain_scores_gemma":[0.999595,0.00025130576,0.000024359515,0.000033907487,0.00008906857,0.000006451466],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002619075,0.00019566296,0.00017339908,0.00017031112,0.00015932534,0.00025919706,0.0003739332,0.00030792828,0.0015072024],"category_scores_gemma":[0.0011436854,0.00007832876,0.000078846075,0.0003463987,0.0002513569,0.00042120955,0.00023227365,0.0005377031,0.00041285614],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019243454,0.000087020235,0.0007050135,0.00015351146,0.00002274553,0.00014898293,0.000095662486,0.2185027,0.08403973,0.028914154,0.0029601217,0.6641779],"study_design_scores_gemma":[0.000008075621,0.00005228361,0.00022470341,0.000007804084,0.000006043206,0.00006658774,0.000008264102,0.97172755,0.021646958,0.0040059774,0.0022401998,0.000005671634],"about_ca_topic_score_codex":0.001121951,"about_ca_topic_score_gemma":0.002177475,"teacher_disagreement_score":0.0015072024,"about_ca_system_score_codex":0.00024276324,"about_ca_system_score_gemma":0.00025825572,"threshold_uncertainty_score":0.005042076},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.023244735467878783,"score_gpt":0.29098343852523606,"score_spread":0.26773870305735725,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2145103350","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010162221,0.00024058277,0.98836833,0.000056820027,0.000028420109,0.000031688993,0.000016860966,0.0007654197,0.00032975562],"genre_scores_gemma":[0.18232834,0.000391269,0.8131051,0.00007793192,0.000042164265,0.000108543565,0.00013297223,0.000065738815,0.00374789],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995735,0.000070968694,0.000030955063,0.000064643864,0.00022787259,0.000032069103],"domain_scores_gemma":[0.99911004,0.000333417,0.00011531565,0.00009789895,0.00031957764,0.000023788607],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009189594,0.00047183846,0.0004139044,0.00055870914,0.0003766887,0.0005698758,0.000785697,0.00062822993,0.0013974434],"category_scores_gemma":[0.002094222,0.00020595439,0.0002172008,0.000477722,0.00033539106,0.00090264704,0.000481672,0.0009063433,0.000801254],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006244583,0.00008891188,0.0007267376,0.000082857354,0.000030974854,0.00008495649,0.00013292847,0.089028426,0.04818764,0.0049558515,0.0018660296,0.8541902],"study_design_scores_gemma":[0.00003889014,0.000121408484,0.0004605179,0.0000095767955,0.000017725626,0.00012408769,0.00001705538,0.95169306,0.044470288,0.0010261588,0.0020046257,0.000016620508],"about_ca_topic_score_codex":0.002379912,"about_ca_topic_score_gemma":0.0023318713,"teacher_disagreement_score":0.002379912,"about_ca_system_score_codex":0.00052556355,"about_ca_system_score_gemma":0.0008097667,"threshold_uncertainty_score":0.004859984},"labels":[],"label_agreement":null},{"id":"W2145889580","doi":"10.1109/ccece.1993.332214","title":"Comparison of image transforms in the coding of the displaced frame difference for block-based motion compensation","year":2002,"lang":"en","type":"article","venue":"","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Hadamard transform; Residual; Motion compensation; Artificial intelligence; Coding (social sciences); Computer vision; Computer science; Discrete cosine transform; Lapped transform; Walsh function; Transform coding; Block (permutation group theory); Frame (networking); Mathematics; Algorithm; Image (mathematics); Statistics; Telecommunications; Combinatorics","score_opus":0.048384097739102766,"score_gpt":0.3242609605565842,"score_spread":0.27587686281748147,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2145889580","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6391639,0.0039965953,0.34779605,0.00025013488,0.00017647441,0.00013874982,0.00013235991,0.0005538432,0.0077919536],"genre_scores_gemma":[0.8070917,0.001799881,0.18816128,0.00007187915,0.00004265536,0.00005397184,0.00035057508,0.000098958335,0.0023291367],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994997,0.00012780284,0.000029540866,0.000027782691,0.0002742077,0.000041027513],"domain_scores_gemma":[0.9986946,0.0007493309,0.000060347964,0.00008297522,0.00038215803,0.000030613588],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00087677635,0.00027146295,0.000215928,0.0008975027,0.00012419789,0.0004534964,0.0002721445,0.00041285815,0.0011322307],"category_scores_gemma":[0.0043574083,0.000092396105,0.00020344908,0.0007603321,0.0002609046,0.0006319616,0.00023219947,0.0002657867,0.00035260597],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0031985447,0.00023808781,0.0043916036,0.00040022878,0.00011166222,0.00034726082,0.00026753478,0.07990615,0.28817883,0.010356527,0.0009409509,0.61166257],"study_design_scores_gemma":[0.0001631474,0.0018380149,0.0075134165,0.00008069822,0.00015428245,0.0010990213,0.00015860982,0.63469994,0.3455035,0.0022619807,0.00646146,0.00006589865],"about_ca_topic_score_codex":0.0014275089,"about_ca_topic_score_gemma":0.0019469043,"teacher_disagreement_score":0.0014275089,"about_ca_system_score_codex":0.00023156848,"about_ca_system_score_gemma":0.00027734737,"threshold_uncertainty_score":0.0046368837},"labels":[],"label_agreement":null},{"id":"W2146410565","doi":"10.1109/tcsvt.2002.803225","title":"New techniques for multi-resolution motion estimation","year":2002,"lang":"en","type":"article","venue":"IEEE Transactions on Circuits and Systems for Video Technology","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":20,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Computer science; Motion estimation; ENCODE; Computational complexity theory; Artificial intelligence; Linear prediction; Bandwidth (computing); Feature (linguistics); Pattern recognition (psychology); Algorithm","score_opus":0.05331426251940818,"score_gpt":0.2959346153302509,"score_spread":0.2426203528108427,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2146410565","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0013840758,0.00088727917,0.9970319,0.000045959365,0.00004188533,0.000011338915,0.000013258367,0.00016666594,0.00041753618],"genre_scores_gemma":[0.040346783,0.0018271981,0.9553095,0.000077279394,0.00017149745,0.00006288926,0.00008323341,0.00004205468,0.0020794887],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993174,0.00009584876,0.00003737553,0.00010437139,0.00041225358,0.000032643817],"domain_scores_gemma":[0.99911994,0.00035017772,0.000095949246,0.00016875,0.00023575965,0.000029480738],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007950504,0.0007321774,0.00068960467,0.0011345044,0.00028850933,0.0005686485,0.0012343833,0.0009262295,0.0028133835],"category_scores_gemma":[0.0025305673,0.00047596227,0.0006594459,0.000908433,0.00036722072,0.0021998514,0.0009624092,0.0011566151,0.0012647213],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012614111,0.000057700527,0.0005917846,0.00033828465,0.00009970003,0.00012651313,0.00012453107,0.036443006,0.08801911,0.03213525,0.001878018,0.84006],"study_design_scores_gemma":[0.000047169135,0.00019191223,0.0007726182,0.00009518954,0.00007988138,0.00084451656,0.000035359568,0.8968742,0.055142064,0.01627745,0.02956546,0.00007430966],"about_ca_topic_score_codex":0.0005660089,"about_ca_topic_score_gemma":0.0011097012,"teacher_disagreement_score":0.0028133835,"about_ca_system_score_codex":0.0002760426,"about_ca_system_score_gemma":0.00027690086,"threshold_uncertainty_score":0.009411633},"labels":[],"label_agreement":null},{"id":"W2146514308","doi":"10.1109/icassp.2010.5495190","title":"An efficient tree-structured codebook design for embedded vector quantization","year":2010,"lang":"en","type":"article","venue":"","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Institut National de la Recherche Scientifique","funders":"","keywords":"Codebook; Vector quantization; Linde–Buzo–Gray algorithm; Computer science; Speech coding; Quantization (signal processing); Algorithm; Tree (set theory); Scalability; Speech recognition; Theoretical computer science; Mathematics","score_opus":0.02204714625483273,"score_gpt":0.30810961341780485,"score_spread":0.2860624671629721,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2146514308","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0018058878,0.00013724131,0.9972947,0.000029644925,0.000032975975,0.000029714583,0.00003672167,0.00011208511,0.00052103226],"genre_scores_gemma":[0.1534706,0.00045431254,0.8427374,0.00010862814,0.000071545095,0.00021138457,0.00044231143,0.00007809312,0.002425741],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99934417,0.00012716294,0.00005033324,0.00006728205,0.0003760663,0.000034938774],"domain_scores_gemma":[0.99931026,0.00014498405,0.00005085494,0.00009148897,0.00037378844,0.000028619903],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00048410537,0.00035167337,0.00047534518,0.00045525123,0.00026167312,0.00047634626,0.0009225352,0.0004365911,0.0016296222],"category_scores_gemma":[0.0021182217,0.00019236098,0.00023196248,0.0008037086,0.00035051059,0.0009277689,0.00058341806,0.0005739611,0.0007222294],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00026147286,0.00007209856,0.0005721469,0.00027745744,0.000039278013,0.0001402914,0.00014957419,0.12713048,0.11586503,0.11106593,0.010071798,0.6343544],"study_design_scores_gemma":[0.000050962324,0.00015541763,0.00019913794,0.00002557134,0.000013655358,0.00023297354,0.000024140165,0.950689,0.023938695,0.013110826,0.011528485,0.00003105289],"about_ca_topic_score_codex":0.0015097737,"about_ca_topic_score_gemma":0.002230996,"teacher_disagreement_score":0.0016296222,"about_ca_system_score_codex":0.0004499037,"about_ca_system_score_gemma":0.0007477728,"threshold_uncertainty_score":0.0054516196},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.14918933800026965,"score_gpt":0.30174808524769264,"score_spread":0.152558747247423,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2146519691","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01846307,0.028065639,0.42240858,0.00396448,0.007247408,0.009609182,0.10043129,0.010257731,0.3995527],"genre_scores_gemma":[0.09284767,0.02818194,0.29108676,0.0062537575,0.003199976,0.017521974,0.27707118,0.007316799,0.27651992],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9977586,0.00044231353,0.00027068812,0.0002452858,0.0010233419,0.0002596448],"domain_scores_gemma":[0.996951,0.0003617077,0.0002257462,0.00039151873,0.0019465893,0.00012347629],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016554451,0.0029143475,0.00081442326,0.005171071,0.0010220425,0.0020242657,0.0017754837,0.0031313717,0.042709526],"category_scores_gemma":[0.0040859757,0.0006403213,0.0006342246,0.003265962,0.00066776073,0.0014138335,0.0011293982,0.0023157871,0.066048555],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009946887,0.00045726978,0.001729224,0.0025775807,0.000076318036,0.0011387953,0.0003374884,0.021060701,0.095398694,0.048788216,0.4006933,0.42674768],"study_design_scores_gemma":[0.00005728144,0.0003595203,0.0013349209,0.00036917272,0.000029164374,0.0008827463,0.000081379425,0.006572297,0.0112474505,0.0046600634,0.9742965,0.00010939671],"about_ca_topic_score_codex":0.0069839624,"about_ca_topic_score_gemma":0.0043588006,"teacher_disagreement_score":0.042709526,"about_ca_system_score_codex":0.0017281397,"about_ca_system_score_gemma":0.002558049,"threshold_uncertainty_score":0.14287764},"labels":[],"label_agreement":null},{"id":"W2146857670","doi":"10.1109/icassp.2007.366982","title":"Speech Bandwidth Extension by Data Hiding and Phonetic Classification","year":2007,"lang":"en","type":"article","venue":"","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":26,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Bandwidth extension; Computer science; Extension (predicate logic); Speech recognition; Bandwidth (computing); Information hiding; Artificial intelligence; Natural language processing; Speech coding; Telecommunications; Programming language","score_opus":0.060689197871907005,"score_gpt":0.33025097337326054,"score_spread":0.2695617755013535,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2146857670","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1753231,0.00059631426,0.82050055,0.0001155632,0.00008543481,0.000063277825,0.00005621256,0.0007278432,0.0025317203],"genre_scores_gemma":[0.84295666,0.00030513923,0.15381254,0.000045122015,0.000032834792,0.000044811113,0.00011086331,0.000028545623,0.0026634892],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99978167,0.000026844162,0.000018249582,0.000037832153,0.00010746106,0.000027889191],"domain_scores_gemma":[0.9996251,0.00014094214,0.0000520532,0.000077376404,0.00009146238,0.000012978263],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024893685,0.00029742232,0.0002788252,0.00039667328,0.00021081792,0.00031796924,0.00045832817,0.00035968726,0.0009155741],"category_scores_gemma":[0.0009763806,0.00016192673,0.0002904739,0.00040572172,0.0003503245,0.00079870864,0.00046402944,0.00032786487,0.0003591589],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00058773573,0.00020732037,0.001842714,0.0002935162,0.00004354059,0.00029952577,0.00028916114,0.060014457,0.4172598,0.013800594,0.0010250338,0.5043366],"study_design_scores_gemma":[0.000056308192,0.00024083338,0.001182614,0.000024747256,0.000050135684,0.00077844126,0.000051854055,0.6550387,0.33560532,0.0027766728,0.004154427,0.000040007963],"about_ca_topic_score_codex":0.00083819707,"about_ca_topic_score_gemma":0.0010927343,"teacher_disagreement_score":0.0009155741,"about_ca_system_score_codex":0.00021548869,"about_ca_system_score_gemma":0.00025610506,"threshold_uncertainty_score":0.0030629635},"labels":[],"label_agreement":null},{"id":"W2147232684","doi":"10.1109/ccece.2005.1557113","title":"Recognition of syllables in a continuous stream of speech by parcor parameters of linear predictive vocoder","year":2006,"lang":"en","type":"article","venue":"","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Saskatchewan","funders":"","keywords":"Speech recognition; Computer science; Linear predictive coding; Linear prediction; Speech coding; Classifier (UML); Speech processing; Vocal tract; Artificial intelligence; Pattern recognition (psychology)","score_opus":0.013015200547207074,"score_gpt":0.251709191667779,"score_spread":0.23869399112057194,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2147232684","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.27802718,0.00053355866,0.7141923,0.00007931893,0.00011061202,0.00017043306,0.0004580491,0.002803172,0.003625492],"genre_scores_gemma":[0.55270445,0.00046577916,0.44176382,0.00007356706,0.000052457257,0.00017170358,0.001003961,0.00017832941,0.0035859484],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997261,0.000049022347,0.000014402171,0.00006479249,0.00011636607,0.000029322651],"domain_scores_gemma":[0.99955684,0.00018966172,0.0000325819,0.000052351425,0.00015064195,0.00001801727],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003897441,0.00035418707,0.0003437852,0.0005000441,0.00012983334,0.0005123001,0.00031098,0.0004058238,0.001232547],"category_scores_gemma":[0.0011978585,0.00017317025,0.00019060296,0.00035521013,0.00017299398,0.0003820205,0.00022001273,0.00041673734,0.0010248979],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005228506,0.000104606144,0.0039843502,0.00020804426,0.00003282384,0.00027172462,0.00020139068,0.005889867,0.41134298,0.0011869656,0.0014094369,0.57484496],"study_design_scores_gemma":[0.000059126894,0.0007239244,0.03953187,0.000060847313,0.00011719078,0.0015468608,0.00016534526,0.5149705,0.43355885,0.0012237808,0.007973079,0.000068552166],"about_ca_topic_score_codex":0.0008968064,"about_ca_topic_score_gemma":0.0016861374,"teacher_disagreement_score":0.001232547,"about_ca_system_score_codex":0.00012333764,"about_ca_system_score_gemma":0.00022769503,"threshold_uncertainty_score":0.004123211},"labels":[],"label_agreement":null},{"id":"W2147316407","doi":"10.1109/icip.1994.413701","title":"Transmission of the color information using quad-trees and segmentation-based approaches for the compression of color images with limited palette","year":2002,"lang":"en","type":"article","venue":"","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université Laval","funders":"","keywords":"Color quantization; Palette (painting); Artificial intelligence; Lossy compression; Color depth; Computer vision; Color space; Computer science; Color Cell Compression; Color image; Color histogram; RGB color model; JPEG; High color; Chrominance; Histogram equalization; Pixel; Color balance; Data compression; Image compression; Luminance; Histogram; Image processing; Image (mathematics)","score_opus":0.04518278862457083,"score_gpt":0.2515928716960689,"score_spread":0.2064100830714981,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2147316407","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.036805056,0.0013785872,0.9576086,0.0001779524,0.00008502488,0.000076179625,0.00012290612,0.000991291,0.0027543597],"genre_scores_gemma":[0.23210253,0.0015684259,0.7612671,0.0001485499,0.000070985974,0.000102739046,0.0004983432,0.00013755506,0.004103701],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998129,0.000028593473,0.000015440211,0.000022355478,0.000102209066,0.000018385048],"domain_scores_gemma":[0.99970645,0.00009092174,0.000031089065,0.00005997874,0.000101033555,0.000010437274],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021766622,0.0002936955,0.0002865993,0.0009482499,0.00034814296,0.00044735317,0.0004482137,0.00034484416,0.0018852215],"category_scores_gemma":[0.0008357135,0.00015060775,0.00026661332,0.0010774938,0.000313632,0.000855112,0.00033376715,0.00032137465,0.0005962336],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00039071392,0.00009498279,0.0005342094,0.0002158081,0.000049241185,0.0002650367,0.00025178606,0.064967945,0.16586111,0.025163975,0.0067390087,0.7354662],"study_design_scores_gemma":[0.000058997874,0.00017015671,0.0010862029,0.000051789608,0.000045375404,0.000772401,0.00006540516,0.8588957,0.10671591,0.014134141,0.01795608,0.000047876547],"about_ca_topic_score_codex":0.0024135157,"about_ca_topic_score_gemma":0.0034218698,"teacher_disagreement_score":0.0024135157,"about_ca_system_score_codex":0.0003979607,"about_ca_system_score_gemma":0.00041505002,"threshold_uncertainty_score":0.0063067675},"labels":[],"label_agreement":null},{"id":"W2147472206","doi":"10.1109/cwit.2011.5872125","title":"Exploiting memory and soft-decision information in channel optimized quantization for correlated fading channels","year":2011,"lang":"en","type":"article","venue":"","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Fading; Rayleigh fading; Channel (broadcasting); Quantization (signal processing); Computer science; Algorithm; Queue; Electronic engineering; Topology (electrical circuits); Mathematics; Telecommunications; Engineering; Computer network","score_opus":0.04472226558672703,"score_gpt":0.2733362985517907,"score_spread":0.22861403296506366,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2147472206","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.42435482,0.0007973926,0.57209396,0.00026150758,0.000051665054,0.00006691913,0.00006117977,0.0004673094,0.0018452804],"genre_scores_gemma":[0.97468704,0.000116664865,0.024745276,0.000028936758,0.000008756777,0.0000115917865,0.000021774476,0.000009616309,0.0003703061],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994311,0.0001925794,0.000030627896,0.000060006212,0.00020360835,0.00008212192],"domain_scores_gemma":[0.9980567,0.001370687,0.0001677247,0.00014144204,0.0002266255,0.000036774793],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010798408,0.00042172385,0.00043267704,0.00020409394,0.00032833937,0.0005374162,0.00057870697,0.0003379936,0.0006880131],"category_scores_gemma":[0.0025418592,0.0001451789,0.00013056035,0.00041527065,0.0006071274,0.00083551375,0.00038879726,0.00045878367,0.00009888816],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0014063898,0.0002138544,0.0035929591,0.00019766383,0.00007442938,0.00021093622,0.00023350651,0.755251,0.075352676,0.034608867,0.00083363586,0.12802416],"study_design_scores_gemma":[0.000025326055,0.00020060207,0.00024109514,0.000008367568,0.000013231607,0.00005452719,0.00001631581,0.9716585,0.026004804,0.0014796901,0.00028151335,0.000015955435],"about_ca_topic_score_codex":0.002223886,"about_ca_topic_score_gemma":0.0034403657,"teacher_disagreement_score":0.002223886,"about_ca_system_score_codex":0.000618515,"about_ca_system_score_gemma":0.00066032854,"threshold_uncertainty_score":0.00571084},"labels":[],"label_agreement":null},{"id":"W2147571468","doi":"10.1109/tcsvt.2006.882388","title":"SPIHT-Based Coding of the Shape and Texture of Arbitrarily Shaped Visual Objects","year":2006,"lang":"en","type":"article","venue":"IEEE Transactions on Circuits and Systems for Video Technology","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":19,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Set partitioning in hierarchical trees; Artificial intelligence; Computer science; Computer vision; Rate–distortion theory; Wavelet; Coding (social sciences); Texture compression; Pattern recognition (psychology); Image texture; Pixel; Wavelet transform; Mathematics; Discrete wavelet transform; Data compression; Image processing; Image (mathematics)","score_opus":0.014323166097388752,"score_gpt":0.25351607079787686,"score_spread":0.2391929047004881,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2147571468","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02442362,0.00032960548,0.9719962,0.000059400147,0.000090919115,0.00004045627,0.00012661655,0.00041945121,0.002513727],"genre_scores_gemma":[0.2983839,0.0011854221,0.6911188,0.000102481434,0.000158654,0.00012266639,0.0006698731,0.00012993248,0.008128381],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99987996,0.000010049516,0.0000057939915,0.000008928631,0.000082409526,0.000012788943],"domain_scores_gemma":[0.99974555,0.00006654825,0.000027229375,0.000054299875,0.00009298038,0.000013416957],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014265762,0.00028468156,0.00031329787,0.000524096,0.00018629129,0.0004766315,0.0004692354,0.00025147074,0.0015174644],"category_scores_gemma":[0.0005650823,0.00013843414,0.00032164378,0.000560718,0.0004158312,0.0006197299,0.00041980494,0.00055693043,0.00041919612],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00027013294,0.00005009812,0.0003915876,0.00027285118,0.000033864577,0.00035145835,0.00015048675,0.0525462,0.46713117,0.040963028,0.0035138947,0.43432525],"study_design_scores_gemma":[0.000035756486,0.00034198223,0.001255418,0.00005652248,0.00005261786,0.0013485558,0.000045130655,0.6530738,0.30309805,0.015541356,0.025092235,0.000058641497],"about_ca_topic_score_codex":0.0005535307,"about_ca_topic_score_gemma":0.001089167,"teacher_disagreement_score":0.0015174644,"about_ca_system_score_codex":0.00028730952,"about_ca_system_score_gemma":0.0002758274,"threshold_uncertainty_score":0.005076468},"labels":[],"label_agreement":null},{"id":"W2147582729","doi":"10.1109/tsp.2010.2062510","title":"On Construction and Simulation of Autoregressive Sources With Near-Laplace Marginals","year":2010,"lang":"en","type":"article","venue":"IEEE Transactions on Signal Processing","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"","keywords":"Autoregressive model; Applied mathematics; Laplace transform; Marginal distribution; Laplace distribution; Bivariate analysis; Algorithm; Monte Carlo method; STAR model; Computer science; Gaussian process; Series (stratigraphy); Gaussian; Mathematics; Time series; Autoregressive integrated moving average; Statistics; Machine learning; Random variable; Mathematical analysis","score_opus":0.010579336687258769,"score_gpt":0.2655764296107105,"score_spread":0.25499709292345174,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2147582729","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008367378,0.000046373825,0.9907616,0.00004563741,0.000007594066,0.000014392325,0.000012686389,0.00011755444,0.0006269124],"genre_scores_gemma":[0.494204,0.00032358768,0.5026484,0.0001043899,0.000045645997,0.00019467498,0.00025453317,0.00015147631,0.002073228],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991841,0.0004478337,0.00003227976,0.00008575979,0.00020256187,0.00004746967],"domain_scores_gemma":[0.9942298,0.0046690465,0.00031098328,0.00033855278,0.00033667052,0.0001148554],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001868302,0.00056456117,0.0007110457,0.0007911929,0.00040668374,0.00081569236,0.0009972402,0.0009784027,0.0016985541],"category_scores_gemma":[0.010632308,0.0005551362,0.0007803325,0.00065101724,0.0012625795,0.0010484343,0.0014791476,0.0012523602,0.0004006357],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000045942485,0.000024443098,0.00043665324,0.000025038025,0.000011893634,0.000053758176,0.00006950174,0.91258883,0.0014067367,0.07281198,0.0001726634,0.012352542],"study_design_scores_gemma":[0.0000030445337,0.000006959802,0.000020150075,0.0000025808872,0.0000010153979,0.00000943936,0.000002250004,0.9888466,0.00038951475,0.010553778,0.00016185582,0.0000028908235],"about_ca_topic_score_codex":0.0017977982,"about_ca_topic_score_gemma":0.0011708126,"teacher_disagreement_score":0.001868302,"about_ca_system_score_codex":0.000692374,"about_ca_system_score_gemma":0.000698242,"threshold_uncertainty_score":0.009880662},"labels":[],"label_agreement":null},{"id":"W2148009554","doi":"10.1109/itw.2007.4313086","title":"Resource-Aware Joint Source-Channel Multiple Description Estimation and Compression in Networks","year":2007,"lang":"en","type":"article","venue":"","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Computer science; Decoding methods; Distributed source coding; Scalability; Algorithm; Minimum mean square error; Encoder; Maximum a posteriori estimation; Theoretical computer science; Belief propagation; Channel code; Maximum likelihood; Mathematics","score_opus":0.025898952407558372,"score_gpt":0.25719502041613507,"score_spread":0.2312960680085767,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2148009554","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007388562,0.0004924691,0.99109215,0.00011780153,0.000021409514,0.000017119624,0.000041980085,0.00016225633,0.0006662493],"genre_scores_gemma":[0.6839327,0.0011162641,0.3108644,0.000140673,0.00012215904,0.000161001,0.00035032994,0.00007762457,0.003234913],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993063,0.00025700222,0.00003612288,0.000102574515,0.00023499434,0.00006299853],"domain_scores_gemma":[0.9984571,0.0010634683,0.00011131646,0.00016585724,0.0001731485,0.00002908897],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010087696,0.00059518096,0.00077146856,0.00051978254,0.0002946853,0.0008190661,0.001264934,0.000818201,0.0007170895],"category_scores_gemma":[0.0035666518,0.00036028458,0.00038403168,0.0009087611,0.00067784055,0.0015111975,0.0011540734,0.00086309446,0.00019118778],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007453936,0.00002138413,0.0002519,0.00006688385,0.00002074468,0.000081365,0.000049970633,0.8995779,0.0022486087,0.021381052,0.0008305916,0.075395055],"study_design_scores_gemma":[0.0000030935553,0.000008002201,0.000031916046,0.0000031060126,0.000002721044,0.000014980064,0.0000031937557,0.9949509,0.00072963926,0.004000147,0.0002483934,0.0000038402745],"about_ca_topic_score_codex":0.0042509544,"about_ca_topic_score_gemma":0.0028321485,"teacher_disagreement_score":0.0042509544,"about_ca_system_score_codex":0.00069775345,"about_ca_system_score_gemma":0.0010784777,"threshold_uncertainty_score":0.0084524155},"labels":[],"label_agreement":null},{"id":"W2148151265","doi":"10.1109/icassp.2003.1198728","title":"Improved packet loss recovery using late frames for prediction-based speech coders","year":2003,"lang":"en","type":"article","venue":"2003 IEEE International Conference on Acoustics, Speech, and Signal Processing, 2003. Proceedings. (ICASSP '03).","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":22,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Sherbrooke","funders":"","keywords":"Jitter; Computer science; Robustness (evolution); Speech recognition; Network packet; Frame (networking); Speech coding; Voice activity detection; Packet loss; Speech processing; Computer network; Telecommunications","score_opus":0.04594437965888411,"score_gpt":0.3069194534094846,"score_spread":0.26097507375060053,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2148151265","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08245239,0.0012100012,0.91331655,0.0001710513,0.00017594766,0.00007923762,0.00007261039,0.0016880264,0.0008341544],"genre_scores_gemma":[0.5397431,0.00086915604,0.45425642,0.00015441682,0.00016506703,0.000093632894,0.0003406138,0.00021151644,0.0041660704],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9994574,0.00012013198,0.0000429871,0.00006537183,0.00025702125,0.000057106918],"domain_scores_gemma":[0.99834645,0.00056147337,0.00017152746,0.00028980293,0.0005755063,0.00005528745],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010943651,0.0010431584,0.0005815834,0.0007082374,0.00050080585,0.0006525397,0.0008811564,0.0007114531,0.0011958253],"category_scores_gemma":[0.0035192638,0.00027843256,0.00023437056,0.00040479336,0.00035468175,0.0011656638,0.0005812107,0.0013276385,0.0006202349],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0021704151,0.00030537156,0.0017715889,0.00017172367,0.000050295934,0.0005061995,0.00030340254,0.06845069,0.39966986,0.007566673,0.0029602933,0.51607347],"study_design_scores_gemma":[0.0001052973,0.0008951248,0.0010381298,0.000044848333,0.000057343626,0.00048384565,0.000041658062,0.7626371,0.22756033,0.0015676592,0.00548997,0.00007875828],"about_ca_topic_score_codex":0.0024166382,"about_ca_topic_score_gemma":0.003681897,"teacher_disagreement_score":0.0024166382,"about_ca_system_score_codex":0.00040040052,"about_ca_system_score_gemma":0.0005373683,"threshold_uncertainty_score":0.0057876706},"labels":[],"label_agreement":null},{"id":"W2148608350","doi":"10.1109/iembs.1995.575185","title":"Medical image compression using B-spline wavelet transform","year":2002,"lang":"en","type":"article","venue":"","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Lossless compression; Wavelet transform; Image compression; Data compression; Artificial intelligence; Computer vision; Data compression ratio; Context-adaptive binary arithmetic coding; Computer science; Tunstall coding; Transform coding; Texture compression; Wavelet; Mathematics; Algorithm; Image processing; Image (mathematics); Discrete cosine transform","score_opus":0.032435063168901046,"score_gpt":0.30407333001668446,"score_spread":0.2716382668477834,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2148608350","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07204884,0.0039251256,0.9179494,0.00033732338,0.00020290993,0.00012033934,0.00013797749,0.0009888828,0.0042890967],"genre_scores_gemma":[0.5954009,0.006247387,0.3896215,0.00017559434,0.0002273658,0.00012615614,0.00042120964,0.000116300434,0.007663589],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9997874,0.000027947446,0.000009916656,0.000012031493,0.00015073606,0.000011982197],"domain_scores_gemma":[0.999803,0.000083203835,0.000019137246,0.000021270145,0.00006383597,0.000009472512],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035653752,0.00024607702,0.00034165496,0.0007609896,0.00013142372,0.00028886768,0.0002737167,0.00046814195,0.00086439983],"category_scores_gemma":[0.0010814078,0.00011430426,0.00022551867,0.00085563323,0.00026923724,0.000357861,0.00026917027,0.00049298385,0.00040360636],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004390491,0.00008134467,0.0004018772,0.00040710173,0.000025727779,0.00054256193,0.00007525527,0.025541198,0.5345068,0.010414004,0.0023001896,0.42526487],"study_design_scores_gemma":[0.00012894213,0.0010351512,0.0033161172,0.00010850408,0.00005842157,0.0041392986,0.000035719375,0.503652,0.4582605,0.008198465,0.021004062,0.00006287104],"about_ca_topic_score_codex":0.0003296514,"about_ca_topic_score_gemma":0.00018632629,"teacher_disagreement_score":0.00086439983,"about_ca_system_score_codex":0.0001112885,"about_ca_system_score_gemma":0.00020128726,"threshold_uncertainty_score":0.0028916597},"labels":[],"label_agreement":null},{"id":"W2148642242","doi":"10.1109/tcsvt.2005.846429","title":"A new time distributed DCT architecture for MPEG-4 hardware reference model","year":2005,"lang":"en","type":"article","venue":"IEEE Transactions on Circuits and Systems for Video Technology","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":22,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Discrete cosine transform; Computer science; Computation; Redundancy (engineering); Architecture; Scheduling (production processes); Coefficient matrix; Exploit; Transform coding; Algorithm; Parallel computing; Computer hardware; Embedded system; Mathematics; Artificial intelligence; Image (mathematics)","score_opus":0.027019795683306255,"score_gpt":0.27165336200521933,"score_spread":0.24463356632191308,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2148642242","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018130638,0.0005514073,0.96301293,0.00022391377,0.00026721723,0.00013866776,0.00014133153,0.0026985612,0.014835374],"genre_scores_gemma":[0.27706113,0.0006453753,0.69280255,0.0003121906,0.00019276085,0.0002744661,0.0010279898,0.00034217263,0.027341345],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996984,0.000031929976,0.0000215139,0.00005109749,0.00017054453,0.000026537356],"domain_scores_gemma":[0.9998115,0.000016842043,0.000012559107,0.00004543251,0.000099680656,0.000014081102],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002814654,0.0003051909,0.00023386297,0.0005329276,0.00030434594,0.0006704377,0.0009580576,0.0003397268,0.005190771],"category_scores_gemma":[0.0005107567,0.00016219143,0.00026583156,0.0004565376,0.00022896509,0.00090116163,0.0003034553,0.0004953853,0.0017327854],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007826539,0.00016195043,0.0010140884,0.00023688971,0.00006223058,0.00045526456,0.0001425399,0.0674088,0.29928693,0.1255345,0.022140715,0.48277345],"study_design_scores_gemma":[0.00020572844,0.00057840376,0.00084321783,0.000048110927,0.00007875137,0.00083243457,0.000041386138,0.6926481,0.123612024,0.010040282,0.1710054,0.000066076864],"about_ca_topic_score_codex":0.0017675051,"about_ca_topic_score_gemma":0.004704852,"teacher_disagreement_score":0.005190771,"about_ca_system_score_codex":0.0008053389,"about_ca_system_score_gemma":0.00078633253,"threshold_uncertainty_score":0.0173648},"labels":[],"label_agreement":null},{"id":"W2148681862","doi":"10.1109/tip.2002.1006399","title":"Performances of linear tools and models for error detection and concealment in subband image transmission","year":2002,"lang":"en","type":"article","venue":"IEEE Transactions on Image Processing","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Decoding methods; Transmission (telecommunications); Channel (broadcasting); Computer science; Gaussian; Residual; Network packet; Algorithm; Artificial intelligence; Pattern recognition (psychology); Mathematics; Telecommunications","score_opus":0.042097463582496046,"score_gpt":0.2956639554336316,"score_spread":0.25356649185113556,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2148681862","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.050930876,0.0016273379,0.94468945,0.00025276808,0.00004764406,0.00003994348,0.00006238003,0.0010587624,0.0012908292],"genre_scores_gemma":[0.8784383,0.0015161869,0.117034204,0.00016038922,0.000055489487,0.0000910323,0.00016045164,0.00014443023,0.0023995542],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9958145,0.0020028597,0.00015043706,0.0004033169,0.0012106537,0.00041831454],"domain_scores_gemma":[0.9675839,0.027417963,0.0016926206,0.0012581979,0.0018138831,0.0002334056],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007510425,0.0014619604,0.0014509222,0.0013319339,0.00055762223,0.0017320904,0.0016772856,0.0018900558,0.0016290962],"category_scores_gemma":[0.033257626,0.00061597483,0.0008715575,0.00084883627,0.0023259094,0.003218506,0.0023582468,0.001602172,0.00062883104],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009800821,0.0000886605,0.0010185387,0.00017867892,0.00009956709,0.000108414766,0.0001437364,0.89437985,0.0020463078,0.02142066,0.00041057036,0.07912497],"study_design_scores_gemma":[0.0000056631843,0.000054566375,0.00006150341,0.000007692234,0.000008809144,0.000015189414,0.000009316734,0.99627507,0.0013762899,0.0021249251,0.000051671224,0.0000092926775],"about_ca_topic_score_codex":0.0073581217,"about_ca_topic_score_gemma":0.0031072088,"teacher_disagreement_score":0.007510425,"about_ca_system_score_codex":0.0014532752,"about_ca_system_score_gemma":0.0014025551,"threshold_uncertainty_score":0.039719403},"labels":[],"label_agreement":null},{"id":"W2148823080","doi":"10.1109/49.848259","title":"Zerotree pattern coding of motion picture residues for error-resilient transmission of video sequences","year":2000,"lang":"en","type":"article","venue":"IEEE Journal on Selected Areas in Communications","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"","keywords":"Quadtree; Computer science; Artificial intelligence; Coding (social sciences); Computer vision; Pixel; Data compression; Context-adaptive binary arithmetic coding; Coding tree unit; Wavelet; Sub-band coding; Pattern recognition (psychology); Wavelet transform; Algorithm; Decoding methods; Mathematics; Statistics","score_opus":0.04133638367224079,"score_gpt":0.3327204557964102,"score_spread":0.2913840721241694,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2148823080","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06976413,0.0014923355,0.9225752,0.0002475413,0.00018600021,0.000110449044,0.0001429944,0.0007001497,0.004781263],"genre_scores_gemma":[0.36507767,0.0016342045,0.6255193,0.00016269868,0.00013585183,0.00008717383,0.00048778544,0.00015793348,0.0067373025],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998616,0.000024481682,0.000009583142,0.000013479155,0.000081019134,0.000009822008],"domain_scores_gemma":[0.99974734,0.00007711983,0.000028165003,0.00006452625,0.000070492555,0.000012443934],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016205353,0.00022550921,0.00018764152,0.00036123965,0.00016980356,0.00027119907,0.00036985026,0.0002449079,0.0018860032],"category_scores_gemma":[0.0008386133,0.00010096228,0.00014473357,0.00044088464,0.00025534802,0.0005718523,0.00028911952,0.00035735915,0.00062029314],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002846906,0.00006477897,0.00047156567,0.00034565575,0.000020322253,0.00041819122,0.00011834487,0.015532822,0.43666232,0.041101813,0.003321946,0.50165755],"study_design_scores_gemma":[0.00011729589,0.0008237106,0.0020913573,0.00011027087,0.00007050749,0.0028908993,0.00006598523,0.40075353,0.49447727,0.030778924,0.0677607,0.0000594578],"about_ca_topic_score_codex":0.0002620199,"about_ca_topic_score_gemma":0.0007286963,"teacher_disagreement_score":0.0018860032,"about_ca_system_score_codex":0.00015253328,"about_ca_system_score_gemma":0.0003220193,"threshold_uncertainty_score":0.0063093305},"labels":[],"label_agreement":null},{"id":"W2148838455","doi":"10.1109/iembs.2005.1617305","title":"Comparison of JPEG 2000 and Other Lossless Compression Schemes for Digital Mammograms","year":2005,"lang":"en","type":"article","venue":"","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Lossless JPEG; JPEG; Huffman coding; Lossless compression; Lossy compression; Computer science; Computer vision; Data compression; Artificial intelligence; JPEG 2000; Compression artifact; Image compression; Image processing; Image (mathematics)","score_opus":0.03636457976219418,"score_gpt":0.36082826149211683,"score_spread":0.3244636817299227,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2148838455","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7624219,0.018760243,0.20165081,0.000554258,0.00048654634,0.0006063859,0.0006077423,0.001670733,0.013241368],"genre_scores_gemma":[0.7801842,0.008359635,0.20041636,0.00032034173,0.00018980082,0.0001412976,0.0014451484,0.0001890376,0.00875412],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99917895,0.00013323316,0.00005109164,0.000049841605,0.00053823343,0.000048593836],"domain_scores_gemma":[0.9987527,0.0004717269,0.000106131876,0.00014668172,0.00045711332,0.00006566178],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011573844,0.00042942335,0.00026498234,0.0016000636,0.0001945028,0.00049579557,0.0005116428,0.00038243987,0.0014192895],"category_scores_gemma":[0.0039280625,0.00011334327,0.00023840755,0.0011151588,0.0002391242,0.0009700218,0.00022345409,0.00022683716,0.0003537074],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.004780814,0.00052849215,0.0057825516,0.0012029917,0.00030328962,0.00037269274,0.00021784236,0.036434766,0.18932825,0.0069151935,0.0053062006,0.7488269],"study_design_scores_gemma":[0.000949124,0.0080958735,0.044157743,0.0002761356,0.00066262623,0.0040525626,0.0003151349,0.4221788,0.47064832,0.0033874246,0.045052,0.00022426085],"about_ca_topic_score_codex":0.0015711705,"about_ca_topic_score_gemma":0.0018622217,"teacher_disagreement_score":0.0016000636,"about_ca_system_score_codex":0.000431409,"about_ca_system_score_gemma":0.00034334027,"threshold_uncertainty_score":0.00612092},"labels":[],"label_agreement":null},{"id":"W2148871295","doi":"10.1109/vtcf.2006.571","title":"FPGA Implementation of a Wireless Modem Suitable for Digital Satellite News Gathering","year":2006,"lang":"en","type":"article","venue":"IEEE Vehicular Technology Conference","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Field-programmable gate array; Computer science; Virtex; Codec; Computer hardware; Embedded system; Digital signal processing; Wireless; Communications satellite; Satellite; Telecommunications; Engineering","score_opus":0.014972838148250752,"score_gpt":0.27605979443677486,"score_spread":0.26108695628852413,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2148871295","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.40607533,0.00080288475,0.5464211,0.00034008958,0.00034845388,0.00045766585,0.00037506415,0.0077760136,0.037403382],"genre_scores_gemma":[0.8711849,0.00016047304,0.12004484,0.00012655152,0.000029428082,0.000099298566,0.00014129373,0.00008559851,0.008127707],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9999349,0.000012013614,0.000003872482,0.000011578153,0.000022483955,0.000015185618],"domain_scores_gemma":[0.9999105,0.000025192927,0.000011467302,0.00001539415,0.000030202522,0.000007282196],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000087698056,0.00023134846,0.00010687177,0.0002514192,0.00013648655,0.00024392958,0.00044902237,0.00025256208,0.0038932355],"category_scores_gemma":[0.00023428877,0.00010038972,0.00010042888,0.00007341324,0.00008354168,0.00016314595,0.00007823731,0.00016954375,0.00057495385],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00086658815,0.00014495564,0.0038820377,0.0006115652,0.000101272766,0.0013650642,0.00029729863,0.018227927,0.6473823,0.0100672245,0.007434834,0.309619],"study_design_scores_gemma":[0.0005235998,0.004418021,0.014471624,0.00014280688,0.00019895054,0.0045731775,0.00013950648,0.25497162,0.6345836,0.0019044849,0.08400367,0.0000689395],"about_ca_topic_score_codex":0.00048697484,"about_ca_topic_score_gemma":0.0006704837,"teacher_disagreement_score":0.0038932355,"about_ca_system_score_codex":0.00019955134,"about_ca_system_score_gemma":0.00018606975,"threshold_uncertainty_score":0.013024151},"labels":[],"label_agreement":null},{"id":"W2148944278","doi":"10.1109/dcc.2005.60","title":"On Global Optimality of Gradient Descent Algorithms for Fixed-Rate Scalar Multiple Description Quantizer Design","year":2005,"lang":"en","type":"article","venue":"Data Compression Conference","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Scalar (mathematics); Mathematics; Regular polygon; Mathematical optimization; Fixed point; Algorithm; Applied mathematics; Mathematical analysis; Geometry","score_opus":0.214356975795677,"score_gpt":0.36711723763990983,"score_spread":0.15276026184423283,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2148944278","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005506469,0.00016336083,0.9923866,0.000095795585,0.00001521846,0.000026142396,0.000027799733,0.00008121813,0.0016974362],"genre_scores_gemma":[0.55127627,0.00079920545,0.44049114,0.00028784038,0.000102779224,0.00035623083,0.00027727906,0.00036108316,0.0060481415],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990221,0.00037498798,0.00005276338,0.00017355524,0.0002693778,0.000107146705],"domain_scores_gemma":[0.9966536,0.002289549,0.00021971515,0.00020398072,0.00056023145,0.0000729835],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00346934,0.0012783068,0.0014166719,0.00055435364,0.00044589903,0.0013756526,0.0009898202,0.0011596644,0.0030869232],"category_scores_gemma":[0.009969719,0.00067381054,0.0005804797,0.0005865817,0.0015516431,0.0022293641,0.001762915,0.0019142821,0.00066081266],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014862369,0.00004258441,0.00046961944,0.00015503177,0.000041211606,0.00007738526,0.0001228767,0.80839616,0.00486505,0.13357563,0.0017814401,0.050324347],"study_design_scores_gemma":[0.000016688662,0.000048363345,0.0000723976,0.000014569401,0.0000056132612,0.000019964382,0.000007571311,0.9778465,0.0014051368,0.020151654,0.00040327164,0.000008274987],"about_ca_topic_score_codex":0.001602954,"about_ca_topic_score_gemma":0.0014174025,"teacher_disagreement_score":0.00346934,"about_ca_system_score_codex":0.001012945,"about_ca_system_score_gemma":0.0013345878,"threshold_uncertainty_score":0.0183478},"labels":[],"label_agreement":null},{"id":"W2149018586","doi":"10.1109/wescan.1995.493969","title":"Adaptive compression of animated sequences","year":2002,"lang":"en","type":"article","venue":"","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"","keywords":"Computer science; Vector quantization; Data compression; Artificial intelligence; Artificial neural network; Data compression ratio; Compression (physics); Learning vector quantization; Image compression; Quantization (signal processing); Computer vision; Pattern recognition (psychology); Speech recognition; Image processing; Image (mathematics)","score_opus":0.047555439477023474,"score_gpt":0.27137002085616624,"score_spread":0.22381458137914276,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2149018586","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22697902,0.0010508655,0.761607,0.0002918702,0.00022272905,0.00011009516,0.00016679533,0.00076325994,0.0088083185],"genre_scores_gemma":[0.7635081,0.00070346333,0.22863396,0.00015946932,0.0001228914,0.00007737215,0.00039213235,0.00007468099,0.0063279592],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9998217,0.000034065906,0.000010810313,0.000024733961,0.000094549956,0.000014137544],"domain_scores_gemma":[0.99959594,0.00015858789,0.000038851293,0.00006454133,0.00012713434,0.000014955898],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023969302,0.0002226763,0.00018937998,0.0005049844,0.00015790608,0.0002386327,0.00032662536,0.00032846743,0.0013424513],"category_scores_gemma":[0.00149177,0.00007178828,0.00014117599,0.00054234185,0.00030381454,0.00040369874,0.00031904873,0.00033510407,0.00025176822],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00051537,0.000080244645,0.00089316507,0.00014446254,0.00003692815,0.00058665953,0.00023200898,0.10943446,0.2931507,0.018642856,0.002821225,0.57346195],"study_design_scores_gemma":[0.000023996952,0.00020397117,0.0017876101,0.000021391666,0.000014435755,0.0005368587,0.000046928315,0.87485725,0.1076858,0.0068982523,0.007900353,0.00002313699],"about_ca_topic_score_codex":0.00078621076,"about_ca_topic_score_gemma":0.0008890286,"teacher_disagreement_score":0.0013424513,"about_ca_system_score_codex":0.00020415835,"about_ca_system_score_gemma":0.0001579841,"threshold_uncertainty_score":0.004490912},"labels":[],"label_agreement":null},{"id":"W2149041852","doi":"10.1109/icassp.2012.6288537","title":"Joint entropy-scalable coding of audio signals","year":2012,"lang":"en","type":"article","venue":"","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Huffman coding; Computer science; Scalability; Entropy encoding; Tunstall coding; Entropy (arrow of time); Speech coding; Variable-length code; Coding (social sciences); Coding tree unit; Quantization (signal processing); Speech recognition; Decoding methods; Algorithm; Theoretical computer science; Data compression; Mathematics","score_opus":0.035788285748168315,"score_gpt":0.28234087618167997,"score_spread":0.24655259043351166,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2149041852","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.026598461,0.00030096289,0.9694642,0.00008631246,0.000050776638,0.000034300847,0.000103218,0.00048095107,0.0028808324],"genre_scores_gemma":[0.6989935,0.0004241694,0.29423153,0.00009801778,0.00010936759,0.00008762125,0.00042684906,0.00010843963,0.005520348],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9996201,0.000053345506,0.000016723034,0.000038296348,0.00023123401,0.000040435778],"domain_scores_gemma":[0.99951494,0.00016434764,0.000050100836,0.00012584374,0.00011624335,0.00002856179],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042327525,0.000418098,0.00038398447,0.00055558793,0.00018541713,0.00037393018,0.00052429666,0.00031953456,0.0017211648],"category_scores_gemma":[0.0014200216,0.0001481057,0.00028363583,0.00061868277,0.00041861067,0.0009856664,0.0010613393,0.0005529038,0.0003530579],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00039519547,0.00008391663,0.00056422385,0.00011687985,0.00003901176,0.00030757903,0.00011299327,0.24594285,0.26060522,0.07387459,0.0036201216,0.4143374],"study_design_scores_gemma":[0.000017410812,0.000072081,0.0003987372,0.000010406956,0.000011525823,0.00012054753,0.000010149332,0.93575215,0.04760917,0.013643076,0.002337082,0.000017657489],"about_ca_topic_score_codex":0.0008652725,"about_ca_topic_score_gemma":0.0017253106,"teacher_disagreement_score":0.0017211648,"about_ca_system_score_codex":0.0002694735,"about_ca_system_score_gemma":0.00041262124,"threshold_uncertainty_score":0.005757928},"labels":[],"label_agreement":null},{"id":"W2149506596","doi":"10.1109/iciap.2003.1234079","title":"Hierarchical modeling via optimal context quantization","year":2004,"lang":"en","type":"article","venue":"","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Computer science; Arithmetic coding; Algorithm; Entropy (arrow of time); Data compression; Quantization (signal processing); Data modeling; Context model; Entropy encoding; Statistical model; Data reduction; Artificial intelligence; Data mining; Context-adaptive binary arithmetic coding","score_opus":0.024831824477600326,"score_gpt":0.2870747359554681,"score_spread":0.26224291147786777,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2149506596","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012120827,0.00021898921,0.98639005,0.000097296244,0.000015880025,0.00002212297,0.00006910808,0.0002731472,0.0007925786],"genre_scores_gemma":[0.63659394,0.0004260116,0.36082023,0.00015207437,0.0000517557,0.00015631819,0.00031134032,0.000108493856,0.0013797965],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991673,0.0002660713,0.000040477713,0.00013654833,0.00030128958,0.000088269415],"domain_scores_gemma":[0.9991922,0.00038577834,0.00006111684,0.00018015532,0.00014933149,0.000031445048],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00082135847,0.0005347701,0.0007359855,0.0006182274,0.00041145843,0.00085518934,0.000959448,0.0006590406,0.0012631292],"category_scores_gemma":[0.0042340555,0.0003763789,0.0005802551,0.0007705498,0.00066565187,0.0016176562,0.001436813,0.0010694992,0.00025914342],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015243105,0.000039295504,0.0008394573,0.00007514832,0.000038991413,0.00013633061,0.00018326158,0.729422,0.009022641,0.13017844,0.0018473285,0.12806483],"study_design_scores_gemma":[0.000004900968,0.000009495277,0.00006949527,0.0000037398843,0.00000404349,0.000016821034,0.0000067297315,0.98091024,0.0010688261,0.017505035,0.00039496893,0.0000056605745],"about_ca_topic_score_codex":0.0048497254,"about_ca_topic_score_gemma":0.004902718,"teacher_disagreement_score":0.0048497254,"about_ca_system_score_codex":0.0007701552,"about_ca_system_score_gemma":0.0010223147,"threshold_uncertainty_score":0.009643018},"labels":[],"label_agreement":null},{"id":"W2149564831","doi":"10.1109/ccece.1993.332209","title":"A DSP realization of a CELP testbench","year":2002,"lang":"en","type":"article","venue":"","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"École de Technologie Supérieure; Université du Québec à Montréal","funders":"","keywords":"Code-excited linear prediction; Computer science; Realization (probability); Modular design; Software; Process (computing); Digital signal processing; Linear predictive coding; Code (set theory); Simple (philosophy); Computer hardware; Speech coding; Speech recognition; Programming language","score_opus":0.024562074566475352,"score_gpt":0.23824560795988897,"score_spread":0.21368353339341362,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2149564831","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.046027932,0.00018076318,0.91101736,0.0001490316,0.00017015237,0.0004997941,0.0010065238,0.020459136,0.02048928],"genre_scores_gemma":[0.6166087,0.00024854328,0.35583556,0.00030622695,0.000090082875,0.0011872929,0.0037908624,0.0017657988,0.020167032],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992471,0.00013538815,0.000056892222,0.00010789545,0.00036270884,0.00009004571],"domain_scores_gemma":[0.998544,0.00050180755,0.00008092641,0.00028596498,0.00050229166,0.00008501081],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00069898635,0.00074880465,0.00038622832,0.0008862671,0.00031693903,0.0009794576,0.0019512846,0.00067978003,0.015625553],"category_scores_gemma":[0.0024139672,0.0002730492,0.00023634371,0.0003229897,0.00034004482,0.0008102221,0.00048473722,0.0007612609,0.005054578],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0016050425,0.0005623506,0.0026522314,0.0011337353,0.00010807546,0.0020210603,0.000668287,0.053947974,0.4842764,0.037007388,0.016698847,0.3993186],"study_design_scores_gemma":[0.00038990035,0.0017728828,0.0016213057,0.00014739031,0.00006380841,0.0015344559,0.00010687426,0.26093107,0.63155854,0.0038642418,0.09793212,0.00007740362],"about_ca_topic_score_codex":0.00082212506,"about_ca_topic_score_gemma":0.00049640867,"teacher_disagreement_score":0.015625553,"about_ca_system_score_codex":0.00043441326,"about_ca_system_score_gemma":0.0007009512,"threshold_uncertainty_score":0.052272737},"labels":[],"label_agreement":null},{"id":"W2149567218","doi":"10.1109/tit.2009.2032831","title":"On Properties of Locally Optimal Multiple Description Scalar Quantizers With Convex Cells","year":2009,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":21,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Mathematics; Scalar (mathematics); Regular polygon; Uniqueness; Probability density function; Applied mathematics; Convex function; Convex optimization; Mathematical optimization; Discrete mathematics; Mathematical analysis; Statistics; Geometry","score_opus":0.01224115883879454,"score_gpt":0.21044769094134413,"score_spread":0.1982065321025496,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2149567218","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.043553974,0.0007855787,0.9459191,0.00031495976,0.0000226874,0.00006292002,0.00015783722,0.00012371605,0.009059167],"genre_scores_gemma":[0.87479883,0.0015844902,0.1153055,0.0002735552,0.00008482438,0.00026174638,0.0003616981,0.00021055773,0.0071188253],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989084,0.00031831666,0.00006849119,0.00015949254,0.00042416994,0.00012114694],"domain_scores_gemma":[0.995673,0.002944589,0.00042253427,0.00035467377,0.0005113989,0.00009366941],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022374294,0.00060127693,0.0010171541,0.0006878027,0.00044100208,0.001633009,0.00089134794,0.0006940891,0.0051150005],"category_scores_gemma":[0.010945104,0.0004698992,0.00049404014,0.0009878488,0.0018074429,0.0031619815,0.0016577013,0.0012743007,0.0006029196],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00025282346,0.00004622366,0.000870539,0.00023137986,0.000038789894,0.00024883,0.00039700003,0.26286218,0.019250583,0.6576422,0.0018956643,0.05626373],"study_design_scores_gemma":[0.000027170563,0.00010493088,0.00027303438,0.00004475522,0.0000131798615,0.00020344892,0.00010096474,0.84602535,0.007975818,0.14333993,0.0018572279,0.000034259527],"about_ca_topic_score_codex":0.0013037247,"about_ca_topic_score_gemma":0.0006553918,"teacher_disagreement_score":0.0051150005,"about_ca_system_score_codex":0.0012209336,"about_ca_system_score_gemma":0.0006987822,"threshold_uncertainty_score":0.017111361},"labels":[],"label_agreement":null},{"id":"W2149860554","doi":"10.1109/dcc.2008.57","title":"M-Channel Multiple Description Coding with Two-Rate Predictive Coding and Staggered Quantization","year":2008,"lang":"en","type":"article","venue":"DCC","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Encoder; Algorithm; Computer science; Quantization (signal processing); Entropy (arrow of time); Predictive coding; Variable-length code; Coding (social sciences); Bit rate; Entropy encoding; Decoding methods; Channel code; Mathematics; Statistics; Real-time computing; Physics","score_opus":0.03882110689853489,"score_gpt":0.25644651254309386,"score_spread":0.21762540564455896,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2149860554","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003061125,0.00054041675,0.9951933,0.00010109702,0.00004667331,0.000064851956,0.000058059617,0.00018755463,0.0007468762],"genre_scores_gemma":[0.18603517,0.00087213924,0.8088915,0.00019439078,0.00014619916,0.0002829652,0.00037779676,0.00004529315,0.0031545397],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991487,0.00027400794,0.00006227031,0.0000998815,0.00035108498,0.00006394428],"domain_scores_gemma":[0.99922323,0.00035058756,0.000081713646,0.00014186458,0.0001753196,0.000027311662],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011675206,0.0007428759,0.0010098005,0.0011067105,0.00039664307,0.0007732442,0.0017767332,0.0011007012,0.001698137],"category_scores_gemma":[0.0025058733,0.00034752997,0.0006530623,0.0018192433,0.00067853084,0.0014114253,0.0011461158,0.0013645971,0.00063692074],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004961485,0.00012816781,0.0005523246,0.0003442352,0.00009822967,0.0005078528,0.00015135527,0.2932387,0.02656948,0.15634134,0.0059291194,0.51564306],"study_design_scores_gemma":[0.000044980443,0.00007431427,0.000101343634,0.000023761282,0.000016905415,0.00019417629,0.000008419412,0.9756437,0.0076064435,0.013570313,0.0026834726,0.000032192245],"about_ca_topic_score_codex":0.0029518928,"about_ca_topic_score_gemma":0.0036873885,"teacher_disagreement_score":0.0029518928,"about_ca_system_score_codex":0.0006355809,"about_ca_system_score_gemma":0.0011204963,"threshold_uncertainty_score":0.0061745048},"labels":[],"label_agreement":null},{"id":"W2149875507","doi":"10.1109/ccece.1998.682709","title":"An information theoretic image-quality measure","year":2002,"lang":"en","type":"article","venue":"","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":26,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Lossy compression; Measure (data warehouse); Computer science; Artificial intelligence; Image quality; Image compression; Mean squared error; Encoding (memory); Representation (politics); Data compression; Image (mathematics); Information theory; Pattern recognition (psychology); Computer vision; Image processing; Mathematics; Data mining; Statistics","score_opus":0.0231913388971485,"score_gpt":0.299273327553619,"score_spread":0.2760819886564705,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2149875507","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012859981,0.004899057,0.97502875,0.0003558203,0.00023671547,0.000112685615,0.00040573959,0.0003412118,0.005760009],"genre_scores_gemma":[0.47965616,0.0040643676,0.50911117,0.00047536445,0.0007825436,0.00040063288,0.0013009121,0.00022264165,0.0039862343],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9948754,0.0010165471,0.0003484524,0.0005307547,0.003102327,0.00012665373],"domain_scores_gemma":[0.99317825,0.0026955816,0.0010728409,0.0007322978,0.0021087541,0.00021228046],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0036400554,0.001131261,0.0011117482,0.0043655746,0.00036718082,0.002475691,0.0013275753,0.0016963418,0.001948266],"category_scores_gemma":[0.0132196,0.00025883946,0.0005818984,0.0024262515,0.0020074178,0.0047856877,0.0015695916,0.0012675849,0.000821243],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00055448845,0.00030410508,0.0076514124,0.002105106,0.0006218419,0.0003986532,0.00035619256,0.10602359,0.093950056,0.27827093,0.011813502,0.4979501],"study_design_scores_gemma":[0.00009056149,0.0018266527,0.016804403,0.00046970023,0.0004105618,0.00402388,0.00033472668,0.63219225,0.06988789,0.22122069,0.05227639,0.0004622185],"about_ca_topic_score_codex":0.0003557071,"about_ca_topic_score_gemma":0.0002827338,"teacher_disagreement_score":0.0043655746,"about_ca_system_score_codex":0.0012119001,"about_ca_system_score_gemma":0.00062383467,"threshold_uncertainty_score":0.019250691},"labels":[],"label_agreement":null},{"id":"W2150364251","doi":"10.1109/tsp.2008.2010011","title":"Design and Analysis of a Successively Refinable Lattice Quantizer for i.i.d. Gaussian Sources","year":2008,"lang":"en","type":"article","venue":"IEEE Transactions on Signal Processing","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Gaussian; Algorithm; Independent and identically distributed random variables; Mathematics; Coding (social sciences); Computer science; Lattice (music); Applied mathematics; Theoretical computer science; Random variable; Statistics","score_opus":0.04953194908737637,"score_gpt":0.3000290351967437,"score_spread":0.25049708610936733,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2150364251","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0053925766,0.00022644238,0.9935423,0.000095185576,0.00001885612,0.000024827494,0.000031847652,0.00008109935,0.00058678724],"genre_scores_gemma":[0.39338008,0.00074825535,0.6019878,0.00018522624,0.00006644549,0.00020228467,0.00017190853,0.000049855247,0.0032080973],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99941206,0.00015299598,0.00003425905,0.00008809641,0.00027164628,0.000040905972],"domain_scores_gemma":[0.9989318,0.00050472777,0.00016272847,0.000111299,0.00023689705,0.000052486306],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010086664,0.0005598622,0.00057101547,0.0004433993,0.0002828465,0.0006508143,0.0008975198,0.0007953035,0.0016283767],"category_scores_gemma":[0.0027820268,0.00028438884,0.0003846971,0.0006309718,0.0007398941,0.0011016882,0.00073238055,0.0011398623,0.00043838896],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000414109,0.000056569796,0.0008429695,0.00016602261,0.00005604901,0.00017168261,0.00016812289,0.5317608,0.076021746,0.17112634,0.0023077196,0.21690778],"study_design_scores_gemma":[0.000015643926,0.00009561338,0.00006341883,0.0000089707155,0.0000065346867,0.00005347179,0.0000069321313,0.9880838,0.0064562433,0.0039898036,0.0012031469,0.000016443075],"about_ca_topic_score_codex":0.0017146374,"about_ca_topic_score_gemma":0.0015775062,"teacher_disagreement_score":0.0017146374,"about_ca_system_score_codex":0.000798165,"about_ca_system_score_gemma":0.0009928856,"threshold_uncertainty_score":0.0057911277},"labels":[],"label_agreement":null},{"id":"W2150866123","doi":"10.1109/pacrim.1989.48341","title":"Robust vector quantization based on spectral mapping with a noise estimate","year":2003,"lang":"en","type":"article","venue":"","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Linde–Buzo–Gray algorithm; Codebook; Vector quantization; Quantization (signal processing); Estimator; Computer science; Algorithm; Noise (video); Learning vector quantization; Artificial intelligence; Mathematics; Speech recognition; Pattern recognition (psychology); Statistics","score_opus":0.03037509912793654,"score_gpt":0.2604469709366611,"score_spread":0.23007187180872454,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2150866123","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0039891256,0.00021901548,0.99508697,0.00005605809,0.000028026037,0.000010094223,0.000013430187,0.0001806939,0.0004166891],"genre_scores_gemma":[0.36860985,0.0007505996,0.625836,0.0001451359,0.00012766491,0.00008537015,0.00019252537,0.00015695432,0.0040959176],"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9990884,0.00025724506,0.000056348283,0.00017910845,0.00036515234,0.000053803196],"domain_scores_gemma":[0.99918884,0.00039863662,0.00006819315,0.00014891558,0.00017205521,0.000023314207],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009776126,0.00048589584,0.0008434324,0.00051703834,0.00024402214,0.0009415621,0.00087600003,0.0007486259,0.0016277521],"category_scores_gemma":[0.004005852,0.00024078909,0.00036023612,0.0007372522,0.0007841323,0.0019794481,0.0011316754,0.00076389115,0.0005568332],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00030089606,0.000042211173,0.00030892267,0.00013854931,0.00004694648,0.000102736005,0.00014530406,0.4295654,0.033062033,0.124176905,0.0025647117,0.4095454],"study_design_scores_gemma":[0.000006900362,0.000032733267,0.00006654446,0.000008433828,0.0000055762016,0.000048798433,0.000011841056,0.97288877,0.0067311497,0.01889176,0.0012962029,0.000011320603],"about_ca_topic_score_codex":0.0013073288,"about_ca_topic_score_gemma":0.0008872878,"teacher_disagreement_score":0.0016277521,"about_ca_system_score_codex":0.0004886276,"about_ca_system_score_gemma":0.0005772785,"threshold_uncertainty_score":0.005445361},"labels":[],"label_agreement":null},{"id":"W2150895415","doi":"10.1109/acssc.2005.1599742","title":"Reversible Integer-to-Integer Wavelet Transforms With Improved Approximation Properties","year":2006,"lang":"en","type":"article","venue":"","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Wavelet transform; Integer (computer science); Wavelet; Algorithm; Mathematics; Coding (social sciences); Computer science; Discrete mathematics; Artificial intelligence; Statistics","score_opus":0.010168043160623905,"score_gpt":0.21089077257413186,"score_spread":0.20072272941350794,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2150895415","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03820812,0.0003329986,0.95409906,0.000114716575,0.00008039031,0.000033620217,0.00004857623,0.00035939526,0.0067231013],"genre_scores_gemma":[0.4331447,0.0010761363,0.55801463,0.00011718576,0.00011231534,0.000069251975,0.00021445,0.00019635714,0.0070549506],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998167,0.000026850685,0.000011680954,0.000021708149,0.00010110899,0.00002197883],"domain_scores_gemma":[0.9996371,0.00013302326,0.000061742685,0.00009469464,0.000054021697,0.000019414361],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005244301,0.00045781967,0.00035741722,0.00045906976,0.00018062841,0.0006608114,0.000594818,0.0003505614,0.0021872502],"category_scores_gemma":[0.0017041707,0.00021869387,0.00036868945,0.00071510876,0.0005147834,0.0012940161,0.00045074374,0.0010849362,0.00070076523],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00029509774,0.00013580328,0.0004934601,0.00023859007,0.00003340614,0.0005168819,0.00017898207,0.103071086,0.30068994,0.28865063,0.0018050373,0.30389097],"study_design_scores_gemma":[0.000049244718,0.00023519459,0.0004179365,0.0000235422,0.000039875635,0.00077385723,0.000060623242,0.7344598,0.22218844,0.029103972,0.012598403,0.000049122205],"about_ca_topic_score_codex":0.00021314996,"about_ca_topic_score_gemma":0.00042884776,"teacher_disagreement_score":0.0021872502,"about_ca_system_score_codex":0.00019521124,"about_ca_system_score_gemma":0.00024497558,"threshold_uncertainty_score":0.007317066},"labels":[],"label_agreement":null},{"id":"W2151122300","doi":"10.1109/ism.2006.18","title":"Adaptive Multi-Path Video Streaming","year":2006,"lang":"en","type":"article","venue":"","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Computer science; Codec; Real-time computing; Coding (social sciences); Decoding methods; Multiview Video Coding; Video processing; Channel (broadcasting); Multiple description coding; Path (computing); Video streaming; Group of pictures; Video compression picture types; Computer network; Video tracking; Algorithm; Computer vision; Computer hardware","score_opus":0.019044211987558915,"score_gpt":0.26774785790440714,"score_spread":0.24870364591684824,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2151122300","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10701667,0.0029840977,0.8853518,0.0001855997,0.00012519943,0.00040449318,0.00011627432,0.000699484,0.0031162922],"genre_scores_gemma":[0.6999933,0.0015922079,0.29513553,0.00014314917,0.00007540143,0.0002062089,0.00021332967,0.000051355015,0.0025894726],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99942434,0.00009174485,0.000017768227,0.000061330466,0.00036933634,0.000035539586],"domain_scores_gemma":[0.9985721,0.0005405879,0.0002120361,0.000156154,0.0004535389,0.00006556656],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005284935,0.0004698381,0.0004703933,0.00061357074,0.00022867798,0.00041549082,0.00084777334,0.00052286184,0.0008176839],"category_scores_gemma":[0.0020526757,0.00015473858,0.0001781352,0.00061400916,0.0003655998,0.000772582,0.00035672195,0.00073642255,0.00022481041],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005232829,0.00029777657,0.005332759,0.00054573425,0.0001729248,0.00043157567,0.00014921727,0.18715988,0.24833713,0.027182873,0.0025402922,0.5273266],"study_design_scores_gemma":[0.000033534507,0.00036153806,0.0014068448,0.00001665308,0.000023098495,0.00054270803,0.000024967307,0.9252935,0.065484405,0.0027234931,0.0040577534,0.000031418145],"about_ca_topic_score_codex":0.0016748188,"about_ca_topic_score_gemma":0.0017540216,"teacher_disagreement_score":0.0016748188,"about_ca_system_score_codex":0.00062461256,"about_ca_system_score_gemma":0.0005732004,"threshold_uncertainty_score":0.00453192},"labels":[],"label_agreement":null},{"id":"W2151280457","doi":"10.1109/ccece.2004.1347662","title":"A linear decoder for vector quantization over a CDMA channel","year":2004,"lang":"en","type":"article","venue":"","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Saskatchewan","funders":"","keywords":"Decoding methods; Soft-decision decoder; Computer science; Code division multiple access; Algorithm; Multiuser detection; Channel (broadcasting); Encoder; Vector quantization; Computational complexity theory; Quantization (signal processing); Telecommunications","score_opus":0.02641125952846233,"score_gpt":0.3188468360864214,"score_spread":0.29243557655795904,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2151280457","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0045500677,0.00048247376,0.992065,0.00021292665,0.000040597086,0.000031581363,0.00007817984,0.0002788294,0.0022602915],"genre_scores_gemma":[0.43812504,0.0011505592,0.5435897,0.0003014455,0.00013988662,0.0001577664,0.00033242974,0.000070375114,0.016132778],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993094,0.0002165512,0.0000353529,0.00011049621,0.000274178,0.000053964755],"domain_scores_gemma":[0.99932647,0.00036589307,0.000057930414,0.000067709036,0.0001605804,0.000021513773],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006285159,0.00036230244,0.00052073336,0.00028439943,0.00035902997,0.00089693285,0.0006333671,0.0008322738,0.00317826],"category_scores_gemma":[0.0018298391,0.0002312263,0.00020404861,0.0005589928,0.00044365597,0.00096236024,0.00068679824,0.00085086847,0.0011640902],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002021525,0.000067707704,0.00061922707,0.00036906262,0.00005208075,0.00029848664,0.00017581253,0.4725354,0.024470186,0.16034363,0.00940677,0.33145943],"study_design_scores_gemma":[0.000022563238,0.00005998129,0.00006971408,0.00001539156,0.000012370947,0.00012061665,0.000016409893,0.97262007,0.0058286972,0.017456027,0.0037625327,0.00001560896],"about_ca_topic_score_codex":0.0020153949,"about_ca_topic_score_gemma":0.003190256,"teacher_disagreement_score":0.00317826,"about_ca_system_score_codex":0.0006689994,"about_ca_system_score_gemma":0.0016156405,"threshold_uncertainty_score":0.010632396},"labels":[],"label_agreement":null},{"id":"W2151333624","doi":"10.1109/icassp.2005.1416038","title":"A Speech Coder Post-Processor Controlled By Side-Information","year":2006,"lang":"en","type":"article","venue":"","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Sherbrooke","funders":"","keywords":"Codec2; Speech coding; Computer science; Encoder; Codec; Speech recognition; Speech enhancement; Voice activity detection; Linear predictive coding; Speech processing; Adaptive Multi-Rate audio codec; Encoding (memory); PSQM; Quality (philosophy); Artificial intelligence; Computer hardware; Noise reduction","score_opus":0.0037819247769028948,"score_gpt":0.23068805419238886,"score_spread":0.22690612941548596,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2151333624","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09849282,0.0005331585,0.89172935,0.00013999213,0.00026358498,0.00020548448,0.0001421979,0.0038294755,0.0046638176],"genre_scores_gemma":[0.4656736,0.00043696008,0.5134047,0.00036144443,0.0003075829,0.00020509704,0.00035518725,0.00035603065,0.018899307],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996922,0.000037825812,0.000025954641,0.000072650604,0.00014219155,0.000029171013],"domain_scores_gemma":[0.9989505,0.00031450414,0.00010349202,0.00018527557,0.00039826112,0.0000480486],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042477122,0.0005669441,0.00059523934,0.00040848777,0.00021986783,0.0004849466,0.000660327,0.00065479614,0.0034767073],"category_scores_gemma":[0.0010092951,0.00022004903,0.00029913397,0.00021896826,0.0002711771,0.00045622262,0.00033791596,0.0008338836,0.0029172488],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00065694685,0.00008783147,0.0005742356,0.00015944897,0.00003991725,0.0003111676,0.000047799116,0.0023679326,0.8362521,0.0017069353,0.00087796553,0.15691772],"study_design_scores_gemma":[0.000068399764,0.00053567387,0.0019885642,0.000024231827,0.00008508772,0.0012751704,0.0000120008535,0.10300067,0.88315725,0.00038847758,0.009439462,0.000025022066],"about_ca_topic_score_codex":0.00030346573,"about_ca_topic_score_gemma":0.0006888962,"teacher_disagreement_score":0.0034767073,"about_ca_system_score_codex":0.00016226273,"about_ca_system_score_gemma":0.00029727322,"threshold_uncertainty_score":0.011630774},"labels":[],"label_agreement":null},{"id":"W2151433294","doi":"10.1109/scft.1993.762328","title":"Smooth Speech Reconstruction Using Prototype Waveform Interpolation","year":2005,"lang":"en","type":"article","venue":"","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Institut National de la Recherche Scientifique; McGill University","funders":"","keywords":"Waveform; Interpolation (computer graphics); Computer science; Speech recognition; Speech coding; Linear predictive coding; Speech processing; Speech synthesis; Coding (social sciences); Artificial intelligence; Mathematics; Telecommunications","score_opus":0.026564981064054315,"score_gpt":0.29851567181218414,"score_spread":0.27195069074812983,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2151433294","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.051241655,0.0001621039,0.9453166,0.00006350175,0.000047218447,0.00004074388,0.000045225774,0.0008709365,0.002212046],"genre_scores_gemma":[0.37368798,0.000278608,0.62184626,0.00004213572,0.00003753273,0.000052357656,0.00020909295,0.00011335535,0.0037326713],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99980646,0.000042465228,0.00001292964,0.00003317829,0.00008787385,0.000017196278],"domain_scores_gemma":[0.999453,0.00018122104,0.000044962508,0.00016873497,0.00012641883,0.00002571232],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044002052,0.00033336997,0.00031284775,0.00043454705,0.00020181728,0.00042694758,0.00045602652,0.00040402944,0.0016061601],"category_scores_gemma":[0.0015361886,0.00018841746,0.0002837551,0.00039544603,0.00033050354,0.0006247912,0.00061737094,0.0006024032,0.0005978246],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008685435,0.000069109265,0.000646881,0.0001602222,0.00003152613,0.00034201748,0.00023904351,0.047878835,0.37252134,0.022427402,0.0014771407,0.5533379],"study_design_scores_gemma":[0.00007613823,0.00040606418,0.0008446003,0.000027195785,0.000023895413,0.0008726686,0.000054671076,0.746572,0.23755841,0.0064617377,0.0070491577,0.000053423973],"about_ca_topic_score_codex":0.00036495467,"about_ca_topic_score_gemma":0.00038226566,"teacher_disagreement_score":0.0016061601,"about_ca_system_score_codex":0.00013520739,"about_ca_system_score_gemma":0.00022804351,"threshold_uncertainty_score":0.00537318},"labels":[],"label_agreement":null},{"id":"W2151650368","doi":"10.1109/igarss.2002.1026137","title":"Quantitative evaluation of hyperspectral data compressed by near lossless onboard compression techniques","year":2003,"lang":"en","type":"article","venue":"","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"Canadian Space Agency","funders":"","keywords":"Hyperspectral imaging; Lossless compression; Remote sensing; Data cube; Compressed sensing; Data compression; Computer science; Compression (physics); Compression ratio; Artificial intelligence; Geology; Data mining; Engineering; Materials science","score_opus":0.10940770123696839,"score_gpt":0.38867921330216665,"score_spread":0.2792715120651983,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2151650368","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.958104,0.0005866322,0.0375477,0.00013118326,0.000052357856,0.00007264968,0.00041249074,0.00023649112,0.0028565207],"genre_scores_gemma":[0.9604818,0.0005091731,0.035095282,0.000081267564,0.000050234554,0.00006667671,0.0011266965,0.00008681466,0.0025020202],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999151,0.00011514092,0.000028462979,0.000051230483,0.00060541916,0.00004872301],"domain_scores_gemma":[0.9961266,0.0018092381,0.00030231368,0.00028298007,0.0014034905,0.000075408585],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010005516,0.00040069167,0.00018010818,0.0012204952,0.0002365155,0.00039567307,0.00034343734,0.00035001273,0.0023738344],"category_scores_gemma":[0.00403384,0.000082616825,0.00013742407,0.00141831,0.00069302466,0.00086095976,0.00033535063,0.00027793634,0.00019187188],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0018412644,0.00029230397,0.0046954434,0.00033086483,0.000060425667,0.00026059203,0.0003693136,0.019907424,0.78863025,0.0011213045,0.00086620473,0.18162464],"study_design_scores_gemma":[0.00007140577,0.0015734802,0.041200228,0.00004276938,0.00007017995,0.0006181171,0.0005057105,0.11656213,0.83533895,0.00085426593,0.0031007978,0.000061996114],"about_ca_topic_score_codex":0.0013460283,"about_ca_topic_score_gemma":0.0015864666,"teacher_disagreement_score":0.0023738344,"about_ca_system_score_codex":0.00035121987,"about_ca_system_score_gemma":0.0001488382,"threshold_uncertainty_score":0.007941306},"labels":[],"label_agreement":null},{"id":"W2152116756","doi":"10.1109/icassp.2006.1660942","title":"DESIGn of Multiple Description Predictive Vector Quantizers","year":2006,"lang":"en","type":"article","venue":"","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"","keywords":"Linear prediction; Computer science; Vector quantization; Residual; Algorithm; Speech coding; Simple (philosophy); Linear predictive coding; Markov process; Encoding (memory); Channel (broadcasting); Markov chain; Speech recognition; Pattern recognition (psychology); Artificial intelligence; Mathematics; Machine learning; Statistics","score_opus":0.030948995597661077,"score_gpt":0.25552098540355095,"score_spread":0.22457198980588988,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2152116756","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0023272126,0.00020726892,0.99622643,0.00008830436,0.000038891012,0.00006050698,0.00003949494,0.00033394404,0.00067795534],"genre_scores_gemma":[0.40916127,0.00046138433,0.58575714,0.00021205298,0.00010129123,0.00049081777,0.00023000315,0.00006818008,0.0035178368],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991597,0.00015278635,0.00005821346,0.00018291782,0.00038097,0.00006543356],"domain_scores_gemma":[0.99912256,0.00031622945,0.00010535017,0.000104458675,0.00032467628,0.00002663141],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014098167,0.00063293474,0.0008249493,0.00037709612,0.0004022708,0.00094813155,0.001727383,0.0009648734,0.002919855],"category_scores_gemma":[0.0029281098,0.00044862126,0.00029540714,0.0004784053,0.00055913825,0.0010364042,0.00072128297,0.0012913758,0.0007482201],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002801181,0.00008332805,0.0004936054,0.00026918948,0.00006932113,0.0001450928,0.0001085806,0.46323887,0.03013309,0.052114815,0.0047474545,0.44831663],"study_design_scores_gemma":[0.00003037111,0.00006888857,0.00006961544,0.000012667713,0.000013016789,0.000030947926,0.0000064612727,0.9847114,0.009255634,0.0035186617,0.002270675,0.000011623992],"about_ca_topic_score_codex":0.0019867558,"about_ca_topic_score_gemma":0.0024022176,"teacher_disagreement_score":0.002919855,"about_ca_system_score_codex":0.0007470314,"about_ca_system_score_gemma":0.0011161641,"threshold_uncertainty_score":0.00976789},"labels":[],"label_agreement":null},{"id":"W2152176337","doi":"10.1109/ijcnn.1993.716929","title":"Design optimization of code-excited neural vector quantizers","year":2005,"lang":"en","type":"article","venue":"","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Vector quantization; Codebook; Linde–Buzo–Gray algorithm; Simulated annealing; Algorithm; Computer science; Data compression; Maxima and minima; Encoding (memory); Mathematics; Mathematical optimization; Artificial intelligence","score_opus":0.037129221040965034,"score_gpt":0.2943574127782102,"score_spread":0.25722819173724515,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2152176337","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010279226,0.00028118826,0.9867193,0.00008880815,0.000020581618,0.000049044615,0.000028395889,0.000104387604,0.0024291317],"genre_scores_gemma":[0.59213054,0.00052630604,0.401536,0.00014016843,0.000033979202,0.00042531258,0.00013556909,0.00006920468,0.005002941],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996283,0.000092383685,0.00002100424,0.00007545769,0.00015355276,0.000029303708],"domain_scores_gemma":[0.999522,0.00021813602,0.00006046239,0.000024867728,0.00016463132,0.000009962609],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00075305643,0.0004304986,0.00053151115,0.00032067564,0.00022856181,0.0006212143,0.00061014877,0.00068851886,0.0012110249],"category_scores_gemma":[0.0020777795,0.00025251563,0.00019536001,0.00048830913,0.00048286104,0.0006530455,0.00043086812,0.0005078384,0.00024018099],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005319152,0.000022455964,0.00026398108,0.00011920037,0.000020566857,0.000031652708,0.00007703188,0.86759335,0.010471351,0.026564876,0.0009962043,0.09378619],"study_design_scores_gemma":[0.000006983328,0.000019541681,0.000050873034,0.0000066456287,0.0000033860108,0.000008615105,0.0000063701427,0.9940948,0.0023145054,0.002739395,0.0007447388,0.000004127069],"about_ca_topic_score_codex":0.0019172581,"about_ca_topic_score_gemma":0.0022298712,"teacher_disagreement_score":0.0019172581,"about_ca_system_score_codex":0.00072102004,"about_ca_system_score_gemma":0.000767586,"threshold_uncertainty_score":0.0052313805},"labels":[],"label_agreement":null},{"id":"W2152831535","doi":"10.1109/isit.2008.4595488","title":"Optimal quantization for noisy channels with random index assignment","year":2008,"lang":"en","type":"article","venue":"","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Quantization (signal processing); Algorithm; Vector quantization; Channel (broadcasting); Sigma; Computer science; Decoding methods; Coding (social sciences); Mathematics; Statistics; Telecommunications","score_opus":0.02465629865230943,"score_gpt":0.2683787751388403,"score_spread":0.24372247648653086,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2152831535","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011523948,0.0003498625,0.9869871,0.00014003893,0.000023337172,0.000021604792,0.000036985897,0.00010719282,0.00080997165],"genre_scores_gemma":[0.79001904,0.0007572339,0.20613736,0.00017737359,0.000092955765,0.00014215852,0.00015617392,0.000071478105,0.002446248],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997322,0.0011262409,0.0001284971,0.000478395,0.00070786866,0.000236977],"domain_scores_gemma":[0.9953694,0.0031426137,0.00051325903,0.00030660842,0.00057829794,0.000089779984],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025919518,0.0007222046,0.0011076275,0.0005078551,0.00040425986,0.0012038575,0.0008670965,0.00079414144,0.0010509684],"category_scores_gemma":[0.011899381,0.00050587155,0.00028276801,0.00083349156,0.0014557663,0.0022524493,0.001187052,0.0009832536,0.00031120807],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00032542873,0.000032510856,0.0005490306,0.00014007925,0.000038515547,0.0000620207,0.000108122185,0.8477194,0.006139051,0.0859018,0.00090365706,0.058080427],"study_design_scores_gemma":[0.000018544088,0.00003546748,0.000071754184,0.00001065128,0.0000060272723,0.00001932951,0.000009896474,0.9740021,0.0014810427,0.023912217,0.00042227915,0.000010740072],"about_ca_topic_score_codex":0.0023976613,"about_ca_topic_score_gemma":0.001791807,"teacher_disagreement_score":0.0025919518,"about_ca_system_score_codex":0.001431578,"about_ca_system_score_gemma":0.0014532227,"threshold_uncertainty_score":0.013707697},"labels":[],"label_agreement":null},{"id":"W2152853272","doi":"10.1109/vetec.1998.686532","title":"Coding with dynamic rate control for low-delay image transmission over CDMA fading channels","year":2002,"lang":"en","type":"article","venue":"","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Institut National de la Recherche Scientifique; McGill University","funders":"","keywords":"Computer science; Fading; Rayleigh fading; Channel (broadcasting); Transmission (telecommunications); Transmission delay; Real-time computing; Computer network; Telecommunications","score_opus":0.011406428627529016,"score_gpt":0.25785001116125716,"score_spread":0.24644358253372814,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2152853272","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04918465,0.0005247005,0.94824666,0.00014676408,0.00004514881,0.000067573674,0.000015131354,0.0003055584,0.001463806],"genre_scores_gemma":[0.8569617,0.0005180061,0.14069663,0.00008506803,0.00007666444,0.00013567049,0.00003457132,0.000041647356,0.0014501623],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99953985,0.00013723422,0.000024431898,0.000050911272,0.00019612336,0.000051484876],"domain_scores_gemma":[0.9986065,0.0007645526,0.00020569775,0.00017718918,0.00021715862,0.000028987997],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008704022,0.00037771298,0.0002547515,0.00041980995,0.00025575882,0.0004581882,0.0006112188,0.0003793842,0.0005056481],"category_scores_gemma":[0.0036919094,0.00014833028,0.00014932493,0.00036149233,0.00073921116,0.0005810515,0.000506557,0.00060706225,0.00014503626],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007123287,0.00012283117,0.0010323954,0.00023341138,0.000048298716,0.00044554885,0.0005111013,0.47650248,0.20548262,0.10685846,0.0012793054,0.20677118],"study_design_scores_gemma":[0.00005318304,0.0001618588,0.00026592053,0.000021902968,0.000025339892,0.00014147804,0.000021967944,0.95772874,0.030989189,0.008770798,0.0017905544,0.00002917263],"about_ca_topic_score_codex":0.0017265815,"about_ca_topic_score_gemma":0.0019980958,"teacher_disagreement_score":0.0017265815,"about_ca_system_score_codex":0.00045064473,"about_ca_system_score_gemma":0.00057947665,"threshold_uncertainty_score":0.004603207},"labels":[],"label_agreement":null},{"id":"W2152857335","doi":"10.1109/iscas.1992.230506","title":"Generalized product codes: a framework for the design of structured vector quantizers","year":2003,"lang":"en","type":"article","venue":"","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Codebook; Computer science; Generality; Encoding (memory); Theoretical computer science; Code (set theory); Source code; Class (philosophy); Product (mathematics); Algorithm; Artificial intelligence; Computer engineering; Programming language; Mathematics","score_opus":0.05100918443996795,"score_gpt":0.3253674354673388,"score_spread":0.2743582510273709,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2152857335","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0008518525,0.00018918983,0.99726105,0.000052324613,0.000021773943,0.000028391536,0.000036550315,0.0001384883,0.0014204091],"genre_scores_gemma":[0.115362205,0.0011609616,0.87480736,0.00020197956,0.000104797306,0.00038305525,0.000277129,0.00020513739,0.0074973763],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99893016,0.00034541343,0.0000552042,0.00012729343,0.0004809881,0.000060956423],"domain_scores_gemma":[0.99911577,0.00032885637,0.000069231995,0.00016857157,0.00029044037,0.000027091453],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012487462,0.0008460029,0.0005810526,0.00073021586,0.00035846158,0.0015095752,0.0017211091,0.0011357556,0.0042965147],"category_scores_gemma":[0.003143704,0.00048434237,0.0005754037,0.00090654625,0.0013238026,0.0018648267,0.0010988854,0.0013502146,0.0013849522],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010823035,0.000025800688,0.00021597954,0.00020165651,0.000043726475,0.00015153251,0.00017862694,0.23388161,0.01071787,0.5842813,0.005540874,0.16465278],"study_design_scores_gemma":[0.000040088264,0.00013674713,0.00006920437,0.000051484752,0.00001805235,0.0002170955,0.000027009277,0.7961017,0.0050682668,0.17380525,0.024438787,0.000026380916],"about_ca_topic_score_codex":0.0019162219,"about_ca_topic_score_gemma":0.0023009486,"teacher_disagreement_score":0.0042965147,"about_ca_system_score_codex":0.00080669945,"about_ca_system_score_gemma":0.0011139138,"threshold_uncertainty_score":0.014373243},"labels":[],"label_agreement":null},{"id":"W2152889529","doi":"10.1109/dcc.2011.50","title":"High-Fidelity Image Compression for High-Throughput and Energy-Efficient Cameras","year":2011,"lang":"en","type":"article","venue":"","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Encoder; Codec; Computer science; Image compression; Algorithm; High fidelity; Pixel; JPEG; Computational complexity theory; Data compression; Theoretical computer science; Image (mathematics); Artificial intelligence; Image processing; Computer hardware; Engineering","score_opus":0.02450415539881833,"score_gpt":0.2677989003088621,"score_spread":0.24329474491004377,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2152889529","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.032752078,0.0004759413,0.96247977,0.0002476563,0.00003861212,0.00004721017,0.0000679676,0.00035372627,0.0035370553],"genre_scores_gemma":[0.5797591,0.00084886653,0.41341865,0.0001772914,0.0000932575,0.00007954456,0.00016492927,0.000080020705,0.0053784107],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997545,0.000032830598,0.000007739051,0.000031494325,0.00015696425,0.00001646339],"domain_scores_gemma":[0.9997044,0.00008274359,0.000050099625,0.00007467273,0.00007136747,0.000016749744],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002782524,0.00038758732,0.00031323457,0.00023575811,0.00021422982,0.0005646769,0.0006955963,0.00047012034,0.0014883674],"category_scores_gemma":[0.0009750903,0.00017258192,0.0001645456,0.000352131,0.00033829792,0.0009393458,0.000533874,0.000678257,0.0004267069],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00028674514,0.00018966584,0.000998128,0.00027601136,0.000052551644,0.00055750675,0.00016691866,0.18864717,0.42756477,0.06608542,0.00542956,0.30974555],"study_design_scores_gemma":[0.000022506887,0.00010090976,0.000631484,0.00002017581,0.0000127749545,0.00037539928,0.000023112696,0.86108726,0.12699369,0.006993123,0.0037144087,0.000025196998],"about_ca_topic_score_codex":0.00065679866,"about_ca_topic_score_gemma":0.0013874533,"teacher_disagreement_score":0.0014883674,"about_ca_system_score_codex":0.00038678525,"about_ca_system_score_gemma":0.0003833623,"threshold_uncertainty_score":0.004979074},"labels":[],"label_agreement":null},{"id":"W2153450807","doi":"10.1109/dcc.2003.1194074","title":"Soft-decoding based vector quantization for hidden-Markov channels","year":2003,"lang":"en","type":"article","venue":"","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"","keywords":"Fading; Decoding methods; Rayleigh fading; Algorithm; Computer science; Vector quantization; Hidden Markov model; Markov process; Channel (broadcasting); Markov model; Minimum mean square error; Channel state information; Markov chain; Speech recognition; Wireless; Mathematics; Telecommunications; Statistics","score_opus":0.03082896390473764,"score_gpt":0.2968498563786044,"score_spread":0.26602089247386673,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2153450807","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009783978,0.0013502827,0.9851893,0.00027577137,0.00020101096,0.000051700103,0.00013433435,0.00050345657,0.0025101977],"genre_scores_gemma":[0.665432,0.0024153057,0.32092842,0.00023146404,0.0003020908,0.0001731507,0.000587402,0.00011403968,0.009816141],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993643,0.00020376005,0.000041493797,0.0000795446,0.0002608851,0.000050058803],"domain_scores_gemma":[0.99831617,0.0011011653,0.00009493548,0.00019289769,0.00026530767,0.000029564106],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00071798154,0.0005093912,0.00072836026,0.00033750385,0.00030191257,0.00080176187,0.00072003884,0.00056480337,0.0049342797],"category_scores_gemma":[0.0040599257,0.00018898908,0.00021697166,0.0007549742,0.0006383732,0.0009204329,0.0005443622,0.00087488943,0.0010918014],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00026215476,0.000045389705,0.00046745638,0.00033571926,0.000040367628,0.00016522057,0.00012408943,0.5455135,0.007522297,0.10704833,0.0077735325,0.33070195],"study_design_scores_gemma":[0.000008691451,0.000028154234,0.000053486026,0.000014552542,0.0000052529726,0.00003580838,0.000007309965,0.98239094,0.0021032481,0.013794118,0.0015490656,0.000009375624],"about_ca_topic_score_codex":0.0026608254,"about_ca_topic_score_gemma":0.0028771576,"teacher_disagreement_score":0.0049342797,"about_ca_system_score_codex":0.0006236272,"about_ca_system_score_gemma":0.0007822802,"threshold_uncertainty_score":0.016506791},"labels":[],"label_agreement":null},{"id":"W2153832262","doi":"10.1109/icassp.2004.1326634","title":"On turbo-compression and modeling of black and white images","year":2004,"lang":"en","type":"article","venue":"","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Lossless compression; Turbo code; Image compression; Computer science; Entropy encoding; Pixel; Data compression; Algorithm; Color Cell Compression; Entropy (arrow of time); Artificial intelligence; Turbo; Computer vision; Image (mathematics); Image processing; Decoding methods; Engineering","score_opus":0.01629042248092917,"score_gpt":0.2746717677506756,"score_spread":0.25838134526974643,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2153832262","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.041294344,0.00094528066,0.9540144,0.00023117472,0.00003959356,0.00002457164,0.00005812937,0.00012698391,0.0032655362],"genre_scores_gemma":[0.92658794,0.0030167643,0.063112535,0.00011193956,0.00013478429,0.0000679427,0.00012422382,0.000067131165,0.006776705],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996964,0.00010159273,0.0000106496855,0.000031972937,0.00012994702,0.000029547551],"domain_scores_gemma":[0.9986357,0.0009215791,0.00013754096,0.00008053164,0.00019420427,0.000030461077],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006189187,0.0005317448,0.00053563295,0.0005694233,0.00021787304,0.0005993256,0.0005981922,0.00088680437,0.0006593321],"category_scores_gemma":[0.0034752602,0.0002929346,0.00050342747,0.0007750386,0.0011711195,0.0012517311,0.00042389304,0.00074378366,0.00028413598],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000031156924,0.00001096696,0.00020338404,0.000030753577,0.000010815916,0.00010185358,0.000045762084,0.95849913,0.0023116,0.029827911,0.00026443132,0.008662174],"study_design_scores_gemma":[6.589788e-7,0.000005507563,0.000046443372,0.0000021313888,0.0000013855939,0.000019905445,0.0000021285246,0.9952573,0.00037656768,0.0042051873,0.000079355545,0.0000034371997],"about_ca_topic_score_codex":0.00517621,"about_ca_topic_score_gemma":0.0026404685,"teacher_disagreement_score":0.00517621,"about_ca_system_score_codex":0.0005882047,"about_ca_system_score_gemma":0.0004494842,"threshold_uncertainty_score":0.010292172},"labels":[],"label_agreement":null},{"id":"W2153957340","doi":"10.1109/icip.2009.5413873","title":"Modified H.264 intra prediction for compression of video and images captured with a color filter array","year":2009,"lang":"en","type":"article","venue":"","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Bayer filter; Color filter array; Artificial intelligence; Color gel; Computer vision; Computer science; Pixel; Filter (signal processing); Channel (broadcasting); Data compression; Color image; Image (mathematics); Image processing; Materials science; Telecommunications; Layer (electronics)","score_opus":0.012600990564530519,"score_gpt":0.253218920470695,"score_spread":0.24061792990616448,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2153957340","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10305314,0.0023852459,0.88047224,0.0003249193,0.00038120933,0.00032808093,0.00068678235,0.0028272178,0.009541124],"genre_scores_gemma":[0.4236115,0.00165624,0.54828393,0.00028184376,0.00024000548,0.00022701538,0.0015056806,0.00029579725,0.02389789],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997782,0.00002484281,0.000010144648,0.00002588995,0.00013848954,0.000022387792],"domain_scores_gemma":[0.99975854,0.000033949404,0.00002164766,0.000034797045,0.00013953839,0.000011453734],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002664113,0.0004979275,0.00026598544,0.00048306768,0.00022042975,0.00020941674,0.0005194271,0.0003090058,0.001973607],"category_scores_gemma":[0.0006586607,0.00011349859,0.00023832734,0.0003914215,0.00015097643,0.00027156572,0.00018142433,0.0005276295,0.0007405423],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010125515,0.00014814174,0.0008377056,0.00022120427,0.00004943781,0.00041784043,0.000116669224,0.014641044,0.45287496,0.0050376216,0.010500756,0.5141421],"study_design_scores_gemma":[0.00015400442,0.0011338558,0.009780665,0.000076826866,0.0001172118,0.0014780428,0.000062975676,0.5335307,0.4092542,0.0030340445,0.041258615,0.00011895207],"about_ca_topic_score_codex":0.0034480745,"about_ca_topic_score_gemma":0.0065415055,"teacher_disagreement_score":0.0034480745,"about_ca_system_score_codex":0.00031253716,"about_ca_system_score_gemma":0.00047332092,"threshold_uncertainty_score":0.0068560243},"labels":[],"label_agreement":null},{"id":"W2154006840","doi":"10.1109/scft.2000.878415","title":"Index assignment for predictive wideband LSF quantization","year":2002,"lang":"en","type":"article","venue":"","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Sherbrooke","funders":"","keywords":"Vector quantization; Wideband; Encoder; Wideband audio; Algorithm; Entropy (arrow of time); Autoregressive model; Speech recognition; Computer science; Quantization (signal processing); Channel (broadcasting); Autoregressive–moving-average model; Mathematics; Binary number; Speech coding; Statistics; Telecommunications; Engineering; Electronic engineering; Arithmetic; Audio signal","score_opus":0.02893555724250846,"score_gpt":0.2711066525209188,"score_spread":0.24217109527841035,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2154006840","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01062101,0.00045445558,0.9850974,0.00014042642,0.000056362318,0.00002909721,0.000057488163,0.00030560413,0.0032380037],"genre_scores_gemma":[0.65540826,0.0007255485,0.33741775,0.00022928955,0.00020763991,0.00015670151,0.000255821,0.00013070383,0.005468286],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99940896,0.00012400263,0.00003807005,0.00007314613,0.00030974255,0.000045993736],"domain_scores_gemma":[0.9992797,0.00034169716,0.000066417466,0.00013885535,0.000154013,0.000019296318],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007134301,0.00030782993,0.00042831645,0.00040112622,0.0004017521,0.00078835833,0.00073358964,0.00047726,0.002968943],"category_scores_gemma":[0.004914459,0.00014044931,0.000106075575,0.0005768764,0.000549342,0.0015088861,0.0007064379,0.00075872673,0.00053796277],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00033049242,0.00006119305,0.0003901682,0.00012891972,0.000013328399,0.00009966705,0.00019006549,0.23810047,0.019413188,0.2837463,0.0039914777,0.45353466],"study_design_scores_gemma":[0.000017005772,0.00005686757,0.00010616634,0.000020817397,0.000005765691,0.00006361127,0.0000211699,0.885243,0.007947512,0.10235122,0.0041533653,0.000013516265],"about_ca_topic_score_codex":0.0008875482,"about_ca_topic_score_gemma":0.0010775678,"teacher_disagreement_score":0.002968943,"about_ca_system_score_codex":0.0006115996,"about_ca_system_score_gemma":0.000454327,"threshold_uncertainty_score":0.009932101},"labels":[],"label_agreement":null},{"id":"W2154064715","doi":"10.1109/isit.2008.4595250","title":"Improved spectral performance of Knuth Codes","year":2008,"lang":"en","type":"article","venue":"","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Code word; Computer science; Encoding (memory); Word (group theory); Extension (predicate logic); Context (archaeology); Code (set theory); Process (computing); Decoding methods; Algorithm; Theoretical computer science; Mathematics; Artificial intelligence; Programming language","score_opus":0.017691004813645782,"score_gpt":0.24995442582351068,"score_spread":0.2322634210098649,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2154064715","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.33536762,0.0011488193,0.6354345,0.00047730768,0.00016758047,0.000051824372,0.00010537022,0.0014223645,0.025824621],"genre_scores_gemma":[0.7256354,0.00052270305,0.2660927,0.00018559386,0.00008008094,0.000071935756,0.00018566307,0.00017743722,0.007048519],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99898547,0.00025407935,0.000047179725,0.00011139024,0.00046603766,0.00013584681],"domain_scores_gemma":[0.99780196,0.0009890284,0.00019578722,0.00037099747,0.0005491983,0.00009301333],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007253115,0.00074628036,0.0005855977,0.0010052645,0.0007188291,0.0007994198,0.00064248865,0.00077602227,0.0028271717],"category_scores_gemma":[0.0038565798,0.00017319765,0.00024214947,0.0010823085,0.0009908642,0.0015325857,0.0011603461,0.0006730455,0.0012895856],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0014534239,0.00016304149,0.00176509,0.00031056654,0.00006554628,0.0006148314,0.0007243037,0.10228932,0.27203995,0.2758073,0.0026964406,0.34207022],"study_design_scores_gemma":[0.000085507614,0.00082220306,0.00077390793,0.00011560533,0.000041156993,0.001796307,0.00023741109,0.56236976,0.3265707,0.08909449,0.017894132,0.00019879731],"about_ca_topic_score_codex":0.00066086394,"about_ca_topic_score_gemma":0.00092310185,"teacher_disagreement_score":0.0028271717,"about_ca_system_score_codex":0.0005721928,"about_ca_system_score_gemma":0.0008835505,"threshold_uncertainty_score":0.009457827},"labels":[],"label_agreement":null},{"id":"W2154204394","doi":"10.1109/dcc.2012.16","title":"Context Modeling and Correction of Quantization Errors in Prediction Loop","year":2012,"lang":"en","type":"article","venue":"","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Quantization (signal processing); Pulse-code modulation; Computer science; Robustness (evolution); Lossy compression; Algorithm; Mean squared prediction error; Coding (social sciences); Speech recognition; Artificial intelligence; Control theory (sociology); Mathematics; Statistics","score_opus":0.029978870521564893,"score_gpt":0.2856991958722552,"score_spread":0.2557203253506903,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2154204394","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.026716657,0.00039707942,0.97218174,0.00008420401,0.000058948473,0.000016922604,0.000025877227,0.00026730952,0.00025132007],"genre_scores_gemma":[0.71684563,0.0006543359,0.28136355,0.00009955736,0.000090654416,0.000052731048,0.00009099933,0.000076826094,0.00072574004],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995882,0.0000916761,0.000028021826,0.00009630745,0.00015945974,0.00003634167],"domain_scores_gemma":[0.99905175,0.000324264,0.00015321076,0.00022561001,0.00021884625,0.000026264317],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004796853,0.000743952,0.00043731212,0.00028347038,0.0002771658,0.00043760566,0.00080167444,0.000569075,0.0003829764],"category_scores_gemma":[0.0040717847,0.00027283293,0.00024294383,0.00034171634,0.00038183754,0.0011222974,0.0009128085,0.0008484069,0.00013207951],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00053298485,0.00007434341,0.0033329811,0.00019354098,0.000051460724,0.00038393817,0.00034872678,0.4146881,0.16399698,0.017596308,0.0010167491,0.39778388],"study_design_scores_gemma":[0.000011873882,0.00006218924,0.00050376076,0.000016149017,0.000018628592,0.00011242474,0.00001563453,0.9464037,0.048950374,0.0029238833,0.0009593386,0.00002209575],"about_ca_topic_score_codex":0.0013726929,"about_ca_topic_score_gemma":0.0019329287,"teacher_disagreement_score":0.0013726929,"about_ca_system_score_codex":0.00025270518,"about_ca_system_score_gemma":0.00047235598,"threshold_uncertainty_score":0.002729416},"labels":[],"label_agreement":null},{"id":"W2154414774","doi":"10.1109/dcc.2007.47","title":"Image Coding on Quincunx Lattice with Adaptive Lifting and Interpolation","year":2007,"lang":"en","type":"article","venue":"","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":27,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Mathematics; Artificial intelligence; Pixel; Computer vision; Piecewise; Encoder; JPEG; Codebook; Image compression; Image processing; Algorithm; Computer science; Data compression; Image (mathematics); Statistics","score_opus":0.01825785093161216,"score_gpt":0.2881868451613624,"score_spread":0.26992899422975025,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2154414774","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.084334314,0.0002503401,0.9123593,0.00009393852,0.000050170733,0.00003255028,0.000060234055,0.00027268237,0.0025464967],"genre_scores_gemma":[0.50416934,0.00040138685,0.49138752,0.00008328596,0.000037889997,0.00007821992,0.00015829291,0.000065044616,0.0036189628],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99986017,0.00003832199,0.000008354202,0.000019006979,0.00005499862,0.000019151139],"domain_scores_gemma":[0.9998246,0.000055236982,0.00001817644,0.000046265086,0.00004310299,0.000012583178],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002139718,0.0002431874,0.0003377425,0.00037749106,0.00016816026,0.0003035456,0.00041907083,0.0002442638,0.0012421771],"category_scores_gemma":[0.00048467855,0.000121836965,0.00024025039,0.0005978104,0.0003159886,0.00052249443,0.0004733769,0.00032235967,0.00031428962],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006080413,0.00013422313,0.0011898044,0.00024627632,0.00003960766,0.0005069703,0.0002511816,0.25424218,0.29885846,0.0950662,0.00243868,0.34641835],"study_design_scores_gemma":[0.000016247557,0.00008924676,0.0003073183,0.000010825663,0.0000062406057,0.00017500269,0.00002316308,0.9632482,0.028100511,0.0053847744,0.00261927,0.000019288638],"about_ca_topic_score_codex":0.0010816993,"about_ca_topic_score_gemma":0.0012440805,"teacher_disagreement_score":0.0012421771,"about_ca_system_score_codex":0.00020428414,"about_ca_system_score_gemma":0.0002390246,"threshold_uncertainty_score":0.0041555166},"labels":[],"label_agreement":null},{"id":"W2154495006","doi":"10.1109/tit.2003.819340","title":"Do optimal entropy-constrained quantizers have a finite or infinite number of codewords?","year":2003,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":26,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Mathematics; Entropy (arrow of time); Gaussian; Maximum entropy probability distribution; Principle of maximum entropy; Rate–distortion theory; Finite set; Differential entropy; Probability distribution; Combinatorics; Discrete mathematics; Applied mathematics; Mathematical optimization; Algorithm; Mathematical analysis; Data compression; Statistics","score_opus":0.016081819938457403,"score_gpt":0.28269953385516056,"score_spread":0.26661771391670314,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2154495006","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.25718725,0.0020867416,0.7206249,0.0025931436,0.00010221583,0.00012582933,0.00034278087,0.00022634405,0.016710795],"genre_scores_gemma":[0.89400107,0.0010436471,0.09865383,0.00053695403,0.00013284141,0.00020997495,0.0003052255,0.000102328246,0.0050140135],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980988,0.00049747695,0.00016420997,0.00034108985,0.0006190834,0.00027939747],"domain_scores_gemma":[0.9859656,0.0090187695,0.0021230471,0.0012164549,0.0012070581,0.00046902054],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002466598,0.00050627,0.001604898,0.0007031967,0.00082253176,0.0015258517,0.0012104079,0.0014922717,0.003612797],"category_scores_gemma":[0.025389776,0.00083474343,0.00054861075,0.00083918445,0.0040583275,0.007676212,0.0018786569,0.0013259863,0.00054587855],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00036409855,0.00010770916,0.0015665375,0.00019185714,0.00004854425,0.00012343713,0.00021740157,0.09872957,0.004043424,0.8447566,0.001777326,0.048073366],"study_design_scores_gemma":[0.00009472723,0.00017440827,0.00074480684,0.000066673725,0.000023239203,0.0001665846,0.000117062686,0.34124956,0.0055875937,0.6484725,0.0032599748,0.00004289944],"about_ca_topic_score_codex":0.00086813816,"about_ca_topic_score_gemma":0.00072970946,"teacher_disagreement_score":0.003612797,"about_ca_system_score_codex":0.0013884928,"about_ca_system_score_gemma":0.0009719728,"threshold_uncertainty_score":0.013044834},"labels":[],"label_agreement":null},{"id":"W2154646662","doi":"10.1109/mwscas.1994.519077","title":"Frequency selective harmonic coding at 2400 bps","year":2002,"lang":"en","type":"article","venue":"","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Communications Research Centre Canada","funders":"","keywords":"Speech recognition; Computer science; Quantization (signal processing); Coding (social sciences); Speech coding; Harmonic Vector Excitation Coding; Harmonic analysis; Algorithm; Harmonic; Electronic engineering; Acoustics; Mathematics; Physics; Engineering","score_opus":0.03308022042953062,"score_gpt":0.2618217112737968,"score_spread":0.22874149084426615,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2154646662","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23400414,0.0013367318,0.68203145,0.0005893262,0.0005280485,0.0001848098,0.0009170591,0.006714776,0.07369364],"genre_scores_gemma":[0.7066619,0.00062863395,0.25776356,0.00037955958,0.00015643863,0.000130468,0.0008173189,0.0005198997,0.032942235],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997489,0.000021632879,0.0000071297127,0.000026256539,0.0001658988,0.000030172252],"domain_scores_gemma":[0.99969923,0.00006753145,0.000017751463,0.000050914434,0.0001432903,0.000021364704],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002136768,0.00028372506,0.0002551937,0.00047860123,0.0002909312,0.00053019205,0.00033707777,0.00035478338,0.008315323],"category_scores_gemma":[0.0008986917,0.000096572396,0.000088647066,0.00040273566,0.00029632953,0.0005478115,0.00040087142,0.00051355566,0.0030517497],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007140381,0.00006732797,0.0008048269,0.00013704276,0.00002189157,0.00028775368,0.0003144335,0.006432144,0.33755162,0.023538338,0.0066538947,0.62347656],"study_design_scores_gemma":[0.000112185306,0.0006490005,0.004339288,0.0001757596,0.00007397994,0.001796717,0.00025992186,0.15721685,0.6654905,0.016881786,0.15291004,0.000093975556],"about_ca_topic_score_codex":0.0013864924,"about_ca_topic_score_gemma":0.0012376014,"teacher_disagreement_score":0.008315323,"about_ca_system_score_codex":0.00038336177,"about_ca_system_score_gemma":0.00043348497,"threshold_uncertainty_score":0.027817547},"labels":[],"label_agreement":null},{"id":"W2154769360","doi":"10.1109/icassp.2004.1326481","title":"Embedded color image coding using context-modeled wavelet difference reduction","year":2004,"lang":"en","type":"article","venue":"","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Chrominance; Artificial intelligence; Computer vision; Wavelet; Color space; Computer science; Color image; Wavelet transform; Discrete wavelet transform; Luminance; Color histogram; JPEG 2000; Mathematics; Wavelet packet decomposition; Pattern recognition (psychology); Image compression; Image processing; Image (mathematics)","score_opus":0.03437083296304513,"score_gpt":0.3045923283795404,"score_spread":0.2702214954164953,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2154769360","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06520041,0.00067829347,0.9320345,0.00009502901,0.00009560478,0.000043751275,0.00005820647,0.0005513835,0.0012427781],"genre_scores_gemma":[0.43506715,0.0006904134,0.5614947,0.000088648085,0.00007496121,0.000061994906,0.00016940557,0.00006423413,0.00228845],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998877,0.000013322592,0.0000051002744,0.000016743614,0.000067196976,0.000009829048],"domain_scores_gemma":[0.9998716,0.000025596059,0.000015238565,0.00002618429,0.00005352411,0.000007778474],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013160518,0.00031407844,0.00031067565,0.00030469056,0.00012226561,0.0003026547,0.0004191967,0.00026182036,0.00065684435],"category_scores_gemma":[0.00046953163,0.000118425385,0.00022403988,0.00044352678,0.00014228634,0.00042426694,0.0003543478,0.00048827304,0.00023653804],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00025972404,0.000100768884,0.00054834475,0.00009398956,0.000032857883,0.00020339494,0.00005901308,0.032684565,0.42536578,0.01885829,0.0019071642,0.5198861],"study_design_scores_gemma":[0.000042342075,0.00018257383,0.0011682446,0.000017486023,0.000037520265,0.00053470506,0.00001626031,0.78070796,0.20735961,0.002819055,0.007087339,0.0000269051],"about_ca_topic_score_codex":0.00079939084,"about_ca_topic_score_gemma":0.0013254263,"teacher_disagreement_score":0.00079939084,"about_ca_system_score_codex":0.00018310137,"about_ca_system_score_gemma":0.00025481198,"threshold_uncertainty_score":0.0021973848},"labels":[],"label_agreement":null},{"id":"W2154830162","doi":"10.1109/ispaw.2011.43","title":"Energy Efficient Multiple Description Coding for Video Sensor Network","year":2011,"lang":"en","type":"article","venue":"","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"British Columbia Innovation Council","keywords":"Computer science; Wireless sensor network; Coding (social sciences); Real-time computing; Video quality; Bandwidth (computing); Linear network coding; Efficient energy use; Computer network; Network packet; Engineering","score_opus":0.05546746204716937,"score_gpt":0.2546908082634318,"score_spread":0.19922334621626245,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2154830162","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010819985,0.0023638394,0.98387665,0.00040249818,0.00013037067,0.00006826698,0.00011949403,0.00027039615,0.0019485652],"genre_scores_gemma":[0.55188257,0.004306008,0.4332669,0.00036328635,0.0001787538,0.00040086507,0.0011141142,0.000083498584,0.008403987],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996604,0.00007191814,0.000021656579,0.000029662413,0.00019154462,0.000024799596],"domain_scores_gemma":[0.9994885,0.0002564081,0.000041154017,0.00006349524,0.00013557437,0.000014849919],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004382039,0.00033174068,0.00035183772,0.0005677882,0.00025135448,0.00031934847,0.00071662426,0.00046649997,0.0014364257],"category_scores_gemma":[0.0012881879,0.00013275705,0.00022111196,0.00078630337,0.00027219614,0.00066744204,0.00051467,0.0007053545,0.0003043915],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00033424326,0.000103966544,0.00056673476,0.00049881125,0.00006547777,0.00042686609,0.0001720916,0.24941237,0.06156367,0.07575661,0.014741544,0.5963577],"study_design_scores_gemma":[0.000023695413,0.00006602094,0.00021000532,0.00003124563,0.0000123261225,0.00013536186,0.000019936722,0.9711276,0.010922106,0.012324026,0.0051089823,0.000018631941],"about_ca_topic_score_codex":0.003232744,"about_ca_topic_score_gemma":0.0034970853,"teacher_disagreement_score":0.003232744,"about_ca_system_score_codex":0.00050669775,"about_ca_system_score_gemma":0.00060533674,"threshold_uncertainty_score":0.006427884},"labels":[],"label_agreement":null},{"id":"W2155011982","doi":"10.1109/icassp.2011.5946465","title":"3D medical image coding with optimal channel protection for wireless transmission","year":2011,"lang":"en","type":"article","venue":"","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; Wireless; Concatenation (mathematics); Bitstream; Channel (broadcasting); Robustness (evolution); Multiple description coding; Algorithm; Decoding methods; Computer network; Telecommunications; Mathematics; Arithmetic","score_opus":0.03601843137451636,"score_gpt":0.26958733164695087,"score_spread":0.23356890027243452,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2155011982","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016933687,0.00024870486,0.98195386,0.00012761077,0.000020080217,0.000012216212,0.000020510974,0.0001259033,0.00055741105],"genre_scores_gemma":[0.37622404,0.0006904494,0.62135243,0.00017335489,0.00006669234,0.00006854471,0.00008021067,0.000054409295,0.0012899169],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99977833,0.000048388825,0.000010144783,0.00001646152,0.00012834588,0.00001833785],"domain_scores_gemma":[0.99959916,0.0001525422,0.00008195476,0.00008232277,0.000065974884,0.00001803412],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032702793,0.00034371347,0.00028065481,0.0004009492,0.00012960203,0.00036635462,0.00038575308,0.00051285344,0.000653039],"category_scores_gemma":[0.0011208192,0.00016665166,0.00032589224,0.00038198245,0.00043670431,0.0006012081,0.0005843544,0.0005086326,0.00022229593],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003849195,0.00007329399,0.0012109078,0.00024483298,0.000072089446,0.00048346183,0.00021728722,0.2685275,0.33335942,0.046128195,0.0021768452,0.34712127],"study_design_scores_gemma":[0.000020676389,0.0000971191,0.00038906702,0.000018805127,0.000021620925,0.00066077965,0.000016653048,0.8906331,0.10073719,0.0046019214,0.0027687973,0.00003418496],"about_ca_topic_score_codex":0.00039464052,"about_ca_topic_score_gemma":0.00039959443,"teacher_disagreement_score":0.000653039,"about_ca_system_score_codex":0.00020610171,"about_ca_system_score_gemma":0.0003563481,"threshold_uncertainty_score":0.0021845698},"labels":[],"label_agreement":null},{"id":"W2155149875","doi":"10.1109/wcnc.2004.1311822","title":"Optimal unequal channel protection of multiple-description product codes for multimedia communications over fast fading channels","year":2004,"lang":"en","type":"article","venue":"","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Computer science; Network packet; Channel (broadcasting); Fading; Transmission (telecommunications); Computer network; Coding (social sciences); Decoding methods; Set (abstract data type); Algorithm; Scheme (mathematics); Telecommunications; Mathematics; Statistics","score_opus":0.0665074065477417,"score_gpt":0.3126629165784875,"score_spread":0.2461555100307458,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2155149875","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.055450175,0.00036074992,0.9428719,0.000100576195,0.000015630529,0.000017729304,0.000030691823,0.00010818721,0.0010443066],"genre_scores_gemma":[0.89347756,0.00040736602,0.10494955,0.000047731533,0.00002454325,0.000030131761,0.00006445567,0.000032668693,0.00096606096],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999353,0.00025436803,0.000027767199,0.00008102859,0.00020201212,0.000081830636],"domain_scores_gemma":[0.9982249,0.0011416812,0.00017313681,0.00027537515,0.00014636225,0.000038489394],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011544444,0.00052269344,0.0005315882,0.00042400637,0.00033455627,0.00054903,0.0005524879,0.00045261433,0.00079847843],"category_scores_gemma":[0.0033611835,0.00021576398,0.00029790704,0.0004985461,0.001154406,0.0011611235,0.00080617465,0.00065395137,0.00015176449],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00049536774,0.000046730747,0.0008349726,0.00015472257,0.00004684712,0.00023617003,0.00020074693,0.7275865,0.03775432,0.103811115,0.00071712537,0.12811534],"study_design_scores_gemma":[0.00002628617,0.00011599329,0.00021480034,0.000017366843,0.000016311371,0.00015773973,0.000026190182,0.94356954,0.02307191,0.031614654,0.0011490977,0.000020072055],"about_ca_topic_score_codex":0.0007109413,"about_ca_topic_score_gemma":0.0006394857,"teacher_disagreement_score":0.0011544444,"about_ca_system_score_codex":0.000563836,"about_ca_system_score_gemma":0.0006373901,"threshold_uncertainty_score":0.0061053038},"labels":[],"label_agreement":null},{"id":"W2155958165","doi":"10.1117/12.428114","title":"<title>Performance analysis of algorithms for retrieval of magnetic resonance images for interactive teleradiology</title>","year":2001,"lang":"en","type":"article","venue":"Proceedings of SPIE, the International Society for Optical Engineering/Proceedings of SPIE","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Computer science; Set partitioning in hierarchical trees; Image compression; Uncompressed video; Redundancy (engineering); Java; Artificial intelligence; Computer vision; Image processing; Image (mathematics); Operating system; Video processing","score_opus":0.012288143959968167,"score_gpt":0.25551255399335854,"score_spread":0.24322441003339038,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2155958165","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.83195794,0.0022876267,0.14143346,0.00029854532,0.00015268663,0.0004339704,0.0009285839,0.015422345,0.0070846993],"genre_scores_gemma":[0.8138736,0.0006514975,0.17659673,0.00011022371,0.00006414966,0.00024280818,0.002745278,0.0016691232,0.0040467004],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978942,0.00053108524,0.00022461376,0.00039132446,0.00071111677,0.00024766327],"domain_scores_gemma":[0.9895502,0.0065575144,0.0005691416,0.00078840443,0.0022695686,0.0002651347],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002201579,0.0009137866,0.00077332964,0.001463818,0.0004014747,0.0011522977,0.001988565,0.0008761336,0.005033577],"category_scores_gemma":[0.009764235,0.00034981157,0.00048355767,0.0014255518,0.0004843442,0.0016298261,0.00047610517,0.00047466808,0.0015346688],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.009166775,0.00138691,0.017802441,0.001308375,0.00037534005,0.00040032397,0.00047238206,0.13476576,0.21297644,0.00276553,0.012021248,0.6065585],"study_design_scores_gemma":[0.000418724,0.0016067812,0.016539635,0.00004213319,0.00011827356,0.00027098844,0.00013588586,0.84420794,0.13345689,0.0005776931,0.0025355525,0.000089495894],"about_ca_topic_score_codex":0.011211929,"about_ca_topic_score_gemma":0.0054203356,"teacher_disagreement_score":0.011211929,"about_ca_system_score_codex":0.0014472427,"about_ca_system_score_gemma":0.0010020002,"threshold_uncertainty_score":0.02229333},"labels":[],"label_agreement":null},{"id":"W2156366466","doi":"10.1109/mwscas.1994.518973","title":"Image compression using probabilistic winner-take-all learning","year":2002,"lang":"en","type":"article","venue":"","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Probabilistic logic; Computer science; Image compression; Data compression; Compression (physics); Artificial intelligence; Competitive learning; Image (mathematics); Algorithm; Machine learning; Artificial neural network; Image processing","score_opus":0.05536993154762849,"score_gpt":0.29694379803028337,"score_spread":0.2415738664826549,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2156366466","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08384199,0.0010103225,0.90805733,0.00046919458,0.00014126394,0.00021288679,0.000042240903,0.0010680724,0.0051567643],"genre_scores_gemma":[0.85320854,0.00030073203,0.14238094,0.00033430624,0.000083870626,0.00016433229,0.000083052866,0.000063410145,0.0033807117],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.997912,0.00043827086,0.000107197826,0.0002458655,0.0010869002,0.00020973847],"domain_scores_gemma":[0.9980301,0.00083397666,0.00023324789,0.00022833348,0.0005748145,0.00009963656],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003514435,0.00085323595,0.0016913201,0.0011200215,0.0007262245,0.0011447988,0.0031813658,0.0013868265,0.0016688665],"category_scores_gemma":[0.005659227,0.00039199152,0.0006159369,0.0010573937,0.0013729536,0.0018743183,0.0019628082,0.0012187068,0.00045675435],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00051279063,0.00036247697,0.001973646,0.00017917748,0.00025446835,0.000147643,0.0001070283,0.33637616,0.011040042,0.023091685,0.0031366388,0.6228183],"study_design_scores_gemma":[0.000070200804,0.00023930939,0.00027181648,0.0000043859227,0.000023210383,0.0001181861,0.000014222985,0.9844505,0.006790742,0.00708131,0.0009138085,0.000022308248],"about_ca_topic_score_codex":0.0016584409,"about_ca_topic_score_gemma":0.0017835228,"teacher_disagreement_score":0.003514435,"about_ca_system_score_codex":0.0009114037,"about_ca_system_score_gemma":0.0010959336,"threshold_uncertainty_score":0.018586338},"labels":[],"label_agreement":null},{"id":"W2157638847","doi":"10.1109/icwc.1992.200728","title":"Tesbed for a multimedia wireless local area network","year":2003,"lang":"en","type":"article","venue":"","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"Communications Research Centre Canada","funders":"","keywords":"Testbed; Computer science; Wireless; Multimedia; Wireless network; Computer network; Throughput; Wi-Fi array; Interface (matter); Telecommunications; Operating system","score_opus":0.01983575413769458,"score_gpt":0.2693964125031797,"score_spread":0.2495606583654851,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2157638847","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0077317734,0.0043927426,0.68470037,0.004869,0.0044800206,0.0007630731,0.0023336043,0.035763998,0.25496542],"genre_scores_gemma":[0.08882811,0.0035883544,0.2491848,0.0027913554,0.0009482086,0.00119824,0.008608609,0.003967017,0.64088535],"study_design_codex":"not_applicable","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99945885,0.00011672114,0.000034241257,0.00006674958,0.00026945345,0.00005395646],"domain_scores_gemma":[0.9994261,0.00008030215,0.000029211991,0.00012664714,0.00023927381,0.00009857834],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006426175,0.00050328113,0.00033710783,0.00060147897,0.00065360375,0.0014261282,0.0013515578,0.0011180525,0.087936826],"category_scores_gemma":[0.001209452,0.00027709102,0.0002018292,0.0006471589,0.0003437993,0.0016884563,0.0012208597,0.001394929,0.04323146],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000446117,0.00012453644,0.0004969941,0.00049505936,0.000038093232,0.0006225148,0.00020129509,0.004346859,0.037303224,0.12832013,0.4537541,0.37385112],"study_design_scores_gemma":[0.000061247854,0.000089614085,0.00023666909,0.000057776437,0.000009032129,0.00026631964,0.0000397904,0.021245088,0.0060278,0.009498185,0.96244645,0.000022020435],"about_ca_topic_score_codex":0.0011512877,"about_ca_topic_score_gemma":0.0023776202,"teacher_disagreement_score":0.087936826,"about_ca_system_score_codex":0.000685543,"about_ca_system_score_gemma":0.0007072988,"threshold_uncertainty_score":0.29417795},"labels":[],"label_agreement":null},{"id":"W2158144386","doi":"10.1109/icassp.2004.1326085","title":"Combining equalization and estimation for bandwidth extension of narrowband speech","year":2004,"lang":"en","type":"article","venue":"","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":27,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Narrowband; Bandwidth extension; Bandwidth (computing); Computer science; Equalization (audio); Extension (predicate logic); Speech recognition; Telecommunications; Speech coding; Decoding methods; Audio signal","score_opus":0.023326019568096493,"score_gpt":0.30760195691659137,"score_spread":0.2842759373484949,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2158144386","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12831467,0.0004928935,0.86852914,0.00007318533,0.000043319626,0.00003652292,0.000022479113,0.0010447495,0.0014430226],"genre_scores_gemma":[0.57450235,0.00040768352,0.42172366,0.000102781654,0.000080154525,0.000040960596,0.0001538922,0.000118842036,0.002869691],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99959654,0.00009693707,0.00003129213,0.00007027005,0.00016254661,0.000042359934],"domain_scores_gemma":[0.9991898,0.00048627442,0.000057915968,0.0000926526,0.00015774934,0.000015639913],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00070018915,0.000369472,0.00039589943,0.00045661372,0.00016405151,0.00031093287,0.0002551105,0.0004583933,0.0011225027],"category_scores_gemma":[0.001743523,0.00023221034,0.00019593943,0.00029975292,0.00026395256,0.00067085034,0.0004792762,0.0003219137,0.0006111629],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00041170165,0.000096599986,0.0017545854,0.000094001625,0.000058149704,0.000093900024,0.00011038032,0.012201151,0.39651147,0.0010880203,0.0004122289,0.5871678],"study_design_scores_gemma":[0.000047441496,0.00046182566,0.008902113,0.00003132093,0.00017048989,0.00081525743,0.000060127444,0.30816182,0.6717484,0.0018077369,0.0076965773,0.00009686883],"about_ca_topic_score_codex":0.0005193306,"about_ca_topic_score_gemma":0.0010906964,"teacher_disagreement_score":0.0011225027,"about_ca_system_score_codex":0.00012146045,"about_ca_system_score_gemma":0.00020917109,"threshold_uncertainty_score":0.0037551522},"labels":[],"label_agreement":null},{"id":"W2158447309","doi":"10.1109/pacrim.1999.799579","title":"DSP-RAM: A logic-enhanced memory architecture for communication signal processing","year":2003,"lang":"en","type":"article","venue":"","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Computer science; Digital signal processing; SIMD; Computer architecture; Digital signal processor; Key (lock); Very long instruction word; Coding (social sciences); Computer hardware; Signal processing; Embedded system; Parallel computing; Operating system","score_opus":0.0269941376174473,"score_gpt":0.3057043893023266,"score_spread":0.2787102516848793,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2158447309","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0931856,0.0063239997,0.8536567,0.00043871978,0.0005325004,0.0001805983,0.00036656167,0.012150744,0.033164598],"genre_scores_gemma":[0.48630187,0.0018621605,0.48514184,0.0006412664,0.00019124176,0.00018425792,0.0010212725,0.00028416511,0.02437196],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9998888,0.000016707614,0.000008258606,0.000026847805,0.00004371144,0.000015638785],"domain_scores_gemma":[0.99985874,0.000031385825,0.00001586799,0.000029964049,0.00005326708,0.000010783693],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019601006,0.00031974207,0.0002199039,0.00033605023,0.00023524344,0.00052732584,0.0017028725,0.00041044166,0.005777052],"category_scores_gemma":[0.00028928302,0.0001383278,0.00019286438,0.00040446047,0.0002436597,0.0010421616,0.000305117,0.0004923621,0.0017561152],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011701265,0.00020180167,0.0011072535,0.0008200701,0.00009331575,0.0005388149,0.00010541668,0.014599326,0.3004452,0.04772346,0.016115008,0.6170802],"study_design_scores_gemma":[0.00030886062,0.0016278016,0.0014148413,0.000096583266,0.00019005961,0.002143188,0.0000886609,0.2603994,0.49549064,0.013603011,0.224557,0.00007988126],"about_ca_topic_score_codex":0.0003625519,"about_ca_topic_score_gemma":0.00066293933,"teacher_disagreement_score":0.005777052,"about_ca_system_score_codex":0.00023203481,"about_ca_system_score_gemma":0.00032540978,"threshold_uncertainty_score":0.01932621},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.18290160842156253,"score_gpt":0.34319309078227184,"score_spread":0.1602914823607093,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2158531688","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0033474187,0.00014877693,0.99454206,0.000049026716,0.000011445867,0.000040103037,0.000025327956,0.00032805317,0.0015077427],"genre_scores_gemma":[0.08708566,0.0004933529,0.90997964,0.00007538241,0.000042300304,0.0001599292,0.00014331477,0.00009896214,0.0019215266],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99923074,0.00018860796,0.000044310065,0.000075510805,0.00040682906,0.000054009313],"domain_scores_gemma":[0.9986272,0.00084474427,0.000090576024,0.0002091439,0.00020239996,0.000026016925],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007848058,0.0006171533,0.0005477998,0.00062722096,0.00041108538,0.0009515565,0.0010173183,0.0004768669,0.0022958815],"category_scores_gemma":[0.0032960626,0.00023147554,0.00028276318,0.0008259777,0.0007592302,0.0012241004,0.0010564438,0.0009210448,0.00091966236],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022715151,0.00007127702,0.00071133027,0.00027670118,0.00003532738,0.00023153095,0.00017810361,0.24346186,0.06015055,0.21966007,0.0033311984,0.47166494],"study_design_scores_gemma":[0.00003222214,0.00012517469,0.0001877762,0.000033348875,0.000013302158,0.0003610755,0.000029162959,0.9377041,0.026508579,0.027021775,0.00795597,0.000027561791],"about_ca_topic_score_codex":0.0019528125,"about_ca_topic_score_gemma":0.0031691,"teacher_disagreement_score":0.0022958815,"about_ca_system_score_codex":0.000677858,"about_ca_system_score_gemma":0.00096757157,"threshold_uncertainty_score":0.0076804757},"labels":[],"label_agreement":null},{"id":"W2158535666","doi":"10.1109/vetec.1994.345385","title":"Low complexity, low delay speech coding for indoor wireless communications","year":2002,"lang":"en","type":"article","venue":"","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Computer science; Wireless; Code-excited linear prediction; Interleaving; Robustness (evolution); Time division multiple access; Codec; Full Rate; Computer network; Real-time computing; Speech coding; Speech recognition; Telecommunications; Linear predictive coding","score_opus":0.09444035735693096,"score_gpt":0.32834249765465473,"score_spread":0.23390214029772377,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2158535666","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008945397,0.0011640486,0.9868819,0.0001515212,0.00007027352,0.000031462238,0.00003791012,0.00034123662,0.0023763182],"genre_scores_gemma":[0.20329382,0.0017480853,0.78685343,0.00016960345,0.00019205982,0.00013498966,0.00024305603,0.00008746629,0.0072775474],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998087,0.000046123027,0.000009611521,0.000016919594,0.00010565391,0.000012971736],"domain_scores_gemma":[0.9996605,0.00016598463,0.0000402414,0.000048912843,0.0000724502,0.000011872409],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024890125,0.00036607476,0.00016590916,0.00035539118,0.0001718607,0.00041136096,0.00037424007,0.00040684178,0.001984893],"category_scores_gemma":[0.0009047165,0.000113062604,0.00016329395,0.00047228322,0.0003013659,0.00040773148,0.00028610817,0.00054772064,0.00083318626],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00024822165,0.000050989926,0.0004246833,0.00031250372,0.000022620214,0.00018513235,0.00010823431,0.038519133,0.20440012,0.04315247,0.0042429003,0.708333],"study_design_scores_gemma":[0.000082540726,0.0005716767,0.0009889309,0.00009394005,0.000053255662,0.000878084,0.000051711515,0.7210085,0.21289875,0.017775523,0.045539185,0.00005791056],"about_ca_topic_score_codex":0.00058416615,"about_ca_topic_score_gemma":0.00086781516,"teacher_disagreement_score":0.001984893,"about_ca_system_score_codex":0.00024826158,"about_ca_system_score_gemma":0.00036771083,"threshold_uncertainty_score":0.0066401362},"labels":[],"label_agreement":null},{"id":"W2158885036","doi":"10.1109/iscc.2003.1214229","title":"Real-time multiple description and layered encoded video streaming with optimal diverse routing","year":2004,"lang":"en","type":"article","venue":"","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; Overlay; Path (computing); Coding (social sciences); Computer network; Video streaming; Video quality; Disjoint sets; Lossy compression; Multiple description coding; Real-time computing; Selection (genetic algorithm); Distributed computing; Network packet; Artificial intelligence","score_opus":0.016366588165188288,"score_gpt":0.24085171386086285,"score_spread":0.22448512569567455,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2158885036","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.149703,0.00047875533,0.8475135,0.00014300103,0.000024536163,0.000047556878,0.000038767514,0.0003224604,0.0017284119],"genre_scores_gemma":[0.8715818,0.00022386384,0.12734157,0.000026027878,0.000012079906,0.00003502958,0.000049235954,0.000016126422,0.0007143473],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99969804,0.00011381174,0.000014505005,0.000023635104,0.00012336782,0.00002670628],"domain_scores_gemma":[0.99928135,0.00041341092,0.000111040186,0.000056304478,0.00010895657,0.00002892077],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00067878014,0.00037897663,0.0002792996,0.00029896662,0.00012069071,0.00037075242,0.0004028261,0.0003174186,0.00035308092],"category_scores_gemma":[0.0021515766,0.00016666183,0.00022790853,0.00029399415,0.00030620894,0.0007142737,0.00035238688,0.0003453082,0.00006264696],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020322906,0.000058602185,0.00085903826,0.00007839327,0.00004336345,0.00016079271,0.00007533587,0.892857,0.028980257,0.014863054,0.0004771763,0.061343815],"study_design_scores_gemma":[0.000007690103,0.00002782921,0.00008558481,0.0000014453053,0.0000034388634,0.000026853391,0.0000048511565,0.99602014,0.00278288,0.0009150175,0.000119980345,0.0000042271963],"about_ca_topic_score_codex":0.0015328134,"about_ca_topic_score_gemma":0.001517622,"teacher_disagreement_score":0.0015328134,"about_ca_system_score_codex":0.00046983178,"about_ca_system_score_gemma":0.00032803183,"threshold_uncertainty_score":0.0035897493},"labels":[],"label_agreement":null},{"id":"W2158983766","doi":"10.1109/icme.2007.4284858","title":"Soft Input Error Resilient Multiple Description Coding for Rayleigh Fading Channels","year":2007,"lang":"en","type":"article","venue":"","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University; Communications Research Centre Canada","funders":"","keywords":"Additive white Gaussian noise; Forward error correction; Computer science; Rayleigh fading; Algorithm; Error detection and correction; Fading; Encoder; Decoding methods; Coding gain; Bit error rate; Redundancy (engineering); Propagation of uncertainty; Coding (social sciences); Channel (broadcasting); Mathematics; Telecommunications; Statistics","score_opus":0.055691655546268606,"score_gpt":0.31606114565521987,"score_spread":0.2603694901089513,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2158983766","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.061788645,0.0006232389,0.9355743,0.00017914394,0.0000503832,0.000047596794,0.00009416332,0.0005255185,0.0011170516],"genre_scores_gemma":[0.8431475,0.0005101465,0.15379316,0.00013720772,0.000052684623,0.00006169939,0.00028197156,0.00004150051,0.0019741198],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994149,0.00015162524,0.00003378277,0.000047367575,0.00028813092,0.00006420388],"domain_scores_gemma":[0.9982492,0.00077780604,0.00020847222,0.00037895964,0.00034409808,0.00004140704],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008642096,0.0004433655,0.00038596755,0.00041679098,0.00023125538,0.0004610399,0.00087659166,0.000424652,0.00056331203],"category_scores_gemma":[0.002443703,0.0001419577,0.00022371096,0.00046692215,0.00051509554,0.0008955085,0.00086349016,0.0006446571,0.0001860105],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000902566,0.00009284502,0.0015419959,0.00034623197,0.000086141474,0.00087623217,0.00024994632,0.4038532,0.09844652,0.056225874,0.003080275,0.43429816],"study_design_scores_gemma":[0.00003487607,0.00012769821,0.00028532138,0.000019558405,0.000024538429,0.00018982808,0.000019782952,0.93791145,0.050609805,0.008918914,0.001824117,0.000034106884],"about_ca_topic_score_codex":0.0015240816,"about_ca_topic_score_gemma":0.0014738749,"teacher_disagreement_score":0.0015240816,"about_ca_system_score_codex":0.00038472883,"about_ca_system_score_gemma":0.0005286091,"threshold_uncertainty_score":0.0045704246},"labels":[],"label_agreement":null},{"id":"W2159457093","doi":"10.1109/pacrim.1989.48382","title":"Implementation of an 8000 BPS CELP coder on a single TMS320C25 digital signal processor chip","year":2003,"lang":"en","type":"article","venue":"","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Communications Research Centre Canada","funders":"","keywords":"Code-excited linear prediction; Codebook; Computer science; Digital signal processing; Linear predictive coding; Cascade; Waveform; Filter (signal processing); Speech recognition; Linear prediction; Digital signal processor; SIGNAL (programming language); Computer hardware; Speech coding; Algorithm; Telecommunications; Engineering","score_opus":0.022106270328480674,"score_gpt":0.3079365621993796,"score_spread":0.2858302918708989,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2159457093","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.066788346,0.00027758288,0.87790126,0.00043779772,0.0003474859,0.00074489275,0.0006131871,0.022406507,0.030483011],"genre_scores_gemma":[0.449768,0.00020785454,0.5045703,0.00059007027,0.00012441847,0.000662385,0.0010945026,0.0008800247,0.04210238],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9993864,0.000044213964,0.000038805236,0.00011030173,0.00033578122,0.00008452136],"domain_scores_gemma":[0.9994276,0.000103148115,0.000039811766,0.00009067664,0.00029719566,0.00004161968],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036283853,0.00041751692,0.0004196717,0.00070096663,0.00032385642,0.00070345704,0.0012472603,0.00044500563,0.016816942],"category_scores_gemma":[0.0011713576,0.00024493565,0.00017565276,0.0003393746,0.00020338004,0.00047116962,0.00036906253,0.00055155205,0.006771031],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00068049703,0.00026487134,0.0012283537,0.00028845,0.0000507635,0.0005883634,0.00022228384,0.0119181555,0.42706037,0.010881599,0.024429046,0.5223873],"study_design_scores_gemma":[0.00033791206,0.0016404503,0.0035823723,0.000087263186,0.000093990995,0.002178154,0.00014005645,0.21648757,0.66774434,0.0029162643,0.10468074,0.0001108129],"about_ca_topic_score_codex":0.0018465118,"about_ca_topic_score_gemma":0.0025097139,"teacher_disagreement_score":0.016816942,"about_ca_system_score_codex":0.0005706751,"about_ca_system_score_gemma":0.0010043819,"threshold_uncertainty_score":0.05625826},"labels":[],"label_agreement":null},{"id":"W2159615724","doi":"10.1109/vetec.1989.40140","title":"Performance of a low complexity CELP speech coder under mobile channel fading conditions","year":2003,"lang":"en","type":"article","venue":"","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"Instituto de Telecomunicações","keywords":"Code-excited linear prediction; Computer science; Speech coding; Codec; Codebook; Vector sum excited linear prediction; Convolutional code; Residual; Speech recognition; Codec2; Full Rate; Coding (social sciences); Adaptive Multi-Rate audio codec; Linear predictive coding; Computer engineering; Computer hardware; Voice activity detection; Algorithm; Speech processing; Decoding methods","score_opus":0.040124239598998586,"score_gpt":0.3013434345087496,"score_spread":0.26121919490975104,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2159615724","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9809568,0.00014497875,0.015819492,0.000093679344,0.000021349684,0.000034953544,0.000188515,0.00073608523,0.002004111],"genre_scores_gemma":[0.99707663,0.000046241665,0.0021173835,0.000015509415,0.0000023328098,0.000010287893,0.00009054335,0.00003708075,0.00060395227],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997049,0.0000690375,0.00001365665,0.000042545063,0.00011591669,0.000053870186],"domain_scores_gemma":[0.99836594,0.0011360791,0.00009290576,0.00006834812,0.00027810328,0.000058554815],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039043895,0.0005822548,0.00061677344,0.000340616,0.00039968907,0.0004609441,0.0004891782,0.0005620469,0.0011788814],"category_scores_gemma":[0.0026515902,0.00017069999,0.0002568771,0.00025397376,0.00047913758,0.00038819027,0.00031245075,0.00037630755,0.00032631503],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011587001,0.00011174173,0.0036825188,0.00012813255,0.00007391758,0.00048788416,0.00018149827,0.9307515,0.046754412,0.0007064635,0.00050575874,0.015457639],"study_design_scores_gemma":[0.00007098508,0.0006193168,0.0020023265,0.0000066283314,0.000034540873,0.000118852244,0.000028753306,0.95724523,0.039438717,0.00013859966,0.00027764708,0.00001850805],"about_ca_topic_score_codex":0.006825028,"about_ca_topic_score_gemma":0.0026035085,"teacher_disagreement_score":0.006825028,"about_ca_system_score_codex":0.00058954133,"about_ca_system_score_gemma":0.00034330704,"threshold_uncertainty_score":0.013570607},"labels":[],"label_agreement":null},{"id":"W2159727819","doi":"10.1109/iembs.2005.1617308","title":"Region of Interest Image Coding for Digital Mammography","year":2005,"lang":"en","type":"article","venue":"","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Set partitioning in hierarchical trees; Computer science; JPEG 2000; Region of interest; Artificial intelligence; Computer vision; Coding (social sciences); Wavelet; Pixel; Data compression; Fidelity; Image compression; Pattern recognition (psychology); Wavelet transform; Mathematics; Image (mathematics); Image processing; Discrete wavelet transform; Statistics; Telecommunications","score_opus":0.04991842932210808,"score_gpt":0.3003329417589656,"score_spread":0.25041451243685753,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2159727819","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0148262065,0.0064575626,0.9720395,0.00035058334,0.00013371826,0.00009114247,0.00016298634,0.0007464575,0.0051917355],"genre_scores_gemma":[0.15857579,0.005319758,0.8301682,0.00023585635,0.0001216935,0.00016134535,0.0004662155,0.00015121332,0.0047999406],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997738,0.00005314763,0.0000091021,0.000017550447,0.00013502603,0.000011391533],"domain_scores_gemma":[0.9996045,0.00017566673,0.00003240601,0.000069708,0.0001085907,0.000009166758],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029964146,0.0002614948,0.0001976132,0.00051952765,0.00010672176,0.00031963052,0.00043475523,0.00042140394,0.0026978669],"category_scores_gemma":[0.0017458434,0.000103586586,0.00018363848,0.00064835534,0.00021484963,0.00046906905,0.00027498402,0.00040953662,0.00092228345],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002279912,0.000040383584,0.00048933044,0.00044123147,0.000030693045,0.00032511153,0.0001242656,0.035080716,0.1494152,0.057304043,0.00970582,0.7468152],"study_design_scores_gemma":[0.00006203689,0.00032820707,0.0021357648,0.00022040012,0.00007623336,0.002497494,0.00009434333,0.6838223,0.18057771,0.038615134,0.09151045,0.000059996702],"about_ca_topic_score_codex":0.0007260681,"about_ca_topic_score_gemma":0.00075838447,"teacher_disagreement_score":0.0026978669,"about_ca_system_score_codex":0.00022484579,"about_ca_system_score_gemma":0.00029749464,"threshold_uncertainty_score":0.009025216},"labels":[],"label_agreement":null},{"id":"W2159771978","doi":"10.1109/icassp.1996.543231","title":"Switched prediction and quantization of LSP frequencies","year":2002,"lang":"en","type":"article","venue":"","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":19,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Institut National de la Recherche Scientifique","funders":"","keywords":"Quantization (signal processing); Vector quantization; Algorithm; Residual; Speech coding; Coding (social sciences); Harmonic Vector Excitation Coding; Mathematics; Computer science; Speech recognition; Statistics","score_opus":0.027622273622697445,"score_gpt":0.2413408913193714,"score_spread":0.21371861769667394,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2159771978","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15828812,0.0011665333,0.8341448,0.00016119028,0.00015934442,0.000064131,0.00013826786,0.00107692,0.004800713],"genre_scores_gemma":[0.8021505,0.0006183473,0.19285904,0.000072852265,0.00008175018,0.00007020829,0.00023212892,0.00006823185,0.003846925],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995158,0.00008010084,0.00002478395,0.000056546734,0.00028278626,0.00004004528],"domain_scores_gemma":[0.99900717,0.0005195595,0.000076093704,0.00016546411,0.00019777264,0.000033917546],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004237193,0.00028695582,0.00024453548,0.00028092117,0.00022120496,0.0005165964,0.00063686154,0.00031397847,0.0021081583],"category_scores_gemma":[0.0023089095,0.00015163966,0.00015482004,0.00036507612,0.0006416738,0.0008706577,0.00044958515,0.00058047444,0.00031248532],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.001143294,0.00010944886,0.0015364689,0.00023045132,0.000049559523,0.00031065047,0.00018897437,0.119233176,0.24652618,0.020006843,0.0015569527,0.609108],"study_design_scores_gemma":[0.000059385573,0.00041938826,0.0013606938,0.00003231005,0.000040426483,0.00026996442,0.00004572654,0.74510443,0.23565786,0.011674343,0.0053003333,0.00003506289],"about_ca_topic_score_codex":0.002435677,"about_ca_topic_score_gemma":0.004053237,"teacher_disagreement_score":0.002435677,"about_ca_system_score_codex":0.00037563586,"about_ca_system_score_gemma":0.0003228656,"threshold_uncertainty_score":0.007052481},"labels":[],"label_agreement":null},{"id":"W2159885709","doi":"10.1109/ccece.2009.5090215","title":"Joint optimization of run-length coding, context-based arithmetic coding and quantization step sizes","year":2009,"lang":"en","type":"article","venue":"","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Blackberry (Canada); University of Waterloo","funders":"","keywords":"Huffman coding; Arithmetic coding; Lossless JPEG; JPEG; Computer science; JPEG 2000; Quantization (signal processing); Rate–distortion theory; Algorithm; Data compression; Context-adaptive binary arithmetic coding; Coding (social sciences); Rate–distortion optimization; Variable-length code; Shannon–Fano coding; Transform coding; Arithmetic; Image compression; Mathematics; Theoretical computer science; Artificial intelligence; Decoding methods; Discrete cosine transform; Image processing; Statistics; Multiview Video Coding","score_opus":0.024308671959958096,"score_gpt":0.2716124739718775,"score_spread":0.2473038020119194,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2159885709","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.040806327,0.00036616402,0.956092,0.00011591848,0.000039190283,0.00007865587,0.000038575705,0.0006236958,0.0018395061],"genre_scores_gemma":[0.5289092,0.00030570957,0.46818718,0.00006515416,0.000036125406,0.00021261642,0.0001141051,0.0001543415,0.002015642],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99956137,0.00011749293,0.00002859626,0.00008621556,0.00015889092,0.000047426223],"domain_scores_gemma":[0.99924326,0.00034639833,0.00010580452,0.00008150312,0.0001880417,0.000035036745],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007388425,0.0009628742,0.00061306887,0.0004189768,0.00018417016,0.0006196414,0.00075669383,0.00059565593,0.0012613216],"category_scores_gemma":[0.00429346,0.00023463953,0.0003036819,0.00056846504,0.00038680204,0.0010787038,0.0006514302,0.00070101535,0.00034986844],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00033401765,0.00017191049,0.0014369737,0.00018127314,0.00006623279,0.000089766065,0.00009305841,0.5410127,0.08809656,0.018642725,0.001741629,0.34813315],"study_design_scores_gemma":[0.000028800165,0.00011752836,0.0004184535,0.000013127971,0.000024572071,0.000050581835,0.000015562518,0.9717852,0.023375733,0.0031880185,0.0009661411,0.000016291611],"about_ca_topic_score_codex":0.0016716485,"about_ca_topic_score_gemma":0.0033579746,"teacher_disagreement_score":0.0016716485,"about_ca_system_score_codex":0.00047096104,"about_ca_system_score_gemma":0.0011672371,"threshold_uncertainty_score":0.004219532},"labels":[],"label_agreement":null},{"id":"W2160700974","doi":"10.1109/icpr.2002.1044813","title":"Distributed retrieval of wavelet images using bandwidth monitoring","year":2003,"lang":"en","type":"article","venue":"","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Computer science; Wavelet; Bandwidth (computing); Artificial intelligence; Computer vision; Wavelet transform; Pattern recognition (psychology); Telecommunications","score_opus":0.02942780290669358,"score_gpt":0.302112683133445,"score_spread":0.27268488022675147,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2160700974","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16917828,0.0010941413,0.82265675,0.00020814592,0.00005927803,0.000104266226,0.00005315818,0.0027225593,0.003923472],"genre_scores_gemma":[0.8588944,0.0004060855,0.13720748,0.00005451701,0.000072163544,0.000095073825,0.00013259662,0.00010813264,0.0030295493],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995914,0.00008217365,0.000025079476,0.00007567073,0.00018385067,0.000041863535],"domain_scores_gemma":[0.999191,0.00026950068,0.00007737807,0.00024684967,0.00017824006,0.00003700756],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005170977,0.00031907306,0.0006129479,0.0008296497,0.00034610508,0.0009065096,0.00083698466,0.0005734425,0.0012453105],"category_scores_gemma":[0.0021734454,0.00023716583,0.00019002319,0.00065524,0.00037760733,0.001751572,0.0009190737,0.000386741,0.00056285074],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011318692,0.00024738946,0.0015073026,0.00014352918,0.00005183026,0.00029762936,0.00022715126,0.04683939,0.4369576,0.008261499,0.0028402372,0.5014946],"study_design_scores_gemma":[0.0002581543,0.0003283183,0.0016902675,0.000017059108,0.000064635526,0.0007098604,0.00012122513,0.79557604,0.1850502,0.009224399,0.006907885,0.0000519635],"about_ca_topic_score_codex":0.0006796401,"about_ca_topic_score_gemma":0.000503497,"teacher_disagreement_score":0.0012453105,"about_ca_system_score_codex":0.00039718527,"about_ca_system_score_gemma":0.00029972405,"threshold_uncertainty_score":0.004166007},"labels":[],"label_agreement":null},{"id":"W2160813686","doi":"10.1109/icassp.1996.545733","title":"Low-power subband coding algorithm","year":2002,"lang":"en","type":"article","venue":"","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Algorithm; Vector quantization; Computer science; Computational complexity theory; Data compression; Coding (social sciences); Filter bank; Quantization (signal processing); Sub-band coding; Filter (signal processing); Speech coding; Speech recognition; Mathematics; Computer vision","score_opus":0.017911992443509273,"score_gpt":0.25149906188945936,"score_spread":0.2335870694459501,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2160813686","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005456051,0.0003058994,0.9747956,0.00018177426,0.00014391271,0.00018206956,0.0001785075,0.0018137487,0.016942449],"genre_scores_gemma":[0.1081917,0.00062635925,0.8526066,0.00059084035,0.00013317987,0.00037079284,0.001004601,0.00036237,0.03611355],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997491,0.000017433345,0.000013046728,0.00004346206,0.00014951594,0.00002744144],"domain_scores_gemma":[0.99974877,0.00003886928,0.000015516152,0.0000550236,0.0001314027,0.0000104394785],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016796443,0.00049962313,0.0003285824,0.0006474177,0.0004209669,0.0009351091,0.0007242058,0.000513493,0.011881902],"category_scores_gemma":[0.00070214394,0.00015325024,0.0002204743,0.00048167404,0.00033733965,0.00059099926,0.0004406758,0.00059172977,0.0067860936],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017114122,0.00006838415,0.0003176229,0.00014717488,0.000018356772,0.000104607345,0.00009472457,0.026381318,0.055508383,0.062358584,0.016981397,0.83784837],"study_design_scores_gemma":[0.00015618769,0.00023877934,0.00083233113,0.000085139145,0.00004592448,0.0007370783,0.00006401219,0.63780886,0.1273724,0.043679457,0.18891834,0.00006155082],"about_ca_topic_score_codex":0.0019317957,"about_ca_topic_score_gemma":0.002070672,"teacher_disagreement_score":0.011881902,"about_ca_system_score_codex":0.00049614045,"about_ca_system_score_gemma":0.00080125895,"threshold_uncertainty_score":0.039748847},"labels":[],"label_agreement":null},{"id":"W2160832637","doi":"10.82308/8568","title":"Modulation, pre-equalization and pulse shaping for PCM voiceband channels","year":2001,"lang":"en","type":"article","venue":"eScholarship@McGill (McGill)","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Pulse-code modulation; Electronic engineering; Analog transmission; Computer science; Encoder; Engineering; Analog signal; Telecommunications; Digital signal processing; Transmission (telecommunications)","score_opus":0.039866598283277654,"score_gpt":0.28792519344502204,"score_spread":0.2480585951617444,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2160832637","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010248788,0.0006518891,0.9813535,0.00011512267,0.00007116351,0.00005579629,0.000042565218,0.0003628562,0.0070982305],"genre_scores_gemma":[0.6830744,0.002450464,0.29875934,0.00026790486,0.00015756825,0.00013045015,0.0001790142,0.00016740966,0.014813491],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.999686,0.00006482698,0.000009613935,0.00004552708,0.00016771085,0.000026362652],"domain_scores_gemma":[0.9996074,0.0001961368,0.000041729043,0.000060158796,0.00008606968,0.000008549013],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003148567,0.0003953156,0.00031332477,0.000249262,0.00035843032,0.00064277527,0.0004133147,0.00059977703,0.0026370988],"category_scores_gemma":[0.0014874416,0.00015051458,0.00027095486,0.000475111,0.0004009169,0.00056424324,0.00028506506,0.00082873914,0.00090596516],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00035759492,0.00014763197,0.0013767974,0.00053691986,0.000031646006,0.00034309787,0.00036463793,0.24405158,0.18775277,0.16767837,0.004552158,0.39280683],"study_design_scores_gemma":[0.0000145418635,0.00019847191,0.00054527365,0.00007030286,0.000016637037,0.00057101424,0.000059069764,0.87574655,0.08112815,0.024733836,0.016882136,0.0000341157],"about_ca_topic_score_codex":0.00059091626,"about_ca_topic_score_gemma":0.00077899225,"teacher_disagreement_score":0.0026370988,"about_ca_system_score_codex":0.00049410586,"about_ca_system_score_gemma":0.00041616193,"threshold_uncertainty_score":0.008821964},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.016630669044424097,"score_gpt":0.24418621375826616,"score_spread":0.22755554471384207,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2161065057","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12756976,0.0053631566,0.84941566,0.0009902585,0.00020789028,0.00008439071,0.0004635606,0.0009797139,0.014925545],"genre_scores_gemma":[0.8769532,0.0028395224,0.113175906,0.0003259186,0.00019640596,0.00015415449,0.00083374797,0.00047989612,0.0050411886],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9958165,0.0012588544,0.00028033176,0.00048973603,0.0017905773,0.00036401674],"domain_scores_gemma":[0.94932824,0.042731743,0.0014339766,0.00304183,0.0032187593,0.00024552643],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0052647167,0.001153159,0.0013340616,0.00084096025,0.00068287796,0.0015838809,0.001687063,0.0012186905,0.003017199],"category_scores_gemma":[0.051513243,0.0006126676,0.00042644097,0.0013269881,0.0016791287,0.0032096393,0.0017803024,0.0015773462,0.0008452249],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010295565,0.000083136314,0.0030089342,0.00029951133,0.0000993917,0.00015348323,0.00013162641,0.84561914,0.015322218,0.032123722,0.0023484624,0.09978084],"study_design_scores_gemma":[0.000017131346,0.00021586592,0.0014346035,0.000051381518,0.000031234682,0.00042036618,0.00004679947,0.9580639,0.026338037,0.011783105,0.0015599466,0.000037652084],"about_ca_topic_score_codex":0.001966537,"about_ca_topic_score_gemma":0.0014269983,"teacher_disagreement_score":0.0052647167,"about_ca_system_score_codex":0.0027085505,"about_ca_system_score_gemma":0.00082668645,"threshold_uncertainty_score":0.02784282},"labels":[],"label_agreement":null},{"id":"W2161588199","doi":"10.1109/ccece.2008.4564622","title":"A two-stage algorithm for multiple description predictive coding","year":2008,"lang":"en","type":"article","venue":"Conference proceedings - Canadian Conference on Electrical and Computer Engineering","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Predictive coding; Encoder; Computer science; Coding (social sciences); Algorithm; Stage (stratigraphy); Mathematics; Statistics","score_opus":0.028734980683333366,"score_gpt":0.22679055633033068,"score_spread":0.19805557564699733,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2161588199","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00052310777,0.00011687345,0.9981419,0.000059887785,0.000032305124,0.000100105586,0.000039134116,0.00031477533,0.0006719409],"genre_scores_gemma":[0.043050993,0.00025058934,0.9523517,0.0001250568,0.000043176537,0.00045131572,0.0003061262,0.000073934185,0.003347176],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990201,0.00017291801,0.000060585873,0.00014698105,0.00050972006,0.00008965308],"domain_scores_gemma":[0.99932003,0.00025274197,0.000035458354,0.00014736054,0.0002159657,0.000028437567],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011710157,0.0008821187,0.0007990744,0.0012028981,0.00068485993,0.001106574,0.0027405026,0.0015008665,0.0063709533],"category_scores_gemma":[0.0023472558,0.00057326054,0.0006561236,0.0014051106,0.00067478576,0.0015172651,0.0024515607,0.0019804216,0.00215077],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001690129,0.000100048244,0.00030843684,0.00019929407,0.000055208486,0.0001882112,0.00011376093,0.09734173,0.013201781,0.07417027,0.008524193,0.80562806],"study_design_scores_gemma":[0.00006668217,0.00008794496,0.00015591641,0.000028009139,0.000022243983,0.00026125705,0.000016429363,0.95400023,0.009808471,0.026537545,0.008974377,0.000040828483],"about_ca_topic_score_codex":0.003583005,"about_ca_topic_score_gemma":0.0044247466,"teacher_disagreement_score":0.0063709533,"about_ca_system_score_codex":0.000778531,"about_ca_system_score_gemma":0.0018963288,"threshold_uncertainty_score":0.021313012},"labels":[],"label_agreement":null},{"id":"W2161837525","doi":"10.1109/tcsvt.2011.2179453","title":"Error-Resilient and Error Concealment 3-D SPIHT for Multiple Description Video Coding With Added Redundancy","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":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Redundancy (engineering); Set partitioning in hierarchical trees; Computer science; Algorithm; Wavelet; Coding (social sciences); Artificial intelligence; Pattern recognition (psychology); Wavelet transform; Computer vision; Mathematics; Discrete wavelet transform; Statistics","score_opus":0.06537689194422454,"score_gpt":0.2772072198290999,"score_spread":0.21183032788487538,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2161837525","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015127016,0.0002676008,0.9838018,0.000057174,0.000022460878,0.000023809996,0.00003345097,0.00020264435,0.00046407589],"genre_scores_gemma":[0.20073286,0.0004375247,0.7967842,0.000084143365,0.00003202729,0.000055217624,0.000230798,0.00005568872,0.0015874985],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9996922,0.000056587414,0.000015448877,0.000027055428,0.00019016484,0.000018445731],"domain_scores_gemma":[0.99953246,0.00019230106,0.000065227156,0.00008613738,0.00011106046,0.000012935321],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047945714,0.00038576397,0.0003486021,0.0007084949,0.00022198162,0.00036273565,0.00065214897,0.00055211276,0.0008276575],"category_scores_gemma":[0.0012883316,0.00017051472,0.00043466323,0.00052394194,0.00032135993,0.00082006806,0.0004647102,0.00065367226,0.00033701162],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003107565,0.00008462013,0.0007576729,0.00033748438,0.000078171906,0.00036809716,0.0002456948,0.21820837,0.15138097,0.034315504,0.0021910605,0.59172153],"study_design_scores_gemma":[0.000016573045,0.0001061821,0.00025250894,0.000019671219,0.000020876914,0.00041125866,0.0000160217,0.94168913,0.05104708,0.003461648,0.0029373064,0.00002173414],"about_ca_topic_score_codex":0.0008946459,"about_ca_topic_score_gemma":0.0013519698,"teacher_disagreement_score":0.0008946459,"about_ca_system_score_codex":0.0004276465,"about_ca_system_score_gemma":0.0004193322,"threshold_uncertainty_score":0.003102839},"labels":[],"label_agreement":null},{"id":"W2161931923","doi":"10.1109/lcn.1995.527359","title":"A performance study of adaptive video coding algorithms for high speed networks","year":2002,"lang":"en","type":"article","venue":"","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Saskatchewan","funders":"","keywords":"Computer science; Coding tree unit; Multiview Video Coding; Context-adaptive binary arithmetic coding; Coding (social sciences); Algorithm; Linear network coding; Data compression; Real-time computing; Context-adaptive variable-length coding; Adaptive coding; Video processing; Computer network; Video tracking; Artificial intelligence; Lossless compression; Decoding methods; Mathematics","score_opus":0.054844680164683815,"score_gpt":0.2842859946456457,"score_spread":0.2294413144809619,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2161931923","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22973399,0.011576478,0.7346549,0.0009972918,0.00018988464,0.00015376667,0.00007967122,0.00032515606,0.022288816],"genre_scores_gemma":[0.9449147,0.0040635886,0.047650635,0.00010563282,0.00015130163,0.00007534096,0.00010277443,0.000070133014,0.0028659862],"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99799687,0.0005983761,0.00005252151,0.00017130574,0.0010190824,0.00016189029],"domain_scores_gemma":[0.9867749,0.009403295,0.00073153636,0.0006300556,0.002321483,0.0001387539],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023228077,0.0007269353,0.00052176684,0.0009973447,0.0005498721,0.001327629,0.00082933827,0.0012608699,0.0014520476],"category_scores_gemma":[0.020532928,0.0002864466,0.0003408143,0.0017566059,0.0010401207,0.002466027,0.00049165037,0.00129651,0.0002759563],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020253906,0.0000972022,0.0025138468,0.00013073551,0.00005453423,0.000117968404,0.0001522471,0.80560577,0.008386597,0.11022492,0.0013459555,0.07116766],"study_design_scores_gemma":[0.0000055482433,0.00006537545,0.00051138,0.000012078937,0.00000686138,0.000068059235,0.0000148755935,0.9902298,0.0012675803,0.007185171,0.0006246157,0.000008532417],"about_ca_topic_score_codex":0.004271186,"about_ca_topic_score_gemma":0.0015001599,"teacher_disagreement_score":0.004271186,"about_ca_system_score_codex":0.0018769008,"about_ca_system_score_gemma":0.0010449885,"threshold_uncertainty_score":0.013617992},"labels":[],"label_agreement":null},{"id":"W2163029569","doi":"10.1109/icassp.2010.5495432","title":"A fast lossless compression scheme for digital map images using color separation","year":2010,"lang":"en","type":"article","venue":"","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Northern British Columbia","funders":"University of Northern British Columbia","keywords":"Lossless compression; Computer science; Data compression; Arithmetic coding; Raster graphics; Entropy encoding; Image compression; Raster scan; Color Cell Compression; Algorithm; Computer vision; Pixel; Artificial intelligence; Context-adaptive binary arithmetic coding; Image processing; Image (mathematics)","score_opus":0.02137437899048452,"score_gpt":0.34339036423333924,"score_spread":0.32201598524285474,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2163029569","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.055837408,0.0006826331,0.93885034,0.00023995995,0.0001333959,0.00010171955,0.00019043825,0.0013324989,0.0026316205],"genre_scores_gemma":[0.32185498,0.0007535773,0.66980124,0.0001665853,0.00015828456,0.00012306681,0.00053249474,0.00017886044,0.0064309984],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997918,0.000020560723,0.000009713754,0.000019388905,0.00013872977,0.000019792598],"domain_scores_gemma":[0.99963427,0.00010548699,0.000034808083,0.00009307454,0.00011678026,0.000015596113],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021480232,0.00040887677,0.00027847613,0.000871665,0.00024988782,0.00041795117,0.0005718136,0.00030303953,0.0018241578],"category_scores_gemma":[0.0007580608,0.0001359002,0.00023474405,0.00072737323,0.00032856106,0.0010069011,0.0005795841,0.0005243941,0.0005899522],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00039327246,0.000105622574,0.00071664475,0.0002752804,0.000043930006,0.00028963917,0.00016436318,0.018073672,0.27434102,0.012444633,0.0050124186,0.6881395],"study_design_scores_gemma":[0.0000832917,0.00035108242,0.0022485962,0.000053587737,0.000070978545,0.0016206043,0.00007907098,0.35816923,0.6058001,0.005155321,0.026287219,0.00008101384],"about_ca_topic_score_codex":0.00063144264,"about_ca_topic_score_gemma":0.00067642506,"teacher_disagreement_score":0.0018241578,"about_ca_system_score_codex":0.00023011542,"about_ca_system_score_gemma":0.00027109077,"threshold_uncertainty_score":0.0061024427},"labels":[],"label_agreement":null},{"id":"W2163114503","doi":"10.1109/icassp.2002.5743704","title":"Improved spectral tracking using interpolated linear prediction parameters","year":2002,"lang":"en","type":"article","venue":"IEEE International Conference on Acoustics Speech and Signal Processing","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Linear prediction; Linear predictive coding; Interpolation (computer graphics); Speech coding; Computer science; Linear interpolation; Smoothing; Image warping; Algorithm; Codec; Distortion (music); Code-excited linear prediction; Speech recognition; Artificial intelligence; Computer vision; Pattern recognition (psychology); Bandwidth (computing)","score_opus":0.07952398660335253,"score_gpt":0.3189378977877926,"score_spread":0.23941391118444005,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2163114503","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04350176,0.0002267254,0.9533184,0.000055638702,0.0000657035,0.0000270967,0.00006176206,0.0015756643,0.0011672581],"genre_scores_gemma":[0.2241824,0.00024057858,0.7717566,0.000059971844,0.00006516131,0.00005579929,0.00033532013,0.0003662324,0.002937986],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99947506,0.00007492013,0.000036646656,0.000121692414,0.00025264744,0.000039088816],"domain_scores_gemma":[0.99836653,0.0005585854,0.00017920912,0.00045188752,0.00040231668,0.000041537685],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007066126,0.00083128066,0.0005433324,0.0006472996,0.0003479689,0.000618365,0.00093148154,0.00087359827,0.0022231922],"category_scores_gemma":[0.0036674773,0.00042211273,0.0004606678,0.0009157852,0.00027370444,0.0016782824,0.0006535508,0.00118353,0.0014404936],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007877341,0.00021558076,0.002088322,0.00012650625,0.000082361985,0.0002281522,0.00027653677,0.13414475,0.29931676,0.0057641123,0.0016715277,0.5552976],"study_design_scores_gemma":[0.000043717653,0.00022333341,0.0013015536,0.00002032544,0.00005252035,0.0003964605,0.000024717463,0.7922847,0.1957189,0.0013979054,0.008462112,0.00007367037],"about_ca_topic_score_codex":0.00170753,"about_ca_topic_score_gemma":0.0017882404,"teacher_disagreement_score":0.0022231922,"about_ca_system_score_codex":0.0003133881,"about_ca_system_score_gemma":0.0005051647,"threshold_uncertainty_score":0.0074373484},"labels":[],"label_agreement":null},{"id":"W2163738205","doi":"10.1109/icassp.2002.5745071","title":"A finite-state vector quantizer for noisy channels","year":2002,"lang":"en","type":"article","venue":"IEEE International Conference on Acoustics Speech and Signal Processing","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"","keywords":"Decoding methods; Encoder; Computer science; Vector quantization; Additive white Gaussian noise; Algorithm; Quantization (signal processing); Channel (broadcasting); Gaussian; Control theory (sociology); Artificial intelligence; Telecommunications","score_opus":0.0841771246141185,"score_gpt":0.3266171760860755,"score_spread":0.242440051471957,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2163738205","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0037116741,0.00033108998,0.9948789,0.000073925774,0.00004501872,0.000017455892,0.000032499884,0.00013323719,0.0007761813],"genre_scores_gemma":[0.54307556,0.001020647,0.4510669,0.00019261382,0.000108215834,0.00015890338,0.0002016314,0.000054551925,0.0041208602],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99955076,0.00011588555,0.000034826357,0.00010013671,0.00017522911,0.000023144927],"domain_scores_gemma":[0.9994424,0.0002661126,0.0000619702,0.00009714791,0.00011821575,0.00001415055],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006793399,0.0003409365,0.0004876472,0.00019538107,0.00028247593,0.00074211525,0.0006930078,0.0006192573,0.0013992517],"category_scores_gemma":[0.0020941412,0.00017558712,0.00022382404,0.00037652912,0.0006174266,0.0011086055,0.00047075353,0.0007874772,0.00036380245],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001626807,0.00004164725,0.0005748357,0.00030932983,0.000055925473,0.00011779371,0.00014959511,0.42757213,0.0315315,0.2831981,0.0019763764,0.2543101],"study_design_scores_gemma":[0.000010601428,0.00005884671,0.00009516222,0.000023869097,0.000013422782,0.0000639034,0.000010333579,0.96915495,0.006920275,0.018966533,0.004666017,0.00001611018],"about_ca_topic_score_codex":0.0015497037,"about_ca_topic_score_gemma":0.0017142727,"teacher_disagreement_score":0.0015497037,"about_ca_system_score_codex":0.00050742563,"about_ca_system_score_gemma":0.00091052835,"threshold_uncertainty_score":0.0046809316},"labels":[],"label_agreement":null},{"id":"W2163868972","doi":"10.1109/dcc.2011.35","title":"Fast R-D Optimal Packetization of Embedded Bitstreams into Independent Source Packets","year":2011,"lang":"en","type":"article","venue":"","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Network packet; Interleaving; Computer science; Algorithm; Theoretical computer science; Computer network","score_opus":0.019374166169646555,"score_gpt":0.25270236554731024,"score_spread":0.2333281993776637,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2163868972","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.026288064,0.00015563222,0.9720104,0.00006877003,0.000015467023,0.000042253272,0.000026228598,0.00034969967,0.0010435946],"genre_scores_gemma":[0.32420227,0.00032999038,0.67137533,0.00007940377,0.00003465131,0.00012654041,0.00021989163,0.00015715936,0.003474753],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99974805,0.00004386894,0.000017632869,0.000046853213,0.000092523216,0.00005113517],"domain_scores_gemma":[0.99961925,0.0001958466,0.000043463624,0.000056279696,0.00006796291,0.000017240674],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041614246,0.0008627993,0.00072671496,0.00038611182,0.0002945109,0.00059856294,0.0006116337,0.00044462696,0.001492391],"category_scores_gemma":[0.0014019749,0.0002683421,0.0004172058,0.0004371383,0.00046235137,0.0010684293,0.0007801563,0.00066028134,0.00037046886],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00036642363,0.000086006265,0.000668896,0.00012734233,0.00003816665,0.00015155383,0.00017225984,0.51230687,0.051992107,0.0141399065,0.0019988639,0.41795167],"study_design_scores_gemma":[0.000017348226,0.000057992438,0.00011391776,0.0000046799555,0.000006718902,0.000088014975,0.000030631294,0.9741554,0.021915829,0.002666631,0.0009357189,0.000007209464],"about_ca_topic_score_codex":0.0020160933,"about_ca_topic_score_gemma":0.0020046101,"teacher_disagreement_score":0.0020160933,"about_ca_system_score_codex":0.0006843419,"about_ca_system_score_gemma":0.0009894718,"threshold_uncertainty_score":0.004992485},"labels":[],"label_agreement":null},{"id":"W2164196496","doi":"10.1109/dcc.2005.30","title":"Design of VQ-Based Hybrid Digital-Analog Joint Source-Channel Codes for Image Communication","year":2005,"lang":"en","type":"article","venue":"Data Compression Conference","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Computer science; Vector quantization; Additive white Gaussian noise; Communications system; Quantization (signal processing); Channel (broadcasting); Electronic engineering; Dynamic range; Bandwidth (computing); Noise shaping; Algorithm; Computer vision; Telecommunications; Engineering","score_opus":0.12035509914447806,"score_gpt":0.32568466638822324,"score_spread":0.20532956724374518,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2164196496","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.022054901,0.00044011642,0.97435886,0.0001587385,0.00012182841,0.00012801084,0.000056773217,0.0006710289,0.0020097846],"genre_scores_gemma":[0.6106721,0.0003886179,0.3834129,0.0002545571,0.0001114493,0.0002996971,0.00017150419,0.000043967815,0.0046452316],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994815,0.00013262435,0.000034517372,0.00008131896,0.00022206946,0.000047925827],"domain_scores_gemma":[0.9991105,0.00018048537,0.00012653352,0.00008216929,0.0004596061,0.00004072779],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005383367,0.0004324525,0.0004110677,0.00047626477,0.00052620843,0.00066205574,0.00094069465,0.00066233217,0.0015837506],"category_scores_gemma":[0.0011400806,0.00020384288,0.00018343757,0.00047181008,0.0004068288,0.00063308014,0.00065347884,0.0005598387,0.0006966913],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00067992375,0.00021089277,0.001786488,0.0004085936,0.0001636977,0.00035850398,0.00041588323,0.0680509,0.34246218,0.045691893,0.0064060725,0.53336495],"study_design_scores_gemma":[0.00015279379,0.0008874991,0.00085303816,0.000072659976,0.000078196244,0.0008160694,0.00006673214,0.8016661,0.16904302,0.0061281812,0.020139495,0.000096263415],"about_ca_topic_score_codex":0.001263371,"about_ca_topic_score_gemma":0.0021257023,"teacher_disagreement_score":0.0015837506,"about_ca_system_score_codex":0.0004978668,"about_ca_system_score_gemma":0.0008199817,"threshold_uncertainty_score":0.0052981973},"labels":[],"label_agreement":null},{"id":"W2164505483","doi":"10.1109/icassp.2001.941278","title":"Generalized S transform","year":2002,"lang":"en","type":"article","venue":"","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Integer (computer science); Mathematics; Scheme (mathematics); Algorithm; Discrete mathematics; Arithmetic; Computer science; Applied mathematics; Mathematical analysis","score_opus":0.029620183339629094,"score_gpt":0.26626324187960543,"score_spread":0.23664305853997633,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2164505483","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.030848224,0.0019709193,0.8787937,0.00080457114,0.00075160456,0.00013226215,0.00036533803,0.0013004513,0.085032955],"genre_scores_gemma":[0.54288924,0.0039963652,0.37880632,0.0014612499,0.0006293004,0.0002587809,0.0009139595,0.0005033765,0.07054138],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996867,0.000050999035,0.000017713344,0.00007477009,0.00012181909,0.000047984424],"domain_scores_gemma":[0.99971884,0.000064215994,0.000033405682,0.0000969603,0.000065410706,0.00002118342],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031407335,0.0005091546,0.0005210864,0.00070683355,0.00046403476,0.0011603871,0.00064916775,0.00086737,0.013760415],"category_scores_gemma":[0.0012215537,0.00017945883,0.00057386217,0.00081518304,0.0009868132,0.001511107,0.0010815009,0.0010413214,0.0034535958],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00024375183,0.00004031369,0.00035194418,0.00022401227,0.00002478473,0.00038691275,0.00013973509,0.023166694,0.05305246,0.64238167,0.01108003,0.2689077],"study_design_scores_gemma":[0.00012031282,0.00054351665,0.000574299,0.00012585813,0.000057506222,0.0025543238,0.0002100359,0.3056137,0.088314846,0.38520437,0.21654844,0.00013276494],"about_ca_topic_score_codex":0.0004433558,"about_ca_topic_score_gemma":0.00051612,"teacher_disagreement_score":0.013760415,"about_ca_system_score_codex":0.00038751343,"about_ca_system_score_gemma":0.00066698604,"threshold_uncertainty_score":0.046033204},"labels":[],"label_agreement":null},{"id":"W2164938435","doi":"10.1109/glocom.2005.1577874","title":"Joint source-channel decoding of convolutionally encoded multiple-descriptions","year":2005,"lang":"en","type":"article","venue":"GLOBECOM '05. IEEE Global Telecommunications Conference, 2005.","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"","keywords":"Convolutional code; Computer science; Decoding methods; Viterbi decoder; Viterbi algorithm; Algorithm; Sequential decoding; Turbo code; Binary erasure channel; Soft output Viterbi algorithm; Channel (broadcasting); Serial concatenated convolutional codes; Theoretical computer science; Concatenated error correction code; Telecommunications; Channel capacity; Block code","score_opus":0.05186381459234656,"score_gpt":0.29160493794875897,"score_spread":0.2397411233564124,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2164938435","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.060639054,0.0003289434,0.9360143,0.00018729702,0.000036624893,0.000061817445,0.00014237192,0.00040615583,0.002183417],"genre_scores_gemma":[0.842872,0.00021832928,0.15264681,0.00007212525,0.000020705202,0.00006102515,0.00024849622,0.00005462351,0.0038058609],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987118,0.00046194272,0.00007224319,0.00012581723,0.00044343414,0.00018466107],"domain_scores_gemma":[0.99668556,0.0021267731,0.00027306954,0.00040719417,0.0004327938,0.00007454264],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019854202,0.00066234986,0.00082093437,0.00046713607,0.00037773172,0.0009446137,0.00094329653,0.00096545095,0.0010809406],"category_scores_gemma":[0.0056210305,0.00041881364,0.00040786035,0.00074324483,0.00069934217,0.0014730309,0.0013148229,0.00096872135,0.00034933584],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000412655,0.00006558024,0.00095502316,0.000119832606,0.00006176301,0.00037391274,0.00015902835,0.8520412,0.010848738,0.070246115,0.0009133324,0.0638028],"study_design_scores_gemma":[0.000014974862,0.00003156458,0.000056749475,0.000007990188,0.0000060026887,0.000060497132,0.000011402393,0.9799468,0.010348276,0.009127393,0.000376861,0.000011530324],"about_ca_topic_score_codex":0.0035035936,"about_ca_topic_score_gemma":0.0038334557,"teacher_disagreement_score":0.0035035936,"about_ca_system_score_codex":0.0011000783,"about_ca_system_score_gemma":0.0018259472,"threshold_uncertainty_score":0.010500014},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.07186065655579724,"score_gpt":0.2791376371289322,"score_spread":0.20727698057313496,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2165238496","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007848129,0.00020175015,0.98897725,0.00013446149,0.00002824321,0.0000251116,0.000031978303,0.00038179677,0.0023712665],"genre_scores_gemma":[0.5115771,0.00038046757,0.47266504,0.00013234797,0.00009295888,0.00012012578,0.00017806816,0.00008369273,0.014770204],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99912566,0.0003318744,0.00003330496,0.000109867644,0.00032165635,0.00007760151],"domain_scores_gemma":[0.9995066,0.00018430044,0.000048768943,0.00013135983,0.000114044706,0.000014965047],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006621586,0.00048828305,0.0006040164,0.0002700064,0.0002876132,0.0009318157,0.000616306,0.0007310389,0.0019735019],"category_scores_gemma":[0.0011337559,0.00023231041,0.00037689254,0.00041074597,0.00056987366,0.0009694301,0.0009881746,0.0007042556,0.0010639299],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00038125558,0.00009475009,0.00078706746,0.00015899978,0.00011209054,0.00027761626,0.00017390898,0.6015956,0.052827355,0.108085535,0.0035251048,0.23198065],"study_design_scores_gemma":[0.00002673887,0.00007162951,0.00015640398,0.00001306304,0.000022860044,0.00011976299,0.000011131303,0.96822727,0.019011874,0.009397343,0.0029224698,0.000019418874],"about_ca_topic_score_codex":0.0012703163,"about_ca_topic_score_gemma":0.002537168,"teacher_disagreement_score":0.0019735019,"about_ca_system_score_codex":0.0004907175,"about_ca_system_score_gemma":0.0009320665,"threshold_uncertainty_score":0.006602049},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.014042808550889352,"score_gpt":0.306208180765932,"score_spread":0.29216537221504263,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2165307236","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.021172617,0.00025949616,0.9770108,0.0001741042,0.000027105827,0.000021949838,0.000045691842,0.00031226882,0.00097607466],"genre_scores_gemma":[0.38640416,0.0011548381,0.6088017,0.0002332718,0.00013671999,0.00010612434,0.00027388366,0.00019897251,0.002690368],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99979883,0.000030503828,0.0000089038185,0.000015273157,0.00013101085,0.000015444912],"domain_scores_gemma":[0.9996018,0.00017173788,0.000047591348,0.00007717835,0.00008300933,0.000018670715],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032911345,0.00033436497,0.00025986513,0.00036275256,0.000105899206,0.00032612626,0.00038315606,0.0002687474,0.001124217],"category_scores_gemma":[0.0012827183,0.000116842,0.00019474071,0.00039081168,0.00030965224,0.0006335078,0.00043473637,0.00047487486,0.00040725016],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00029337718,0.00003938572,0.00037272103,0.0001851558,0.00002028343,0.00024216234,0.00011255915,0.03055468,0.63791466,0.034741722,0.0026301797,0.2928932],"study_design_scores_gemma":[0.000064273445,0.00030683738,0.0008873885,0.00004953214,0.000043936016,0.0011224115,0.000042971235,0.54106283,0.42452553,0.015696453,0.016160574,0.000037303234],"about_ca_topic_score_codex":0.00021203936,"about_ca_topic_score_gemma":0.00028394695,"teacher_disagreement_score":0.001124217,"about_ca_system_score_codex":0.00019448758,"about_ca_system_score_gemma":0.00030142308,"threshold_uncertainty_score":0.0037608147},"labels":[],"label_agreement":null},{"id":"W2165387203","doi":"10.1049/cp.2011.1065","title":"A hybrid image compression technique based on DWT and DCT transforms","year":2011,"lang":"en","type":"article","venue":"","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":31,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Discrete cosine transform; Image compression; Computer science; Transform coding; Computer vision; Data compression; Artificial intelligence; Compression (physics); Image (mathematics); Texture compression; Image processing; Materials science","score_opus":0.019434840917978084,"score_gpt":0.25177545285164143,"score_spread":0.23234061193366334,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2165387203","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.042672705,0.0033868107,0.94693506,0.00027904572,0.00041041087,0.00018811943,0.00022582687,0.0011662487,0.004735634],"genre_scores_gemma":[0.20322895,0.0029312002,0.7833916,0.00030598472,0.0004070993,0.00013732187,0.00068319525,0.00014420444,0.008770411],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99961215,0.000026569556,0.000021331816,0.000050665596,0.00026786103,0.000021436741],"domain_scores_gemma":[0.99968815,0.000082526305,0.000028739518,0.00004566345,0.00013874806,0.000016250346],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029701003,0.0004894529,0.0005597523,0.0011610388,0.00020084248,0.0004272857,0.00048537835,0.00049367157,0.0014767844],"category_scores_gemma":[0.000718714,0.00019591086,0.00046670102,0.0012122917,0.0002350381,0.0008516662,0.0003956455,0.0006121919,0.00072272273],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023336381,0.00008386128,0.000810727,0.00038170858,0.000077864795,0.00039104425,0.000047755297,0.005832477,0.4930215,0.0043186992,0.0027384856,0.49206248],"study_design_scores_gemma":[0.00017911967,0.0015792903,0.007468535,0.00013583682,0.00027688965,0.0121960435,0.00009325596,0.2750293,0.6303273,0.0030940145,0.06946055,0.00015985427],"about_ca_topic_score_codex":0.000514764,"about_ca_topic_score_gemma":0.00093977596,"teacher_disagreement_score":0.0014767844,"about_ca_system_score_codex":0.0001558215,"about_ca_system_score_gemma":0.000247955,"threshold_uncertainty_score":0.0049403906},"labels":[],"label_agreement":null},{"id":"W2165449310","doi":"10.1109/pacrim.1995.519598","title":"A fixed-length compression method using the Karhunen-Loeve transform","year":2002,"lang":"en","type":"article","venue":"","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Block Truncation Coding; Karhunen–Loève theorem; Data compression; Compression ratio; Color Cell Compression; Compression (physics); Transform coding; Image compression; Artificial intelligence; Pixel; Computer vision; Computer science; Mathematics; Discrete cosine transform; Algorithm; Image processing; Materials science; Image (mathematics); Physics","score_opus":0.05487639258515852,"score_gpt":0.33018877974345495,"score_spread":0.2753123871582964,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2165449310","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017735556,0.0016026469,0.97549486,0.00022238168,0.00029186314,0.000119798664,0.00013047151,0.00126865,0.0031336942],"genre_scores_gemma":[0.13469888,0.0014194131,0.85645103,0.0001265616,0.00019913726,0.00013521878,0.00036079204,0.00015949298,0.006449442],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99976975,0.000024263418,0.000012974918,0.000030506837,0.00014571428,0.00001673246],"domain_scores_gemma":[0.9997044,0.00008438263,0.000038978058,0.00005753589,0.00009947266,0.000015164521],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002242042,0.000459637,0.0004338318,0.000991744,0.00036978206,0.00043670725,0.00077638583,0.0006145261,0.00376972],"category_scores_gemma":[0.00086950616,0.0001846574,0.00038230393,0.0007714285,0.0005114792,0.00091514806,0.0004710033,0.00068752805,0.001295855],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018033254,0.00007149585,0.0003790124,0.00026346577,0.00003850939,0.0003131408,0.00009297546,0.0071019647,0.3064981,0.010857616,0.0046008113,0.6696026],"study_design_scores_gemma":[0.00013020202,0.00067274226,0.0026849112,0.000108794826,0.00011960265,0.0058973413,0.000099929086,0.28692055,0.6303406,0.0057257977,0.06709551,0.00020391462],"about_ca_topic_score_codex":0.0007964897,"about_ca_topic_score_gemma":0.0010249927,"teacher_disagreement_score":0.00376972,"about_ca_system_score_codex":0.00030470392,"about_ca_system_score_gemma":0.00037169395,"threshold_uncertainty_score":0.012610972},"labels":[],"label_agreement":null},{"id":"W2165488956","doi":"10.1109/tbme.2007.912421","title":"Respiratory Sounds Compression","year":2008,"lang":"en","type":"article","venue":"IEEE Transactions on Biomedical Engineering","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"","keywords":"Signal compression; Computer science; Data compression; Speech recognition; Adaptive filter; Signal processing; Adaptive coding; Compression ratio; Cluster analysis; Sensitivity (control systems); Coding (social sciences); SIGNAL (programming language); Noise (video); Pattern recognition (psychology); Artificial intelligence; Digital signal processing; Algorithm; Lossless compression; Mathematics; Electronic engineering; Statistics; Engineering; Computer hardware","score_opus":0.02241657292531462,"score_gpt":0.24977489371288478,"score_spread":0.22735832078757015,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2165488956","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13648756,0.014018054,0.83221126,0.00092090096,0.0010695293,0.00042636014,0.0015017656,0.0020752687,0.011289294],"genre_scores_gemma":[0.57378495,0.008340312,0.3940566,0.00076449796,0.00080567505,0.000332742,0.0027482768,0.00028772137,0.018879253],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99973494,0.000036045098,0.00001766829,0.000047591515,0.00014626987,0.000017487915],"domain_scores_gemma":[0.99950933,0.0001947813,0.00003305071,0.000071295515,0.00017584978,0.000015721269],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003353041,0.0005589805,0.00043005604,0.0010152318,0.00018083419,0.00039985563,0.000530275,0.00072465965,0.0036732522],"category_scores_gemma":[0.0014957587,0.00012835127,0.00036991658,0.00094831816,0.00022499484,0.0004383685,0.00044073,0.00043301893,0.0013759604],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005959131,0.000067585104,0.000936838,0.00055094616,0.000043809225,0.000309626,0.000083192164,0.006896801,0.24687661,0.0026042815,0.0035467562,0.7374877],"study_design_scores_gemma":[0.00022115745,0.000864427,0.02075034,0.00026664115,0.00020912047,0.0057070227,0.0001580152,0.30226454,0.597027,0.0068065342,0.065578885,0.00014632009],"about_ca_topic_score_codex":0.0006573247,"about_ca_topic_score_gemma":0.0006531763,"teacher_disagreement_score":0.0036732522,"about_ca_system_score_codex":0.00016672238,"about_ca_system_score_gemma":0.00026887888,"threshold_uncertainty_score":0.012288272},"labels":[],"label_agreement":null},{"id":"W2167040761","doi":"10.1109/acssc.2005.1599812","title":"Multiple Description Conjugate Vector Quantizers with Side Distortion Compensation","year":2006,"lang":"en","type":"article","venue":"","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Computer science; Decoding methods; Speech coding; Algorithm; Erasure; Computational complexity theory; Channel (broadcasting); Coding (social sciences); Companding; Distortion (music); Speech recognition; Theoretical computer science; Mathematics; Telecommunications; Orthogonal frequency-division multiplexing; Statistics; Bandwidth (computing)","score_opus":0.016572064720701694,"score_gpt":0.23249593088432335,"score_spread":0.21592386616362166,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2167040761","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004501531,0.00042940365,0.99379164,0.00012335707,0.000047308273,0.00005911414,0.00008086914,0.00027941697,0.00068740797],"genre_scores_gemma":[0.26542488,0.0006012374,0.7262639,0.00032701495,0.00010480763,0.00025478174,0.0005362295,0.000081850005,0.0064052437],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987282,0.000325998,0.00012466266,0.00016471941,0.00059677137,0.000059701877],"domain_scores_gemma":[0.9983675,0.0006473953,0.00021110316,0.0003693172,0.00036694357,0.000037709815],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017819918,0.0006522518,0.0009795919,0.00050018495,0.00034900728,0.0010121838,0.0015717989,0.0009521596,0.003385496],"category_scores_gemma":[0.0040741526,0.00032125303,0.00045434886,0.0012245004,0.00057555886,0.0017405022,0.0012095827,0.0010261266,0.0009357794],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005461112,0.00010976951,0.0008539614,0.00036499885,0.00010240195,0.00013901148,0.00014464007,0.16832514,0.038555216,0.10924539,0.005863767,0.6757496],"study_design_scores_gemma":[0.00013055772,0.00023183116,0.0003694338,0.000025585163,0.00003276458,0.00023742914,0.000023856184,0.9255246,0.044392023,0.018901845,0.0100698965,0.000060271726],"about_ca_topic_score_codex":0.000942523,"about_ca_topic_score_gemma":0.0015021911,"teacher_disagreement_score":0.003385496,"about_ca_system_score_codex":0.0005944349,"about_ca_system_score_gemma":0.0010356712,"threshold_uncertainty_score":0.011325598},"labels":[],"label_agreement":null},{"id":"W2167116957","doi":"10.1109/spawc.2005.1506065","title":"VLSI architecture of a wireless channel estimator using sequential Monte Carlo methods","year":2005,"lang":"en","type":"article","venue":"","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Very-large-scale integration; Field-programmable gate array; Monte Carlo method; Estimator; Channel (broadcasting); Wireless; Parallel computing; Architecture; Fading; Computer architecture; Computer engineering; Algorithm; Computer hardware; Embedded system; Telecommunications; Mathematics","score_opus":0.0415519844161827,"score_gpt":0.3787217151006834,"score_spread":0.33716973068450073,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2167116957","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.021724772,0.0001869829,0.97368884,0.000089473135,0.00003388085,0.000056075718,0.00003111995,0.0012589939,0.0029299648],"genre_scores_gemma":[0.5248972,0.00020644505,0.47235745,0.000097362186,0.000039626528,0.00011367876,0.00008659804,0.000030376743,0.0021712852],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998093,0.00004677269,0.000010369649,0.000026987882,0.00008653196,0.000019985411],"domain_scores_gemma":[0.9997702,0.00009540855,0.00002060287,0.000028490942,0.000075215554,0.000010086895],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032560344,0.0002162187,0.00024931284,0.00028795615,0.0002217149,0.0003606198,0.00055063894,0.0003396434,0.0019089817],"category_scores_gemma":[0.00066124706,0.00016420643,0.00019111141,0.00021001522,0.00019514257,0.00031393414,0.00015849168,0.00029999277,0.0005056787],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005276298,0.00016741674,0.0033366191,0.00025003782,0.00014122254,0.00031835388,0.00016002274,0.32481125,0.14127055,0.04529064,0.0036226881,0.48010358],"study_design_scores_gemma":[0.00006338124,0.0002582328,0.0006944924,0.000013495261,0.000037285645,0.0002052992,0.000011151151,0.9649143,0.024304757,0.0034370148,0.006045138,0.000015365917],"about_ca_topic_score_codex":0.0018562955,"about_ca_topic_score_gemma":0.0025791212,"teacher_disagreement_score":0.0019089817,"about_ca_system_score_codex":0.00030727926,"about_ca_system_score_gemma":0.0006332039,"threshold_uncertainty_score":0.0063862205},"labels":[],"label_agreement":null},{"id":"W2167216303","doi":"10.1109/tcsvt.2004.825573","title":"Efficient Channel Protection for JPEG2000 Bitstream","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":32,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Computer science; Bitstream; Concatenation (mathematics); Channel (broadcasting); Robustness (evolution); Redundancy (engineering); Bit error rate; Convolutional code; Algorithm; Bit rate; Real-time computing; Decoding methods; Computer network; Mathematics; Arithmetic","score_opus":0.027732527012491525,"score_gpt":0.2635189451919529,"score_spread":0.2357864181794614,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2167216303","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15651883,0.002094664,0.83732015,0.0002141698,0.000107980515,0.00005598324,0.000099627556,0.00069593085,0.0028926316],"genre_scores_gemma":[0.88097566,0.0010038202,0.11412204,0.0000747948,0.00007323589,0.000034281293,0.00017452883,0.00004585503,0.00349574],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99983764,0.000030229483,0.000007153292,0.000019301791,0.00007660904,0.000029052451],"domain_scores_gemma":[0.99977726,0.00007305546,0.00003234877,0.000050728988,0.000054459466,0.0000122485135],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019661579,0.00032153554,0.00021711756,0.0003477429,0.0002294509,0.00029803062,0.000275985,0.0003334237,0.0010439169],"category_scores_gemma":[0.00049419556,0.000103940605,0.00019317263,0.00021413567,0.00026134652,0.00044224143,0.00041455554,0.00036589647,0.00023574529],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00053487666,0.000057340203,0.0010397619,0.00021576855,0.000053222484,0.0003391838,0.00011669312,0.056452155,0.59577155,0.012164798,0.0023212354,0.33093342],"study_design_scores_gemma":[0.000060333612,0.00027505384,0.0020546624,0.00003978179,0.00007144556,0.0009171811,0.000048369417,0.52107203,0.46305564,0.0040432573,0.008317896,0.00004440088],"about_ca_topic_score_codex":0.00068172603,"about_ca_topic_score_gemma":0.0010575212,"teacher_disagreement_score":0.0010439169,"about_ca_system_score_codex":0.0002163967,"about_ca_system_score_gemma":0.0002916886,"threshold_uncertainty_score":0.0034922361},"labels":[],"label_agreement":null},{"id":"W2167252182","doi":"10.1109/icc.1995.524439","title":"Fixed-rate entropy-coded vector quantization using linear (zero-one) programming","year":2002,"lang":"en","type":"article","venue":"","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Mathematics; Linear programming; Combinatorics; Entropy (arrow of time); Decoding methods; Discrete mathematics; Simplex; Algorithm; Mathematical optimization","score_opus":0.061934932500972574,"score_gpt":0.29429918396752214,"score_spread":0.23236425146654957,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2167252182","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005962529,0.00016328965,0.99126667,0.00007827315,0.0000129762375,0.000019533496,0.000019585388,0.00015979924,0.002317302],"genre_scores_gemma":[0.3762214,0.0004197752,0.61760163,0.000108151544,0.00003264578,0.00021218757,0.000118542455,0.00010153281,0.0051841675],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992499,0.00030129895,0.000027266637,0.00009091263,0.00025499536,0.0000755998],"domain_scores_gemma":[0.9991291,0.0006647822,0.00005209569,0.000030633244,0.00010769933,0.000015769741],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008469703,0.0005942253,0.00082556746,0.00031707593,0.00023898289,0.0011082371,0.0008956625,0.000640184,0.0019461985],"category_scores_gemma":[0.003001696,0.00030624104,0.00043193114,0.00095996447,0.00088739605,0.0013119433,0.00086303527,0.0010573515,0.00033870776],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000053439846,0.000028163777,0.000117975644,0.0000725489,0.000012205742,0.000043487034,0.000058572972,0.89578605,0.0012174691,0.044786166,0.0007353093,0.057088614],"study_design_scores_gemma":[0.0000043539726,0.000010760946,0.000012296819,0.0000046095133,0.0000016678828,0.0000067567685,0.0000047082476,0.9929559,0.00050549785,0.0062302183,0.00026029846,0.0000028426377],"about_ca_topic_score_codex":0.0044681383,"about_ca_topic_score_gemma":0.0042097974,"teacher_disagreement_score":0.0044681383,"about_ca_system_score_codex":0.0011578756,"about_ca_system_score_gemma":0.00096268154,"threshold_uncertainty_score":0.008884251},"labels":[],"label_agreement":null},{"id":"W2167665838","doi":"10.1109/ccece.2011.6030680","title":"Quantization noise estimation for log-PCM","year":2011,"lang":"en","type":"article","venue":"","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Computer science; Narrowband; Quantization (signal processing); Estimator; Wideband; Speech recognition; Noise (video); Noise measurement; Coding (social sciences); Algorithm; Telecommunications; Electronic engineering; Noise reduction; Mathematics; Statistics; Artificial intelligence; Engineering","score_opus":0.06031114875541676,"score_gpt":0.30682585754627856,"score_spread":0.2465147087908618,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2167665838","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0023144581,0.0009893208,0.9954144,0.000074483716,0.00007557618,0.000022432292,0.00008661663,0.00033306365,0.0006895743],"genre_scores_gemma":[0.23839396,0.0031692737,0.7498872,0.00018038676,0.000272127,0.00014784957,0.0011636646,0.0002280498,0.006557501],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99920505,0.00015245938,0.0000495718,0.0001392076,0.00042058146,0.000033158172],"domain_scores_gemma":[0.99915624,0.00036905793,0.000058624646,0.00010333235,0.0002983336,0.000014445473],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00055742403,0.00062151015,0.0005684345,0.0006448329,0.00029474712,0.0009453204,0.0006366686,0.0007457369,0.0035188326],"category_scores_gemma":[0.004520492,0.00020604061,0.00029058053,0.0008768402,0.0003201978,0.0009790275,0.0005343859,0.00071286026,0.0017000216],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000266085,0.000060296516,0.0011482595,0.00049808697,0.000046339843,0.000268135,0.000110432826,0.15155639,0.05203068,0.028523175,0.0055472353,0.75994486],"study_design_scores_gemma":[0.000014396769,0.00005031382,0.0009694577,0.000070781454,0.000015667805,0.00029814034,0.00003077465,0.94890296,0.029364428,0.010272089,0.009983204,0.000027719765],"about_ca_topic_score_codex":0.0019768113,"about_ca_topic_score_gemma":0.0021581682,"teacher_disagreement_score":0.0035188326,"about_ca_system_score_codex":0.0004781523,"about_ca_system_score_gemma":0.00058737193,"threshold_uncertainty_score":0.011771619},"labels":[],"label_agreement":null},{"id":"W2167814482","doi":"10.1109/icip.2008.4712187","title":"Lowcomplexity M-channel multiple description coding with two-rate predictive coding and staggered quantization","year":2008,"lang":"en","type":"article","venue":"","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Encoder; Coding (social sciences); Quantization (signal processing); Algorithm; Rate distortion; Rate–distortion theory; Computer science; Bit rate; Multiple description coding; Transform coding; Discrete cosine transform; Predictive coding; Theoretical computer science; Decoding methods; Invertible matrix; Pattern recognition (psychology); Mathematics; Artificial intelligence; Data compression; Image (mathematics); Statistics; Computer engineering","score_opus":0.05913989322179607,"score_gpt":0.2677260824292019,"score_spread":0.2085861892074058,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2167814482","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00412169,0.00070474367,0.9938637,0.00010230483,0.000051700004,0.00005121438,0.000062653504,0.00019153529,0.0008504075],"genre_scores_gemma":[0.18515868,0.00085904787,0.8092123,0.00021075034,0.00014039468,0.00021351624,0.00037615356,0.00006331234,0.0037658284],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99909174,0.00021053528,0.000051336698,0.00010031596,0.0004990097,0.000047050074],"domain_scores_gemma":[0.9991073,0.00038519508,0.00011890313,0.00019132912,0.00016885863,0.000028391358],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00096277613,0.0006445146,0.0007075995,0.0010453106,0.00032596212,0.00076328724,0.0015133144,0.00092829374,0.0017075595],"category_scores_gemma":[0.002872521,0.00030517342,0.0005625123,0.0014154171,0.00068032544,0.0016323172,0.0010447049,0.0014083721,0.0006216588],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004783992,0.00010959405,0.00056405336,0.00045713427,0.00009129136,0.0004611957,0.00015639656,0.16122167,0.050868876,0.120445825,0.005716337,0.65942925],"study_design_scores_gemma":[0.000042463893,0.000112068825,0.00020569154,0.00003805782,0.00002465895,0.0004121105,0.000013410778,0.9591408,0.022259451,0.012443053,0.005255519,0.000052714688],"about_ca_topic_score_codex":0.0021364621,"about_ca_topic_score_gemma":0.002570214,"teacher_disagreement_score":0.0021364621,"about_ca_system_score_codex":0.00070776074,"about_ca_system_score_gemma":0.00092469034,"threshold_uncertainty_score":0.0057123303},"labels":[],"label_agreement":null},{"id":"W2167837172","doi":"10.1109/ccece.1996.548252","title":"Piecewise self-affine fractal modelling of linear prediction excitations in speech compression","year":2002,"lang":"en","type":"article","venue":"","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"","keywords":"Iterated function system; Fractal; Affine transformation; Fractal compression; Interpolation (computer graphics); Piecewise; Mathematics; Iterated function; Computer science; Piecewise linear function; Applied mathematics; Algorithm; Pure mathematics; Mathematical analysis; Artificial intelligence; Image (mathematics); Image processing; Image compression","score_opus":0.043305959853313335,"score_gpt":0.2648913735778345,"score_spread":0.22158541372452115,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2167837172","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.076869376,0.00050106854,0.9192468,0.00008409352,0.000037555506,0.000021461841,0.000040978397,0.0004780573,0.0027205863],"genre_scores_gemma":[0.8155582,0.0006576831,0.17973362,0.000029503964,0.000037135764,0.000042355,0.000093320145,0.00007775744,0.0037703488],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9999027,0.000028842924,0.000005729444,0.0000103368775,0.000044215973,0.000008164652],"domain_scores_gemma":[0.9997553,0.00013769884,0.000025265428,0.00004028139,0.00003336748,0.000008116948],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002102831,0.00023631283,0.00021293608,0.00025590733,0.00017039022,0.00029801528,0.0002673709,0.00032265022,0.00074762106],"category_scores_gemma":[0.0008077517,0.00012165888,0.00023894964,0.00026246294,0.0003294742,0.0005299695,0.00017494656,0.00040196645,0.00023871439],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016701559,0.000038531765,0.0007466333,0.00012209687,0.00002042735,0.0003713175,0.00021148822,0.71386105,0.08289635,0.074939184,0.00087544636,0.1257505],"study_design_scores_gemma":[0.0000024645633,0.000034515993,0.00017687792,0.0000074140567,0.000004682989,0.00012227916,0.000008234389,0.98492855,0.008944618,0.0045276964,0.0012341511,0.000008443912],"about_ca_topic_score_codex":0.0008459573,"about_ca_topic_score_gemma":0.00071855925,"teacher_disagreement_score":0.0008459573,"about_ca_system_score_codex":0.00023008534,"about_ca_system_score_gemma":0.00015424743,"threshold_uncertainty_score":0.0025010705},"labels":[],"label_agreement":null},{"id":"W2167841881","doi":"10.1109/ccece.2001.933567","title":"Fixed block-based lossless compression of digital mammograms","year":2002,"lang":"en","type":"article","venue":"","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Lossless compression; Huffman coding; Computer science; Data compression; Image compression; Color Cell Compression; Entropy encoding; Lossy compression; Context-adaptive binary arithmetic coding; Data compression ratio; Compression ratio; Artificial intelligence; Algorithm; Computer vision; Image processing; Image (mathematics)","score_opus":0.02615848111786986,"score_gpt":0.24852593465285672,"score_spread":0.22236745353498685,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2167841881","genre_codex":"empirical","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.60865045,0.0036450892,0.380602,0.00032842928,0.0001443575,0.00023589988,0.0005152124,0.0011909746,0.0046875924],"genre_scores_gemma":[0.8431676,0.0012860969,0.15197596,0.00008134625,0.000066878194,0.000068435955,0.00055481604,0.00005829099,0.0027406097],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9998228,0.00003456415,0.00000969695,0.00001512094,0.00010381876,0.000014066564],"domain_scores_gemma":[0.9995747,0.00022147511,0.000038313643,0.00006840105,0.00008777819,0.000009239437],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033745123,0.00021453254,0.00020710519,0.00073034497,0.000120110584,0.00020331044,0.0004625088,0.00026172103,0.0011004421],"category_scores_gemma":[0.0017727579,0.00008622459,0.00011675869,0.0005627978,0.00022677121,0.0003434671,0.00019562768,0.00015095872,0.0002920481],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010381498,0.00013816035,0.0017449098,0.00028494353,0.000036270336,0.00056540174,0.00016659424,0.05999311,0.35354736,0.0036736755,0.0022736134,0.5765377],"study_design_scores_gemma":[0.00011024267,0.00082530157,0.009473267,0.0000735531,0.000072783994,0.0015904579,0.00008707616,0.57466304,0.40083742,0.002676522,0.009544167,0.000046212735],"about_ca_topic_score_codex":0.0010374582,"about_ca_topic_score_gemma":0.0008617489,"teacher_disagreement_score":0.0011004421,"about_ca_system_score_codex":0.00022434491,"about_ca_system_score_gemma":0.00015546236,"threshold_uncertainty_score":0.0036813617},"labels":[],"label_agreement":null},{"id":"W2167885192","doi":"10.1109/icme.2011.6011897","title":"Compression of 3D MRI images based on symmetry in prediction-error field","year":2011,"lang":"en","type":"article","venue":"","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Lossless compression; Computer science; Data compression; Compression (physics); Block (permutation group theory); Matching (statistics); Symmetry (geometry); Lossy compression; Artificial intelligence; Computer vision; Field (mathematics); Algorithm; Pattern recognition (psychology); Mathematics; Geometry","score_opus":0.02536617480719113,"score_gpt":0.27926732849033925,"score_spread":0.25390115368314814,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2167885192","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13421988,0.00096686295,0.8616837,0.00020076783,0.00010726086,0.00008290927,0.00019127296,0.00076418364,0.0017831218],"genre_scores_gemma":[0.62632006,0.001322801,0.3690585,0.00010055089,0.000094906594,0.00008770054,0.00056377024,0.000081096514,0.002370643],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998299,0.000032462656,0.000011514571,0.000013727581,0.00010098899,0.000011348105],"domain_scores_gemma":[0.9995933,0.00019433527,0.000055406308,0.00007917076,0.000066167435,0.000011677932],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027991916,0.00032181616,0.00034034124,0.00062198204,0.000099475954,0.00022809615,0.0003072538,0.00025848876,0.00091940514],"category_scores_gemma":[0.0011092515,0.00010516068,0.00022956097,0.00068478094,0.00024071378,0.0005003931,0.0002754663,0.0002643908,0.0003025987],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006792497,0.000115871386,0.0012903153,0.00019007555,0.00004636763,0.00060461846,0.00012753392,0.09241697,0.34434763,0.016409842,0.0025915513,0.5411799],"study_design_scores_gemma":[0.000047582693,0.00025977645,0.002773619,0.000022109842,0.000026465348,0.0013791776,0.000026349351,0.78942716,0.19681601,0.0057145916,0.0034742644,0.00003284751],"about_ca_topic_score_codex":0.0005380523,"about_ca_topic_score_gemma":0.00055221963,"teacher_disagreement_score":0.00091940514,"about_ca_system_score_codex":0.00013701609,"about_ca_system_score_gemma":0.00022828889,"threshold_uncertainty_score":0.0030757189},"labels":[],"label_agreement":null},{"id":"W2168022732","doi":"10.1109/icassp.2006.1660844","title":"Variable Frame Size for Vector Quantization","year":2006,"lang":"en","type":"article","venue":"","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Vector quantization; Speech coding; Quantization (signal processing); Lossy compression; Computer science; Linear predictive coding; Harmonic Vector Excitation Coding; Speech recognition; Data compression; Signal compression; Algorithm; Bit rate; Mathematics; Coding (social sciences); Artificial intelligence; Signal processing; Digital signal processing; Statistics","score_opus":0.008835981561027682,"score_gpt":0.25836181282868426,"score_spread":0.24952583126765657,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2168022732","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0060440823,0.002663907,0.9825989,0.00035135652,0.0006720129,0.00011572168,0.00023513663,0.00069137185,0.0066275597],"genre_scores_gemma":[0.20377529,0.002499496,0.7815744,0.0005697997,0.00047050347,0.00042897512,0.00083205325,0.00042277484,0.009426754],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991246,0.00021223133,0.000055569777,0.00017506038,0.00037564713,0.000056902387],"domain_scores_gemma":[0.99909973,0.00033543177,0.0000615424,0.00023241372,0.00024708148,0.000023744547],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006512046,0.0005266613,0.000525675,0.00043063716,0.00033917374,0.0008064578,0.0011496433,0.0008514556,0.009367932],"category_scores_gemma":[0.0039810087,0.00018428329,0.0002987068,0.001025183,0.0005302911,0.0014377641,0.00067724846,0.0012514264,0.0018651295],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004992631,0.00009290943,0.0005579332,0.00038556487,0.00005074933,0.00014553557,0.00013904793,0.03494288,0.10076455,0.2110583,0.023951663,0.6274116],"study_design_scores_gemma":[0.00017788557,0.0006077455,0.0018187015,0.0002454896,0.0000855642,0.0007955698,0.00010913551,0.5582625,0.112068646,0.10950409,0.21616532,0.0001593656],"about_ca_topic_score_codex":0.0009689268,"about_ca_topic_score_gemma":0.001172899,"teacher_disagreement_score":0.009367932,"about_ca_system_score_codex":0.0004781172,"about_ca_system_score_gemma":0.00037244076,"threshold_uncertainty_score":0.03133887},"labels":[],"label_agreement":null},{"id":"W2168133875","doi":"10.1109/iscas.2005.1465296","title":"Artificial Bandwidth Extension of Telephony Speech by Data Hiding","year":2005,"lang":"en","type":"article","venue":"","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":25,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Bandwidth extension; Telephony; Computer science; Extension (predicate logic); Bandwidth (computing); Speech recognition; Telecommunications; Speech coding; Programming language","score_opus":0.05066735251417853,"score_gpt":0.3174690984815497,"score_spread":0.26680174596737116,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2168133875","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5705926,0.0007559803,0.4258055,0.00011277537,0.000053349653,0.000024247056,0.000030115576,0.0005036501,0.0021217882],"genre_scores_gemma":[0.9476672,0.00031575857,0.05056717,0.000022549542,0.000019099223,0.000014281049,0.000037547765,0.000022028422,0.0013343634],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9999014,0.000023050095,0.000007684087,0.000014313426,0.000041351163,0.000012164422],"domain_scores_gemma":[0.9997557,0.00009646893,0.00004243344,0.0000618387,0.000034602792,0.000009024904],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014974656,0.0001876562,0.00015145208,0.00021609155,0.00009311831,0.000119516604,0.00023175312,0.00021368268,0.00044099582],"category_scores_gemma":[0.0004945629,0.00010182073,0.00015538649,0.00016607092,0.00028166565,0.0004538874,0.0003747197,0.00021079903,0.00015864393],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00034804578,0.000056481207,0.00047150766,0.00015324102,0.000015478492,0.0001475022,0.00017535809,0.014721804,0.842063,0.0042572557,0.0002563533,0.13733405],"study_design_scores_gemma":[0.000026363006,0.00022134733,0.0010947748,0.000020718448,0.000030228131,0.0007655606,0.000031012154,0.21580166,0.7749621,0.0016513951,0.005368148,0.000026631547],"about_ca_topic_score_codex":0.00010766716,"about_ca_topic_score_gemma":0.0001216604,"teacher_disagreement_score":0.00044099582,"about_ca_system_score_codex":0.00009705005,"about_ca_system_score_gemma":0.000068698246,"threshold_uncertainty_score":0.001475215},"labels":[],"label_agreement":null},{"id":"W2168256033","doi":"10.1109/tit.2011.2104990","title":"Fast Encoder Optimization for Multi-Resolution Scalar Quantizer Design","year":2011,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Encoder; Algorithm; Convex optimization; Distortion (music); Computer science; Scalar (mathematics); Mathematics; Quadratic equation; Mathematical optimization; Regular polygon; Bandwidth (computing)","score_opus":0.0618109044380348,"score_gpt":0.278808517238661,"score_spread":0.2169976128006262,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2168256033","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0016685987,0.000119377895,0.9976701,0.000030404704,0.000009631117,0.000013219115,0.0000134733355,0.0001310522,0.00034414508],"genre_scores_gemma":[0.18409112,0.00029409,0.8135104,0.00006537961,0.000027937731,0.00010185795,0.00010911601,0.00007934832,0.0017207393],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992454,0.00021378919,0.000051593943,0.00012026766,0.00032080614,0.000048216487],"domain_scores_gemma":[0.9992418,0.00036982365,0.000060142418,0.00012271275,0.0001883873,0.000017057844],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016921213,0.0006899544,0.00094020093,0.00046690748,0.00036537676,0.00090694585,0.00080243184,0.0006971838,0.0026910054],"category_scores_gemma":[0.0032639618,0.00046258484,0.00041202834,0.00063840544,0.00053282647,0.0014895415,0.0010458595,0.0012303196,0.00069146906],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00025013674,0.000053604625,0.00035499406,0.00025566656,0.000042031883,0.000093341936,0.00016305894,0.4909599,0.025187012,0.10622743,0.003183192,0.3732296],"study_design_scores_gemma":[0.000018581683,0.00004232833,0.000053706946,0.00001015289,0.000005096695,0.000042298227,0.000010745528,0.97870946,0.009030259,0.010422769,0.0016442101,0.000010431483],"about_ca_topic_score_codex":0.0010990744,"about_ca_topic_score_gemma":0.0017301226,"teacher_disagreement_score":0.0026910054,"about_ca_system_score_codex":0.0007035982,"about_ca_system_score_gemma":0.0010102422,"threshold_uncertainty_score":0.009002268},"labels":[],"label_agreement":null},{"id":"W2168632843","doi":"10.1109/dcc.2005.4","title":"A Fast Trellis-Based Rate-Allocation Algorithm for Robust Transmission of Progressively Coded Images over Noisy Channels","year":2005,"lang":"en","type":"article","venue":"Data Compression Conference","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Trellis (graph); Algorithm; Set partitioning in hierarchical trees; Computer science; Viterbi algorithm; Transmission (telecommunications); Channel (broadcasting); Soft output Viterbi algorithm; Binary search algorithm; Set (abstract data type); Decoding methods; Search algorithm; Image compression; Image (mathematics); Image processing; Artificial intelligence; Telecommunications; Sequential decoding; Block code","score_opus":0.06167895276373782,"score_gpt":0.32541282286905715,"score_spread":0.26373387010531935,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2168632843","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0049179248,0.0005492323,0.9923471,0.00009197739,0.000081715465,0.00006804702,0.000050668557,0.0008417222,0.001051601],"genre_scores_gemma":[0.1213766,0.0006466672,0.8713208,0.00012338907,0.00016057018,0.00026901835,0.00035378776,0.00019150936,0.005557705],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99942386,0.00014010655,0.000045926226,0.00008691876,0.00025368592,0.00004958928],"domain_scores_gemma":[0.9988772,0.0005095392,0.000117989905,0.00013328494,0.00032933612,0.000032570555],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011043961,0.00066779833,0.0006881931,0.000855802,0.0005118079,0.0007864768,0.0010422568,0.0008878515,0.0055992627],"category_scores_gemma":[0.002732158,0.00039455833,0.00042274134,0.0008214614,0.0006113307,0.00086459046,0.00060641137,0.0011071682,0.0022765615],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007821474,0.0000853103,0.0004017954,0.00033989138,0.00013594561,0.00026939856,0.00023202223,0.17055331,0.1374161,0.03458597,0.014159739,0.6410383],"study_design_scores_gemma":[0.00010581172,0.00026905953,0.00033279436,0.000043707318,0.000051303577,0.0005124604,0.000018733193,0.9309249,0.05079124,0.0067412527,0.010126205,0.00008254193],"about_ca_topic_score_codex":0.0016944993,"about_ca_topic_score_gemma":0.0028393378,"teacher_disagreement_score":0.0055992627,"about_ca_system_score_codex":0.00079537247,"about_ca_system_score_gemma":0.00086033775,"threshold_uncertainty_score":0.018731415},"labels":[],"label_agreement":null},{"id":"W2168896870","doi":"10.1109/ism.2006.128","title":"Practical Content-Adaptive Subsampling for Image and Video Compression","year":2006,"lang":"en","type":"article","venue":"","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Computer vision; Artificial intelligence; JPEG; Brightness; Data compression; Image (mathematics); Image compression; Image processing","score_opus":0.08114797988083193,"score_gpt":0.34668194973322297,"score_spread":0.265533969852391,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2168896870","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011507071,0.0009392231,0.98284274,0.00012544783,0.00009438843,0.00010954638,0.000040262676,0.0008082041,0.0035331012],"genre_scores_gemma":[0.14758173,0.0008002274,0.8482259,0.0001242212,0.0001153567,0.00010327903,0.00020447631,0.00009287391,0.0027520296],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9995778,0.00007826838,0.000015715332,0.000048446527,0.0002592895,0.00002040248],"domain_scores_gemma":[0.99967504,0.000108273445,0.000022971019,0.00008460674,0.00009652713,0.000012620086],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004285139,0.0005424395,0.00033492487,0.00061154313,0.00034036412,0.00043474403,0.0005380989,0.00044761784,0.002800016],"category_scores_gemma":[0.0014027322,0.00015427804,0.0002630637,0.0007540725,0.00030158664,0.0005543552,0.00043282288,0.00047584908,0.0010146778],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002283464,0.00008027141,0.00045195603,0.00013992442,0.000029439268,0.00013525206,0.000066095236,0.010826426,0.19307403,0.016110709,0.0040979944,0.77475953],"study_design_scores_gemma":[0.00008156801,0.00046552348,0.00252071,0.000057635763,0.00006652665,0.0017199817,0.00007610868,0.6092372,0.31674007,0.018053716,0.050927714,0.000053285872],"about_ca_topic_score_codex":0.000884976,"about_ca_topic_score_gemma":0.0017226344,"teacher_disagreement_score":0.002800016,"about_ca_system_score_codex":0.00029699362,"about_ca_system_score_gemma":0.00030806303,"threshold_uncertainty_score":0.009366989},"labels":[],"label_agreement":null},{"id":"W2169119453","doi":"10.1109/83.841529","title":"Indexing the output points of an LBVQ used for image transform coding","year":2000,"lang":"en","type":"article","venue":"IEEE Transactions on Image Processing","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Search engine indexing; JPEG; Discrete cosine transform; Transform coding; Mathematics; Data compression; Lattice (music); Image quality; Computer science; Algorithm; Pattern recognition (psychology); Image processing; Coding (social sciences); Artificial intelligence; Image (mathematics); Statistics","score_opus":0.022485348663973764,"score_gpt":0.30521285680767274,"score_spread":0.28272750814369896,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2169119453","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00597759,0.00031871084,0.9913208,0.00005713942,0.00010542946,0.000050574177,0.00013657515,0.0011208388,0.000912369],"genre_scores_gemma":[0.13888085,0.0005407371,0.854478,0.000098894736,0.00011276871,0.00025617215,0.0008898015,0.0002297241,0.004513007],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99931216,0.000095899275,0.000054977125,0.00008727483,0.00039950415,0.0000502407],"domain_scores_gemma":[0.99934345,0.00012850082,0.000058535283,0.00013530013,0.00029278168,0.00004144547],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005376716,0.0006007679,0.0007486045,0.00095402554,0.00049813924,0.00093650137,0.00096418103,0.0005602839,0.0038735524],"category_scores_gemma":[0.0020095683,0.00026529428,0.00036721374,0.0014396701,0.0005944077,0.001284707,0.000880717,0.0010089633,0.0023218046],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004671438,0.000094671,0.0007282025,0.00029054485,0.000030966305,0.0001544917,0.00013824188,0.018580215,0.23890145,0.018499572,0.0059802104,0.7161343],"study_design_scores_gemma":[0.0001309338,0.00044294898,0.0011559441,0.00007683719,0.00004631197,0.0008246011,0.00010281581,0.61943436,0.32247865,0.014263024,0.04092038,0.00012322915],"about_ca_topic_score_codex":0.002033308,"about_ca_topic_score_gemma":0.001976458,"teacher_disagreement_score":0.0038735524,"about_ca_system_score_codex":0.0006309595,"about_ca_system_score_gemma":0.0007517063,"threshold_uncertainty_score":0.012958348},"labels":[],"label_agreement":null},{"id":"W2169352241","doi":"10.1109/itwnit.2009.5158566","title":"Rate-distortion optimized network communication using general MDC","year":2009,"lang":"en","type":"article","venue":"","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Computer science; Coding (social sciences); Distortion (music); Multiple description coding; Joint (building); Scheme (mathematics); Rate distortion; Multimedia; Computer engineering; Real-time computing; Computer network; Theoretical computer science; Algorithm; Decoding methods; Bandwidth (computing)","score_opus":0.027001532874296685,"score_gpt":0.30708276807852614,"score_spread":0.28008123520422945,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2169352241","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009273258,0.00024461397,0.98928434,0.00010787899,0.000019942594,0.00004186233,0.00003061849,0.00010324215,0.0008942796],"genre_scores_gemma":[0.61193323,0.00045226692,0.38401374,0.00014762256,0.000049069025,0.00021921065,0.00017923694,0.000055101165,0.0029505023],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989779,0.00033765825,0.0000614102,0.00014087063,0.000398638,0.000083528066],"domain_scores_gemma":[0.99869174,0.00065746024,0.0001623329,0.00016167057,0.00029582664,0.000030943538],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001833114,0.0006931594,0.00072740304,0.0005291795,0.00032869267,0.00061732216,0.0009886092,0.00080168206,0.0008319181],"category_scores_gemma":[0.0032762806,0.00026085138,0.00028724762,0.0006613595,0.00067769235,0.0014958335,0.0009776992,0.0008545174,0.00021862693],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00031666487,0.00007105854,0.00040078015,0.000115571056,0.00004339573,0.00013222403,0.00008130168,0.79370797,0.020844715,0.07187529,0.00132565,0.11108541],"study_design_scores_gemma":[0.000015472304,0.000044728862,0.000045373487,0.0000052574237,0.000006522087,0.00004285678,0.0000040269106,0.9888315,0.004259633,0.0059605963,0.0007750601,0.000008932813],"about_ca_topic_score_codex":0.001542672,"about_ca_topic_score_gemma":0.0012421227,"teacher_disagreement_score":0.001833114,"about_ca_system_score_codex":0.0010548321,"about_ca_system_score_gemma":0.0010243747,"threshold_uncertainty_score":0.009694517},"labels":[],"label_agreement":null},{"id":"W2169530986","doi":"10.1109/tmm.2005.850967","title":"Progressive scalable interactive region-of-interest image coding using vector quantization","year":2005,"lang":"en","type":"article","venue":"IEEE Transactions on Multimedia","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Computer science; Encoder; Vector quantization; Computational complexity theory; Scalability; Quantization (signal processing); Algorithm; Data compression; Coding (social sciences); Computer vision; Artificial intelligence; Mathematics","score_opus":0.05985769026960499,"score_gpt":0.331599419061439,"score_spread":0.27174172879183406,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2169530986","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0147166485,0.00049465377,0.98273003,0.00007904654,0.000023663943,0.0000550768,0.000045604178,0.00060643774,0.0012488825],"genre_scores_gemma":[0.3013923,0.0006383808,0.69464284,0.00008685013,0.00004445637,0.00009506201,0.0002828824,0.00011950348,0.0026976778],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99963856,0.000061228,0.000020401598,0.000038384114,0.00020899465,0.000032366588],"domain_scores_gemma":[0.99944764,0.00021811583,0.0000475733,0.00011271735,0.00015165421,0.00002227399],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00055090326,0.00042689996,0.0004162135,0.0005372705,0.00016511991,0.00040119275,0.00091627706,0.00031998148,0.0012431785],"category_scores_gemma":[0.0013444071,0.00017255478,0.00034850673,0.00057709776,0.0004309967,0.0011750332,0.00064752967,0.0007596431,0.000309093],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00028302384,0.00010067678,0.00057307683,0.00021292205,0.00006426756,0.00041548602,0.00027766483,0.17463088,0.29011717,0.0481982,0.0036034817,0.48152322],"study_design_scores_gemma":[0.00004227255,0.0002028566,0.00033163006,0.000024386229,0.000023089035,0.00037705095,0.000026383244,0.8692846,0.115997404,0.0067316783,0.006918323,0.000040380317],"about_ca_topic_score_codex":0.001505325,"about_ca_topic_score_gemma":0.001953361,"teacher_disagreement_score":0.001505325,"about_ca_system_score_codex":0.00028236178,"about_ca_system_score_gemma":0.0003820074,"threshold_uncertainty_score":0.0041588545},"labels":[],"label_agreement":null},{"id":"W2169665194","doi":"10.1109/tencon.1991.753909","title":"Performance Evaluation Of Progressive Image Transmission Techniques","year":2005,"lang":"en","type":"article","venue":"","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Computer science; Image (mathematics); Computer vision; Transmission (telecommunications); Artificial intelligence; Bandwidth (computing); Image restoration; Image compression; Image processing; Feature detection (computer vision); Computer graphics (images); Telecommunications","score_opus":0.02123114707168851,"score_gpt":0.32884360806775,"score_spread":0.3076124609960615,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2169665194","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6573757,0.0043694624,0.3140152,0.00028286505,0.00019231997,0.00038472083,0.00046391325,0.005832145,0.0170837],"genre_scores_gemma":[0.9195794,0.0013951587,0.072093025,0.000054178905,0.00007011178,0.00008624061,0.0007762973,0.00023587137,0.005709732],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99862087,0.00022992108,0.0000605638,0.00015400792,0.0007598482,0.00017475417],"domain_scores_gemma":[0.995565,0.0023871476,0.0002475824,0.0004989021,0.0011427425,0.00015863705],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00096288155,0.00072657684,0.0004679064,0.0011387917,0.00038706855,0.00058823975,0.001174882,0.0005503674,0.0045095826],"category_scores_gemma":[0.007857108,0.00014443522,0.00027016498,0.0013971565,0.00033792577,0.000982642,0.0006295716,0.0004136411,0.00086170045],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0054282933,0.00063670654,0.0027065927,0.00054428255,0.00015880243,0.00055304787,0.00026648582,0.22928636,0.11539715,0.004275241,0.005833728,0.6349134],"study_design_scores_gemma":[0.00015540101,0.002733054,0.0026699302,0.000029460201,0.000099222925,0.0007946146,0.0001170015,0.89957666,0.08863291,0.0013011901,0.0038431138,0.000047587706],"about_ca_topic_score_codex":0.0038994001,"about_ca_topic_score_gemma":0.0020596832,"teacher_disagreement_score":0.0045095826,"about_ca_system_score_codex":0.000490036,"about_ca_system_score_gemma":0.0006040297,"threshold_uncertainty_score":0.015085995},"labels":[],"label_agreement":null},{"id":"W2170183661","doi":"10.1109/isimp.2001.925359","title":"Noncausal predictive lattice model for image compression","year":2002,"lang":"en","type":"article","venue":"","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Windsor","funders":"","keywords":"Lossy compression; Lossless compression; Image compression; Computer science; Data compression; Redundancy (engineering); Algorithm; Artificial intelligence; Codec; Predictive coding; Image plane; Image (mathematics); Computer vision; Mathematics; Image processing; Coding (social sciences)","score_opus":0.0426688238464089,"score_gpt":0.3016464091005967,"score_spread":0.2589775852541878,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2170183661","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010764426,0.00039820326,0.98465896,0.000299669,0.000068556816,0.000020827092,0.00006842377,0.0001847211,0.003536133],"genre_scores_gemma":[0.83449316,0.0013066134,0.154677,0.00024937914,0.00012647313,0.00017013917,0.00021280647,0.000061395076,0.008703055],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997465,0.00006371972,0.000008133737,0.00003105173,0.00013171141,0.000018908151],"domain_scores_gemma":[0.9996737,0.0001666921,0.000043052372,0.0000406904,0.000059512815,0.000016387186],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039425056,0.00036219103,0.00041068444,0.0002753051,0.0002218936,0.00060916325,0.00072878203,0.00055396697,0.0018303215],"category_scores_gemma":[0.0012095862,0.00017672357,0.00031097763,0.00036098575,0.000623733,0.0010677095,0.0003458963,0.001005845,0.0003349929],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010095842,0.000056091812,0.0003428598,0.00010857278,0.000028049852,0.00017051795,0.0000678711,0.6522509,0.008965981,0.29180294,0.0017743639,0.044330824],"study_design_scores_gemma":[0.0000055338105,0.000013562241,0.000027355049,0.000002498803,0.0000025707875,0.000021700673,0.0000034743862,0.98459274,0.00064262893,0.01406484,0.0006188063,0.000004354284],"about_ca_topic_score_codex":0.0015833669,"about_ca_topic_score_gemma":0.0014318193,"teacher_disagreement_score":0.0018303215,"about_ca_system_score_codex":0.00052462984,"about_ca_system_score_gemma":0.00062799733,"threshold_uncertainty_score":0.0061230063},"labels":[],"label_agreement":null},{"id":"W2170195546","doi":"10.1109/icassp.2006.1660372","title":"Block Tree Partitioning for Wavelet Based Color Image Compression","year":2006,"lang":"en","type":"article","venue":"","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Set partitioning in hierarchical trees; Computer science; Wavelet; Image compression; Data compression; Algorithm; Wavelet transform; Artificial intelligence; Color Cell Compression; Pattern recognition (psychology); Discrete wavelet transform; Image processing; Image (mathematics)","score_opus":0.0120887740739121,"score_gpt":0.2678970922305391,"score_spread":0.25580831815662697,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2170195546","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014581631,0.0010189798,0.98108613,0.00009564417,0.00006318035,0.000050718783,0.000052990566,0.00037287164,0.0026779303],"genre_scores_gemma":[0.16966362,0.0017868406,0.82269806,0.0000951235,0.00007582808,0.00011872783,0.0003534223,0.0001506275,0.005057698],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99983156,0.000031188672,0.000008917477,0.000014919843,0.00009987116,0.0000135082955],"domain_scores_gemma":[0.9997987,0.000086838154,0.000016634285,0.000029364182,0.000060593153,0.000007911528],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019433987,0.0002422252,0.0002614048,0.0005572458,0.00023052386,0.00036375943,0.00033992683,0.00026283856,0.0018585543],"category_scores_gemma":[0.00079924345,0.00009848013,0.00018267988,0.00079968193,0.0002918157,0.0006073244,0.00029995188,0.00043211418,0.00069435016],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023050034,0.00005106117,0.00029319173,0.00023860528,0.000025500794,0.00015684482,0.00016345686,0.051234614,0.14014825,0.07971648,0.004758266,0.72298336],"study_design_scores_gemma":[0.0000406994,0.00026494885,0.0007264948,0.000050231323,0.000038862167,0.0006728479,0.000065118016,0.8314628,0.090050034,0.03463739,0.041959465,0.00003115096],"about_ca_topic_score_codex":0.0007750671,"about_ca_topic_score_gemma":0.0010755248,"teacher_disagreement_score":0.0018585543,"about_ca_system_score_codex":0.00029752386,"about_ca_system_score_gemma":0.00029916392,"threshold_uncertainty_score":0.0062175393},"labels":[],"label_agreement":null},{"id":"W2170484997","doi":"10.1109/icip.2000.899846","title":"Scalable lossy to lossless video coding via adaptive 3D wavelet transform and context modeling","year":2000,"lang":"en","type":"article","venue":"","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Lifting scheme; Wavelet transform; Lossless compression; Lossy compression; Wavelet packet decomposition; Computer science; Discrete wavelet transform; Wavelet; Second-generation wavelet transform; Data compression; Arithmetic coding; Stationary wavelet transform; Entropy encoding; Motion compensation; Artificial intelligence; Algorithm; Context-adaptive binary arithmetic coding","score_opus":0.021980528569883806,"score_gpt":0.2596904147166605,"score_spread":0.23770988614677668,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2170484997","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.38129833,0.0010115383,0.6154281,0.00024105619,0.00003111781,0.00006573608,0.000070440496,0.00029354097,0.0015601432],"genre_scores_gemma":[0.87248623,0.0007327543,0.12574175,0.000067446985,0.000028100647,0.000035050958,0.000080945494,0.0000317872,0.00079594547],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99987364,0.000020872616,0.0000048482107,0.000013590778,0.000071449285,0.000015643738],"domain_scores_gemma":[0.9997608,0.00011181741,0.00003324946,0.00003933637,0.000041486594,0.0000133520625],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027302656,0.00034543723,0.00027172422,0.00026022093,0.0001124757,0.0002991973,0.0003369213,0.00020416244,0.00038223213],"category_scores_gemma":[0.0010028606,0.00014326793,0.00020339323,0.00028117976,0.00035708412,0.0007840403,0.0004267807,0.00039698958,0.000064130174],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00039370405,0.00011277733,0.00093409605,0.0001584842,0.000040992247,0.0005865759,0.00019510127,0.2962367,0.44389692,0.02499688,0.00092444825,0.23152328],"study_design_scores_gemma":[0.00002253943,0.0001261732,0.00073366944,0.000009103271,0.000009800785,0.0001573382,0.000022441967,0.9315077,0.062482703,0.0040218565,0.0008961331,0.000010495432],"about_ca_topic_score_codex":0.0009806757,"about_ca_topic_score_gemma":0.0011788955,"teacher_disagreement_score":0.0009806757,"about_ca_system_score_codex":0.00024828714,"about_ca_system_score_gemma":0.00021642247,"threshold_uncertainty_score":0.0019499063},"labels":[],"label_agreement":null},{"id":"W2170693749","doi":"10.1109/icassp.2008.4517872","title":"Joint source-chanel decoding of JPEG2000 images with unequal loss protection","year":2008,"lang":"en","type":"article","venue":"Proceedings of the ... IEEE International Conference on Acoustics, Speech, and Signal Processing","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Decoding methods; JPEG 2000; Joint (building); Computer science; Context (archaeology); Set (abstract data type); Resilience (materials science); Algorithm; Computer vision; Image (mathematics); Artificial intelligence; Image processing; Image compression; Engineering","score_opus":0.05950487015959868,"score_gpt":0.27410827926888454,"score_spread":0.21460340910928585,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2170693749","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02952784,0.00026720483,0.966658,0.000093790026,0.0000491512,0.00004718317,0.00006852512,0.0010315521,0.0022567029],"genre_scores_gemma":[0.26727635,0.00028322166,0.7229055,0.00006863521,0.000065665416,0.000063243104,0.00027973577,0.00024387705,0.008813739],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991375,0.00012179456,0.000054670625,0.00009267408,0.0005286928,0.00006463909],"domain_scores_gemma":[0.999076,0.00027153446,0.00009089612,0.00029126173,0.00023106496,0.000039252256],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007626234,0.0006826148,0.0006223209,0.0008102954,0.00037431982,0.00079375785,0.0007203549,0.00063097005,0.0017574932],"category_scores_gemma":[0.0028985308,0.00032587608,0.0004451558,0.0005462614,0.00043474633,0.0012667315,0.0013935659,0.0008290558,0.001055468],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006284002,0.00011970887,0.0009321509,0.00016206098,0.00007435389,0.00030396838,0.0003264101,0.03973828,0.29130006,0.01659984,0.0018374101,0.6479773],"study_design_scores_gemma":[0.000059987124,0.00021288346,0.0008442362,0.000034676883,0.000039407692,0.0007387238,0.000049895487,0.4992482,0.48369992,0.0075096264,0.0075128465,0.000049652266],"about_ca_topic_score_codex":0.00083014707,"about_ca_topic_score_gemma":0.0017018352,"teacher_disagreement_score":0.0017574932,"about_ca_system_score_codex":0.00034181782,"about_ca_system_score_gemma":0.0007607826,"threshold_uncertainty_score":0.005879402},"labels":[],"label_agreement":null},{"id":"W2170773382","doi":"10.1109/82.877156","title":"Reversible EZW-based image compression using best-transform selection and selective partial embedding","year":2000,"lang":"en","type":"article","venue":"IEEE Transactions on Circuits and Systems II Analog and Digital Signal Processing","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria; University of British Columbia","funders":"","keywords":"Embedding; Image compression; Wavelet transform; Artificial intelligence; Computer science; Compression (physics); Data compression; Computer vision; Image (mathematics); Wavelet; Mathematics; Image processing; Materials science","score_opus":0.022193639267980375,"score_gpt":0.27172328980365573,"score_spread":0.24952965053567536,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2170773382","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13045782,0.000815305,0.8605087,0.0001478954,0.0000933806,0.00017223872,0.00011163496,0.002288582,0.0054044905],"genre_scores_gemma":[0.5506542,0.0008559641,0.43818402,0.000115299874,0.00009035485,0.00014278643,0.00028617962,0.00015940757,0.009511878],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99988604,0.000013601525,0.000005504577,0.000016718153,0.0000655088,0.000012559229],"domain_scores_gemma":[0.9998497,0.000043846714,0.000026681513,0.000039186347,0.000032238266,0.000008394197],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016602153,0.00047083924,0.0003230645,0.0005452938,0.00020855255,0.00034898552,0.00070488243,0.0003319786,0.0016079642],"category_scores_gemma":[0.00038293444,0.00020766973,0.00024206475,0.00043122395,0.0004062914,0.0006746999,0.00039933814,0.00034332505,0.00063102145],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00029428987,0.00009031799,0.00040852826,0.00011109272,0.000039100625,0.00024905952,0.00005191668,0.009316017,0.5842686,0.0078016035,0.0014551993,0.3959143],"study_design_scores_gemma":[0.00006232127,0.00039046977,0.001126232,0.00001267246,0.0000506705,0.0011511368,0.000031637508,0.2048742,0.78449726,0.0016595747,0.006089113,0.000054713993],"about_ca_topic_score_codex":0.00051252113,"about_ca_topic_score_gemma":0.0016354433,"teacher_disagreement_score":0.0016079642,"about_ca_system_score_codex":0.00015334788,"about_ca_system_score_gemma":0.00025778462,"threshold_uncertainty_score":0.0053791404},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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)","score_opus":0.021616503987927957,"score_gpt":0.25141341626166525,"score_spread":0.22979691227373727,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2170855391","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011279342,0.030238738,0.8727138,0.0022872689,0.0022341777,0.00036432024,0.0010695461,0.0022411174,0.07757166],"genre_scores_gemma":[0.078343146,0.051135607,0.81992847,0.0010168268,0.0012722797,0.00036663274,0.0037470844,0.00063273404,0.04355722],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9990096,0.00013746996,0.000070213915,0.00007113473,0.0006708935,0.000040642244],"domain_scores_gemma":[0.99951744,0.00008098013,0.00004844665,0.00009094391,0.00024470725,0.000017370792],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010191294,0.00047475603,0.00034639772,0.0010036617,0.00030261342,0.001428058,0.00062991347,0.0010059777,0.00435913],"category_scores_gemma":[0.0029584893,0.00032984914,0.0002485183,0.0022240926,0.00048384792,0.0023423734,0.0006051412,0.0013487044,0.005190641],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017362292,0.00008769729,0.0005217336,0.00064177177,0.00003136803,0.0004650449,0.00022256003,0.012247068,0.050458174,0.27215597,0.06870083,0.59429413],"study_design_scores_gemma":[0.000066326065,0.00019946047,0.0018148124,0.0007903605,0.00004886647,0.0023498312,0.00019559008,0.058803685,0.045875978,0.12083619,0.76891184,0.00010714263],"about_ca_topic_score_codex":0.0009849351,"about_ca_topic_score_gemma":0.0009666364,"teacher_disagreement_score":0.00435913,"about_ca_system_score_codex":0.00039785242,"about_ca_system_score_gemma":0.0007158005,"threshold_uncertainty_score":0.014582753},"labels":[],"label_agreement":null},{"id":"W2170959418","doi":"10.1109/tsa.2003.814411","title":"Quantization of lsf parameters using a trellis modeling","year":2003,"lang":"en","type":"article","venue":"IEEE Transactions on Speech and Audio Processing","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Trellis quantization; Vector quantization; Algorithm; Quantization (signal processing); Speech recognition; Mathematics; Computer science; Trellis (graph); Speech coding; Decoding methods; Artificial intelligence; Image processing","score_opus":0.04364163151637969,"score_gpt":0.2915569645516571,"score_spread":0.2479153330352774,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2170959418","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003657015,0.00017821703,0.99476177,0.000050278297,0.000023794333,0.00003593749,0.00006859493,0.00033785607,0.0008866209],"genre_scores_gemma":[0.30335018,0.0008751864,0.68973005,0.00010803476,0.00007610349,0.0002562997,0.0005188342,0.00016574313,0.0049196198],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993748,0.00015707937,0.000049215083,0.00008748638,0.00028328132,0.00004809166],"domain_scores_gemma":[0.9991886,0.00033445153,0.0000954241,0.00012144528,0.00024429918,0.000015735675],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007036287,0.0005230044,0.000488507,0.0005304921,0.00034753926,0.0007858685,0.000771919,0.0006105533,0.0026486875],"category_scores_gemma":[0.0020208142,0.00030635696,0.0005949419,0.0007198848,0.00046473747,0.0010869286,0.00028550596,0.00093400764,0.0010424986],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017640651,0.00004998904,0.000412565,0.00014972211,0.000044830915,0.00010338657,0.00011107372,0.71452796,0.065877676,0.05966205,0.0023756314,0.15650868],"study_design_scores_gemma":[0.000008463563,0.000054882476,0.00009123177,0.000010936506,0.000008615039,0.00005265874,0.00000656242,0.98023903,0.013364778,0.003892994,0.0022544416,0.0000154642],"about_ca_topic_score_codex":0.004621288,"about_ca_topic_score_gemma":0.005157181,"teacher_disagreement_score":0.004621288,"about_ca_system_score_codex":0.0009451137,"about_ca_system_score_gemma":0.0009916887,"threshold_uncertainty_score":0.009188771},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Lossless compression; Computer science; Context (archaeology); Data compression; Theoretical computer science; Computer engineering; Algorithm","score_opus":0.016101060052439116,"score_gpt":0.28585642504167746,"score_spread":0.26975536498923836,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2171033838","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06419432,0.00226153,0.9217109,0.0002782479,0.00022042391,0.00013742411,0.00016197831,0.0014114404,0.00962377],"genre_scores_gemma":[0.66553915,0.0014412405,0.32615834,0.00061651727,0.0002656718,0.00011921975,0.0005065088,0.0001658432,0.0051875724],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996475,0.000036749236,0.000014941186,0.00006315745,0.00019392681,0.0000438279],"domain_scores_gemma":[0.9995764,0.00007009849,0.000049890685,0.00012951302,0.00015230513,0.00002173941],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026828554,0.0006719707,0.0003591873,0.0007805538,0.00025800592,0.0006082226,0.0008537926,0.00055264484,0.0009980995],"category_scores_gemma":[0.0009027773,0.00016176715,0.00028886079,0.00068335515,0.00040712618,0.0007855585,0.0008476223,0.0010281825,0.00046446445],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00056210044,0.00017976968,0.001772084,0.00025658033,0.000046321267,0.00049707736,0.00019054704,0.084723555,0.21230683,0.02179415,0.0046170256,0.673054],"study_design_scores_gemma":[0.00006241769,0.00038866122,0.0021695392,0.00006000481,0.000076455624,0.0011742923,0.00008532878,0.7858444,0.17919475,0.0048115733,0.026063507,0.00006907177],"about_ca_topic_score_codex":0.0012302375,"about_ca_topic_score_gemma":0.002286626,"teacher_disagreement_score":0.0012302375,"about_ca_system_score_codex":0.00034796444,"about_ca_system_score_gemma":0.00042520466,"threshold_uncertainty_score":0.0033389926},"labels":[],"label_agreement":null},{"id":"W2171479664","doi":"10.1109/isit.2004.1365338","title":"Lagrangian global optimization of two-description scalar quantizers","year":2004,"lang":"en","type":"article","venue":"","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Lagrangian; Lagrangian relaxation; Lagrange multiplier; Scalar (mathematics); Mathematical optimization; Augmented Lagrangian method; Multiplier (economics); Mathematics; Class (philosophy); Key (lock); Computer science; Applied mathematics; Artificial intelligence","score_opus":0.01728044091658392,"score_gpt":0.2855572313564843,"score_spread":0.2682767904399004,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2171479664","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003501677,0.00009139061,0.9948061,0.00006174217,0.00001071188,0.000018178409,0.000020601074,0.00008880508,0.0014007448],"genre_scores_gemma":[0.37176868,0.00028884897,0.6207609,0.00013932024,0.00003336175,0.00020541047,0.00016920436,0.00011340078,0.006520788],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995208,0.00015620042,0.000023838136,0.00007557992,0.00017835925,0.00004525483],"domain_scores_gemma":[0.99938476,0.0003233041,0.00007472712,0.000080127924,0.00011695828,0.00002013132],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001727439,0.0006901244,0.00082604314,0.0003455183,0.0002190031,0.0008195528,0.00094373076,0.00068460964,0.002672218],"category_scores_gemma":[0.00236834,0.00039578925,0.00037272117,0.0004863541,0.0008055764,0.0012834106,0.0009988406,0.0009972497,0.00048404443],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012723364,0.000029830837,0.00015426295,0.00014986168,0.000025926478,0.00005799554,0.00006579243,0.73236525,0.006368666,0.16222529,0.0021858963,0.09624397],"study_design_scores_gemma":[0.000024127112,0.000042526837,0.00002372892,0.000008049072,0.0000041342014,0.000014289183,0.0000048423954,0.9807884,0.0018369036,0.01623939,0.0010068387,0.0000068250965],"about_ca_topic_score_codex":0.00069549255,"about_ca_topic_score_gemma":0.00077552296,"teacher_disagreement_score":0.002672218,"about_ca_system_score_codex":0.0008497086,"about_ca_system_score_gemma":0.0009723498,"threshold_uncertainty_score":0.0091356635},"labels":[],"label_agreement":null},{"id":"W2171645635","doi":"10.5281/zenodo.38901","title":"Dynamically Adding Redundancy For Improved Error Concealment In Packet Voice Coding","year":2004,"lang":"en","type":"article","venue":"eScholarship@McGill (McGill)","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Computer science; Network packet; Redundancy (engineering); Real-time computing; Frame (networking); Bit error rate; Coding (social sciences); Packet loss; Computer network; Algorithm; Speech recognition; Decoding methods; Mathematics","score_opus":0.023201995625227463,"score_gpt":0.28105213866870266,"score_spread":0.2578501430434752,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2171645635","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23364688,0.0010931325,0.7608997,0.0002268375,0.00014519856,0.00007053679,0.000053746066,0.0013030262,0.0025608789],"genre_scores_gemma":[0.7976976,0.00045184384,0.19971657,0.00006505131,0.00004620392,0.000041879168,0.00008809267,0.00009217042,0.0018006219],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99960023,0.000109417706,0.00002580083,0.000052456646,0.00016380944,0.0000481835],"domain_scores_gemma":[0.9991824,0.00037713582,0.000101023936,0.00014160009,0.00017610689,0.000021619591],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000552889,0.00049637054,0.00036650043,0.00062066363,0.00029676178,0.0003776676,0.00056768645,0.00043000665,0.0010300664],"category_scores_gemma":[0.0026552356,0.00019100084,0.00025362094,0.0003484534,0.0003182152,0.0008578937,0.000572543,0.00046332338,0.000387113],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010162623,0.00017975539,0.0012113499,0.00018508888,0.000045523782,0.00040049184,0.00028976,0.22997762,0.3400646,0.015878085,0.0014721699,0.4092793],"study_design_scores_gemma":[0.000034404587,0.0002834105,0.00043277544,0.000024120256,0.0000344753,0.00023508216,0.000023240465,0.8717575,0.122431144,0.002500626,0.0022155936,0.000027658072],"about_ca_topic_score_codex":0.0009769826,"about_ca_topic_score_gemma":0.00088558294,"teacher_disagreement_score":0.0010300664,"about_ca_system_score_codex":0.00031669738,"about_ca_system_score_gemma":0.00035355956,"threshold_uncertainty_score":0.0034458637},"labels":[],"label_agreement":null},{"id":"W2172078673","doi":"10.1109/wescan.1997.627107","title":"Very low bit rate video coding for visual communications","year":2002,"lang":"en","type":"article","venue":"","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Coding (social sciences); Bit rate; Visual communication; Computer vision; Artificial intelligence; Context-adaptive binary arithmetic coding; Coding tree unit; MPEG-4; Multimedia; Data compression; Decoding methods; Computer engineering; Algorithm; Mathematics","score_opus":0.05601309128860657,"score_gpt":0.33367318809746677,"score_spread":0.27766009680886017,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2172078673","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0031903745,0.10347385,0.82767385,0.002320311,0.0031542822,0.0005037804,0.00062228984,0.0011687587,0.057892535],"genre_scores_gemma":[0.09022093,0.14342873,0.6742275,0.0034604622,0.0031876443,0.001458055,0.003295797,0.0006798081,0.080041066],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99945885,0.00011760417,0.000035110505,0.000038077254,0.00031313268,0.000037191472],"domain_scores_gemma":[0.99949384,0.00016478015,0.000038561997,0.0000694245,0.00021384907,0.000019483614],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038383278,0.00065941724,0.0005634202,0.0010320835,0.00047135315,0.00094579975,0.00087146653,0.0010645575,0.0119814025],"category_scores_gemma":[0.0016135904,0.0001812701,0.00026041403,0.0018123016,0.0006990723,0.001048704,0.0008191351,0.0017181704,0.006562723],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009862915,0.000036007386,0.00014420891,0.0012202658,0.000030036419,0.00023189119,0.00016181574,0.006058111,0.032593507,0.18999305,0.07774782,0.69168454],"study_design_scores_gemma":[0.00004494869,0.00018452703,0.0007823209,0.0012111363,0.000049885704,0.0012917371,0.000100667756,0.039945442,0.019605767,0.15349343,0.783163,0.00012712485],"about_ca_topic_score_codex":0.0017562138,"about_ca_topic_score_gemma":0.0017196392,"teacher_disagreement_score":0.0119814025,"about_ca_system_score_codex":0.00060440367,"about_ca_system_score_gemma":0.0006327912,"threshold_uncertainty_score":0.04008174},"labels":[],"label_agreement":null},{"id":"W2172163894","doi":"10.1109/dcc.2006.63","title":"Optimal Index Assignment for Multiple Description Lattice Vector Quantization","year":2006,"lang":"en","type":"article","venue":"","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":27,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Mathematics; Lattice (music); Algorithm; Asymptotically optimal algorithm; Rate–distortion theory; Mathematical optimization; Entropy (arrow of time); Vector quantization; Discrete mathematics; Applied mathematics","score_opus":0.025456897896732045,"score_gpt":0.272437750010621,"score_spread":0.24698085211388893,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2172163894","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018028256,0.00033266938,0.9776342,0.00017494954,0.000037770922,0.00004168816,0.00008786937,0.0005824259,0.003080146],"genre_scores_gemma":[0.35674202,0.00029274475,0.6382793,0.00013506225,0.00004100646,0.00012567593,0.00038142208,0.00018606942,0.0038166463],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990773,0.00023916908,0.000072949195,0.000115123206,0.00040694117,0.00008844228],"domain_scores_gemma":[0.99908113,0.00038180713,0.00008548176,0.00016986334,0.00022594782,0.000055720087],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008791001,0.00041508186,0.0005946695,0.0006792759,0.0005707491,0.0011994181,0.001110452,0.0005606854,0.0039240704],"category_scores_gemma":[0.0039082654,0.00028925764,0.00025880762,0.0012705082,0.00085257116,0.0024051345,0.0015037567,0.00097447174,0.00091209554],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00027862136,0.000090086134,0.0007122293,0.0002049019,0.000021012886,0.000097046766,0.0002484316,0.14525795,0.016472518,0.16992283,0.0066891583,0.6600052],"study_design_scores_gemma":[0.00003621229,0.000060497965,0.00012812832,0.00001874599,0.0000066474727,0.00009581416,0.00008211621,0.88445365,0.014073472,0.09634992,0.0046719257,0.000022928542],"about_ca_topic_score_codex":0.0012489882,"about_ca_topic_score_gemma":0.0016670299,"teacher_disagreement_score":0.0039240704,"about_ca_system_score_codex":0.0010015544,"about_ca_system_score_gemma":0.0009119714,"threshold_uncertainty_score":0.013127327},"labels":[],"label_agreement":null},{"id":"W2172198472","doi":"10.1109/ijcnn.2008.4633785","title":"A modified Vector Quantization based image compression technique using wavelet transform","year":2008,"lang":"en","type":"article","venue":"","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"","keywords":"Vector quantization; Codebook; Huffman coding; Artificial intelligence; Image compression; Discrete wavelet transform; Pattern recognition (psychology); Mathematics; Peak signal-to-noise ratio; Wavelet; Compression ratio; Quantization (signal processing); Data compression; Computer science; Wavelet transform; Linde–Buzo–Gray algorithm; Computer vision; Stationary wavelet transform; Image processing; Image (mathematics)","score_opus":0.04472232304191538,"score_gpt":0.29787699516838295,"score_spread":0.2531546721264676,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2172198472","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010597871,0.0016083801,0.9844945,0.00019455545,0.00031243393,0.000114546274,0.00008858543,0.0007451113,0.0018439906],"genre_scores_gemma":[0.15258513,0.0021503374,0.83521974,0.00024640647,0.0002909649,0.0001960683,0.00044148383,0.0000937891,0.008776125],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9993857,0.000065568,0.00003459929,0.000059668182,0.00043247195,0.000021985223],"domain_scores_gemma":[0.99968565,0.00006595203,0.000033875007,0.000045379293,0.00015772636,0.000011474262],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036906783,0.00042865585,0.0006128983,0.00078142376,0.0002471617,0.0005075301,0.0007557174,0.00053418806,0.0016884401],"category_scores_gemma":[0.0009979198,0.00016726331,0.00036140205,0.0012862085,0.0002997775,0.00083600945,0.0004042758,0.00066302816,0.00080714014],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014839,0.00006934567,0.00027889197,0.00029209236,0.0000463625,0.00026463598,0.00008166211,0.017845366,0.20335323,0.011911459,0.004999745,0.76070887],"study_design_scores_gemma":[0.000124899,0.0008887358,0.002177019,0.000093704766,0.00008924248,0.003689514,0.00006656155,0.72306836,0.19934443,0.006663876,0.06366263,0.00013113531],"about_ca_topic_score_codex":0.00097051536,"about_ca_topic_score_gemma":0.0009949299,"teacher_disagreement_score":0.0016884401,"about_ca_system_score_codex":0.00026953156,"about_ca_system_score_gemma":0.00037666643,"threshold_uncertainty_score":0.005648434},"labels":[],"label_agreement":null},{"id":"W2172207459","doi":"10.1109/ccece.2005.1556920","title":"60-channel dual tone multi-frequency signaling receiver based on Goertzel algorithm on single 100MIPS TSM320C54 DSP platform","year":2006,"lang":"en","type":"article","venue":"","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Tone (literature); Computer science; Dual (grammatical number); Digital signal processing; Channel (broadcasting); Detector; Electronic engineering; Algorithm; Speech recognition; Computer hardware; Engineering; Telecommunications","score_opus":0.03505467919523272,"score_gpt":0.2814034422573605,"score_spread":0.2463487630621278,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2172207459","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17568094,0.0006360613,0.80120456,0.00023849274,0.00015009365,0.00034103653,0.00027081787,0.009623681,0.011854333],"genre_scores_gemma":[0.62597436,0.00044499207,0.35153472,0.0002604222,0.0001016383,0.00012433631,0.00043568196,0.00015938553,0.020964472],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9995733,0.00003529088,0.000020308451,0.00007010014,0.00024611608,0.000054944],"domain_scores_gemma":[0.99970216,0.000043632946,0.000036011825,0.00004114359,0.00015122195,0.000025799056],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032768425,0.0003312884,0.0006267841,0.00063267635,0.00022989721,0.00043502325,0.00089982833,0.00063993386,0.005083386],"category_scores_gemma":[0.00040627862,0.00020104172,0.00018538759,0.00039298154,0.000145878,0.00062121934,0.00030745068,0.00041829975,0.0022155968],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00057540595,0.00014854666,0.0024683378,0.00019193308,0.00004452891,0.0003178586,0.00010709512,0.0038517625,0.82060087,0.0061641475,0.0034279574,0.16210158],"study_design_scores_gemma":[0.00022582347,0.0017529672,0.0055220383,0.00004035454,0.00014359855,0.002601659,0.00005520863,0.12737992,0.8263381,0.0011445568,0.034686908,0.00010884084],"about_ca_topic_score_codex":0.0007429662,"about_ca_topic_score_gemma":0.0009817731,"teacher_disagreement_score":0.005083386,"about_ca_system_score_codex":0.0002686024,"about_ca_system_score_gemma":0.00047811994,"threshold_uncertainty_score":0.017005622},"labels":[],"label_agreement":null},{"id":"W2173044382","doi":"10.1109/pacrim.2015.7334808","title":"Bit allocation for lossy image set compression","year":2015,"lang":"en","type":"article","venue":"","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Lethbridge","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Lossy compression; Redundancy (engineering); Image compression; Computer science; ENCODE; Artificial intelligence; Image quality; Data compression; Residual; Computer vision; Image (mathematics); Distortion (music); Set partitioning in hierarchical trees; Image processing; Pattern recognition (psychology); Algorithm","score_opus":0.06989862134318427,"score_gpt":0.35418048296054416,"score_spread":0.2842818616173599,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2173044382","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.050384246,0.0008867999,0.944939,0.0002576382,0.000038976348,0.00005981656,0.00006971869,0.00032596535,0.0030378487],"genre_scores_gemma":[0.7264176,0.0008487786,0.26854494,0.0001571501,0.000030701976,0.00012689321,0.00013300602,0.000101325764,0.0036395544],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997719,0.00006912771,0.000011164406,0.000019857525,0.00010646584,0.000021553968],"domain_scores_gemma":[0.9996971,0.00014826746,0.000035550875,0.000046582754,0.000059386188,0.000013192432],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036165142,0.00032415698,0.00042704766,0.00041702308,0.00022373591,0.00048105896,0.0005623657,0.00039117067,0.0015551345],"category_scores_gemma":[0.0014513762,0.00018330854,0.00015799992,0.00051558553,0.00042213447,0.0008561939,0.0005081819,0.00054385595,0.00033342687],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006936048,0.00014063685,0.0005338162,0.00021723036,0.00003308568,0.00021817845,0.00017881053,0.56460416,0.06643437,0.07536899,0.004070089,0.287507],"study_design_scores_gemma":[0.000016999304,0.000046348716,0.00010086831,0.000016095108,0.000005310322,0.00006996946,0.000008905634,0.9810098,0.009089892,0.008511625,0.0011165105,0.000007766365],"about_ca_topic_score_codex":0.00087938126,"about_ca_topic_score_gemma":0.0007792193,"teacher_disagreement_score":0.0015551345,"about_ca_system_score_codex":0.0005471968,"about_ca_system_score_gemma":0.00037707546,"threshold_uncertainty_score":0.005202472},"labels":[],"label_agreement":null},{"id":"W2227482266","doi":"","title":"Mise en oeuvre d'un algorithme de traitement de la parole basé sur la quantification vectorielle pour une prothèse cochléaire","year":2001,"lang":"fr","type":"article","venue":"Knowledge UdeS (Institutional Deposit of the University of Sherbrooke)","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Medicine","score_opus":0.017624053675799542,"score_gpt":0.24363081719141874,"score_spread":0.2260067635156192,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2227482266","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00644145,0.00046162543,0.99016666,0.00020161057,0.000066694316,0.000054162396,0.00005299802,0.00092800235,0.0016266869],"genre_scores_gemma":[0.13990064,0.0014527411,0.8458094,0.00025029952,0.00007717723,0.000260809,0.00033099772,0.00033658714,0.01158134],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9986706,0.00019560047,0.000108915316,0.00040653584,0.0005048383,0.00011349024],"domain_scores_gemma":[0.9986418,0.0006752654,0.00011056147,0.0001307714,0.00040676357,0.00003475466],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013400951,0.0011512772,0.0010737466,0.00096877775,0.00061231846,0.0023488866,0.0011296049,0.0012237285,0.006130542],"category_scores_gemma":[0.0031100889,0.0006340608,0.001442361,0.00054751005,0.0008336258,0.0015848374,0.0012916784,0.0013545912,0.0018263401],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00030729471,0.0000682304,0.0028307023,0.000620324,0.0001592179,0.00016602162,0.0003807441,0.16086003,0.068304315,0.027976431,0.00408593,0.7342407],"study_design_scores_gemma":[0.000065602515,0.0003193955,0.00348527,0.00021170874,0.00011982164,0.00041059134,0.00025096026,0.8981754,0.0548019,0.017043527,0.025009876,0.0001058192],"about_ca_topic_score_codex":0.008329608,"about_ca_topic_score_gemma":0.007380654,"teacher_disagreement_score":0.008329608,"about_ca_system_score_codex":0.0011933867,"about_ca_system_score_gemma":0.00247555,"threshold_uncertainty_score":0.020508707},"labels":[],"label_agreement":null},{"id":"W2237434365","doi":"10.1007/978-1-4614-1183-3_1","title":"Development of On-Board Data Compression Technology at Canadian Space Agency","year":2011,"lang":"en","type":"book-chapter","venue":"","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"Canadian Space Agency","funders":"","keywords":"Agency (philosophy); Space (punctuation); Government (linguistics); Subject (documents); On board; Order (exchange); Political science; Computer science; Business; Public administration; Engineering; Library science; Sociology; Aerospace engineering; Finance; Social science","score_opus":0.07758960763394782,"score_gpt":0.28290515091651525,"score_spread":0.20531554328256743,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2237434365","genre_codex":"other","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0046792696,0.019760353,0.050835274,0.0028164207,0.002418721,0.00017436786,0.00091697334,0.0013276718,0.917071],"genre_scores_gemma":[0.012047102,0.010897952,0.020185782,0.0002721948,0.00013955377,0.00002852298,0.0004650269,0.00032783445,0.95563596],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99937904,0.000019141813,0.0000076214387,0.000037031965,0.00050957775,0.000047630998],"domain_scores_gemma":[0.99932003,0.000058175738,0.000010323359,0.00003394396,0.000529295,0.000048214893],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005310258,0.0007683361,0.00029641626,0.0021436287,0.0013153595,0.002222803,0.0010325301,0.00080001,0.036595944],"category_scores_gemma":[0.00070504,0.00038513303,0.0002380952,0.0022163263,0.00068106723,0.001306009,0.00056263426,0.0013053804,0.008094656],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000031633837,0.00004018695,0.0002621652,0.00023422117,0.000005414544,0.00011149743,0.00042871846,0.0017163849,0.008497041,0.097352885,0.2649583,0.6263615],"study_design_scores_gemma":[0.0000019314773,0.000008258494,0.0002671753,0.00006504748,0.0000027586198,0.00006890646,0.000031878357,0.00077755406,0.0034697829,0.001872186,0.9934273,0.0000072533358],"about_ca_topic_score_codex":0.27819788,"about_ca_topic_score_gemma":0.41935065,"teacher_disagreement_score":0.27819788,"about_ca_system_score_codex":0.007823495,"about_ca_system_score_gemma":0.0092260055,"threshold_uncertainty_score":0.5531572},"labels":[],"label_agreement":null},{"id":"W2246123910","doi":"10.1007/978-3-319-20801-5_14","title":"Adaptive Weighted Neighbors Lossless Image Coding","year":2015,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Lossless compression; Coding (social sciences); Computer science; Adaptive coding; Artificial intelligence; Computer vision; Mathematics; Data compression; Statistics","score_opus":0.030259303705598917,"score_gpt":0.2843909619216404,"score_spread":0.25413165821604145,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2246123910","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010798078,0.0008708809,0.9762967,0.00012244124,0.00014115618,0.000027488773,0.000076252625,0.00033550386,0.011331483],"genre_scores_gemma":[0.2900679,0.0027945738,0.64465445,0.0002531959,0.00016808709,0.00009860675,0.00059456204,0.0003141547,0.061054476],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9998388,0.000017722814,0.000005684109,0.000025367546,0.00010088131,0.000011494071],"domain_scores_gemma":[0.99983585,0.000039465995,0.00001257275,0.000051933257,0.00005378838,0.000006499471],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001728863,0.0004294047,0.00032625935,0.0004324348,0.00012526475,0.00048861036,0.00087636744,0.0004107534,0.003281997],"category_scores_gemma":[0.0005797073,0.00016897146,0.00018371886,0.00055649533,0.00034035748,0.0010065142,0.00059796934,0.0008379718,0.0010217023],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018737739,0.00007922293,0.00016535744,0.0001419741,0.00002881816,0.00007997856,0.000056882614,0.07578651,0.07502938,0.07668887,0.009397815,0.7623579],"study_design_scores_gemma":[0.000013986847,0.000069051224,0.0003003278,0.00004471038,0.000021883523,0.0003751818,0.000025176158,0.9010171,0.053363565,0.026603442,0.018143624,0.000022043843],"about_ca_topic_score_codex":0.00081398763,"about_ca_topic_score_gemma":0.0015754108,"teacher_disagreement_score":0.003281997,"about_ca_system_score_codex":0.00027034897,"about_ca_system_score_gemma":0.00022569182,"threshold_uncertainty_score":0.010979414},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.03466931739647738,"score_gpt":0.2778103459508886,"score_spread":0.24314102855441122,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2264175841","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02642719,0.012328036,0.9552233,0.00085976644,0.00049683306,0.00006627107,0.000099536104,0.00038227366,0.0041167745],"genre_scores_gemma":[0.56320775,0.02354474,0.3972996,0.00038682917,0.00122593,0.00022418486,0.0004571003,0.00012342291,0.013530427],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99950695,0.00008841022,0.00003067963,0.000040572297,0.0003043027,0.000029140361],"domain_scores_gemma":[0.99918944,0.00040674745,0.000059107315,0.00012219879,0.00020610559,0.00001645021],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00053233077,0.00042548144,0.00037054252,0.001021619,0.00028521157,0.0005403797,0.0006207627,0.0005638457,0.0013482178],"category_scores_gemma":[0.002538869,0.00023696397,0.0001938827,0.0015993499,0.0005000939,0.0012648146,0.0005131329,0.0007278874,0.00042274277],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023665602,0.00011833077,0.0010814994,0.0004386094,0.00006309344,0.00024689667,0.00017074328,0.12572598,0.04252035,0.04405964,0.00570291,0.77963525],"study_design_scores_gemma":[0.000027335896,0.00012301019,0.001234764,0.00011114963,0.000035127377,0.0005740045,0.00011029307,0.9099211,0.034775354,0.039197795,0.013866945,0.000023180699],"about_ca_topic_score_codex":0.0008622696,"about_ca_topic_score_gemma":0.0006930494,"teacher_disagreement_score":0.0013482178,"about_ca_system_score_codex":0.00029903103,"about_ca_system_score_gemma":0.00030741494,"threshold_uncertainty_score":0.0045102835},"labels":[],"label_agreement":null},{"id":"W2288973801","doi":"10.1109/globalsip.2015.7418275","title":"A novel frequency domain BWE with relaxed synchronization and associated BWE switching","year":2015,"lang":"en","type":"article","venue":"","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"VoiceAge (Canada)","funders":"","keywords":"Computer science; Codec; Algorithm; Synchronization (alternating current); Coding (social sciences); Frequency domain; Speech coding; Bandwidth extension; Real-time computing; Speech recognition; Computer network; Telecommunications; Mathematics; Computer vision","score_opus":0.01896107197321811,"score_gpt":0.24954342614004385,"score_spread":0.23058235416682574,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2288973801","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.034728795,0.0004595533,0.9583219,0.00017516773,0.00011815853,0.00008160177,0.00006724308,0.0005884462,0.005459093],"genre_scores_gemma":[0.40107673,0.0004526535,0.58734214,0.00030680775,0.00019644068,0.00013790664,0.00033144988,0.00015730294,0.0099984985],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99943346,0.00010801525,0.00003575531,0.00009876143,0.00025594863,0.00006803126],"domain_scores_gemma":[0.99940145,0.00014581808,0.00007786434,0.00016888806,0.00016183902,0.000044111526],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004685558,0.0004929235,0.0003947863,0.00062611717,0.00044659222,0.00068405695,0.0008128103,0.0007209288,0.0025381516],"category_scores_gemma":[0.001192864,0.00018078541,0.0002599194,0.0005002679,0.0005445176,0.0012786728,0.0010029317,0.0009694615,0.0010940748],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006558299,0.00016874618,0.00071008963,0.00016554295,0.000043937995,0.00024596532,0.00014691196,0.016022125,0.50499797,0.04226321,0.0018920307,0.4326877],"study_design_scores_gemma":[0.0001775147,0.0010193612,0.0018667545,0.000087603534,0.00007037732,0.0027990523,0.0000919657,0.45047373,0.4679007,0.013090177,0.062290914,0.00013181183],"about_ca_topic_score_codex":0.00035056256,"about_ca_topic_score_gemma":0.00054518075,"teacher_disagreement_score":0.0025381516,"about_ca_system_score_codex":0.00024623075,"about_ca_system_score_gemma":0.0003382702,"threshold_uncertainty_score":0.00849092},"labels":[],"label_agreement":null},{"id":"W2291599359","doi":"10.1109/globalsip.2015.7418277","title":"Enhanced AMR-WB bandwidth extension in 3GPP EVS codec","year":2015,"lang":"en","type":"article","venue":"","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"VoiceAge (Canada)","funders":"","keywords":"Computer science; Codec; Bandwidth extension; Subframe; Bandwidth (computing); Decorrelation; Electronic engineering; Speech recognition; Algorithm; Speech coding; Telecommunications; Engineering","score_opus":0.0402007375084272,"score_gpt":0.3089794945911407,"score_spread":0.2687787570827135,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2291599359","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12153928,0.0008215802,0.86569494,0.00015615457,0.00010512496,0.00006539176,0.00013764069,0.0019393454,0.009540536],"genre_scores_gemma":[0.6735179,0.0004029481,0.31584066,0.0001785888,0.00008714479,0.000108869615,0.00066797854,0.00026880528,0.008927151],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99925846,0.0001409145,0.000029670146,0.000075350894,0.0004132759,0.0000823437],"domain_scores_gemma":[0.9993037,0.000141679,0.00006328113,0.0001672306,0.00030303877,0.000021060352],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005224765,0.0005895211,0.00029529195,0.00061642495,0.00017573235,0.0004021985,0.00036953486,0.00040664055,0.0013817429],"category_scores_gemma":[0.0014726958,0.00011779018,0.0002868229,0.0003362576,0.00030927252,0.00046402725,0.00070906366,0.00056306936,0.0008694822],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006966275,0.00008096961,0.0024008641,0.00012726129,0.000035855322,0.00048047284,0.00019854581,0.050084356,0.41556835,0.0109962905,0.0021197083,0.5172107],"study_design_scores_gemma":[0.00005605064,0.0003917157,0.0055300593,0.00008243328,0.000043518816,0.0021173789,0.00010800738,0.5893535,0.3616037,0.0033800625,0.037257582,0.00007592965],"about_ca_topic_score_codex":0.0013558052,"about_ca_topic_score_gemma":0.0016312606,"teacher_disagreement_score":0.0013817429,"about_ca_system_score_codex":0.00021797919,"about_ca_system_score_gemma":0.00030429894,"threshold_uncertainty_score":0.0046224594},"labels":[],"label_agreement":null},{"id":"W22925790","doi":"10.21437/interspeech.2007-662","title":"Objective analysis of the effect of memory inclusion on bandwidth extension of narrowband speech","year":2007,"lang":"en","type":"article","venue":"","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Computer science; Narrowband; Speech recognition; Bandwidth (computing); Bandwidth extension; Speech coding; Telecommunications; Audio signal","score_opus":0.0062216962304044,"score_gpt":0.2802707969675778,"score_spread":0.27404910073717337,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W22925790","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.89359236,0.00066681585,0.10342195,0.000061808605,0.000017461738,0.00003080486,0.00008362559,0.00034450376,0.0017807068],"genre_scores_gemma":[0.9883922,0.00015041341,0.0108553935,0.000016922251,0.0000079122,0.00001385432,0.000054062497,0.000026132595,0.00048305924],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995103,0.00013114426,0.000037440688,0.00007014388,0.00019279736,0.000058181377],"domain_scores_gemma":[0.99446917,0.004004138,0.0005900201,0.0003772054,0.00045535646,0.000104151586],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007879527,0.0005013007,0.00036073188,0.00034577347,0.00015524727,0.00047967202,0.00035081396,0.000410108,0.001411346],"category_scores_gemma":[0.005686751,0.00019298818,0.00019014407,0.00025420802,0.00037675997,0.00079703634,0.00059005007,0.0003565642,0.00019017707],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0038758735,0.00038340405,0.005921742,0.0005058786,0.00013901551,0.00040137887,0.00019129021,0.13633558,0.6846941,0.0019509555,0.00018863333,0.16541213],"study_design_scores_gemma":[0.00005034867,0.0016061385,0.019849872,0.000044443987,0.00014373769,0.0002992353,0.00008660085,0.43027595,0.54614836,0.00053019606,0.00092340686,0.000041691455],"about_ca_topic_score_codex":0.00053916627,"about_ca_topic_score_gemma":0.0007043513,"teacher_disagreement_score":0.001411346,"about_ca_system_score_codex":0.00023907791,"about_ca_system_score_gemma":0.00019662872,"threshold_uncertainty_score":0.004721403},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.16476327607904417,"score_gpt":0.36100338300723206,"score_spread":0.19624010692818789,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2296274957","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04839421,0.036403984,0.88591075,0.006917485,0.0014912705,0.00025208617,0.00064159726,0.0025142005,0.017474495],"genre_scores_gemma":[0.5698024,0.017814595,0.4019505,0.0017330324,0.0010994414,0.00028496634,0.00069266214,0.0011041056,0.00551823],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9903522,0.0032279496,0.0008305642,0.00057366583,0.004833578,0.00018207093],"domain_scores_gemma":[0.96640253,0.019975424,0.0020841379,0.002317958,0.008857007,0.00036293856],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00792742,0.00086251326,0.0008007647,0.001950497,0.00053381035,0.0024428302,0.0014702464,0.0017760948,0.0021125597],"category_scores_gemma":[0.05122971,0.00040927905,0.00035254916,0.0021846718,0.0018166354,0.002398227,0.0018021496,0.0016502332,0.0015185998],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008704103,0.00013596549,0.008043982,0.0033676806,0.0002392606,0.0009753721,0.0010286673,0.06112225,0.08035736,0.055316478,0.025853917,0.7626887],"study_design_scores_gemma":[0.00009926182,0.0016083223,0.018103177,0.001941683,0.0002899881,0.016514815,0.0012226211,0.45630476,0.20759442,0.09447175,0.20123154,0.0006176137],"about_ca_topic_score_codex":0.0024277165,"about_ca_topic_score_gemma":0.001639757,"teacher_disagreement_score":0.00792742,"about_ca_system_score_codex":0.0010620204,"about_ca_system_score_gemma":0.00088754995,"threshold_uncertainty_score":0.041924715},"labels":[],"label_agreement":null},{"id":"W2313128359","doi":"10.1109/embc.2014.6944118","title":"An improved YEF-DCT based compression algorithm for video capsule endoscopy","year":2014,"lang":"en","type":"article","venue":"","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Saskatchewan","funders":"","keywords":"Discrete cosine transform; Computer science; Capsule endoscopy; Lossless compression; Data compression; Computer vision; Artificial intelligence; Peak signal-to-noise ratio; Image compression; Algorithm; Image processing; Image (mathematics)","score_opus":0.011724149573647034,"score_gpt":0.295217305651744,"score_spread":0.28349315607809694,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2313128359","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0347829,0.0018004788,0.9574733,0.00022366764,0.00026527522,0.0001270373,0.00013403923,0.0008106158,0.004382701],"genre_scores_gemma":[0.21672061,0.0018132034,0.76740193,0.00020593219,0.00015526931,0.00013121692,0.00068633136,0.00009613394,0.012789383],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99974805,0.000020068985,0.000016163836,0.00003385335,0.00016507156,0.000016744038],"domain_scores_gemma":[0.9998332,0.000027636,0.000012607202,0.000018067527,0.00010070907,0.000007701903],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022184112,0.00042135536,0.00036459303,0.000693315,0.00022782401,0.0003950764,0.00046309616,0.0005059475,0.0019277178],"category_scores_gemma":[0.00068751926,0.00013571011,0.00027902226,0.0008171222,0.000161116,0.000606438,0.00021784684,0.00046501067,0.0007618407],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00033291156,0.00008944509,0.000649701,0.00016242168,0.000031381835,0.00034350617,0.00005356686,0.028535508,0.19844013,0.0062768282,0.0047174077,0.76036716],"study_design_scores_gemma":[0.00008396956,0.00039817925,0.002812239,0.00004469625,0.00003822202,0.0023140814,0.00003434247,0.8025281,0.16244587,0.001013374,0.028224519,0.00006238184],"about_ca_topic_score_codex":0.0027838435,"about_ca_topic_score_gemma":0.0028390249,"teacher_disagreement_score":0.0027838435,"about_ca_system_score_codex":0.00033059806,"about_ca_system_score_gemma":0.00052880816,"threshold_uncertainty_score":0.0064488053},"labels":[],"label_agreement":null},{"id":"W233433663","doi":"10.1007/978-3-662-04186-4_7","title":"Color Image Compression","year":2000,"lang":"en","type":"book-chapter","venue":"Digital signal processing","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Flexibility (engineering); Multimedia; Image compression; Signal processing; Signal compression; Digital signal processing; Video processing; Asset (computer security); Image processing; Real-time computing; Computer hardware; Image (mathematics); Artificial intelligence; Computer security","score_opus":0.015790557819472112,"score_gpt":0.2511835250913859,"score_spread":0.2353929672719138,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W233433663","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009054792,0.016504087,0.41922078,0.00067703496,0.0025312644,0.00021136792,0.0006495929,0.0075228047,0.5436284],"genre_scores_gemma":[0.06320378,0.014615276,0.13225722,0.00083644164,0.0008758075,0.00012308024,0.0012898816,0.0010167372,0.7857816],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99983263,0.0000061451406,0.00000334767,0.000026956719,0.0001177439,0.0000131412135],"domain_scores_gemma":[0.9998661,0.00001844542,0.000005321459,0.000030105137,0.000072282135,0.000007649262],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000094487215,0.0008909017,0.0004396742,0.001580739,0.000384332,0.0008052602,0.00072001107,0.0005669276,0.051126536],"category_scores_gemma":[0.00028003578,0.00024733355,0.0002691623,0.0018579547,0.00036046683,0.0009674134,0.00067545555,0.000759723,0.021199347],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005936781,0.000054643493,0.000084340536,0.00022753407,0.000015843885,0.00014575476,0.00004060837,0.0015959227,0.06504935,0.019886695,0.0760928,0.83674717],"study_design_scores_gemma":[0.000026158727,0.00013542532,0.0015884874,0.00018438845,0.000055366567,0.0027937137,0.00006386762,0.031707868,0.18091165,0.019243004,0.76323146,0.00005869867],"about_ca_topic_score_codex":0.0006412254,"about_ca_topic_score_gemma":0.0011155099,"teacher_disagreement_score":0.051126536,"about_ca_system_score_codex":0.0003110841,"about_ca_system_score_gemma":0.0002062812,"threshold_uncertainty_score":0.17103529},"labels":[],"label_agreement":null},{"id":"W2354321446","doi":"","title":"Realization of Image Compression System Based on TMS320C5409","year":2006,"lang":"en","type":"article","venue":"Microcomputer applications","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Computer science; Image compression; JPEG; Computer vision; Data compression; Compression (physics); Data compression ratio; Realization (probability); Artificial intelligence; Lossless JPEG; Image quality; Texture compression; Image (mathematics); Image processing; Computer hardware; Mathematics","score_opus":0.00404712115173066,"score_gpt":0.2325010846449098,"score_spread":0.22845396349317912,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2354321446","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17328742,0.0019208589,0.7779302,0.00093897915,0.00071085844,0.00090944336,0.0008127287,0.0090215355,0.034468036],"genre_scores_gemma":[0.62817025,0.000694487,0.35319155,0.00045506272,0.00017098867,0.00037825204,0.0011788602,0.00011947285,0.015641099],"study_design_codex":"bench_or_experimental","study_design_gemma":"not_applicable","domain_scores_codex":[0.9997938,0.000018973355,0.000015690868,0.000033911576,0.00010673933,0.000030780233],"domain_scores_gemma":[0.99988544,0.000017055523,0.000008115024,0.000010860044,0.00006691499,0.000011629192],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017180466,0.00028104038,0.000302907,0.00050336245,0.0002590219,0.00026217857,0.0005585537,0.00038279843,0.004275861],"category_scores_gemma":[0.00033240742,0.00013669246,0.00013211276,0.00033347518,0.0001523565,0.00033002935,0.00019359028,0.00031564297,0.0012107418],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004348279,0.00010225056,0.0009967464,0.00036923893,0.000036015186,0.00038280844,0.00014383903,0.0030179273,0.7664747,0.010679754,0.010981671,0.20638025],"study_design_scores_gemma":[0.0004249,0.001865205,0.005693091,0.00006704186,0.0001127161,0.0032019806,0.00007980186,0.084689766,0.83103895,0.0023502072,0.07039998,0.00007631438],"about_ca_topic_score_codex":0.0006529276,"about_ca_topic_score_gemma":0.0007154768,"teacher_disagreement_score":0.004275861,"about_ca_system_score_codex":0.00028243393,"about_ca_system_score_gemma":0.00044233905,"threshold_uncertainty_score":0.014304161},"labels":[],"label_agreement":null},{"id":"W2356818075","doi":"","title":"A Method Based on Orthogonal Polynomial Partitioned Imitation for Image Compression Coding","year":2007,"lang":"en","type":"article","venue":"Microcomputer applications","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Computer science; Image compression; Digital image; Coding (social sciences); Computer vision; Image (mathematics); Artificial intelligence; Data compression; Theoretical computer science; Computer graphics (images); Image processing; Mathematics","score_opus":0.016758328435472578,"score_gpt":0.3419958244453682,"score_spread":0.3252374960098956,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2356818075","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005369004,0.00030028817,0.9912026,0.00009325472,0.000080201076,0.000049874117,0.00001822529,0.00019654784,0.0026900554],"genre_scores_gemma":[0.24588205,0.0010485629,0.73937947,0.00015536672,0.00013546416,0.00020487724,0.00010208136,0.0001134518,0.012978672],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997105,0.000053781016,0.000014616694,0.000045270583,0.00015579622,0.000020058511],"domain_scores_gemma":[0.9997981,0.00008142916,0.000017451399,0.000031554267,0.00006065313,0.000010851715],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026479975,0.00040682548,0.00038824836,0.0005250601,0.00032221925,0.00031913148,0.00055575906,0.00045552538,0.0020471662],"category_scores_gemma":[0.00076731795,0.00011974967,0.00050492154,0.00053201447,0.000633869,0.0006779436,0.00052154576,0.0007072614,0.00042316952],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002363395,0.00009871461,0.000542808,0.00028941187,0.000071721886,0.00041737195,0.00028165837,0.109468065,0.20278099,0.1877259,0.0046021407,0.4934849],"study_design_scores_gemma":[0.00002610054,0.00018305809,0.00027320115,0.000019457693,0.00003571494,0.0006287868,0.00003153519,0.92490804,0.048180915,0.012278738,0.013385704,0.000048789447],"about_ca_topic_score_codex":0.0013627498,"about_ca_topic_score_gemma":0.0011715261,"teacher_disagreement_score":0.0020471662,"about_ca_system_score_codex":0.00033240582,"about_ca_system_score_gemma":0.0004970571,"threshold_uncertainty_score":0.006848395},"labels":[],"label_agreement":null},{"id":"W2359855347","doi":"","title":"JasPer Software:JPEG2000 Implementation","year":2006,"lang":"en","type":"article","venue":"Microcomputer applications","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Computer science; Software; Block (permutation group theory); JPEG 2000; Feature (linguistics); Image compression; Code (set theory); Image (mathematics); Point (geometry); Image quality; Computer graphics (images); Artificial intelligence; Computer vision; Image processing; Operating system; Programming language; Set (abstract data type)","score_opus":0.0047636187504741445,"score_gpt":0.26650312599556525,"score_spread":0.2617395072450911,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2359855347","genre_codex":"methods","genre_gemma":"software","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"software","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0062562455,0.0013132734,0.66279554,0.00027892887,0.00039374668,0.00044470126,0.006380275,0.2971565,0.024980817],"genre_scores_gemma":[0.066203095,0.0019238464,0.75255233,0.0009391561,0.00036026107,0.00089970784,0.0420621,0.047129273,0.0879302],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.999371,0.000048282283,0.00006494142,0.00007875363,0.00036310754,0.00007390039],"domain_scores_gemma":[0.9991339,0.00008758106,0.000062933796,0.00015230116,0.0005006433,0.000062795836],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000742186,0.0009243495,0.00056472694,0.0020112158,0.0003660092,0.001076006,0.0018740551,0.00067590433,0.04204419],"category_scores_gemma":[0.0023481583,0.00069152506,0.00039928372,0.0016716239,0.0002245705,0.0016568027,0.0008660941,0.0011536925,0.040129654],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007030577,0.0001620238,0.0011507175,0.0007899482,0.00008493193,0.0003323113,0.00014731262,0.0033596933,0.07266102,0.011786213,0.37237945,0.5364433],"study_design_scores_gemma":[0.00030880678,0.00017690824,0.0031916697,0.00019440988,0.00007127726,0.0024051466,0.00006443198,0.06673963,0.19729817,0.0077017155,0.721666,0.00018178076],"about_ca_topic_score_codex":0.0011851653,"about_ca_topic_score_gemma":0.0010874227,"teacher_disagreement_score":0.04204419,"about_ca_system_score_codex":0.00033900706,"about_ca_system_score_gemma":0.00061466725,"threshold_uncertainty_score":0.14065182},"labels":[],"label_agreement":null},{"id":"W2365021431","doi":"","title":"Optimization and Porting of AMR-WB Based on Intel PXA27x","year":2006,"lang":"en","type":"article","venue":"Microcomputer applications","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Porting; Computer science; Codec; Wideband audio; Embedded system; Digital signal processing; Computer architecture; Operating system; Computer hardware; Software","score_opus":0.004331343172244862,"score_gpt":0.22856097482641577,"score_spread":0.2242296316541709,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2365021431","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.35492408,0.0010223446,0.58715624,0.00052227656,0.00018517749,0.000532028,0.00041544676,0.011683846,0.04355859],"genre_scores_gemma":[0.73897946,0.00026633346,0.24679726,0.00012099621,0.000048723887,0.00021023671,0.0007184407,0.00093369297,0.011924911],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994166,0.00010911347,0.00003919572,0.00006825093,0.00028518142,0.000081604216],"domain_scores_gemma":[0.9992587,0.00017756956,0.00006458408,0.00011208628,0.0003591308,0.000027951533],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00065718126,0.00075701013,0.0003700642,0.0006267829,0.0002444222,0.00064486114,0.0007341494,0.0002803069,0.0052456926],"category_scores_gemma":[0.0018275724,0.00021556597,0.00022962403,0.00052724994,0.00017309892,0.00074659224,0.0002805997,0.00054235087,0.0014898231],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0014741352,0.00036171055,0.0044842586,0.00045535917,0.00012597725,0.0006717772,0.00034445673,0.13603504,0.29932126,0.0140024545,0.01325033,0.52947325],"study_design_scores_gemma":[0.00017606522,0.0016197908,0.0060121403,0.00004342222,0.00011364981,0.0007125951,0.00012107608,0.4735975,0.47403052,0.0019592985,0.041540433,0.00007347523],"about_ca_topic_score_codex":0.0013188897,"about_ca_topic_score_gemma":0.001391468,"teacher_disagreement_score":0.0052456926,"about_ca_system_score_codex":0.00041448302,"about_ca_system_score_gemma":0.00040903332,"threshold_uncertainty_score":0.017548561},"labels":[],"label_agreement":null},{"id":"W2365337801","doi":"","title":"A Realization of Adaptive Module Block Truncating Coding","year":2002,"lang":"en","type":"article","venue":"","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"CAE (Canada)","funders":"","keywords":"Coding (social sciences); Computer science; Context-adaptive variable-length coding; Variable-length code; Shannon–Fano coding; Block (permutation group theory); Algorithm; Tunstall coding; Data compression; Flexibility (engineering); Theoretical computer science; Computer engineering; Context-adaptive binary arithmetic coding; Decoding methods; Mathematics; Statistics","score_opus":0.041509273454790496,"score_gpt":0.26456875599103935,"score_spread":0.22305948253624885,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2365337801","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.023167077,0.00019642334,0.9671428,0.00010663557,0.000055836525,0.00005539968,0.000060613267,0.0006133066,0.008601822],"genre_scores_gemma":[0.4754871,0.00027640688,0.5173598,0.00013209718,0.00007375539,0.00009016066,0.00021763632,0.00004860812,0.006314436],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998165,0.0000343485,0.000008295818,0.00003176311,0.00008121034,0.000027971271],"domain_scores_gemma":[0.99977,0.000041174248,0.000024462868,0.000060620194,0.000088291235,0.000015523041],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021735058,0.00030941644,0.00020755293,0.0003932838,0.00026514486,0.00032989692,0.00052209466,0.000496775,0.0014826165],"category_scores_gemma":[0.00049534964,0.0001221471,0.00025030773,0.0003951868,0.00036074597,0.00042737692,0.00034313265,0.0005732668,0.000538367],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00038118224,0.00007952723,0.0014738489,0.00012792021,0.000038250157,0.00045113542,0.00023929321,0.04797684,0.35768953,0.18439552,0.0037422506,0.40340474],"study_design_scores_gemma":[0.000054205088,0.00041385248,0.0012044271,0.00004475352,0.00005025669,0.0015110244,0.000043234242,0.7330754,0.20246027,0.022612179,0.03846829,0.00006215302],"about_ca_topic_score_codex":0.0010347782,"about_ca_topic_score_gemma":0.0009535558,"teacher_disagreement_score":0.0014826165,"about_ca_system_score_codex":0.00025828995,"about_ca_system_score_gemma":0.00038675262,"threshold_uncertainty_score":0.0049598217},"labels":[],"label_agreement":null},{"id":"W2373163080","doi":"","title":"Analysis of the JPEG2000 Code_Stream Formation Algorithm","year":2002,"lang":"en","type":"article","venue":"","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Discovery Air (Canada)","funders":"","keywords":"Computer science; JPEG 2000; Code (set theory); Algorithm; Feature (linguistics); Compression (physics); Image compression; Theoretical computer science; Image (mathematics); Artificial intelligence; Programming language; Image processing","score_opus":0.016302437752156503,"score_gpt":0.24625203281879535,"score_spread":0.22994959506663884,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2373163080","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.028189542,0.0021373623,0.9432933,0.00040409877,0.00016205029,0.00013048005,0.00022687047,0.00061903213,0.02483727],"genre_scores_gemma":[0.5515297,0.0044561885,0.40669477,0.0002512182,0.0004299819,0.0002013715,0.0016302081,0.0005591914,0.034247328],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991997,0.000064691405,0.000020026744,0.00005903722,0.00061115,0.000045461555],"domain_scores_gemma":[0.99923396,0.00018315959,0.00006525059,0.00007016836,0.00042584457,0.000021584981],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005392832,0.0004105821,0.00026844625,0.0013227037,0.00038214668,0.00094781816,0.0004974332,0.00041941094,0.0033653632],"category_scores_gemma":[0.0027680527,0.00019420426,0.00036218777,0.0011463091,0.0004863284,0.0008092919,0.00041908203,0.0006060154,0.0013566919],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00026281553,0.000054385695,0.003366062,0.00022133188,0.000042592343,0.0004245242,0.00020489404,0.15123987,0.046116814,0.40871853,0.012874119,0.37647393],"study_design_scores_gemma":[0.000015737342,0.00006491886,0.0028641198,0.0000416314,0.000023092563,0.00066507317,0.000041038846,0.9098462,0.023848096,0.034888525,0.027667494,0.00003403564],"about_ca_topic_score_codex":0.0039821547,"about_ca_topic_score_gemma":0.0020343997,"teacher_disagreement_score":0.0039821547,"about_ca_system_score_codex":0.0008560809,"about_ca_system_score_gemma":0.0009860886,"threshold_uncertainty_score":0.011258304},"labels":[],"label_agreement":null},{"id":"W2378962433","doi":"","title":"Implementation of a Improved G.726 Speech Compression Algorithm in Low Bit Rate","year":2009,"lang":"en","type":"article","venue":"Microcomputer applications","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Computer science; Speech coding; Bit rate; Encoding (memory); Algorithm; Bandwidth (computing); Speech recognition; Full Rate; Data compression; Process (computing); Codec2; Computer hardware; Linear predictive coding; Artificial intelligence; Telecommunications; Programming language","score_opus":0.0068469222552662344,"score_gpt":0.2981943585585776,"score_spread":0.2913474363033114,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2378962433","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.054419078,0.0005691249,0.9311946,0.00029663145,0.00040139936,0.00021974827,0.00030509348,0.00591827,0.0066761337],"genre_scores_gemma":[0.22061612,0.00040232655,0.764207,0.00020770542,0.000113458045,0.00012541929,0.0007917201,0.00030174566,0.013234441],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99968064,0.00003371607,0.000025777548,0.000050182214,0.0001853675,0.000024381405],"domain_scores_gemma":[0.9995945,0.00005897252,0.000034223704,0.00007326647,0.0002216703,0.000017424714],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029806187,0.00048696346,0.00029459008,0.0006088319,0.0002541341,0.00047900947,0.0006102354,0.00055712793,0.0049051843],"category_scores_gemma":[0.0007040865,0.00015419244,0.00020244248,0.00044798668,0.00019016891,0.00044147993,0.00021738747,0.00056868565,0.0023633712],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00062669895,0.00008865856,0.0007032849,0.00023504552,0.000030514302,0.00035577346,0.00016746257,0.0044720145,0.49645242,0.004866823,0.0047620097,0.48723924],"study_design_scores_gemma":[0.00014845474,0.00059204875,0.002150348,0.00003710901,0.00005870706,0.0019938617,0.00004325082,0.10661313,0.8329281,0.00091170357,0.054455154,0.00006823557],"about_ca_topic_score_codex":0.00081522495,"about_ca_topic_score_gemma":0.0008658015,"teacher_disagreement_score":0.0049051843,"about_ca_system_score_codex":0.00020080534,"about_ca_system_score_gemma":0.00036979635,"threshold_uncertainty_score":0.016409516},"labels":[],"label_agreement":null},{"id":"W2383407410","doi":"","title":"Techniques of Still Image Compress Coding Based on Integer Wavelet Transform","year":2005,"lang":"en","type":"article","venue":"Microcomputer applications","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Computer science; Wavelet transform; Wavelet; Wavelet packet decomposition; Stationary wavelet transform; Second-generation wavelet transform; Discrete wavelet transform; Lifting scheme; Coding (social sciences); Artificial intelligence; Computer vision; Mathematics","score_opus":0.00898615226793457,"score_gpt":0.2720050402896568,"score_spread":0.2630188880217222,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2383407410","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0055126776,0.0021090617,0.9859757,0.00017583938,0.00013940717,0.00007140479,0.000060437298,0.00029369473,0.0056617972],"genre_scores_gemma":[0.13105115,0.00929278,0.8479674,0.0002401773,0.00043784129,0.00020694805,0.00042345386,0.00015405055,0.010226242],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99966824,0.00003055545,0.000019979103,0.000041505147,0.00021452128,0.000025153267],"domain_scores_gemma":[0.9997662,0.00007425039,0.000025654033,0.00004653824,0.00007821625,0.000009268214],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037437194,0.00068553025,0.0004640549,0.0014560457,0.000378528,0.0006407007,0.0007024077,0.00047372037,0.0022321928],"category_scores_gemma":[0.0008931043,0.00024281301,0.00054007233,0.0012943242,0.0006300864,0.0015444829,0.0005209781,0.0013233337,0.0008316324],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019313148,0.00008287854,0.0005888675,0.0005146437,0.00005163931,0.00036229996,0.00028328478,0.025632022,0.1389758,0.20040454,0.0050197123,0.62789124],"study_design_scores_gemma":[0.00008542279,0.00036511227,0.001606949,0.00013658767,0.00013617978,0.0024771413,0.00017633916,0.6583109,0.18172705,0.07373098,0.081121124,0.00012623442],"about_ca_topic_score_codex":0.000844006,"about_ca_topic_score_gemma":0.0008153648,"teacher_disagreement_score":0.0022321928,"about_ca_system_score_codex":0.00035125637,"about_ca_system_score_gemma":0.00044671292,"threshold_uncertainty_score":0.0074674487},"labels":[],"label_agreement":null},{"id":"W2383705327","doi":"","title":"Computation Complexity Based on Image Compression Algorithm","year":2007,"lang":"en","type":"article","venue":"Optics & Optoelectronic Technology","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"L'Alliance Boviteq","funders":"","keywords":"Set partitioning in hierarchical trees; Algorithm; Coding (social sciences); Computation; Wavelet; Data compression; Image compression; Algorithmic efficiency; Computer science; Computational complexity theory; Compression ratio; Wavelet transform; Mathematics; Artificial intelligence; Image processing; Image (mathematics); Discrete wavelet transform; Engineering; Statistics","score_opus":0.011677769779352748,"score_gpt":0.3047993660245477,"score_spread":0.29312159624519496,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2383705327","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015672006,0.0009215438,0.96748304,0.00046330245,0.00014517781,0.00012010471,0.000098018376,0.00077698147,0.014319834],"genre_scores_gemma":[0.37883615,0.0019846875,0.6033934,0.0003227421,0.00036812932,0.0005754526,0.0004757516,0.0002095986,0.013834154],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99889696,0.00011626723,0.000060855422,0.00012992857,0.00071780366,0.00007821155],"domain_scores_gemma":[0.99865013,0.0006384868,0.000070719725,0.00016900945,0.00043840936,0.000033174252],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046403296,0.0005585968,0.0004929035,0.0010701831,0.00037424007,0.0011464499,0.0007634138,0.00054337643,0.0053828903],"category_scores_gemma":[0.0037384825,0.00017995335,0.00037270482,0.0010945695,0.0005903409,0.0015772659,0.0007864232,0.00086210115,0.0012305991],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003042912,0.00007951643,0.0015045747,0.00030181566,0.000047430196,0.00024992172,0.00013350307,0.18555655,0.03356651,0.17264797,0.01034408,0.5952639],"study_design_scores_gemma":[0.000031895008,0.00009246473,0.0006224794,0.000030078594,0.000019423867,0.00033934112,0.000021403495,0.9408501,0.016222537,0.03250375,0.009242097,0.00002438577],"about_ca_topic_score_codex":0.0013583628,"about_ca_topic_score_gemma":0.001038226,"teacher_disagreement_score":0.0053828903,"about_ca_system_score_codex":0.00080976245,"about_ca_system_score_gemma":0.0009969686,"threshold_uncertainty_score":0.018007576},"labels":[],"label_agreement":null},{"id":"W2389415174","doi":"","title":"Multiple Description Scalable Video Coding Based on Directional Lifting Wavelet Transform","year":2009,"lang":"en","type":"article","venue":"Microcomputer applications","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Computer science; Lifting scheme; Wavelet transform; Wavelet; Coding (social sciences); Wavelet packet decomposition; Discrete wavelet transform; Scalability; Scalable Video Coding; Coding tree unit; Subsequence; Artificial intelligence; Computer vision; Algorithm; Motion compensation; Mathematics; Decoding methods","score_opus":0.01455050962980347,"score_gpt":0.2520538324195928,"score_spread":0.2375033227897893,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2389415174","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015847871,0.00047117204,0.9806598,0.00016248165,0.00009731821,0.00007552078,0.00010846788,0.00050587376,0.0020713804],"genre_scores_gemma":[0.34406805,0.0012100083,0.64851546,0.00018906029,0.00014651039,0.00020661333,0.0007294157,0.00006915792,0.004865684],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9997925,0.00002612012,0.00001130426,0.00001765597,0.00013011637,0.000022283994],"domain_scores_gemma":[0.99981207,0.000043578893,0.00002106773,0.00003453149,0.000074793665,0.000013942526],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003018366,0.00034143028,0.00037848903,0.0004422128,0.00019169907,0.00033460668,0.00053607376,0.00030278484,0.0010619421],"category_scores_gemma":[0.00067182886,0.00012124335,0.00031540505,0.0006835086,0.00018785062,0.0006446403,0.00047144637,0.00057710573,0.0002820131],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021841202,0.00007776621,0.0005136414,0.00020788891,0.00004152217,0.0005691769,0.000102026395,0.049056295,0.28818893,0.041228563,0.008062328,0.6117333],"study_design_scores_gemma":[0.00007192279,0.000172991,0.0006951564,0.000027244247,0.000030590018,0.00067069824,0.000033929788,0.90154386,0.074545786,0.007462703,0.014694508,0.000050617276],"about_ca_topic_score_codex":0.0011010519,"about_ca_topic_score_gemma":0.0012308006,"teacher_disagreement_score":0.0011010519,"about_ca_system_score_codex":0.00022710442,"about_ca_system_score_gemma":0.00041625512,"threshold_uncertainty_score":0.003552556},"labels":[],"label_agreement":null},{"id":"W2395310358","doi":"10.1109/dcc.2014.82","title":"Flexible Multiple Description Lattice Vector Quantizer with L ≥ 3 Descriptions","year":2014,"lang":"en","type":"article","venue":"","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Decoding methods; Lattice (music); Algorithm; Heuristic; Computer science; Mathematics; Mathematical optimization; Discrete mathematics; Physics","score_opus":0.06479301812447225,"score_gpt":0.296483960925685,"score_spread":0.23169094280121277,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2395310358","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016090235,0.00044393464,0.9801134,0.00014580293,0.00003792782,0.00005595562,0.00012605394,0.00049274135,0.0024939578],"genre_scores_gemma":[0.3910703,0.00027733797,0.60410017,0.00021199546,0.000036387293,0.00014732554,0.00025879688,0.00008256391,0.0038151308],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994029,0.00015784362,0.00004717437,0.00008106394,0.00025465502,0.00005643788],"domain_scores_gemma":[0.9989831,0.000403852,0.00012104559,0.00027551592,0.00016892397,0.000047620164],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013038806,0.0004459137,0.00057516573,0.0004761712,0.0003942162,0.0010292621,0.0014057142,0.0007220594,0.0028870364],"category_scores_gemma":[0.002541394,0.00024302563,0.00029653046,0.0009130529,0.0008002105,0.0020441106,0.0012421457,0.0010675244,0.0006945341],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006722186,0.00015225609,0.0012876322,0.0002974756,0.000053634973,0.00030834347,0.00026211527,0.18948708,0.0641303,0.19590661,0.004291256,0.5431511],"study_design_scores_gemma":[0.000058161317,0.00014768569,0.00023096098,0.000033040356,0.000011956021,0.00024772825,0.00004053501,0.9296672,0.032779895,0.029443055,0.0072843926,0.000055361746],"about_ca_topic_score_codex":0.0011885065,"about_ca_topic_score_gemma":0.0019705915,"teacher_disagreement_score":0.0028870364,"about_ca_system_score_codex":0.0007917299,"about_ca_system_score_gemma":0.0008261624,"threshold_uncertainty_score":0.009658098},"labels":[],"label_agreement":null},{"id":"W2400346108","doi":"10.1109/icassp.2016.7472812","title":"A subjective listening test of six different artificial bandwidth extension approaches in English, Chinese, German, and Korean","year":2016,"lang":"en","type":"article","venue":"","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University; Nuance Communications (Canada)","funders":"","keywords":"Active listening; German; Computer science; Test (biology); Speech recognition; Extension (predicate logic); Natural language processing; Context (archaeology); Artificial intelligence; Psychology; Linguistics; Communication","score_opus":0.026185773643714445,"score_gpt":0.26921316268343803,"score_spread":0.2430273890397236,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2400346108","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98807526,0.00006616979,0.009107176,0.000020505915,0.00004107816,0.00037464887,0.0001327216,0.000053821834,0.0021284888],"genre_scores_gemma":[0.9752092,0.00010177375,0.020332819,0.00013161675,0.00004204357,0.00088459556,0.00055647397,0.000042729458,0.0026987272],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9977585,0.0008672334,0.00032674515,0.0004338479,0.00047693812,0.00013674323],"domain_scores_gemma":[0.99148,0.005121568,0.00045725002,0.00051031756,0.0018086935,0.000622143],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0044426247,0.0008500119,0.00044277633,0.0008185558,0.0003750251,0.0005644651,0.00033407117,0.00078330736,0.0022635132],"category_scores_gemma":[0.012260582,0.00015099414,0.00054419565,0.0003211578,0.0005112372,0.00065564853,0.0009238085,0.00044712404,0.0005527984],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.017642293,0.004516981,0.13300982,0.0012771405,0.0006538884,0.0007904666,0.011301481,0.0033355053,0.6413595,0.0010441457,0.0017668394,0.18330187],"study_design_scores_gemma":[0.0008807605,0.06570612,0.76773155,0.00013484106,0.00062552193,0.001562905,0.009639331,0.010851847,0.13647981,0.0009849109,0.004841174,0.0005612618],"about_ca_topic_score_codex":0.00049694197,"about_ca_topic_score_gemma":0.0012131672,"teacher_disagreement_score":0.0044426247,"about_ca_system_score_codex":0.00015580114,"about_ca_system_score_gemma":0.00023907177,"threshold_uncertainty_score":0.023495078},"labels":[],"label_agreement":null},{"id":"W2404306640","doi":"","title":"A New Approach for Compressing Color Images using Neural Network","year":2003,"lang":"en","type":"article","venue":"","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":21,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Computer science; Artificial neural network; Image compression; Data compression; Artificial intelligence; Distortion (music); Image (mathematics); Representation (politics); Network architecture; Compression (physics); Computer vision; Transmission (telecommunications); Pattern recognition (psychology); Image processing","score_opus":0.05667162996176557,"score_gpt":0.32176592357377715,"score_spread":0.2650942936120116,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2404306640","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0112636825,0.0012658947,0.982898,0.00030268397,0.00028953678,0.000071802686,0.00006211451,0.0007235062,0.003122731],"genre_scores_gemma":[0.11172784,0.0021391471,0.8765813,0.00028629115,0.00023554834,0.00012973351,0.00022043489,0.000096977805,0.008582835],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9998153,0.000015301168,0.000011878846,0.000034666027,0.00011135346,0.000011516447],"domain_scores_gemma":[0.9997886,0.000052770127,0.00002104013,0.00003974904,0.00008623696,0.000011548065],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024164231,0.000491686,0.00036487362,0.0008986999,0.00029340864,0.00046581254,0.0007226414,0.0005896619,0.0023688765],"category_scores_gemma":[0.000638528,0.00020441684,0.0003272759,0.0008128858,0.00041097606,0.0011317822,0.00040752126,0.0007943189,0.0005616471],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018169655,0.00009525563,0.0005703748,0.000395212,0.00009021916,0.00027784146,0.000093859344,0.030651232,0.18172568,0.017386725,0.0039075986,0.76462436],"study_design_scores_gemma":[0.00006115469,0.00033444475,0.0012796684,0.00006868774,0.00011457367,0.0014832689,0.000059519334,0.7178979,0.21617347,0.008142881,0.054306626,0.00007783986],"about_ca_topic_score_codex":0.0012058602,"about_ca_topic_score_gemma":0.0015993736,"teacher_disagreement_score":0.0023688765,"about_ca_system_score_codex":0.00029165577,"about_ca_system_score_gemma":0.0003073502,"threshold_uncertainty_score":0.007924676},"labels":[],"label_agreement":null},{"id":"W2407002889","doi":"10.21437/interspeech.2011-653","title":"Tree encoding for the ITU-t g.711.1 speech coder","year":2011,"lang":"en","type":"article","venue":"","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Computer science; Encoder; Speech coding; Speech recognition; Vector quantization; Harmonic Vector Excitation Coding; Coding (social sciences); Bitstream; Encoding (memory); PESQ; Sub-band coding; Wideband audio; Decoding methods; Artificial intelligence; Speech enhancement; Algorithm; Mathematics","score_opus":0.08824129336144672,"score_gpt":0.302039043248409,"score_spread":0.21379774988696232,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2407002889","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.046546694,0.0018398297,0.9305097,0.00056274683,0.0005442431,0.00028772186,0.0021663639,0.006084866,0.01145782],"genre_scores_gemma":[0.2844492,0.0019749529,0.6835897,0.00035001838,0.00017119484,0.00040211345,0.0062086033,0.0009366888,0.02191758],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9992311,0.00016097366,0.00005217569,0.00007108851,0.00039812157,0.000086556916],"domain_scores_gemma":[0.99876034,0.0004336896,0.00005998241,0.000110462875,0.00060625863,0.00002930047],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008175346,0.0006807379,0.00039631574,0.0010361153,0.00045174814,0.0010103066,0.0005630608,0.00071904965,0.0054736445],"category_scores_gemma":[0.0032472922,0.00017533416,0.00045203054,0.0012618449,0.00025210428,0.0009836681,0.0005440782,0.00075417454,0.002981298],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008406276,0.00008923784,0.0010839973,0.00040010217,0.000039284776,0.00029965068,0.0003453795,0.04762861,0.06021116,0.03236837,0.018978518,0.837715],"study_design_scores_gemma":[0.0001026931,0.0006210339,0.0027023964,0.00021771793,0.000102951286,0.000553328,0.00021396998,0.7927522,0.09424009,0.014860339,0.09354078,0.000092497554],"about_ca_topic_score_codex":0.010487533,"about_ca_topic_score_gemma":0.015041435,"teacher_disagreement_score":0.010487533,"about_ca_system_score_codex":0.00090415205,"about_ca_system_score_gemma":0.001658797,"threshold_uncertainty_score":0.020852983},"labels":[],"label_agreement":null},{"id":"W2472044101","doi":"10.1109/tcsii.2016.2584091","title":"Low-Cost Architecture of Modified Daubechies Lifting Wavelets Using Integer Polynomial Mapping","year":2016,"lang":"en","type":"article","venue":"IEEE Transactions on Circuits & Systems II Express Briefs","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Saskatchewan","funders":"Western Economic Diversification Canada; Natural Sciences and Engineering Research Council of Canada; Canada Foundation for Innovation","keywords":"Wavelet; Integer (computer science); Mathematics; Polynomial; Architecture; Integer programming; Computer science; Mathematical optimization; Artificial intelligence; Mathematical analysis; Geography","score_opus":0.03469138346990809,"score_gpt":0.2602241535957121,"score_spread":0.22553277012580403,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2472044101","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.054210577,0.0005622142,0.93595386,0.00017421799,0.00018163308,0.000111876136,0.00010746574,0.0013635673,0.0073346095],"genre_scores_gemma":[0.32434678,0.00050866825,0.66777325,0.00012394907,0.00010129268,0.00014927375,0.00034840638,0.000072647745,0.0065756766],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99980587,0.000023249979,0.00001397764,0.00002548261,0.00010150003,0.00002990517],"domain_scores_gemma":[0.9998771,0.000015650148,0.000013009308,0.00003358988,0.000047045807,0.000013516102],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023154971,0.0004560391,0.00038195096,0.0005149068,0.0002532947,0.00051753264,0.001010891,0.00036593573,0.0032209975],"category_scores_gemma":[0.00035120148,0.00024609367,0.0003164016,0.0005027837,0.00014254679,0.0006652358,0.00044969426,0.00052519824,0.0017612258],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005861995,0.00012490898,0.0012858656,0.00028794567,0.00006273503,0.00051624066,0.00013361959,0.022211734,0.4059465,0.030786011,0.0063736364,0.5316846],"study_design_scores_gemma":[0.00020598405,0.0012521865,0.0023087696,0.00006789032,0.00011489892,0.001745884,0.00010147611,0.6558618,0.2440952,0.007772426,0.08638188,0.00009162481],"about_ca_topic_score_codex":0.00067871483,"about_ca_topic_score_gemma":0.0007359091,"teacher_disagreement_score":0.0032209975,"about_ca_system_score_codex":0.00030922593,"about_ca_system_score_gemma":0.00043488952,"threshold_uncertainty_score":0.010775328},"labels":[],"label_agreement":null},{"id":"W2493902054","doi":"10.1117/3.1000981.ch4","title":"Satellite Data Compression","year":2013,"lang":"en","type":"book-chapter","venue":"Society of Photo-Optical Instrumentation Engineers eBooks","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Canadian Space Agency","funders":"","keywords":"Lossless compression; Lossy compression; Data compression; Hyperspectral imaging; Computer science; Image compression; Redundancy (engineering); Texture compression; Remote sensing; Compression ratio; Multispectral image; Computer vision; Artificial intelligence; Geography; Image processing; Engineering; Image (mathematics)","score_opus":0.039454899870513496,"score_gpt":0.27502235619488874,"score_spread":0.23556745632437526,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2493902054","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05301636,0.016513538,0.689731,0.0025758836,0.0060943933,0.0014533855,0.018142266,0.020536639,0.19193655],"genre_scores_gemma":[0.28626418,0.023504607,0.46890992,0.0023107585,0.0020605086,0.0013610462,0.058783602,0.0029434003,0.15386195],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.999271,0.000047115544,0.000056033165,0.00008649766,0.00047358603,0.00006574021],"domain_scores_gemma":[0.99906486,0.00014494002,0.00004037202,0.00021333592,0.00051635713,0.000020136453],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00049964007,0.000916174,0.0006866856,0.0025175584,0.0006329676,0.0016035677,0.0011850111,0.00086627604,0.017256908],"category_scores_gemma":[0.002212621,0.00024492072,0.0006254826,0.0038139343,0.00039901774,0.0017043613,0.001457086,0.0009552672,0.013044134],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00028695862,0.00008036877,0.0007434333,0.00084710575,0.000049159004,0.0004994239,0.00020243436,0.017965158,0.025223628,0.01844729,0.106153056,0.82950187],"study_design_scores_gemma":[0.000118768265,0.00031321152,0.0024047133,0.0005845332,0.00006390413,0.0025617455,0.00048233214,0.16755353,0.13348599,0.029685922,0.66261035,0.00013495235],"about_ca_topic_score_codex":0.0011680413,"about_ca_topic_score_gemma":0.0009425576,"teacher_disagreement_score":0.017256908,"about_ca_system_score_codex":0.00050170266,"about_ca_system_score_gemma":0.0006102226,"threshold_uncertainty_score":0.05773014},"labels":[],"label_agreement":null},{"id":"W2495502577","doi":"10.1109/dcc.2000.838227","title":"Optimal packetization of embedded bitstreams","year":2002,"lang":"en","type":"article","venue":"","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Computer science; Network packet; Redundancy (engineering); Header; Error detection and correction; Real-time computing; Coding (social sciences); Payload (computing); Forward error correction; Convolutional code; Algorithm; Decoding methods; Computer network","score_opus":0.019467763295649334,"score_gpt":0.2519655351759888,"score_spread":0.23249777188033946,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2495502577","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1928475,0.0008982968,0.7916991,0.00047954556,0.00025010953,0.0001421441,0.00025823154,0.00087442365,0.012550741],"genre_scores_gemma":[0.8777796,0.0005315415,0.11485852,0.00012988114,0.000059659316,0.00007978823,0.00035837176,0.00015177461,0.006050922],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997789,0.000044781704,0.000016447535,0.000040271854,0.00006248632,0.000057178106],"domain_scores_gemma":[0.99948764,0.00020172687,0.000053845644,0.00007960982,0.0001477923,0.000029402061],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024053323,0.0004966851,0.0003705634,0.00028789358,0.00021320384,0.00052231393,0.00035599765,0.00029366976,0.0032999231],"category_scores_gemma":[0.0014707266,0.00016868298,0.00015475511,0.00037130067,0.0003189426,0.00082522805,0.0004669805,0.0003621857,0.0005417609],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008949052,0.0001843465,0.000996967,0.0002365819,0.00003715439,0.00024858525,0.0000964574,0.52717984,0.09141529,0.033188645,0.007795262,0.33772606],"study_design_scores_gemma":[0.00003907557,0.00017890296,0.0003415773,0.000018347813,0.000020425721,0.0000971152,0.00005803185,0.915744,0.068072446,0.011284163,0.0041299434,0.000016056447],"about_ca_topic_score_codex":0.0004820466,"about_ca_topic_score_gemma":0.0006073907,"teacher_disagreement_score":0.0032999231,"about_ca_system_score_codex":0.00041262756,"about_ca_system_score_gemma":0.00037040265,"threshold_uncertainty_score":0.011039317},"labels":[],"label_agreement":null},{"id":"W2496882591","doi":"10.1075/cilt.220.22ste","title":"A constraint-based analysis of intraspeaker variation","year":2002,"lang":"en","type":"book-chapter","venue":"Amsterdam studies in the theory and history of linguistic science. Series 4, Current issues in linguistic theory","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Variation (astronomy); Constraint (computer-aided design); Computer science; Mathematics; Physics; Geometry","score_opus":0.046471157982788135,"score_gpt":0.3310941642756842,"score_spread":0.2846230062928961,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2496882591","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.047712475,0.0017461566,0.91692543,0.0010015367,0.000107542546,0.00006480616,0.00072350644,0.00040688136,0.031311613],"genre_scores_gemma":[0.68039256,0.0011390366,0.29769394,0.0003364814,0.00029377005,0.00016111533,0.0015263726,0.0011141639,0.017342571],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9992473,0.00028807763,0.00003988864,0.00014898012,0.00020246231,0.0000732015],"domain_scores_gemma":[0.99716586,0.0021190245,0.00013629977,0.0002150723,0.0002989083,0.00006467132],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012793654,0.0004260023,0.00068165036,0.0018950757,0.0010687526,0.002495436,0.0024502957,0.0010123864,0.011074176],"category_scores_gemma":[0.0063687824,0.00045572213,0.0008965006,0.0037247085,0.0016328396,0.0038348855,0.001259471,0.0018297953,0.00090239465],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019345213,0.000054243632,0.0013139837,0.00014216408,0.00011482863,0.0003760256,0.0008453394,0.03476624,0.00659999,0.80863583,0.007201963,0.13975587],"study_design_scores_gemma":[0.000018822882,0.000019709325,0.0027332103,0.0000351346,0.00003921881,0.00014409788,0.00020224389,0.2426751,0.0012977297,0.743024,0.009773461,0.000037166446],"about_ca_topic_score_codex":0.0077977125,"about_ca_topic_score_gemma":0.007019296,"teacher_disagreement_score":0.011074176,"about_ca_system_score_codex":0.00094446377,"about_ca_system_score_gemma":0.0007040798,"threshold_uncertainty_score":0.03704685},"labels":[],"label_agreement":null},{"id":"W2497104813","doi":"10.1117/3.1002297.ch8","title":"User Acceptability Study of Satellite Data Compression","year":2013,"lang":"en","type":"book-chapter","venue":"Society of Photo-Optical Instrumentation Engineers eBooks","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Canadian Space Agency","funders":"","keywords":"Lossy compression; Lossless compression; Vector quantization; Data compression; Computer science; Hyperspectral imaging; Data compression ratio; Quantization (signal processing); Compression ratio; Image compression; Algorithm; Remote sensing; Artificial intelligence; Geography; Engineering; Image processing","score_opus":0.03988409442465658,"score_gpt":0.29431211841790295,"score_spread":0.2544280239932464,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2497104813","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.96264535,0.00054193556,0.0042597316,0.0005595172,0.00007043655,0.00020908286,0.000504127,0.000385101,0.030824628],"genre_scores_gemma":[0.97254825,0.0004405511,0.0049568694,0.0004112598,0.000049600938,0.000325377,0.0009838109,0.0001804739,0.020103754],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.9933129,0.0025658507,0.00029059083,0.0003900141,0.0032857112,0.00015497778],"domain_scores_gemma":[0.93863076,0.04177073,0.0013528041,0.0019903148,0.015356648,0.0008988062],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00577949,0.00045085265,0.00056901557,0.0011690374,0.00065493875,0.0019385823,0.0007713619,0.00066356926,0.0068173525],"category_scores_gemma":[0.036718562,0.00017351666,0.00046313502,0.00083563715,0.00048162608,0.0013100262,0.0009391271,0.0007755957,0.0019075131],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0039368775,0.0045566214,0.17894915,0.0030482544,0.00026304886,0.0032447,0.11539133,0.0033462087,0.03713462,0.0072841,0.05945656,0.5833886],"study_design_scores_gemma":[0.00038156076,0.02786189,0.4996343,0.0017099715,0.00061196764,0.011233063,0.1280573,0.041713808,0.066314556,0.0044459417,0.2170482,0.0009874307],"about_ca_topic_score_codex":0.0011215423,"about_ca_topic_score_gemma":0.0010047877,"teacher_disagreement_score":0.0068173525,"about_ca_system_score_codex":0.0006882823,"about_ca_system_score_gemma":0.00023458854,"threshold_uncertainty_score":0.030565202},"labels":[],"label_agreement":null},{"id":"W2504650674","doi":"10.1142/9789812776952_0010","title":"Robust Video Transmission for Feedback Channels","year":2002,"lang":"en","type":"book-chapter","venue":"Series in machine perception and artificial intelligence","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Computer science; Transmission (telecommunications); Telecommunications","score_opus":0.07154219167317928,"score_gpt":0.2944957615147548,"score_spread":0.22295356984157555,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2504650674","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012763614,0.0028189826,0.9745319,0.0002627394,0.00019393633,0.000029043009,0.000084493746,0.00095165445,0.008363645],"genre_scores_gemma":[0.654012,0.0045927516,0.30466563,0.00029330127,0.00062662456,0.00012444245,0.0003271959,0.00054210157,0.034815937],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99971884,0.000045551336,0.000010538343,0.00004976929,0.00014466619,0.000030707735],"domain_scores_gemma":[0.999549,0.00025098046,0.00004034708,0.00006042794,0.000090470654,0.000008812894],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003762236,0.00060177717,0.00051140634,0.0003512778,0.00030193964,0.00065365265,0.0006508618,0.0007164976,0.0053270664],"category_scores_gemma":[0.0013595406,0.00022246322,0.00022417108,0.0003819178,0.00043691794,0.001014293,0.0004858234,0.0007313448,0.001081264],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00073712436,0.00009994395,0.00018343313,0.00043930658,0.00006593071,0.00031132225,0.00020173722,0.08438155,0.19623019,0.106375165,0.018625928,0.5923484],"study_design_scores_gemma":[0.000035855006,0.00020107935,0.00030036806,0.0000744406,0.000046462257,0.00051556097,0.00003256808,0.84959227,0.10153894,0.03107379,0.01654915,0.00003951219],"about_ca_topic_score_codex":0.0006129693,"about_ca_topic_score_gemma":0.0006520952,"teacher_disagreement_score":0.0053270664,"about_ca_system_score_codex":0.0003597596,"about_ca_system_score_gemma":0.00019388695,"threshold_uncertainty_score":0.017820835},"labels":[],"label_agreement":null},{"id":"W2518453112","doi":"10.1109/taslp.2016.2607339","title":"Scalable Audio Coding Using Trellis-Based Optimized Joint Entropy Coding and Quantization","year":2016,"lang":"en","type":"article","venue":"IEEE/ACM Transactions on Audio Speech and Language Processing","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Tunstall coding; Huffman coding; Computer science; Shannon–Fano coding; Coding tree unit; Variable-length code; Encoder; Harmonic Vector Excitation Coding; Algorithm; Context-adaptive binary arithmetic coding; Entropy encoding; Speech coding; Entropy (arrow of time); Data compression; Theoretical computer science; Speech recognition; Decoding methods","score_opus":0.027114411685423657,"score_gpt":0.2870833721630097,"score_spread":0.25996896047758605,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2518453112","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013582993,0.00045377016,0.9816456,0.00008607969,0.000043583852,0.00007148838,0.000082546234,0.00062019477,0.0034137873],"genre_scores_gemma":[0.5069964,0.0006516878,0.4854485,0.00013585962,0.0000880267,0.00023855454,0.00052663166,0.00017566288,0.0057387045],"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9993461,0.0001150205,0.00003780597,0.00008169439,0.0003474637,0.0000719784],"domain_scores_gemma":[0.99933475,0.000290878,0.000082615144,0.00008294554,0.00018423008,0.000024690768],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006486112,0.0005031204,0.0006065238,0.000620616,0.00029438766,0.0006669807,0.0008281186,0.00050863845,0.0021778636],"category_scores_gemma":[0.0020520976,0.00022892012,0.00048380575,0.00085028406,0.00052908144,0.0009882357,0.0007938739,0.0007965348,0.0004498936],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021366867,0.00006255072,0.00041909848,0.00012341971,0.00005068594,0.00020016152,0.00013074414,0.6588314,0.07922422,0.06777228,0.0031077685,0.18986405],"study_design_scores_gemma":[0.0000141075,0.00006301138,0.0000927443,0.000011570742,0.0000087360195,0.00005642387,0.0000066555026,0.9800677,0.012452802,0.005975888,0.0012329713,0.00001735153],"about_ca_topic_score_codex":0.0031351054,"about_ca_topic_score_gemma":0.0053616785,"teacher_disagreement_score":0.0031351054,"about_ca_system_score_codex":0.00086932187,"about_ca_system_score_gemma":0.0009971461,"threshold_uncertainty_score":0.0072856545},"labels":[],"label_agreement":null},{"id":"W2532485690","doi":"10.1109/iembs.2004.1403913","title":"Wavelet coding of volumetric medical images with high throughput and operability","year":2005,"lang":"en","type":"article","venue":"","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Computer science; Operability; Lossless compression; Wavelet; Wavelet transform; Throughput; Data compression; Image compression; Scalability; Volume (thermodynamics); Lifting scheme; Coding (social sciences); Artificial intelligence; Computer vision; Discrete wavelet transform; Image processing; Image (mathematics); Database; Telecommunications","score_opus":0.008971035965049652,"score_gpt":0.26304708564208346,"score_spread":0.2540760496770338,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2532485690","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.031660777,0.00021092703,0.96635234,0.00013594948,0.000024307612,0.000032673175,0.000055405788,0.0003376956,0.0011899407],"genre_scores_gemma":[0.42951274,0.00079163717,0.5659984,0.00019098599,0.00013407883,0.0001386949,0.00035030048,0.00018023963,0.0027028867],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997352,0.00003380175,0.000012367981,0.000017795903,0.0001807095,0.000020184274],"domain_scores_gemma":[0.9994661,0.0002465668,0.00006373953,0.000099558645,0.00010425739,0.000019824076],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043492226,0.00031058356,0.00028792158,0.00048323997,0.00009915679,0.00033372614,0.0003753824,0.00029024636,0.0009013509],"category_scores_gemma":[0.0015086095,0.000127839,0.00020335967,0.0004814044,0.000336585,0.00068508805,0.00045153566,0.00043978236,0.00038105118],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004174692,0.000063245,0.00055394997,0.00020201685,0.000024488876,0.0003405332,0.0001152293,0.047596823,0.5886191,0.025348682,0.0018388696,0.33487964],"study_design_scores_gemma":[0.0000664857,0.00029068772,0.0011443879,0.00003978297,0.000040956,0.0008225142,0.000035734316,0.61158395,0.36792573,0.01079746,0.0072183865,0.0000338727],"about_ca_topic_score_codex":0.00021597372,"about_ca_topic_score_gemma":0.00025006253,"teacher_disagreement_score":0.0009013509,"about_ca_system_score_codex":0.00018279016,"about_ca_system_score_gemma":0.00022162782,"threshold_uncertainty_score":0.0030152798},"labels":[],"label_agreement":null},{"id":"W2543525900","doi":"10.1109/acssc.2007.4487476","title":"Classification-Based Techniques for Improving the Robustness of CELP Coders","year":2007,"lang":"en","type":"article","venue":"Conference record/Conference record - Asilomar Conference on Signals, Systems, & Computers","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Sherbrooke","funders":"","keywords":"Code-excited linear prediction; Robustness (evolution); Computer science; Speech recognition; Speech coding; Encoder; Linear predictive coding","score_opus":0.07869613810355884,"score_gpt":0.31290114111647716,"score_spread":0.2342050030129183,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2543525900","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019879261,0.00096888805,0.9751077,0.00028370658,0.00015145772,0.000080318234,0.000081997176,0.0016648351,0.0017818132],"genre_scores_gemma":[0.22651276,0.0012889415,0.7653697,0.00036409716,0.0004255325,0.00013878573,0.00046936062,0.00034881884,0.00508198],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984262,0.00019309288,0.0001250042,0.00019721701,0.0009204245,0.00013819087],"domain_scores_gemma":[0.99506086,0.00198556,0.00062995893,0.0006256047,0.0016176626,0.00008037156],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015033173,0.001452071,0.0009771613,0.0021634817,0.00094899733,0.001241526,0.0013385562,0.0013476099,0.0022601248],"category_scores_gemma":[0.009305532,0.0004674423,0.0005925001,0.0011599085,0.00068225904,0.0014450077,0.00088636886,0.0023990942,0.0017676541],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00056412164,0.00013488797,0.00161525,0.0002522227,0.000061244486,0.00022545687,0.00020358097,0.043346517,0.22242707,0.00623829,0.0032727087,0.7216586],"study_design_scores_gemma":[0.000048766884,0.00024937218,0.0028109609,0.000072860625,0.000084671796,0.0006594218,0.0000818126,0.6500253,0.3283153,0.003719427,0.013842066,0.0000900866],"about_ca_topic_score_codex":0.0023977617,"about_ca_topic_score_gemma":0.0036084533,"teacher_disagreement_score":0.0023977617,"about_ca_system_score_codex":0.0007916805,"about_ca_system_score_gemma":0.00059116073,"threshold_uncertainty_score":0.007950425},"labels":[],"label_agreement":null},{"id":"W2543655390","doi":"10.1109/icece.2006.355630","title":"Multimedia Content Repurposing in Heterogeneous Network Environments","year":2006,"lang":"en","type":"article","venue":"","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Repurposing; Computer science; Multimedia; Heterogeneous network; Proxy (statistics); Content (measure theory); World Wide Web; Computer network; Wireless network; Telecommunications; Wireless; Engineering","score_opus":0.02109697968491274,"score_gpt":0.23777604599358354,"score_spread":0.2166790663086708,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2543655390","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5765067,0.00078485423,0.41136447,0.00018873632,0.000046713736,0.0004210616,0.0000848962,0.0069771805,0.0036254744],"genre_scores_gemma":[0.81969076,0.0003963774,0.1753129,0.00009974706,0.000031165757,0.00007530373,0.00025742568,0.0003053854,0.0038309135],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995933,0.00010678796,0.000024371231,0.00006510502,0.00015974505,0.00005055556],"domain_scores_gemma":[0.9989115,0.00036031142,0.0001037838,0.000360782,0.000150352,0.00011320875],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005460706,0.0004505165,0.00056970643,0.00064723694,0.00037499183,0.0006611128,0.0011375048,0.0006505272,0.0012034252],"category_scores_gemma":[0.0018286462,0.00021082957,0.00026420737,0.00050605484,0.00039037588,0.0015310796,0.00074851926,0.000512643,0.00051092735],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011985415,0.00044636705,0.001422812,0.00015144821,0.0000419463,0.0017845465,0.00052377535,0.011974265,0.6941905,0.0021247866,0.0015278585,0.28461316],"study_design_scores_gemma":[0.00008468414,0.0008822053,0.0033775389,0.0000259209,0.00007418948,0.002546567,0.00039201535,0.27147558,0.71151716,0.0021465125,0.0074055847,0.00007205622],"about_ca_topic_score_codex":0.0008414171,"about_ca_topic_score_gemma":0.0005997582,"teacher_disagreement_score":0.0012034252,"about_ca_system_score_codex":0.00024082167,"about_ca_system_score_gemma":0.00015175682,"threshold_uncertainty_score":0.004025817},"labels":[],"label_agreement":null},{"id":"W2544760598","doi":"10.1109/acssc.2011.6189995","title":"Dithered soft decision quantization for baseline JPEG encoding and its joint optimization with huffman coding and quantization table selection","year":2011,"lang":"en","type":"article","venue":"","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Dither; Quantization (signal processing); Huffman coding; Rate–distortion theory; JPEG; Algorithm; JPEG 2000; Computer science; Lossless JPEG; Trellis quantization; Coding (social sciences); Mathematics; Data compression; Image compression; Artificial intelligence; Computer vision; Image processing; Statistics; Image (mathematics); Noise shaping","score_opus":0.04943102723055369,"score_gpt":0.27034247894801217,"score_spread":0.22091145171745846,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2544760598","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00829565,0.00026046956,0.99032974,0.000058342917,0.000016788807,0.000022465565,0.000022332993,0.00016342744,0.0008307873],"genre_scores_gemma":[0.27999893,0.00039329447,0.71642977,0.00009658449,0.000035461035,0.000093895964,0.0001571784,0.000078932724,0.0027159727],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99969923,0.000064535816,0.000015330002,0.000056128003,0.00014166413,0.000023092647],"domain_scores_gemma":[0.9997892,0.000092411676,0.000030652955,0.000030489398,0.000046501424,0.000010807466],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005991942,0.00043187704,0.0005342983,0.00034673983,0.00018452505,0.00051904086,0.00060296035,0.0005527012,0.0012939976],"category_scores_gemma":[0.0012655165,0.00023439982,0.0002552302,0.00065881485,0.0003919986,0.0006349479,0.0004960213,0.0006001081,0.00029585836],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023546038,0.00010325477,0.0007034823,0.00017854774,0.000048981252,0.000103362756,0.00007935973,0.5300523,0.033875994,0.03953827,0.003934927,0.39114597],"study_design_scores_gemma":[0.000010307065,0.00003645738,0.00010595077,0.0000045195593,0.000005180514,0.000032401877,0.0000037139741,0.9926292,0.0045268065,0.0019537758,0.0006864124,0.0000053044287],"about_ca_topic_score_codex":0.0023703428,"about_ca_topic_score_gemma":0.003370746,"teacher_disagreement_score":0.0023703428,"about_ca_system_score_codex":0.0005155486,"about_ca_system_score_gemma":0.0010977461,"threshold_uncertainty_score":0.004713118},"labels":[],"label_agreement":null},{"id":"W2547116575","doi":"10.1109/ccece.2016.7726648","title":"Codebook design for vector quantization using hexagonal partitioning","year":2016,"lang":"en","type":"article","venue":"","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Codebook; Vector quantization; Linde–Buzo–Gray algorithm; Computer science; Image compression; Algorithm; Artificial intelligence; Hexagonal crystal system; Partition (number theory); Quantization (signal processing); Image quality; Pattern recognition (psychology); Image (mathematics); Computer vision; Mathematics; Image processing; Combinatorics","score_opus":0.10490210486098707,"score_gpt":0.33312338926245366,"score_spread":0.2282212844014666,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2547116575","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008395394,0.00023188152,0.9901778,0.000046255806,0.00004000916,0.000045581604,0.000040540115,0.00019352598,0.00082905684],"genre_scores_gemma":[0.325751,0.0004157513,0.6705722,0.00008725847,0.000058322912,0.0001985557,0.0004019392,0.000086102664,0.0024289142],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99953604,0.0001443315,0.000036854988,0.000063734136,0.00017825841,0.0000408809],"domain_scores_gemma":[0.99933666,0.0001926999,0.000051289233,0.00008395881,0.0003079474,0.000027396472],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046386558,0.00032001777,0.00046276723,0.00055506395,0.00030138917,0.00045323823,0.0007600493,0.00033138602,0.0019833161],"category_scores_gemma":[0.0019354396,0.0002000207,0.00020783753,0.0006702863,0.00032490387,0.0007195364,0.0005564481,0.0003869326,0.00066391873],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00032429027,0.00005639594,0.0007177725,0.00021519668,0.00003054415,0.00010762169,0.00020158602,0.16019537,0.06506568,0.045026332,0.0056439578,0.7224153],"study_design_scores_gemma":[0.000045449688,0.00016803888,0.0003169607,0.000021585663,0.000009320704,0.00018538864,0.000065658285,0.9640373,0.020492468,0.008424294,0.0062068114,0.00002664818],"about_ca_topic_score_codex":0.0027233919,"about_ca_topic_score_gemma":0.0027565619,"teacher_disagreement_score":0.0027233919,"about_ca_system_score_codex":0.00040034612,"about_ca_system_score_gemma":0.00061202585,"threshold_uncertainty_score":0.0066348314},"labels":[],"label_agreement":null},{"id":"W2547126918","doi":"10.1109/icspc.2007.4728593","title":"Multi-Layer Optimization for Voice Coding over Ad Hoc Networks","year":2007,"lang":"en","type":"article","venue":"","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Sherbrooke","funders":"","keywords":"Computer science; Multiple description coding; Computer network; Linear network coding; Network layer; Network packet; Application layer; Mobile ad hoc network; Packet loss; Wireless ad hoc network; Robustness (evolution); Speech coding; Wireless network; Codec; Routing protocol; Distributed computing; Layer (electronics); Wireless; Speech recognition; Telecommunications","score_opus":0.03715344838637986,"score_gpt":0.3312922453546689,"score_spread":0.29413879696828904,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2547126918","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.030603567,0.0009412404,0.9651309,0.00021779342,0.00004734987,0.000035785146,0.000016551769,0.0001191666,0.0028876504],"genre_scores_gemma":[0.89315325,0.00077383174,0.10292448,0.000096581345,0.000050014274,0.000111106696,0.00003962307,0.00006832581,0.0027827525],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995925,0.00015662124,0.000013208612,0.00003536318,0.00014075905,0.00006157645],"domain_scores_gemma":[0.999213,0.00050294265,0.00009131498,0.000038163304,0.00012523473,0.000029374447],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00088816194,0.0008600672,0.00042441828,0.00032030317,0.00029947754,0.00061994,0.0005102027,0.0005368226,0.0012785693],"category_scores_gemma":[0.0024055303,0.0002553312,0.00025425164,0.0003358941,0.0005456013,0.00078279135,0.000864696,0.00057391985,0.00023087008],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004880246,0.000022716147,0.00017019671,0.00004351498,0.000021814325,0.00005102859,0.000032263535,0.96928585,0.005143416,0.0072695627,0.00033087612,0.017579967],"study_design_scores_gemma":[0.000005214682,0.000018132938,0.000035571604,0.000002986964,0.0000040773225,0.000009038485,0.0000069439593,0.9974184,0.00065976137,0.0016428438,0.00019415465,0.0000029016544],"about_ca_topic_score_codex":0.0018105764,"about_ca_topic_score_gemma":0.0015164245,"teacher_disagreement_score":0.0018105764,"about_ca_system_score_codex":0.0007299609,"about_ca_system_score_gemma":0.0006218667,"threshold_uncertainty_score":0.00529629},"labels":[],"label_agreement":null},{"id":"W2547598695","doi":"10.1109/iembs.1991.684501","title":"Reversible Image Data Compression For High-resolution Digital Teleradiology","year":2005,"lang":"en","type":"article","venue":"","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Teleradiology; Computer science; Data compression; Image compression; Computer vision; High resolution; Compression (physics); Artificial intelligence; Computer graphics (images); Image (mathematics); Image processing; Remote sensing; Telemedicine; Geology","score_opus":0.03588032556360818,"score_gpt":0.3055020750955914,"score_spread":0.26962174953198326,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2547598695","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15841067,0.005372386,0.80861634,0.0011803608,0.0004498312,0.00020011839,0.00047977484,0.0022508267,0.023039585],"genre_scores_gemma":[0.7450227,0.0034708644,0.22392614,0.00022142877,0.0003620694,0.00010092736,0.00058437604,0.00030571423,0.026005704],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998572,0.000020682586,0.000007482454,0.000013425893,0.00008735524,0.000013830454],"domain_scores_gemma":[0.9996798,0.00012445355,0.000033785243,0.00010340356,0.000049822287,0.000008713288],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016459064,0.0002790313,0.00019330383,0.00053482974,0.00029511916,0.00040657388,0.00047100842,0.0003399142,0.006650724],"category_scores_gemma":[0.00092195085,0.00017507539,0.00018435252,0.000593507,0.0004487051,0.0005536365,0.00028414413,0.0006013548,0.0011378044],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00043694337,0.00011977696,0.0006621506,0.00049576996,0.00004194598,0.0005657942,0.00018997329,0.015341638,0.35034016,0.03581343,0.0057654316,0.59022707],"study_design_scores_gemma":[0.000056561195,0.0002766508,0.0022491184,0.000087882334,0.000094715855,0.0022211322,0.00009255698,0.1426255,0.8058296,0.012065882,0.034344167,0.000056243563],"about_ca_topic_score_codex":0.0005128622,"about_ca_topic_score_gemma":0.0009695256,"teacher_disagreement_score":0.006650724,"about_ca_system_score_codex":0.00020362297,"about_ca_system_score_gemma":0.00027707726,"threshold_uncertainty_score":0.022248864},"labels":[],"label_agreement":null},{"id":"W2579365127","doi":"10.20381/ruor-7645","title":"Soft trellis waveform compression and joint source/channel coding.","year":2000,"lang":"en","type":"dissertation","venue":"Library and Archives Canada (Government of Canada)","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Waveform; Trellis (graph); Computer science; Joint (building); Trellis modulation; Channel code; Coding (social sciences); Data compression; Channel (broadcasting); Electronic engineering; Speech recognition; Algorithm; Telecommunications; Decoding methods; Engineering; Mathematics; Structural engineering; Fading; Statistics","score_opus":0.004695986501104711,"score_gpt":0.16484735421743274,"score_spread":0.16015136771632804,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2579365127","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.021211121,0.0025409053,0.9635806,0.00027350083,0.00018918057,0.000074904005,0.00014683406,0.0005818403,0.011401098],"genre_scores_gemma":[0.59163743,0.0030120227,0.3860212,0.0003320657,0.00033579036,0.00017242596,0.00077094656,0.00015804266,0.01756016],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9991093,0.00017094349,0.000038390954,0.00010510461,0.00051223196,0.000063987696],"domain_scores_gemma":[0.9990495,0.0004073717,0.00012586903,0.00019603518,0.00019435925,0.000026901973],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007282902,0.00051298423,0.0004269671,0.0007181796,0.00024631998,0.00089738297,0.0007400975,0.0006668609,0.0032165379],"category_scores_gemma":[0.0029254353,0.00019583093,0.00035565047,0.0011186267,0.00068370404,0.0011344234,0.0008699247,0.0010613358,0.0010214132],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00033693828,0.00009051341,0.0008884823,0.0003887317,0.0001072726,0.00017229913,0.00013200357,0.22863558,0.06076768,0.14204203,0.0052173007,0.56122124],"study_design_scores_gemma":[0.00002525987,0.00021600525,0.000635126,0.000065791355,0.00002530322,0.00039295878,0.00003086421,0.89892364,0.060968976,0.027499687,0.011175075,0.000041405467],"about_ca_topic_score_codex":0.001091227,"about_ca_topic_score_gemma":0.0014808542,"teacher_disagreement_score":0.0032165379,"about_ca_system_score_codex":0.0006019705,"about_ca_system_score_gemma":0.000846291,"threshold_uncertainty_score":0.010760367},"labels":[],"label_agreement":null},{"id":"W2592706557","doi":"10.5220/0006151802080215","title":"3D Video Multiple Description Coding Considering Region of Interest","year":2017,"lang":"en","type":"article","venue":"","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Computer science; Coding (social sciences); Computer vision; Computer graphics (images); Artificial intelligence; Mathematics","score_opus":0.1734308434584885,"score_gpt":0.3234570257399217,"score_spread":0.1500261822814332,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2592706557","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009407416,0.0006318111,0.9884581,0.00013412202,0.00007573033,0.000034900313,0.0001483462,0.00022319982,0.0008863687],"genre_scores_gemma":[0.37176237,0.0019709964,0.6202265,0.00025320635,0.0001514538,0.00013321098,0.00087187573,0.00018423605,0.0044462373],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996351,0.000056555153,0.000018291019,0.0000508318,0.00019877839,0.000040469327],"domain_scores_gemma":[0.9995096,0.00018909884,0.000050254555,0.000094701885,0.00013763597,0.000018738183],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041077318,0.0006752026,0.00062460033,0.0010548423,0.00020822111,0.0006643887,0.0007332108,0.0006259746,0.0014283219],"category_scores_gemma":[0.0013820707,0.00030819877,0.00061615126,0.0011411987,0.0002745439,0.00088186865,0.0007136189,0.0006867952,0.00035887072],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00033653298,0.00008530723,0.0011816184,0.0003790284,0.00011848966,0.00060832803,0.00011079242,0.28080726,0.092347436,0.028671328,0.006414089,0.5889397],"study_design_scores_gemma":[0.000006667171,0.000022954722,0.00026390346,0.000013567345,0.00001971877,0.00017561947,0.000014136871,0.9809436,0.01397134,0.0026561,0.0019002416,0.000012124019],"about_ca_topic_score_codex":0.004797186,"about_ca_topic_score_gemma":0.0046728854,"teacher_disagreement_score":0.004797186,"about_ca_system_score_codex":0.0004650488,"about_ca_system_score_gemma":0.00076306204,"threshold_uncertainty_score":0.009538531},"labels":[],"label_agreement":null},{"id":"W2593960687","doi":"","title":"Efficient backward motion compensation based scalable wavelet video coding for satellite channels","year":2002,"lang":"en","type":"article","venue":"International Symposium on Antenna Technology and Applied Electromagnetics","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Computer science; Scalable Video Coding; Motion compensation; Discrete cosine transform; Scalability; Real-time computing; Coding tree unit; Coding (social sciences); Wavelet; Computer vision; Telecommunications; Decoding methods","score_opus":0.012635733920013196,"score_gpt":0.23489563905398914,"score_spread":0.22225990513397595,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2593960687","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04874202,0.00062584435,0.94746727,0.00017645428,0.00007395775,0.000049996142,0.000087616514,0.0003790042,0.0023977708],"genre_scores_gemma":[0.5156758,0.0011122883,0.47513717,0.000120448065,0.00007210193,0.00009131191,0.00059450296,0.000077050376,0.0071192775],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999874,0.000015107818,0.000005658499,0.000008676269,0.00008292076,0.000013658854],"domain_scores_gemma":[0.9998435,0.000045844135,0.000017957413,0.000024727284,0.000059844628,0.000008124526],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024064128,0.00029267528,0.00023817332,0.00037516133,0.00016951628,0.00020827453,0.0004125412,0.00027243266,0.0013624246],"category_scores_gemma":[0.00063110236,0.00009556233,0.00016319467,0.0004531624,0.00017320096,0.0005007056,0.00028673923,0.00036880528,0.00047280174],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00043452097,0.000089588546,0.00051860977,0.000113508206,0.00002574357,0.00020445161,0.000089154804,0.053429846,0.3922193,0.019419836,0.005336321,0.5281191],"study_design_scores_gemma":[0.000044028886,0.000105391,0.0005099393,0.000016411806,0.000016215437,0.00018409762,0.00002094227,0.8919479,0.09957553,0.003041456,0.004520656,0.000017418022],"about_ca_topic_score_codex":0.001696182,"about_ca_topic_score_gemma":0.0036107532,"teacher_disagreement_score":0.001696182,"about_ca_system_score_codex":0.0002204699,"about_ca_system_score_gemma":0.00035503952,"threshold_uncertainty_score":0.004557729},"labels":[],"label_agreement":null},{"id":"W2598664459","doi":"10.1117/3.2265064.ch5","title":"Conflict and Cooperation at Very Low Bit Rates","year":2017,"lang":"en","type":"book-chapter","venue":"","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Transcoding; Bit (key); Computer science; Bit rate; Transmission (telecommunications); Image (mathematics); Hierarchy; Image quality; Bitstream; Multimedia; Artificial intelligence; Computer engineering; Computer network; Telecommunications; Decoding methods; Political science","score_opus":0.030120872838712936,"score_gpt":0.2867041830707928,"score_spread":0.25658331023207986,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2598664459","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03772853,0.014323186,0.46909934,0.0040071085,0.001620501,0.00009213049,0.00010350205,0.00037365765,0.47265202],"genre_scores_gemma":[0.69230115,0.011967669,0.088507615,0.0015356177,0.00096441555,0.00040682306,0.00017495424,0.0003588452,0.20378289],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991841,0.00022448323,0.000034878285,0.00012160792,0.00033217247,0.0001027376],"domain_scores_gemma":[0.99837613,0.0010295006,0.000118294214,0.00017620744,0.00021185463,0.000088042274],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008685171,0.00061099866,0.000519837,0.00037844773,0.0008547714,0.00225313,0.0010911084,0.0011199052,0.010469452],"category_scores_gemma":[0.003453822,0.00034616992,0.000322998,0.0005027321,0.0018915569,0.003073873,0.0022532532,0.0024413897,0.0034526144],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006632442,0.000021004344,0.00013793726,0.00017069842,0.000017873428,0.00029217193,0.00085734506,0.005353909,0.012570277,0.9290889,0.0063913884,0.045032036],"study_design_scores_gemma":[0.000040402836,0.000088455694,0.00028909088,0.00018486756,0.000029371411,0.0013045511,0.00037896883,0.034470115,0.010851859,0.8284388,0.12386719,0.000056197234],"about_ca_topic_score_codex":0.00026146637,"about_ca_topic_score_gemma":0.00021266115,"teacher_disagreement_score":0.010469452,"about_ca_system_score_codex":0.0005950508,"about_ca_system_score_gemma":0.0003625346,"threshold_uncertainty_score":0.035023868},"labels":[],"label_agreement":null},{"id":"W2614571185","doi":"10.1109/tcomm.2017.2704585","title":"On the Design of Symmetric Entropy-constrained Multiple Description Scalar Quantizer with Linear Joint Decoders","year":2017,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Algorithm; Mathematics; Encoder; Mathematical optimization; Quantization (signal processing); Decoding methods; Entropy (arrow of time); Vector quantization; Computer science","score_opus":0.10785868372587035,"score_gpt":0.3037160328637489,"score_spread":0.19585734913787853,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2614571185","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0042417995,0.0001939165,0.99439055,0.00007728169,0.00001416873,0.00003575888,0.000026598716,0.0001132372,0.00090675545],"genre_scores_gemma":[0.46686596,0.00050085667,0.52849257,0.0002021553,0.00005387357,0.00020006487,0.0001968716,0.000060637623,0.0034269525],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99885356,0.00039948418,0.000079371224,0.00018860995,0.00039724767,0.00008164619],"domain_scores_gemma":[0.99904305,0.00044228774,0.00013401949,0.00011021168,0.0002379317,0.000032481406],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016951617,0.0006664403,0.0009106515,0.00034472777,0.0003132283,0.00087892346,0.0010722445,0.0006405795,0.0021085055],"category_scores_gemma":[0.0027335032,0.00042441906,0.0004374793,0.00057482533,0.0007306879,0.0012176317,0.0010209471,0.00080201135,0.00056006527],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002706885,0.000077217024,0.0006798887,0.00034955874,0.000077848854,0.00017126513,0.00018886005,0.64787066,0.025925798,0.09717359,0.0025109064,0.22470368],"study_design_scores_gemma":[0.000022109078,0.00007422772,0.00004912487,0.000012354013,0.000008968368,0.000048702197,0.000009227086,0.98925436,0.0040827566,0.0051490944,0.0012777086,0.000011293065],"about_ca_topic_score_codex":0.0014928309,"about_ca_topic_score_gemma":0.001593554,"teacher_disagreement_score":0.0021085055,"about_ca_system_score_codex":0.00068540085,"about_ca_system_score_gemma":0.001514601,"threshold_uncertainty_score":0.008964956},"labels":[],"label_agreement":null},{"id":"W2622672083","doi":"10.1109/ccece.2017.7946826","title":"An FPGA implementation of a custom JPEG image decoder SoC module","year":2017,"lang":"en","type":"article","venue":"","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Windsor","funders":"","keywords":"Computer science; JPEG; Huffman coding; Computer hardware; Field-programmable gate array; Codec; Embedded system; Central processing unit; ARM architecture; Decoding methods; Software; Data compression; Artificial intelligence","score_opus":0.022949375682598406,"score_gpt":0.38695263466205565,"score_spread":0.36400325897945723,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2622672083","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.33392698,0.0014655351,0.54908097,0.0003198086,0.0007345934,0.0012582192,0.0022353542,0.04337062,0.06760792],"genre_scores_gemma":[0.8392058,0.00035052004,0.12894224,0.00039197708,0.00005731149,0.00022763772,0.0013588883,0.00045279542,0.029012961],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99985254,0.000014275062,0.000010789428,0.000028711505,0.000052390787,0.00004111145],"domain_scores_gemma":[0.9998416,0.000025004832,0.000016566793,0.000021617396,0.000079588666,0.000015652458],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000117529555,0.0005452956,0.00025171446,0.00047714764,0.000137224,0.00038389294,0.0007203532,0.00023850666,0.012116601],"category_scores_gemma":[0.00025716453,0.00019996961,0.00017527732,0.00022477593,0.00006878071,0.00025984927,0.00013952945,0.00023433995,0.0035245202],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011285881,0.00036031377,0.005639826,0.0011494174,0.00021114391,0.0015237954,0.00020245125,0.023921179,0.49594563,0.00486943,0.030390637,0.4346576],"study_design_scores_gemma":[0.00043033183,0.0031434486,0.013950666,0.00016902473,0.00028329188,0.0040864334,0.000087115644,0.23464686,0.6206142,0.0007484028,0.121714056,0.00012629702],"about_ca_topic_score_codex":0.0014068251,"about_ca_topic_score_gemma":0.0020126433,"teacher_disagreement_score":0.012116601,"about_ca_system_score_codex":0.00023426356,"about_ca_system_score_gemma":0.00046561967,"threshold_uncertainty_score":0.04053408},"labels":[],"label_agreement":null},{"id":"W26348862","doi":"10.21437/interspeech.2008-11","title":"Mel-frequency cepstral coefficient-based bandwidth extension of narrowband speech","year":2008,"lang":"en","type":"article","venue":"","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":26,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Narrowband; Computer science; Bandwidth extension; Mel-frequency cepstrum; Bandwidth (computing); Speech recognition; Correlation; Correlation coefficient; Spectral density; Distortion (music); Artificial intelligence; Pattern recognition (psychology); Speech coding; Mathematics; Feature extraction; Audio signal; Telecommunications","score_opus":0.025662975639202484,"score_gpt":0.26558331230059773,"score_spread":0.23992033666139526,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W26348862","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.024013625,0.0006617289,0.9721255,0.00008582641,0.00009330293,0.00004655522,0.00022032643,0.00095127244,0.0018019523],"genre_scores_gemma":[0.32949626,0.0008899341,0.66443974,0.00011227468,0.00014578336,0.000115112714,0.0010473259,0.0001912514,0.0035622716],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9996382,0.000064086984,0.000023970111,0.00007278675,0.00017303406,0.000027980128],"domain_scores_gemma":[0.9991604,0.000262717,0.00008239036,0.00022572085,0.00024250886,0.000026221524],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00072190387,0.0007315163,0.0005003557,0.0010846746,0.00022593081,0.00052603264,0.0005782124,0.00046900313,0.00238476],"category_scores_gemma":[0.0033749281,0.00022577534,0.00035635402,0.00082253764,0.0003063453,0.0010004415,0.00065830303,0.0008306179,0.0013454657],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00034659915,0.00009516899,0.0012220419,0.00019867368,0.000056852557,0.00028612025,0.00011470181,0.042079136,0.17138243,0.007736262,0.0022452548,0.77423674],"study_design_scores_gemma":[0.000030493364,0.0001984331,0.0065199276,0.00009578373,0.00009714589,0.0009743951,0.000039668725,0.83159894,0.13604279,0.006284665,0.01801444,0.00010329063],"about_ca_topic_score_codex":0.00090508297,"about_ca_topic_score_gemma":0.0013643223,"teacher_disagreement_score":0.00238476,"about_ca_system_score_codex":0.00022261344,"about_ca_system_score_gemma":0.00030116312,"threshold_uncertainty_score":0.007977784},"labels":[],"label_agreement":null},{"id":"W2734904996","doi":"10.1109/access.2017.2726997","title":"Lossless Compression in Bayer Color Filter Array for Capsule Endoscopy","year":2017,"lang":"en","type":"article","venue":"IEEE Access","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":33,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Saskatchewan","funders":"Western Economic Diversification Canada; Natural Sciences and Engineering Research Council of Canada; Canada Foundation for Innovation","keywords":"Computer science; Color space; Lossless compression; Color filter array; Artificial intelligence; Data compression; Encoder; Raster graphics; Golomb coding; Algorithm; Arithmetic coding; Image compression; Computer vision; Context-adaptive binary arithmetic coding; Color gel; Image processing","score_opus":0.07208048022519012,"score_gpt":0.3976049791953603,"score_spread":0.3255244989701702,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2734904996","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08925621,0.00077658927,0.9049655,0.00019810475,0.00005802387,0.00004567638,0.000068481786,0.0012265474,0.00340477],"genre_scores_gemma":[0.5718791,0.0006950348,0.41874993,0.00020271043,0.000065417094,0.00005499769,0.00020169745,0.000083846906,0.008067248],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998839,0.000013867448,0.0000051072934,0.000016730686,0.00007112993,0.00000922852],"domain_scores_gemma":[0.999899,0.000029022334,0.000014976791,0.000014732735,0.000037728176,0.000004402959],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014282123,0.000263696,0.00014503584,0.0002789382,0.00014951585,0.00025434015,0.0003430767,0.0002472074,0.0010065386],"category_scores_gemma":[0.00033523378,0.00008132041,0.00016014981,0.0003085151,0.00014692191,0.00044182513,0.00013642332,0.000261425,0.000344027],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00034213983,0.000065665736,0.0011375366,0.00012345881,0.000027954547,0.00025263854,0.00011130655,0.041142505,0.40561754,0.012335376,0.0034121722,0.5354317],"study_design_scores_gemma":[0.000028829214,0.00024080051,0.001248564,0.000014572322,0.000026211976,0.00046742315,0.000025160689,0.73026705,0.2576248,0.0015712605,0.008462152,0.00002316625],"about_ca_topic_score_codex":0.0016036509,"about_ca_topic_score_gemma":0.0019736814,"teacher_disagreement_score":0.0016036509,"about_ca_system_score_codex":0.00033160378,"about_ca_system_score_gemma":0.0003027652,"threshold_uncertainty_score":0.0033672452},"labels":[],"label_agreement":null},{"id":"W2744648840","doi":"10.1109/isit.2017.8006997","title":"Index mapping for bit-error resilient multiple description lattice vector quantizer","year":2017,"lang":"en","type":"article","venue":"","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Voronoi diagram; Lattice (music); Coset; Algorithm; Binary number; Computer science; Decoding methods; Mathematics; Theoretical computer science; Topology (electrical circuits); Discrete mathematics; Combinatorics; Geometry; Arithmetic; Physics","score_opus":0.0940706799898478,"score_gpt":0.33755003755470786,"score_spread":0.24347935756486005,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2744648840","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.020725839,0.00044707351,0.9768613,0.00015010504,0.000045423323,0.000047602232,0.000077947174,0.00028071087,0.0013641104],"genre_scores_gemma":[0.5759002,0.0004676878,0.42015776,0.00022025994,0.00005587194,0.00015876231,0.0002598424,0.000046343546,0.0027332853],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99942774,0.00014596898,0.00003927181,0.00007348641,0.00026645378,0.000047101596],"domain_scores_gemma":[0.99935204,0.00023132526,0.000092426344,0.0001488888,0.00014600677,0.000029240482],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00072605256,0.00034022317,0.00040932195,0.00041723266,0.00029326795,0.00058703165,0.0008925914,0.00042557047,0.0012232547],"category_scores_gemma":[0.0024849349,0.0001581229,0.00019953155,0.00057685387,0.0005050852,0.0013545771,0.0008984948,0.00066002115,0.00035171123],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003422174,0.000099001554,0.0011550173,0.0003016565,0.00003815769,0.00023730173,0.00025989665,0.32430336,0.055690315,0.17232668,0.0036407493,0.4416057],"study_design_scores_gemma":[0.00003202291,0.00013536696,0.00013391345,0.000021380409,0.000009175671,0.00013999041,0.000029994844,0.9533418,0.020268958,0.02218806,0.0036781067,0.000021249176],"about_ca_topic_score_codex":0.000859989,"about_ca_topic_score_gemma":0.00085921003,"teacher_disagreement_score":0.0012232547,"about_ca_system_score_codex":0.00050830375,"about_ca_system_score_gemma":0.0006802826,"threshold_uncertainty_score":0.0040922165},"labels":[],"label_agreement":null},{"id":"W2766337133","doi":"10.23919/eusipco.2017.8081481","title":"Flexible and scalable transform-domain codebook for high bit rate CELP coders","year":2017,"lang":"en","type":"article","venue":"","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"VoiceAge (Canada)","funders":"","keywords":"Code-excited linear prediction; Codebook; Vector sum excited linear prediction; Computer science; Speech coding; Adaptive Multi-Rate audio codec; Linear predictive coding; Codec; Codec2; Harmonic Vector Excitation Coding; Speech recognition; Linear prediction; Full Rate; Voice activity detection; Speech processing; Algorithm; Computer hardware","score_opus":0.022455055106323507,"score_gpt":0.29203174596908127,"score_spread":0.26957669086275776,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2766337133","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014592274,0.00018525323,0.9831889,0.000083012346,0.000032282605,0.000035882847,0.00006531752,0.0004065767,0.0014105532],"genre_scores_gemma":[0.4917883,0.0003409746,0.5044279,0.000114333954,0.000042982625,0.00014546244,0.00042335474,0.00014438646,0.0025723989],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9996284,0.00006606969,0.00002155922,0.00003976675,0.00021468136,0.000029462453],"domain_scores_gemma":[0.9992311,0.00025499688,0.00005821907,0.00024961994,0.00016535826,0.00004065253],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005076624,0.00029620665,0.00032019295,0.00027669,0.00019777515,0.0004008319,0.0006819359,0.00047787483,0.0010984521],"category_scores_gemma":[0.0021691313,0.00013942107,0.00022070545,0.00047474157,0.00047752602,0.0008419485,0.0006929523,0.0009043226,0.0005707369],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00041940433,0.000110312016,0.0011008973,0.00023069845,0.000039075876,0.0006837518,0.00018797322,0.26366407,0.26180935,0.09232352,0.005569691,0.37386134],"study_design_scores_gemma":[0.00003596898,0.00008491019,0.0004173434,0.000022257635,0.0000085336915,0.0004004703,0.000026944916,0.9432889,0.040506564,0.0096940445,0.0054876106,0.000026393483],"about_ca_topic_score_codex":0.0017262733,"about_ca_topic_score_gemma":0.0020571542,"teacher_disagreement_score":0.0017262733,"about_ca_system_score_codex":0.00032383017,"about_ca_system_score_gemma":0.00054248143,"threshold_uncertainty_score":0.003674686},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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)","score_opus":0.09125776043680382,"score_gpt":0.35282067592132466,"score_spread":0.2615629154845208,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2771942883","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.25317425,0.008201607,0.713987,0.0011977373,0.0006882492,0.0005726837,0.0022192942,0.0071597146,0.012799548],"genre_scores_gemma":[0.6712456,0.0047364957,0.31166676,0.0004548779,0.00029768856,0.00024381369,0.0033542945,0.00033658757,0.007663996],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9997608,0.000025046676,0.000015410867,0.000034518922,0.00014299974,0.000021204238],"domain_scores_gemma":[0.99972886,0.000069420435,0.000043924527,0.000053489268,0.000094241856,0.000009979754],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002461439,0.0005210961,0.00031228398,0.0012272368,0.0001652776,0.00051403366,0.00043337798,0.00040078623,0.0023748397],"category_scores_gemma":[0.001327088,0.000083744584,0.00031976402,0.0012548341,0.00022717047,0.0006065227,0.0003371056,0.00048189124,0.0005976828],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008383622,0.00010460886,0.001978734,0.00033834073,0.00005421723,0.00085709867,0.00012114731,0.03043726,0.2428312,0.0041942284,0.010952004,0.70729274],"study_design_scores_gemma":[0.00017246426,0.0011650663,0.018381316,0.00020484428,0.00015604513,0.005556866,0.00015113599,0.4531421,0.4793097,0.005504748,0.036156148,0.00009962004],"about_ca_topic_score_codex":0.0014673112,"about_ca_topic_score_gemma":0.0009856087,"teacher_disagreement_score":0.0023748397,"about_ca_system_score_codex":0.00023090267,"about_ca_system_score_gemma":0.00021882089,"threshold_uncertainty_score":0.007944584},"labels":[],"label_agreement":null},{"id":"W2774289161","doi":"10.1109/pacrim.2017.8121904","title":"Enhancement of time compression overlap-add using multirate downsample upsample shift add algorithm","year":2017,"lang":"en","type":"article","venue":"","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Computer science; Algorithm; Compression (physics); Data compression; Window function; Computational complexity theory; Time shifting; Function (biology); Point (geometry); Sampling (signal processing); Window (computing); Mathematics; Telecommunications","score_opus":0.03767504046577065,"score_gpt":0.32644935119306107,"score_spread":0.28877431072729043,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2774289161","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.036559828,0.00059382897,0.95561343,0.00011973965,0.00017801607,0.00008363664,0.000052120256,0.0009547147,0.0058445917],"genre_scores_gemma":[0.1861159,0.00063460734,0.80412585,0.00013281911,0.00023290704,0.00008525428,0.00017314687,0.00009892085,0.008400641],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995696,0.000049923612,0.000021409658,0.00005080608,0.00027881455,0.000029414876],"domain_scores_gemma":[0.99953675,0.00013769932,0.000049052716,0.000088612745,0.00016609076,0.000021738671],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003856196,0.00068106235,0.0004256833,0.00091157743,0.00037010282,0.0006357678,0.00063131686,0.00042059144,0.0033918635],"category_scores_gemma":[0.0010181512,0.00020002834,0.00045568755,0.00064121623,0.00032364222,0.00088918913,0.00063076837,0.0005727147,0.0011921262],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00066976686,0.00020061908,0.00097566744,0.00023027365,0.000067152476,0.00033108972,0.00021921712,0.02042168,0.20470852,0.02224512,0.0023552647,0.7475757],"study_design_scores_gemma":[0.00006992108,0.0005217409,0.0012367656,0.000057113335,0.0001025324,0.0013720841,0.00010164459,0.5591037,0.39147907,0.0044574034,0.04143068,0.00006730475],"about_ca_topic_score_codex":0.0005860821,"about_ca_topic_score_gemma":0.0010711899,"teacher_disagreement_score":0.0033918635,"about_ca_system_score_codex":0.0002563628,"about_ca_system_score_gemma":0.00041712172,"threshold_uncertainty_score":0.011346936},"labels":[],"label_agreement":null},{"id":"W2784065132","doi":"10.1109/tcomm.2017.2789221","title":"Design of Optimal Entropy-Constrained Unrestricted Polar Quantizer for Bivariate Circularly Symmetric Sources","year":2018,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Bivariate analysis; Entropy (arrow of time); Algorithm; Cross-entropy method; Gaussian; Mathematical optimization; Combinatorics; Optimization problem; Discrete mathematics; Statistics; Quadratic assignment problem","score_opus":0.05727282685408157,"score_gpt":0.3120925061258664,"score_spread":0.25481967927178484,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2784065132","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0029822977,0.000074340496,0.99602675,0.00004277566,0.000008136447,0.00002117999,0.000017000335,0.000106248954,0.00072123273],"genre_scores_gemma":[0.21756744,0.00031308553,0.77923435,0.00008803176,0.000026333046,0.00014835066,0.00012424428,0.00007163562,0.0024265111],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99964535,0.000067986526,0.000022706881,0.000086703694,0.00014430309,0.00003289489],"domain_scores_gemma":[0.99956995,0.00019800129,0.000064151776,0.00003165961,0.00011884751,0.000017459035],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006537598,0.0007482867,0.0006021311,0.00043415802,0.00035864,0.00078045303,0.00073559245,0.00059589616,0.0030007944],"category_scores_gemma":[0.0018041279,0.0003978357,0.0003365215,0.00043373276,0.0005171031,0.0010759532,0.0010047078,0.0007717947,0.00062159484],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00036252246,0.000048157064,0.00075332914,0.00026255968,0.000051667306,0.000110592846,0.00023633787,0.4519984,0.05473287,0.058735605,0.0030032594,0.42970464],"study_design_scores_gemma":[0.000044595115,0.00006958915,0.00011371071,0.000014107106,0.000013816464,0.00006441544,0.000027632332,0.9770931,0.011739627,0.008451951,0.0023501555,0.000017172022],"about_ca_topic_score_codex":0.0014279092,"about_ca_topic_score_gemma":0.0017566944,"teacher_disagreement_score":0.0030007944,"about_ca_system_score_codex":0.000621169,"about_ca_system_score_gemma":0.0011369609,"threshold_uncertainty_score":0.010038674},"labels":[],"label_agreement":null},{"id":"W2789397886","doi":"10.1109/tcsi.2018.2799006","title":"Low-Cost Lifting Architecture and Lossless Implementation of Daubechies-8 Wavelets","year":2018,"lang":"en","type":"article","venue":"IEEE Transactions on Circuits and Systems I Regular Papers","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":19,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Saskatchewan","funders":"Western Economic Diversification Canada; Natural Sciences and Engineering Research Council of Canada; Canada Foundation for Innovation","keywords":"Daubechies wavelet; Wavelet; Lossless compression; Architecture; Computer science; Artificial intelligence; Wavelet transform; Data compression; Discrete wavelet transform; Art","score_opus":0.0150357307594012,"score_gpt":0.2702661278065011,"score_spread":0.25523039704709993,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2789397886","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10958546,0.00062799716,0.8803664,0.00028361173,0.00012711559,0.000088532186,0.00006530806,0.0008077751,0.00804779],"genre_scores_gemma":[0.5282098,0.00063741265,0.46653616,0.0001336941,0.00009223595,0.00010372671,0.00018463048,0.000063325344,0.0040389514],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99970967,0.00003825411,0.000023599434,0.000028430944,0.0001561361,0.00004390124],"domain_scores_gemma":[0.99976045,0.000049032355,0.000037872756,0.000075481046,0.0000630337,0.000014088011],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032296166,0.00044376234,0.00028289558,0.0005431354,0.00028251985,0.00059465645,0.00056003587,0.00043113148,0.002198942],"category_scores_gemma":[0.00084624795,0.00021634634,0.00025368578,0.00049164053,0.0002715476,0.0009602655,0.00046257142,0.000631827,0.0008844083],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00069823326,0.00012638686,0.0011641289,0.0003146767,0.000036059024,0.00049584353,0.00020766909,0.016560538,0.4303722,0.07699098,0.0033039849,0.4697292],"study_design_scores_gemma":[0.0002690155,0.0015263979,0.0025281876,0.00013266438,0.00009292539,0.002054963,0.00018962979,0.46160188,0.44780323,0.029025936,0.054679334,0.00009577088],"about_ca_topic_score_codex":0.00031694263,"about_ca_topic_score_gemma":0.00037988092,"teacher_disagreement_score":0.002198942,"about_ca_system_score_codex":0.0002985189,"about_ca_system_score_gemma":0.0003444656,"threshold_uncertainty_score":0.007356167},"labels":[],"label_agreement":null},{"id":"W2790037810","doi":"10.1109/tcomm.2018.2816070","title":"Index Mapping for Bit-Error Resilient Multiple Description Lattice Vector Quantizer","year":2018,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Voronoi diagram; Algorithm; Decoding methods; Binary number; Coset; Hamming distance; Computer science; Lattice (music); Error detection and correction; Hamming bound; Mathematics; Binary erasure channel; Topology (electrical circuits); Channel (broadcasting); Theoretical computer science; Discrete mathematics; Hamming code; Block code; Combinatorics; Channel capacity; Arithmetic; Geometry; Telecommunications","score_opus":0.10861044294155325,"score_gpt":0.3431401829890115,"score_spread":0.23452974004745825,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2790037810","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.026670072,0.0004946083,0.97028154,0.00021438536,0.000053631775,0.000054499265,0.00009927719,0.00046741142,0.0016646037],"genre_scores_gemma":[0.6627103,0.00041169475,0.3330038,0.00021791583,0.000045525732,0.00014041032,0.00025456442,0.00006469326,0.0031510193],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991891,0.00016984364,0.000058665162,0.00011785566,0.00038314186,0.00008132161],"domain_scores_gemma":[0.9987987,0.0005038869,0.00015737931,0.00026160374,0.00022898467,0.000049359922],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008719836,0.00049745856,0.0005610941,0.0004175788,0.00037216625,0.0007440846,0.0011929492,0.000549956,0.001722724],"category_scores_gemma":[0.0037519045,0.00023058892,0.00021104136,0.00067053677,0.0005915967,0.0016813386,0.0012465133,0.0008306761,0.00046784396],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005484554,0.00013216818,0.0012312963,0.00031956847,0.000039790193,0.00036958233,0.00027200507,0.45514613,0.05344083,0.15145598,0.003599482,0.33344468],"study_design_scores_gemma":[0.000022866994,0.00010070809,0.000092867995,0.000015387675,0.0000068809277,0.00011715871,0.000020171432,0.96249247,0.018492717,0.016531719,0.0020897482,0.000017364864],"about_ca_topic_score_codex":0.001331038,"about_ca_topic_score_gemma":0.0013974813,"teacher_disagreement_score":0.001722724,"about_ca_system_score_codex":0.00075237924,"about_ca_system_score_gemma":0.0009842957,"threshold_uncertainty_score":0.005763054},"labels":[],"label_agreement":null},{"id":"W2792055848","doi":"","title":"Compression Effects of JPEG and JPEG2000 on Temporal-Bone Images","year":2005,"lang":"en","type":"article","venue":"","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"JPEG 2000; Compression (physics); Computer vision; Computer science; Artificial intelligence; Image compression; Image processing; Image (mathematics); Materials science","score_opus":0.005567693574240645,"score_gpt":0.25800333728589714,"score_spread":0.2524356437116565,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2792055848","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9492665,0.0056824707,0.035520207,0.00024164058,0.00024959465,0.0002546238,0.0006888901,0.00033688676,0.0077592623],"genre_scores_gemma":[0.91111237,0.0044075656,0.07570271,0.00022143754,0.000090530906,0.00012934124,0.0011616609,0.0001114803,0.00706287],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99964416,0.000057581823,0.000027707907,0.000035913195,0.00019977851,0.000034904362],"domain_scores_gemma":[0.9990576,0.00039735532,0.00008053201,0.000074225725,0.00034849418,0.000041832605],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00062095944,0.0003640177,0.00015288594,0.0010207639,0.00013646456,0.0002765054,0.00021305408,0.00030090654,0.0023088777],"category_scores_gemma":[0.0031146337,0.00010062155,0.00016427269,0.00095456204,0.00022705246,0.00036605194,0.00019244905,0.00023297674,0.00031363082],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0031997473,0.00026913962,0.0061123925,0.000700968,0.0000917472,0.00066003005,0.0002448167,0.00479107,0.7287334,0.0022649579,0.002297175,0.25063458],"study_design_scores_gemma":[0.0001569126,0.0027572725,0.044585876,0.0001038681,0.00017133645,0.0033438697,0.00018461548,0.031532448,0.90600747,0.0008446491,0.0102414675,0.000070253875],"about_ca_topic_score_codex":0.0011007016,"about_ca_topic_score_gemma":0.0012568735,"teacher_disagreement_score":0.0023088777,"about_ca_system_score_codex":0.00020885779,"about_ca_system_score_gemma":0.00018251082,"threshold_uncertainty_score":0.007723987},"labels":[],"label_agreement":null},{"id":"W2794968288","doi":"10.1109/lsp.2018.2820642","title":"Design of Optimal Fixed-Rate Unrestricted Polar Quantizer for Bivariate Circularly Symmetric Sources","year":2018,"lang":"en","type":"article","venue":"IEEE Signal Processing Letters","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Bivariate analysis; Mathematics; Mathematical optimization; Statistics","score_opus":0.034463296486246735,"score_gpt":0.27913818301015164,"score_spread":0.2446748865239049,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2794968288","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0031548645,0.00011063031,0.9956839,0.00004131438,0.000011309759,0.000023929793,0.000016892232,0.00008981726,0.0008674314],"genre_scores_gemma":[0.27238557,0.00042107067,0.7246211,0.0001061454,0.000037413083,0.00016779729,0.00011623644,0.00005762677,0.0020870545],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99961746,0.00008790778,0.000026099588,0.0000926069,0.00013245532,0.00004334442],"domain_scores_gemma":[0.99963224,0.00016246052,0.000051705258,0.000030268731,0.000107205284,0.000016105341],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00070315076,0.0008784516,0.00071063515,0.0003572619,0.00029117233,0.0009029175,0.0006724579,0.00057632575,0.0024464312],"category_scores_gemma":[0.0016372552,0.00037550318,0.00036663658,0.00037791414,0.00047834468,0.0008998686,0.00093555026,0.0008747294,0.00057007844],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00035770674,0.000058644768,0.0006004445,0.00033058965,0.00006297224,0.00017282001,0.00021764834,0.45400485,0.060462456,0.074668184,0.0032209298,0.40584263],"study_design_scores_gemma":[0.00005346327,0.00010758152,0.000086813394,0.000020445868,0.000018848878,0.00010623581,0.000030086028,0.9746183,0.012884551,0.009532268,0.0025221673,0.0000193047],"about_ca_topic_score_codex":0.00097550056,"about_ca_topic_score_gemma":0.0012569777,"teacher_disagreement_score":0.0024464312,"about_ca_system_score_codex":0.00047252147,"about_ca_system_score_gemma":0.0010241801,"threshold_uncertainty_score":0.008184195},"labels":[],"label_agreement":null},{"id":"W2797646149","doi":"10.1007/978-981-10-8081-4_7","title":"Structures for Digital Filter Realization and Effects of Finite Word Length","year":2018,"lang":"en","type":"book-chapter","venue":"Digital Signal Processing","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Realization (probability); Word length; Filter (signal processing); Word (group theory); Computer science; Digital filter; Arithmetic; Mathematics; Computer vision; Natural language processing; Geometry; Statistics","score_opus":0.01500939496727047,"score_gpt":0.25040335742378544,"score_spread":0.23539396245651498,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2797646149","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015546741,0.004173248,0.9224613,0.00048291875,0.0004886376,0.000043850527,0.00011600196,0.0009019344,0.05578536],"genre_scores_gemma":[0.26868984,0.007625302,0.6335069,0.0004902563,0.0008885631,0.00022042153,0.00046905017,0.0011296738,0.08698005],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99971145,0.000057705434,0.000024027599,0.00004901284,0.00012991663,0.000027838976],"domain_scores_gemma":[0.99937785,0.000298007,0.000045350956,0.00015676364,0.00010752886,0.00001442874],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003903046,0.0009701114,0.00050644495,0.000740794,0.0006497329,0.001872895,0.00081393257,0.0011638596,0.01007559],"category_scores_gemma":[0.0016158328,0.00051392586,0.0004681183,0.0009896986,0.0010099611,0.002390364,0.00058627484,0.0017031197,0.0042234757],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000073349445,0.000034441236,0.00006441063,0.00020176823,0.00001277989,0.00013785771,0.00016068411,0.0050201267,0.021087756,0.86148894,0.0032262432,0.10849171],"study_design_scores_gemma":[0.000036632726,0.000099919685,0.00017072468,0.00014665407,0.000039180977,0.0007738227,0.000067874105,0.046686012,0.03859631,0.8327746,0.08055338,0.00005500482],"about_ca_topic_score_codex":0.00019827759,"about_ca_topic_score_gemma":0.00043342012,"teacher_disagreement_score":0.01007559,"about_ca_system_score_codex":0.0006614137,"about_ca_system_score_gemma":0.0003358571,"threshold_uncertainty_score":0.033706248},"labels":[],"label_agreement":null},{"id":"W2798399419","doi":"10.1109/mmsp.2018.8547134","title":"Near-Lossless Deep Feature Compression for Collaborative Intelligence","year":2018,"lang":"en","type":"preprint","venue":"","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Computer science; Cloud computing; Deep learning; Artificial intelligence; Lossless compression; Inference; Mobile device; Deep neural networks; Software deployment; Codec; Feature (linguistics); Image compression; Artificial neural network; Mobile cloud computing; Computer engineering; Distributed computing; Data compression; Real-time computing; Image (mathematics); Image processing; Computer hardware","score_opus":0.03495862601100915,"score_gpt":0.33934692802719624,"score_spread":0.3043883020161871,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2798399419","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.034966633,0.00045363858,0.9594958,0.00040560373,0.000066147164,0.000039523486,0.00014568713,0.0011418469,0.0032850755],"genre_scores_gemma":[0.6795667,0.0005471394,0.3121127,0.0003586473,0.000093794675,0.00007790139,0.0003885135,0.00013756912,0.006716987],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99976104,0.00002970101,0.000011490491,0.00003234198,0.00013620095,0.000029249159],"domain_scores_gemma":[0.99952996,0.00016554707,0.00004103521,0.00016264278,0.000080813414,0.000020125528],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036156128,0.00044593477,0.0003050766,0.0003328327,0.000221386,0.00067032204,0.0009160073,0.00063661067,0.0024836278],"category_scores_gemma":[0.0015882924,0.00015467987,0.00023133302,0.00051611214,0.0005862053,0.0018705629,0.00089908484,0.0011826623,0.0005501332],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00029323448,0.00020139551,0.0011573005,0.00019296132,0.000064798296,0.0003972825,0.00019674368,0.17424057,0.11009167,0.058549605,0.01043777,0.6441766],"study_design_scores_gemma":[0.000014338024,0.0000709125,0.00036106183,0.000018603649,0.000009528274,0.00017556318,0.000029429872,0.9306689,0.047753356,0.015220319,0.0056653228,0.000012823113],"about_ca_topic_score_codex":0.0016201263,"about_ca_topic_score_gemma":0.002971965,"teacher_disagreement_score":0.0024836278,"about_ca_system_score_codex":0.0004585314,"about_ca_system_score_gemma":0.00039812727,"threshold_uncertainty_score":0.008308589},"labels":[],"label_agreement":null},{"id":"W2805124033","doi":"10.48550/arxiv.1806.03348","title":"DSSLIC: Deep Semantic Segmentation-based Layered Image Compression","year":2018,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Artificial intelligence; Computer vision; Image segmentation; Segmentation; Codec; Deep learning; Image compression; RGB color model; Pattern recognition (psychology); Image (mathematics); Image processing","score_opus":0.05499341926677982,"score_gpt":0.2259753511538068,"score_spread":0.17098193188702698,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2805124033","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04433578,0.0012225808,0.9460172,0.0002412884,0.00013275414,0.00012473119,0.00045130894,0.003313526,0.004160719],"genre_scores_gemma":[0.49055466,0.0011120464,0.49886164,0.0003290248,0.000107984015,0.00014739015,0.0018353141,0.00022028053,0.0068316273],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997676,0.000024603189,0.00001353247,0.00002441587,0.00013686199,0.000032933764],"domain_scores_gemma":[0.9997955,0.000038554474,0.00002348063,0.000057222314,0.00006929383,0.000015972104],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029820713,0.0007432972,0.0005110927,0.00096488773,0.00020795743,0.0006381214,0.0008284446,0.0004816444,0.0018005968],"category_scores_gemma":[0.0008289152,0.00014160485,0.00037426504,0.00084026303,0.00040595187,0.0011322718,0.00095311116,0.00076460047,0.0005861016],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00063443294,0.0001856289,0.0009790908,0.0002063062,0.00009654872,0.00035820104,0.00011623731,0.08907585,0.13998337,0.016729169,0.007913489,0.74372166],"study_design_scores_gemma":[0.000046677855,0.00021831378,0.00087512966,0.000037013822,0.000045090837,0.0005941417,0.000043377833,0.83799934,0.1419026,0.009341003,0.008860583,0.000036732014],"about_ca_topic_score_codex":0.001573265,"about_ca_topic_score_gemma":0.0022317914,"teacher_disagreement_score":0.0018005968,"about_ca_system_score_codex":0.00043667413,"about_ca_system_score_gemma":0.0005310835,"threshold_uncertainty_score":0.006023586},"labels":[],"label_agreement":null},{"id":"W2886491616","doi":"10.22147/jucit/090401","title":"A Differential Image Compression Method Using Quantiser Mechanism","year":2018,"lang":"en","type":"article","venue":"Journal of Computer & Information Technology","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Canadian Patient Safety Institute","keywords":"Lossless compression; Lossy compression; Image compression; Huffman coding; Data compression; Computer science; Lossless JPEG; Data compression ratio; Compression ratio; JPEG 2000; Algorithm; JPEG; Artificial intelligence; Image processing; Image (mathematics); Physics","score_opus":0.014276285978481759,"score_gpt":0.31750241693541487,"score_spread":0.3032261309569331,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2886491616","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.021392724,0.0025229477,0.9691013,0.0003210261,0.00034970132,0.0001900173,0.00029193462,0.0017770125,0.004053391],"genre_scores_gemma":[0.31202993,0.0022956787,0.667925,0.00038840406,0.0002422343,0.0002451687,0.0008086213,0.000160921,0.01590397],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99950063,0.000029714689,0.000029299294,0.00009227274,0.00032658447,0.000021469968],"domain_scores_gemma":[0.9996551,0.00007589107,0.00004432136,0.00006964063,0.00014177154,0.00001318012],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000344008,0.00046643597,0.00042057942,0.0011607303,0.00031902592,0.00058815733,0.0008937108,0.00048417592,0.003315489],"category_scores_gemma":[0.0009901955,0.00021715545,0.00029602455,0.0013092171,0.0004595069,0.0011808949,0.0005661082,0.00076171476,0.00077029795],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020360731,0.00007306337,0.000677174,0.0004139977,0.000042474177,0.00020785807,0.0001366294,0.00591241,0.2964365,0.011426952,0.0048139826,0.6796553],"study_design_scores_gemma":[0.00013897938,0.0006722363,0.0039240546,0.000101053156,0.00010459734,0.0035290886,0.00010575674,0.26747283,0.64398915,0.0061079063,0.07371969,0.00013468467],"about_ca_topic_score_codex":0.0008859637,"about_ca_topic_score_gemma":0.0008494172,"teacher_disagreement_score":0.003315489,"about_ca_system_score_codex":0.0004744125,"about_ca_system_score_gemma":0.00041038272,"threshold_uncertainty_score":0.0110913515},"labels":[],"label_agreement":null},{"id":"W2887141786","doi":"","title":"Digital Systolic Architectures for UWB Beamforming using 2-D IIR Spatio-temporal Frequency-planar Beam Filters","year":2013,"lang":"en","type":"article","venue":"OhioLink ETD Center (Ohio Library and Information Network)","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Public Health Agency of Canada; University of Akron","keywords":"Beamforming; Infinite impulse response; Planar; Computer science; Acoustics; Digital filter; Electronic engineering; Telecommunications; Physics; Filter (signal processing); Engineering; Computer vision; Computer graphics (images)","score_opus":0.010533150589312968,"score_gpt":0.21494874145311238,"score_spread":0.2044155908637994,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2887141786","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.043472532,0.0004328459,0.94895494,0.00016750758,0.000092686,0.000034196237,0.000089327485,0.001020636,0.0057351817],"genre_scores_gemma":[0.3794491,0.0005278249,0.60829365,0.00033961574,0.00010751482,0.00013736622,0.00032834648,0.000072055205,0.010744573],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998709,0.000030044188,0.000013098598,0.000020576157,0.000045811827,0.000019595485],"domain_scores_gemma":[0.999739,0.0000960697,0.00003473559,0.000038931037,0.00007721655,0.000014123358],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002545114,0.0005127374,0.00022157522,0.00037166916,0.00026793205,0.00065817754,0.0005688196,0.00041686368,0.0042355717],"category_scores_gemma":[0.00050718023,0.0001871712,0.00023444074,0.0004757362,0.0001766801,0.000662168,0.0004575337,0.00038946053,0.0010239757],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007755101,0.00024139161,0.0011548456,0.00023908017,0.00009197481,0.00023144485,0.00033692177,0.11337158,0.25852513,0.049458552,0.006210524,0.56936306],"study_design_scores_gemma":[0.00014907391,0.0009578067,0.00085527165,0.0000715667,0.000069016554,0.00037963665,0.00014424205,0.8471552,0.11171383,0.019288715,0.019163206,0.000052448177],"about_ca_topic_score_codex":0.0007849468,"about_ca_topic_score_gemma":0.0031532852,"teacher_disagreement_score":0.0042355717,"about_ca_system_score_codex":0.0004031461,"about_ca_system_score_gemma":0.00051614485,"threshold_uncertainty_score":0.014169395},"labels":[],"label_agreement":null},{"id":"W2890182058","doi":"10.1109/tcomm.2018.2869864","title":"Design of Optimal Scalar Quantizer for Sequential Coding of Correlated Sources","year":2018,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Coding (social sciences); Algorithm; Scalar (mathematics); Electronic engineering; Mathematics; Control theory (sociology); Statistics; Engineering; Artificial intelligence","score_opus":0.08850073956349497,"score_gpt":0.3438400994164779,"score_spread":0.25533935985298295,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2890182058","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0072494154,0.00012035545,0.9916368,0.00007808783,0.00001978305,0.000030779407,0.00003772093,0.00011515875,0.00071193144],"genre_scores_gemma":[0.5479893,0.0005018276,0.44720453,0.00016375358,0.0000650739,0.00019293635,0.00020513126,0.000058885715,0.0036185817],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99947673,0.00012840168,0.000034985693,0.00015054214,0.0001696136,0.000039604754],"domain_scores_gemma":[0.99941635,0.00024887413,0.00010127198,0.000045914494,0.00016670642,0.000020990958],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008484021,0.00061534194,0.00056288665,0.0003227659,0.00026793918,0.0006053835,0.0007059826,0.00048474973,0.002103407],"category_scores_gemma":[0.001733165,0.00032021338,0.00028796057,0.00046372676,0.00049302215,0.001086025,0.000594056,0.0006216173,0.00045487343],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005100114,0.00009718359,0.0011584719,0.00043237032,0.00009123017,0.0001571961,0.00025013127,0.43828866,0.10199143,0.10080792,0.0033882821,0.35282716],"study_design_scores_gemma":[0.000044390803,0.00014685636,0.00018808687,0.000020116471,0.000017203183,0.000058965335,0.000025420291,0.9712587,0.015189583,0.010443293,0.0025889718,0.000018370503],"about_ca_topic_score_codex":0.0012429394,"about_ca_topic_score_gemma":0.0018190545,"teacher_disagreement_score":0.002103407,"about_ca_system_score_codex":0.0005929605,"about_ca_system_score_gemma":0.0012457737,"threshold_uncertainty_score":0.0070366263},"labels":[],"label_agreement":null},{"id":"W2891083648","doi":"10.1109/icassp.2018.8462220","title":"Design of Optimal Entropy-Constrained Unrestricted Polar Quantizer for Bivariate Circularly Symmetric Sources","year":2018,"lang":"en","type":"article","venue":"","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Bivariate analysis; Mathematics; Entropy (arrow of time); Minification; Cross-entropy method; Combinatorics; Graph; Algorithm; Optimization problem; Mathematical optimization; Discrete mathematics; Statistics; Quadratic assignment problem; Physics","score_opus":0.032659814472745234,"score_gpt":0.2846306703937049,"score_spread":0.25197085592095964,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2891083648","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0031969282,0.00007326912,0.9958683,0.000039113587,0.000006890901,0.000018951128,0.000016859629,0.00009766472,0.0006820022],"genre_scores_gemma":[0.24334863,0.00029592033,0.7540038,0.000075899465,0.000022935452,0.0001299926,0.00012907955,0.000062140345,0.0019315919],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997228,0.000053267155,0.000019121699,0.00006744074,0.0001108692,0.000026565907],"domain_scores_gemma":[0.999671,0.00015577905,0.000046169127,0.00002658582,0.00008749796,0.000013037064],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00053109083,0.0006210553,0.00052793487,0.0004000127,0.0002990758,0.0006524194,0.00064359454,0.00050720223,0.0026347598],"category_scores_gemma":[0.001519595,0.00032585775,0.00028186123,0.00041040286,0.00044141698,0.0008994301,0.00089170306,0.0006702784,0.0004991716],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00031096902,0.000045420213,0.000739102,0.00026118627,0.000043477914,0.000118356,0.00019992633,0.41545978,0.05245664,0.06175031,0.0029266572,0.46568823],"study_design_scores_gemma":[0.000040526756,0.0000789502,0.00011683962,0.000014797341,0.000014140689,0.000085531676,0.000028902517,0.9728933,0.013410441,0.010808568,0.0024937568,0.000014273141],"about_ca_topic_score_codex":0.0011044693,"about_ca_topic_score_gemma":0.0014184525,"teacher_disagreement_score":0.0026347598,"about_ca_system_score_codex":0.00045103108,"about_ca_system_score_gemma":0.0009349185,"threshold_uncertainty_score":0.008814156},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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)","score_opus":0.22791176551484027,"score_gpt":0.42425800844391887,"score_spread":0.1963462429290786,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2894662919","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05537781,0.0009685617,0.9375894,0.00033546754,0.00021953405,0.0001058531,0.00010085058,0.00089102995,0.004411545],"genre_scores_gemma":[0.45829204,0.0011284308,0.533105,0.00015314325,0.00023215586,0.0001671648,0.00037236107,0.000111640096,0.0064381002],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997123,0.000018981525,0.000014630889,0.000037268546,0.00020111175,0.000015583311],"domain_scores_gemma":[0.99956876,0.00011672229,0.000044510678,0.00007394469,0.0001760673,0.000019882196],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024290447,0.00039283358,0.00036157094,0.0011732717,0.000415161,0.00033566693,0.00045246418,0.0004187709,0.0013568831],"category_scores_gemma":[0.001076734,0.000122050464,0.0004489862,0.00082807324,0.0003058177,0.0007019212,0.0003606638,0.0003906346,0.0003029295],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00039891156,0.00013310026,0.0019901327,0.00026736464,0.000078122575,0.00075269054,0.00034957158,0.0907918,0.19842319,0.02806859,0.007618286,0.6711283],"study_design_scores_gemma":[0.000041832758,0.000103988205,0.0012225731,0.000017452912,0.00002649102,0.0011143914,0.000046893067,0.9249522,0.058054186,0.0051634717,0.00922617,0.000030279502],"about_ca_topic_score_codex":0.0019328531,"about_ca_topic_score_gemma":0.0014464553,"teacher_disagreement_score":0.0019328531,"about_ca_system_score_codex":0.0004111185,"about_ca_system_score_gemma":0.00047215677,"threshold_uncertainty_score":0.0045391917},"labels":[],"label_agreement":null},{"id":"W2897104541","doi":"10.2352/cic.2014.22.1.art00012","title":"Subspace-Clustering-Based Multispectral Image Compression","year":2014,"lang":"en","type":"article","venue":"Color and Imaging Conference","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Multispectral image; Lossless compression; Linear subspace; Data compression; Redundancy (engineering); Hyperspectral imaging; Image compression; JPEG 2000; Cluster analysis; Computer science; Artificial intelligence; Multispectral pattern recognition; Subspace topology; Dimension (graph theory); Pattern recognition (psychology); Compression (physics); Mathematics; Computer vision; Algorithm; Image processing; Image (mathematics); Physics; Combinatorics; Geometry","score_opus":0.010614231518210828,"score_gpt":0.259756510927532,"score_spread":0.24914227940932115,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2897104541","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012563317,0.0005153954,0.9825714,0.000102134414,0.00006867517,0.00005333127,0.000108098706,0.0010634088,0.0029542386],"genre_scores_gemma":[0.20706737,0.0009906597,0.7846371,0.00014123127,0.00007049516,0.00012674653,0.00080232875,0.00024621378,0.0059178667],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99937433,0.00009024607,0.000029067141,0.00008688047,0.0003699591,0.000049601153],"domain_scores_gemma":[0.9995989,0.000069690395,0.000028080822,0.00009520316,0.00019393682,0.0000141174605],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003270139,0.0006427829,0.00064388535,0.0015239996,0.0005804899,0.00055330154,0.0007572446,0.0006028021,0.0019693363],"category_scores_gemma":[0.000796243,0.00019594672,0.0006038354,0.0021002097,0.00046232852,0.0009505574,0.00084740145,0.0006186698,0.0011956738],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017142341,0.0001358065,0.00041682893,0.00016082497,0.0000708458,0.00015357109,0.0001637616,0.1612057,0.14987993,0.022822285,0.0052281087,0.65959096],"study_design_scores_gemma":[0.000016065944,0.00009899891,0.00076328556,0.000019442834,0.000019211482,0.00042176258,0.000059381815,0.8606649,0.118016906,0.0076431883,0.012219839,0.00005707198],"about_ca_topic_score_codex":0.002011728,"about_ca_topic_score_gemma":0.0029341704,"teacher_disagreement_score":0.002011728,"about_ca_system_score_codex":0.00044700535,"about_ca_system_score_gemma":0.0005143468,"threshold_uncertainty_score":0.0065881014},"labels":[],"label_agreement":null},{"id":"W2912928774","doi":"10.1109/tcomm.2019.2894808","title":"Design of Successively Refinable Unrestricted Polar Quantizer","year":2019,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Algorithm; Entropy (arrow of time); Combinatorics; Computer science; Mathematics; Discrete mathematics; Physics","score_opus":0.046837516925425794,"score_gpt":0.30398805775679216,"score_spread":0.25715054083136635,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2912928774","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011543338,0.0001522459,0.9863702,0.00004840564,0.000019367286,0.0000407128,0.000033526598,0.00013320282,0.0016589522],"genre_scores_gemma":[0.55328834,0.0004418379,0.44105944,0.00010783258,0.00004802382,0.00018675615,0.00016193639,0.000043425727,0.0046623526],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99963593,0.00008297426,0.000024666384,0.000105575426,0.00011050501,0.000040416988],"domain_scores_gemma":[0.9995633,0.00015237636,0.00008480593,0.00005418942,0.000115101895,0.000030146346],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005874996,0.0006379809,0.00055070163,0.00040071228,0.0002788792,0.00068974664,0.0009483127,0.00062494626,0.0031600178],"category_scores_gemma":[0.0016799562,0.00037597888,0.00034871127,0.00031852993,0.0005151353,0.0012402796,0.0010538102,0.0007855398,0.00059091114],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009693114,0.00009055986,0.001319486,0.00035997614,0.00007672284,0.00027042275,0.0004145134,0.27799407,0.22674386,0.11510046,0.001990096,0.3746705],"study_design_scores_gemma":[0.000068938025,0.00027638106,0.00036923523,0.00003414649,0.000035964633,0.00012690289,0.00004564898,0.93760914,0.04578186,0.010063467,0.005541495,0.000046781184],"about_ca_topic_score_codex":0.0007450528,"about_ca_topic_score_gemma":0.00097534154,"teacher_disagreement_score":0.0031600178,"about_ca_system_score_codex":0.00040678246,"about_ca_system_score_gemma":0.0005151574,"threshold_uncertainty_score":0.010571361},"labels":[],"label_agreement":null},{"id":"W2913468736","doi":"10.1145/3310195.3310204","title":"JPEG column","year":2019,"lang":"en","type":"article","venue":"ACM SIGMultimedia Records","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"JPEG; JPEG 2000; Computer science; Coding (social sciences); Flexibility (engineering); Column (typography); Image quality; Data compression; Lossless JPEG; Image compression; Multimedia; Computer vision; Telecommunications; Image processing; Image (mathematics); Statistics; Mathematics","score_opus":0.011426252009117134,"score_gpt":0.2642818728921535,"score_spread":0.25285562088303637,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2913468736","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0014638461,0.009826786,0.02963839,0.004947794,0.013836233,0.00046917936,0.030910539,0.017634727,0.89127254],"genre_scores_gemma":[0.0039526084,0.0031878948,0.008309398,0.0014937858,0.0014364611,0.00007281057,0.022386976,0.002418732,0.9567413],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99940693,0.00002690857,0.00002764944,0.000085238345,0.00040054574,0.000052768246],"domain_scores_gemma":[0.99810326,0.000113530536,0.000047053396,0.00024484695,0.0012721627,0.00021917858],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00052731327,0.0010468444,0.0007722155,0.0030187427,0.0010082168,0.0035659622,0.0013799078,0.0013272491,0.6181056],"category_scores_gemma":[0.001926806,0.00053630554,0.00043084225,0.0027809897,0.00045451388,0.0026324824,0.0012728263,0.0023993638,0.5169767],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006204938,0.000016334408,0.00007319653,0.00013027628,0.000005243974,0.00005390543,0.000016844016,0.00009348569,0.004409403,0.00458107,0.90184873,0.0887095],"study_design_scores_gemma":[0.0000071341474,0.000010339162,0.0002154995,0.000031279713,0.0000026679015,0.00013471242,0.0000119986025,0.00021468842,0.0012620406,0.0007140982,0.99738723,0.000008381617],"about_ca_topic_score_codex":0.0063109486,"about_ca_topic_score_gemma":0.013432671,"teacher_disagreement_score":0.6181056,"about_ca_system_score_codex":0.00072525005,"about_ca_system_score_gemma":0.0013097716,"threshold_uncertainty_score":0.544726},"labels":[],"label_agreement":null},{"id":"W2951833923","doi":"10.1007/s10514-019-09866-z","title":"Transmission of images by unmanned underwater vehicles","year":2019,"lang":"en","type":"article","venue":"Autonomous Robots","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Defence Research and Development Canada","funders":"","keywords":"Computer science; Sonar; Underwater; Fidelity; Computer vision; Artificial intelligence; Bandwidth (computing); Attenuation; Side-scan sonar; Quantization (signal processing); Acoustics; Real-time computing; Telecommunications; Geology","score_opus":0.007821730148855793,"score_gpt":0.2419004764974718,"score_spread":0.234078746348616,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2951833923","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.30858284,0.0025215363,0.6582983,0.0012202775,0.0007833922,0.00011058199,0.00059543987,0.0017029161,0.026184645],"genre_scores_gemma":[0.87375873,0.0014154383,0.095134445,0.00017639234,0.00024861933,0.00008029024,0.00051139144,0.00014142535,0.028533272],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99990046,0.000012092489,0.0000032122223,0.00001099465,0.00006146797,0.000011772376],"domain_scores_gemma":[0.9998462,0.00004701072,0.000021180298,0.000029390345,0.000048183225,0.000007994058],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000097951895,0.00026747977,0.0001640021,0.00036891113,0.0002570236,0.0003222506,0.00027938109,0.0003391315,0.0030636585],"category_scores_gemma":[0.0005541827,0.00011942125,0.00010948854,0.00040490297,0.00022230949,0.0006241305,0.00041655582,0.00025303016,0.0005191121],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005313738,0.00007595201,0.0018000865,0.0003617205,0.000057915637,0.0007799364,0.0006179689,0.04891196,0.257036,0.024936238,0.013980386,0.65091044],"study_design_scores_gemma":[0.00009331905,0.0004342726,0.006479341,0.00011808959,0.00006524432,0.0011002925,0.00056574267,0.5617739,0.34169456,0.018265298,0.06935134,0.000058633683],"about_ca_topic_score_codex":0.0012511887,"about_ca_topic_score_gemma":0.0009684173,"teacher_disagreement_score":0.0030636585,"about_ca_system_score_codex":0.00024185554,"about_ca_system_score_gemma":0.000231264,"threshold_uncertainty_score":0.010248899},"labels":[],"label_agreement":null},{"id":"W2964134724","doi":"10.1109/wf-iot.2019.8767351","title":"Refined Lightweight Temporal Compression for Energy-Efficient Sensor Data Streaming","year":2019,"lang":"en","type":"article","venue":"","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Lossy compression; Computer science; Energy consumption; Compression ratio; Data compression; Byte; Latency (audio); Overhead (engineering); Real-time computing; Compression (physics); Energy (signal processing); Data compression ratio; Parallel computing; Algorithm; Computer hardware; Image compression; Telecommunications","score_opus":0.032434074486695844,"score_gpt":0.2959669132078151,"score_spread":0.26353283872111927,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2964134724","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.061871987,0.0013848474,0.9315471,0.00020812271,0.000118952514,0.00012500855,0.00045584005,0.0021083187,0.0021797423],"genre_scores_gemma":[0.49876013,0.0010977626,0.49570867,0.00019862712,0.00012569643,0.000244533,0.0014586528,0.00025133163,0.002154592],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995902,0.00003844886,0.000031482603,0.00004712129,0.00026137868,0.000031363754],"domain_scores_gemma":[0.9990502,0.0003663875,0.00010300213,0.0001871435,0.0002624186,0.000030818763],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043490093,0.00048496737,0.00041205407,0.00096459355,0.0003166877,0.0005750374,0.0008009868,0.00035065666,0.0011451315],"category_scores_gemma":[0.0029752152,0.000163171,0.0002954015,0.0015684001,0.000391356,0.0012267488,0.0007217849,0.00060205365,0.00038245355],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00065290666,0.00013191711,0.0020400893,0.00030131635,0.000044684803,0.00032592713,0.00023341016,0.11659162,0.1418922,0.01503426,0.0068180417,0.7159336],"study_design_scores_gemma":[0.00003746214,0.00014909024,0.0010347991,0.000029723135,0.000017902526,0.00037030238,0.00006641353,0.92004746,0.065221824,0.0065200576,0.0064779636,0.00002694468],"about_ca_topic_score_codex":0.0024183677,"about_ca_topic_score_gemma":0.0031917167,"teacher_disagreement_score":0.0024183677,"about_ca_system_score_codex":0.00039473062,"about_ca_system_score_gemma":0.000762461,"threshold_uncertainty_score":0.004808545},"labels":[],"label_agreement":null},{"id":"W2971644068","doi":"","title":"GAN Data Augmentation Through Active Learning Inspired Sample Acquisition.","year":2019,"lang":"en","type":"article","venue":"Computer Vision and Pattern Recognition","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":20,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Sample (material); Physics","score_opus":0.04842322416993738,"score_gpt":0.32161623873480977,"score_spread":0.2731930145648724,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2971644068","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010718793,0.00030043427,0.9848791,0.00013777542,0.00012766897,0.000047074274,0.0002480684,0.0015475121,0.0019936124],"genre_scores_gemma":[0.4500871,0.00045228342,0.53720266,0.00040717196,0.00016488547,0.00023288795,0.0022041663,0.00039110746,0.008857695],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996958,0.0000680473,0.000011773604,0.00007822029,0.000118480515,0.000027772778],"domain_scores_gemma":[0.99925536,0.000289213,0.00004953767,0.00018231967,0.0001938842,0.000029652403],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006133459,0.0007182847,0.00055397965,0.00038024614,0.000139139,0.0005544389,0.0010712587,0.00063475064,0.0029083458],"category_scores_gemma":[0.0024812177,0.0003125738,0.00042405288,0.0005651141,0.00044919786,0.0010949861,0.00085320417,0.0014891359,0.0013491182],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005789052,0.00026855513,0.0016946907,0.0002640801,0.0001340454,0.00018579185,0.00016033834,0.19010234,0.055228822,0.018914983,0.02062401,0.7118434],"study_design_scores_gemma":[0.000008622883,0.000059158298,0.00027446475,0.000011738263,0.000010299247,0.00008378329,0.000011010654,0.9767799,0.015225724,0.004074904,0.0034517345,0.000008629908],"about_ca_topic_score_codex":0.0008853235,"about_ca_topic_score_gemma":0.0020056542,"teacher_disagreement_score":0.0029083458,"about_ca_system_score_codex":0.00023173589,"about_ca_system_score_gemma":0.00043659404,"threshold_uncertainty_score":0.009729385},"labels":[],"label_agreement":null},{"id":"W2974226098","doi":"10.22215/etd/2009-08965","title":"Multiple description video coding using MPEG-21","year":2009,"lang":"en","type":"dissertation","venue":"","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Canadian Heritage; Library and Archives Canada","funders":"","keywords":"Computer science; Coding (social sciences); Mathematics; Statistics","score_opus":0.04141110842826938,"score_gpt":0.31617169967935466,"score_spread":0.27476059125108526,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2974226098","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.039652616,0.0019756258,0.8625256,0.0007075919,0.00089309533,0.00067226676,0.002676542,0.0045587188,0.086337924],"genre_scores_gemma":[0.2739484,0.0038203292,0.51881367,0.000593209,0.0002535676,0.00037356466,0.00906589,0.00079905277,0.19233224],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99979395,0.000021395643,0.000016224192,0.000019981824,0.00012288096,0.000025659152],"domain_scores_gemma":[0.99984133,0.00002078139,0.000011018635,0.00003720045,0.00008202184,0.000007739318],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030682757,0.00037152268,0.00025919778,0.00073341944,0.00023236292,0.00060365704,0.00044554807,0.00036698536,0.008557141],"category_scores_gemma":[0.0008115557,0.00008004159,0.00021841422,0.00067068764,0.0001321992,0.00042870673,0.00032626186,0.00043058992,0.0032690896],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00027334335,0.00013039492,0.0006573338,0.00025988516,0.000052738207,0.00036214458,0.00012219635,0.005203295,0.19866677,0.03578251,0.03623146,0.722258],"study_design_scores_gemma":[0.000080130354,0.00045264608,0.0038336688,0.00017258263,0.0000592202,0.0012670739,0.00015717081,0.122918144,0.5358807,0.012678044,0.3224191,0.000081640916],"about_ca_topic_score_codex":0.0024636516,"about_ca_topic_score_gemma":0.004001133,"teacher_disagreement_score":0.008557141,"about_ca_system_score_codex":0.00039308512,"about_ca_system_score_gemma":0.0004987281,"threshold_uncertainty_score":0.028626502},"labels":[],"label_agreement":null},{"id":"W2994230332","doi":"10.1109/idaacs.2019.8924259","title":"Comparison of Pixel Correlation Induced by Space-Filling Curves on 2D Image Data","year":2019,"lang":"en","type":"article","venue":"","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Rimouski","funders":"","keywords":"Pixel; Hilbert curve; Image (mathematics); Mathematics; Artificial intelligence; Computer science; Algorithm; Computer vision","score_opus":0.06597296602883185,"score_gpt":0.37027950682904626,"score_spread":0.3043065408002144,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2994230332","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9578791,0.00032814223,0.039684366,0.00007007591,0.000025164445,0.000041736468,0.00030776788,0.000377006,0.0012867212],"genre_scores_gemma":[0.9830148,0.00016664076,0.015842458,0.000012064972,0.0000099575,0.00003363789,0.00058658415,0.00006824694,0.000265692],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991689,0.00015267108,0.000059869417,0.00012093055,0.00038021742,0.0001174861],"domain_scores_gemma":[0.99125755,0.005083744,0.000637368,0.0013303476,0.0014412211,0.0002497979],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008799872,0.00044295212,0.00046511617,0.0016504712,0.00039484035,0.0008361019,0.00035445174,0.00035608304,0.0012683952],"category_scores_gemma":[0.010018965,0.00020740715,0.00025549947,0.002260816,0.00083909364,0.0014170079,0.0005660577,0.00041576813,0.00018355498],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0046895784,0.00057774957,0.037348337,0.0006972999,0.00014888398,0.0015461321,0.0015045125,0.38229063,0.21125677,0.019198783,0.0039662826,0.33677495],"study_design_scores_gemma":[0.00006783032,0.00096904143,0.035714794,0.000050083723,0.00003539846,0.0014261962,0.0006758512,0.7900504,0.16067709,0.0071226386,0.0030979426,0.00011278182],"about_ca_topic_score_codex":0.0009552976,"about_ca_topic_score_gemma":0.00063572364,"teacher_disagreement_score":0.0016504712,"about_ca_system_score_codex":0.0005312354,"about_ca_system_score_gemma":0.0005528284,"threshold_uncertainty_score":0.004653871},"labels":[],"label_agreement":null},{"id":"W3002658151","doi":"10.5539/cis.v13n1p80","title":"Multi-Channel Similarity Based Compression","year":2020,"lang":"en","type":"article","venue":"Computer and Information Science","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Computer science; Similarity (geometry); Channel (broadcasting); Compression (physics); Data compression; Process (computing); Data mining; Compression ratio; Algorithm; Lossless compression; Pattern recognition (psychology); Artificial intelligence; Telecommunications; Image (mathematics)","score_opus":0.03598611742903018,"score_gpt":0.2830182567671213,"score_spread":0.2470321393380911,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3002658151","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.059577346,0.0018186931,0.9257922,0.00049192057,0.00046060965,0.00025553405,0.00062714395,0.0018830954,0.00909338],"genre_scores_gemma":[0.507292,0.0017032891,0.47189835,0.0004307435,0.00059025455,0.0003286178,0.0020394062,0.0002814333,0.015436091],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988513,0.00012629117,0.00007692333,0.00018508111,0.00064608833,0.00011435841],"domain_scores_gemma":[0.99836165,0.00044179856,0.00010209683,0.00050552946,0.0005374717,0.00005145951],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006279076,0.0007173154,0.0008257574,0.0019516142,0.0004439047,0.0010445068,0.000862713,0.0009988709,0.004393544],"category_scores_gemma":[0.0030395414,0.00021858483,0.0006034623,0.0031294208,0.0005432392,0.001872905,0.0014408297,0.00075060397,0.0016329202],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009168743,0.00028160724,0.0020782722,0.0002858697,0.00012295706,0.000608827,0.00020563368,0.044814657,0.1007848,0.016407313,0.009010069,0.82448304],"study_design_scores_gemma":[0.000116922405,0.00062319706,0.0062343995,0.00010202658,0.00014560821,0.0032452457,0.00026984653,0.7218821,0.21330974,0.02493803,0.028975513,0.00015731079],"about_ca_topic_score_codex":0.0010325335,"about_ca_topic_score_gemma":0.0014871527,"teacher_disagreement_score":0.004393544,"about_ca_system_score_codex":0.0003924853,"about_ca_system_score_gemma":0.0006597907,"threshold_uncertainty_score":0.014697909},"labels":[],"label_agreement":null},{"id":"W3006387108","doi":"10.1007/s00357-019-09353-1","title":"Modified Subspace Constrained Mean Shift Algorithm","year":2020,"lang":"en","type":"article","venue":"Journal of Classification","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Vector Institute; St. Michael's Hospital; Public Safety Canada; University of Toronto","funders":"","keywords":"Algorithm; Mathematics; Principal component analysis; Kernel (algebra); Subspace topology; Kernel density estimation; Mean-shift; Cluster analysis; Kernel principal component analysis; Projection (relational algebra); Kernel method; Pattern recognition (psychology); Computer science; Artificial intelligence; Support vector machine; Statistics","score_opus":0.05620725276592743,"score_gpt":0.3001003185265803,"score_spread":0.2438930657606529,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3006387108","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007981109,0.00046003048,0.9889764,0.00014276532,0.00017251293,0.00003966333,0.00011820263,0.0006303133,0.0014788721],"genre_scores_gemma":[0.08522712,0.00056292664,0.90204614,0.00023509438,0.00016163349,0.00015435492,0.0007841399,0.00023477177,0.010593837],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992562,0.00010826213,0.000042194464,0.00016636717,0.000365337,0.00006164039],"domain_scores_gemma":[0.99945396,0.00007887096,0.00003343236,0.0001246751,0.0002802543,0.000028786737],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046365912,0.00066323,0.0010545056,0.0008727929,0.0006225645,0.0009699917,0.0011991411,0.001145341,0.005257679],"category_scores_gemma":[0.001291719,0.0003191053,0.0007408137,0.0015216774,0.00044984062,0.000998616,0.0011759587,0.00095624203,0.0030957006],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00030236234,0.00011317291,0.00068826607,0.00013014922,0.00011889977,0.000084660314,0.000068561385,0.038527183,0.04464013,0.009720327,0.010013564,0.89559263],"study_design_scores_gemma":[0.000055810106,0.0001627456,0.0014148224,0.000021793776,0.0000655643,0.0005002366,0.000050529496,0.92497647,0.037352044,0.010978413,0.02435976,0.00006183622],"about_ca_topic_score_codex":0.0030750993,"about_ca_topic_score_gemma":0.004863737,"teacher_disagreement_score":0.005257679,"about_ca_system_score_codex":0.0003058909,"about_ca_system_score_gemma":0.0018881083,"threshold_uncertainty_score":0.017588675},"labels":[],"label_agreement":null},{"id":"W3010268208","doi":"10.1109/tcomm.2020.2979113","title":"Design of General Entropy-Constrained Successively Refinable Unrestricted Polar Quantizer","year":2020,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University; McGill University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Entropy (arrow of time); Combinatorics; Algorithm; Mathematics; Minification; Discrete mathematics; Computer science; Mathematical optimization; Physics","score_opus":0.06519810886652606,"score_gpt":0.30382343160195147,"score_spread":0.23862532273542542,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3010268208","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005595148,0.00008213565,0.99317366,0.000031071704,0.0000064630203,0.000027487107,0.000021975242,0.00009095993,0.00097096956],"genre_scores_gemma":[0.30700564,0.0002814122,0.68904734,0.00007254727,0.000020451385,0.0001716281,0.0001668319,0.00006063332,0.0031735022],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996431,0.000075685035,0.00002264822,0.00009340525,0.00012904736,0.000036078276],"domain_scores_gemma":[0.9996948,0.00012701482,0.00005704389,0.00003592553,0.00006989291,0.000015396865],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006330455,0.0007076137,0.0005891403,0.0003926664,0.000285491,0.0005666329,0.00086548436,0.0006327719,0.002952307],"category_scores_gemma":[0.0014882018,0.0003768047,0.00040968874,0.0003612903,0.0005903015,0.0011431223,0.0011259275,0.0006825182,0.00048316512],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000418415,0.000045493103,0.0008746879,0.00029379252,0.00005400266,0.0001808339,0.00029237042,0.5572296,0.1072719,0.063536316,0.0016615575,0.26814103],"study_design_scores_gemma":[0.000039913793,0.000096789874,0.00014837584,0.000013335776,0.000016557342,0.000066090994,0.000026308697,0.97643775,0.013405112,0.007161888,0.002569427,0.000018449291],"about_ca_topic_score_codex":0.0013863068,"about_ca_topic_score_gemma":0.0019325836,"teacher_disagreement_score":0.002952307,"about_ca_system_score_codex":0.00051604625,"about_ca_system_score_gemma":0.00081575534,"threshold_uncertainty_score":0.00987643},"labels":[],"label_agreement":null},{"id":"W3027436916","doi":"10.32016/1.68.13","title":"ANALIZA PARAMETRÓW SYGNAŁU MOWY W KONTEKŚCIE ICH PRZYDATNOŚCI W AUTOMATYCZNEJ OCENIE JAKOŚCI EKSPRESJI ŚPIEWU","year":2019,"lang":"pl","type":"article","venue":"Zeszyty Naukowe Wydziału Elektrotechniki i Automatyki Politechniki Gdańskiej","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Physics; Theology; Philosophy","score_opus":0.0055589458067208984,"score_gpt":0.24098662225688197,"score_spread":0.23542767645016108,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3027436916","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.31995463,0.007832672,0.6138249,0.00094703055,0.0007822602,0.00087135367,0.0055444613,0.007742065,0.042500645],"genre_scores_gemma":[0.76028264,0.0052731354,0.19631854,0.00033040758,0.00023588001,0.0008493159,0.004539525,0.0014206948,0.030749839],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99781775,0.00023071893,0.00018090384,0.00064136,0.0009082707,0.00022095176],"domain_scores_gemma":[0.9978077,0.0007477817,0.00019660019,0.0003083601,0.00085100246,0.00008857316],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001316065,0.001678869,0.0010767078,0.0035351117,0.00083185156,0.0036780809,0.00079898007,0.0013219916,0.012896863],"category_scores_gemma":[0.005924455,0.00063544494,0.0009119779,0.0023237525,0.000762039,0.0028496264,0.0014833283,0.0010770018,0.0071786456],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012236851,0.0002571784,0.03336039,0.0023955347,0.00035183073,0.0014515648,0.0020267384,0.012263529,0.16463135,0.005634257,0.015254823,0.76114917],"study_design_scores_gemma":[0.00014493486,0.0015006596,0.30872092,0.0011648232,0.001245049,0.0075653126,0.0070502427,0.2240311,0.26168996,0.02664526,0.15952426,0.0007173859],"about_ca_topic_score_codex":0.0037316068,"about_ca_topic_score_gemma":0.0037217282,"teacher_disagreement_score":0.012896863,"about_ca_system_score_codex":0.00063989847,"about_ca_system_score_gemma":0.00090650877,"threshold_uncertainty_score":0.043144286},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.03242712166723326,"score_gpt":0.2919537167898722,"score_spread":0.2595265951226389,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3034755948","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06623341,0.00047337043,0.92689496,0.00034372762,0.00016356148,0.00007979093,0.00040087418,0.002211893,0.0031984518],"genre_scores_gemma":[0.5840815,0.00043894257,0.40830845,0.00022772822,0.000078217476,0.00013332577,0.000988837,0.00024752255,0.0054954677],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99974924,0.000023201132,0.000015701951,0.000034255154,0.00015163864,0.000025948326],"domain_scores_gemma":[0.99931824,0.00020530426,0.00005667505,0.00021009795,0.00018612582,0.000023538865],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037101388,0.00055411085,0.00022138281,0.0004961253,0.00023233745,0.0004903329,0.00057695474,0.00038029999,0.0022954382],"category_scores_gemma":[0.002522637,0.0001379274,0.0001872369,0.00065996335,0.00036361036,0.001091359,0.00067979883,0.00089039135,0.00065008126],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00034037765,0.00009414261,0.0012745315,0.00010588958,0.00003580701,0.00026446496,0.00018151154,0.10611226,0.124156,0.015410641,0.007865655,0.74415874],"study_design_scores_gemma":[0.00002139152,0.000105357234,0.0011437614,0.000028499826,0.000012171678,0.00021089651,0.000050114053,0.85333115,0.12618528,0.010012632,0.008877302,0.000021495754],"about_ca_topic_score_codex":0.002629921,"about_ca_topic_score_gemma":0.004723524,"teacher_disagreement_score":0.002629921,"about_ca_system_score_codex":0.0005417818,"about_ca_system_score_gemma":0.0005281503,"threshold_uncertainty_score":0.0076789856},"labels":[],"label_agreement":null},{"id":"W3035197843","doi":"10.1109/icme46284.2020.9102877","title":"Learned Variable-Rate Image Compression With Residual Divisive Normalization","year":2020,"lang":"en","type":"preprint","venue":"","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":27,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Computer science; Residual; Normalization (sociology); Image compression; Rounding; Algorithm; Codec; Artificial intelligence; MNIST database; Quantization (signal processing); Encoder; Decoding methods; Pattern recognition (psychology); Image processing; Deep learning; Image (mathematics)","score_opus":0.029491025803178358,"score_gpt":0.29159106544630276,"score_spread":0.2621000396431244,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3035197843","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.021259157,0.000386414,0.9752,0.00012244047,0.00003956943,0.00004175552,0.00006141634,0.00096335827,0.001925878],"genre_scores_gemma":[0.5009891,0.0005060722,0.4895111,0.00022318731,0.00007247852,0.000112738424,0.00039688565,0.0002796206,0.0079088835],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999645,0.00005250129,0.000017519744,0.00008406212,0.0001681054,0.00003272198],"domain_scores_gemma":[0.99960405,0.000106141335,0.00004337369,0.000098805605,0.0001316227,0.000015928223],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006584611,0.00074477703,0.00054341037,0.00045788492,0.00017557121,0.0005360878,0.0012168157,0.00051647803,0.0013276953],"category_scores_gemma":[0.0015366274,0.00021608907,0.00041627718,0.0005920003,0.0007059035,0.0010855803,0.0008746831,0.0011901492,0.00040918676],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020701915,0.00010920791,0.0006105199,0.000113447844,0.0000664324,0.00011793987,0.00009392473,0.4428844,0.044627007,0.018076098,0.0028459085,0.4902481],"study_design_scores_gemma":[0.000007684765,0.000026747923,0.00012778683,0.000007167484,0.0000075526755,0.000058256646,0.00000622565,0.9790557,0.017034743,0.002541548,0.0011178675,0.000008817266],"about_ca_topic_score_codex":0.0026296421,"about_ca_topic_score_gemma":0.0033911576,"teacher_disagreement_score":0.0026296421,"about_ca_system_score_codex":0.00060397125,"about_ca_system_score_gemma":0.0007024629,"threshold_uncertainty_score":0.0052286386},"labels":[],"label_agreement":null},{"id":"W3043300565","doi":"","title":"L2 Optimized Predictive Image Coding with L∞ Bound","year":2013,"lang":"en","type":"article","venue":"MacSphere (McMaster University)","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Predictive coding; Computer science; Artificial intelligence; Coding (social sciences); Pattern recognition (psychology); Computer vision; Mathematics; Statistics","score_opus":0.009696310246707158,"score_gpt":0.20252249059347657,"score_spread":0.1928261803467694,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3043300565","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0069885454,0.0008214988,0.9855971,0.00026542836,0.000057744535,0.000021089154,0.000065333734,0.0002820274,0.005901286],"genre_scores_gemma":[0.57055676,0.0022858938,0.40581065,0.000874469,0.00024010177,0.00023699172,0.0005365901,0.00030843882,0.019150121],"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9994272,0.00012313719,0.000024646726,0.00006945584,0.0003022104,0.000053268213],"domain_scores_gemma":[0.9989299,0.00068653043,0.00006850553,0.00009544926,0.00019566937,0.000023977833],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010940253,0.00089261646,0.00061457296,0.0004703738,0.00031843732,0.0010281174,0.0008580082,0.0008040177,0.0026160507],"category_scores_gemma":[0.003533748,0.00022805156,0.00027186467,0.00080592424,0.00087314594,0.0015338865,0.0011936977,0.0017195262,0.0007814919],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00036095938,0.00007401515,0.0006837528,0.00021920765,0.000043115833,0.00021303692,0.00026608267,0.5115077,0.016760888,0.23411329,0.0071243793,0.2286336],"study_design_scores_gemma":[0.000007611195,0.000040216826,0.00007037524,0.000022298636,0.000006504342,0.00004327088,0.0000136242825,0.9734614,0.0038612424,0.020180335,0.002277274,0.000015857919],"about_ca_topic_score_codex":0.0028861458,"about_ca_topic_score_gemma":0.003060603,"teacher_disagreement_score":0.0028861458,"about_ca_system_score_codex":0.0010103515,"about_ca_system_score_gemma":0.0011869508,"threshold_uncertainty_score":0.008751571},"labels":[],"label_agreement":null},{"id":"W3094861295","doi":"10.1016/j.bspc.2020.102306","title":"An optimized JPEG-XT-based algorithm for the lossy and lossless compression of 16-bit depth medical image","year":2020,"lang":"en","type":"article","venue":"Biomedical Signal Processing and Control","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Saskatchewan","funders":"Office of Research and Economic Development, Louisiana State University; Office of Research and Economic Development, Mississippi State University; Louisiana State University; Royal College of Surgeons of England; Health Sciences Center New Orleans, Louisiana State University; Louisiana Board of Regents","keywords":"JPEG; Lossless JPEG; Lossless compression; Lossy compression; JPEG 2000; Discrete cosine transform; Image compression; Mathematics; Algorithm; Data compression; Computer science; Artificial intelligence; Computer vision; Image processing; Image (mathematics)","score_opus":0.014619182214321784,"score_gpt":0.2877301801156462,"score_spread":0.2731109979013244,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3094861295","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018627468,0.0009885541,0.975937,0.00016539377,0.00017907016,0.00020462982,0.00028155633,0.0013269298,0.0022893718],"genre_scores_gemma":[0.065420724,0.00068639976,0.9266001,0.00014754376,0.00006701704,0.00014207762,0.00072341727,0.00017819779,0.006034609],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99975723,0.00002340234,0.000017954544,0.000023673865,0.00016279305,0.000014864058],"domain_scores_gemma":[0.99978083,0.000035008918,0.000018930961,0.000028068742,0.000121769226,0.000015345035],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030238213,0.00053678855,0.00032075084,0.0007073817,0.00022496116,0.0005070997,0.00065878377,0.00048805852,0.0038225786],"category_scores_gemma":[0.00077960745,0.00017285318,0.00026876945,0.0007238632,0.00015886842,0.0005399179,0.00038758235,0.0005271934,0.0015232618],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00045432217,0.00010725505,0.00059439207,0.0002475703,0.000064592,0.00015996906,0.0000667337,0.015898896,0.21153808,0.006436274,0.010372146,0.7540597],"study_design_scores_gemma":[0.00017307117,0.00046841067,0.004660689,0.00007375979,0.00011945036,0.0020859202,0.000049368664,0.6864628,0.2704669,0.002572028,0.03277941,0.00008819753],"about_ca_topic_score_codex":0.0022482653,"about_ca_topic_score_gemma":0.0057470906,"teacher_disagreement_score":0.0038225786,"about_ca_system_score_codex":0.00034994032,"about_ca_system_score_gemma":0.0009984034,"threshold_uncertainty_score":0.012787759},"labels":[],"label_agreement":null},{"id":"W3096069091","doi":"10.1007/s11760-020-01804-2","title":"High compression rate, based on the RLS adaptive algorithm in progressive image transmission","year":2020,"lang":"en","type":"article","venue":"Signal Image and Video Processing","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Algorithm; Computer science; Transmission (telecommunications); Block (permutation group theory); Transmitter; Image (mathematics); Recursive least squares filter; Computational complexity theory; Sequence (biology); Image quality; Image compression; Data compression; Compression (physics); Adaptive filter; Artificial intelligence; Mathematics; Image processing; Telecommunications; Channel (broadcasting)","score_opus":0.019545246389737234,"score_gpt":0.2711814913857292,"score_spread":0.25163624499599196,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3096069091","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17729005,0.0014711007,0.80551475,0.0003019915,0.00019270953,0.00011437692,0.00007809445,0.0014760391,0.013560963],"genre_scores_gemma":[0.7064866,0.0007243468,0.28239268,0.000095898606,0.00013950597,0.00006518763,0.0001668614,0.0001291651,0.009799804],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99984026,0.000034892175,0.0000068658946,0.000022816317,0.00008505049,0.000009999653],"domain_scores_gemma":[0.99972826,0.0001088528,0.000021213053,0.000039161037,0.000089696696,0.000012765753],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032319943,0.00033973972,0.00024028863,0.00052642915,0.00020978706,0.0002830426,0.00042241527,0.0002854684,0.0018478172],"category_scores_gemma":[0.00082672265,0.00010297203,0.00018415083,0.0003544056,0.0002877122,0.00044484957,0.00022650002,0.00034804636,0.00045670863],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009747946,0.00017530096,0.0017773216,0.00027331855,0.00006528777,0.00045582885,0.0003198988,0.04527879,0.39161703,0.019004455,0.0034285213,0.5366295],"study_design_scores_gemma":[0.00009581181,0.0004875356,0.0030649358,0.000037171303,0.00008274111,0.0008161101,0.000058194102,0.83360493,0.15085672,0.0025426408,0.008306114,0.000047179994],"about_ca_topic_score_codex":0.0011811339,"about_ca_topic_score_gemma":0.0013566285,"teacher_disagreement_score":0.0018478172,"about_ca_system_score_codex":0.0001817221,"about_ca_system_score_gemma":0.00024830323,"threshold_uncertainty_score":0.006181538},"labels":[],"label_agreement":null},{"id":"W3107384155","doi":"10.1109/ccece47787.2020.9255670","title":"Live RF Image Transmission using OFDM with RPi and PlutoSDR","year":2020,"lang":"en","type":"article","venue":"","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"Dalhousie University","keywords":"Orthogonal frequency-division multiplexing; Computer science; Software-defined radio; Intersymbol interference; Data transmission; Software; Visible light communication; Interference (communication); Electronic engineering; Transmission (telecommunications); Real-time computing; Computer hardware; Telecommunications; Electrical engineering; Engineering; Decoding methods","score_opus":0.02392472183360743,"score_gpt":0.2649647227046651,"score_spread":0.24104000087105765,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3107384155","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.33775884,0.0012053638,0.6327161,0.00045647402,0.00018486026,0.00013690368,0.00024259086,0.0020942017,0.025204685],"genre_scores_gemma":[0.825517,0.00075074076,0.15912847,0.00017479592,0.00010781894,0.000088769666,0.0002321587,0.00011013732,0.013890217],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9998698,0.000017223021,0.0000070753003,0.000027766146,0.000062597996,0.000015502912],"domain_scores_gemma":[0.9997949,0.000058296155,0.00003689344,0.000043996064,0.000055686665,0.000010166346],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018685576,0.00023538458,0.00018453789,0.00027212867,0.00015249735,0.00035428634,0.0003756799,0.00030490005,0.0028816166],"category_scores_gemma":[0.00047124957,0.00009958387,0.00015438252,0.00029860344,0.00016201167,0.00055623625,0.00026535575,0.00028886466,0.00066971127],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00051463715,0.00017788794,0.0015886236,0.00028602465,0.000028627937,0.0009226228,0.00032503356,0.0060138535,0.6510208,0.0077038715,0.002874573,0.32854342],"study_design_scores_gemma":[0.00009582837,0.0011614236,0.004036606,0.00006156526,0.0000516497,0.0023479545,0.00014342133,0.15222368,0.80978525,0.001586684,0.028456246,0.000049733077],"about_ca_topic_score_codex":0.00026744636,"about_ca_topic_score_gemma":0.00025150023,"teacher_disagreement_score":0.0028816166,"about_ca_system_score_codex":0.00021137364,"about_ca_system_score_gemma":0.00008640929,"threshold_uncertainty_score":0.009639978},"labels":[],"label_agreement":null},{"id":"W3111529171","doi":"10.22215/etd/2008-07490","title":"Joint source and channel coding for image transmission over noisy channels with feedback","year":2008,"lang":"en","type":"dissertation","venue":"","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Library and Archives Canada","funders":"","keywords":"Channel (broadcasting); Joint (building); Computer science; Coding (social sciences); Telecommunications; Art; Mathematics; Engineering; Statistics","score_opus":0.01799741863065061,"score_gpt":0.2679420169841459,"score_spread":0.24994459835349528,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3111529171","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04355575,0.00057544134,0.9510821,0.00043367344,0.00012302141,0.000035231806,0.0001477516,0.00041820915,0.003628815],"genre_scores_gemma":[0.84665483,0.00093795394,0.13785721,0.00010030866,0.00017290277,0.00009648301,0.00028899874,0.00013065684,0.013760613],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995534,0.00010480184,0.000017962837,0.000038732294,0.00023172144,0.000053304568],"domain_scores_gemma":[0.9989549,0.0006228154,0.000069921276,0.000121499,0.00020513646,0.000025679414],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005896189,0.00039576282,0.0003993602,0.00036702966,0.00021759546,0.0004704256,0.00034537833,0.00048387444,0.002120852],"category_scores_gemma":[0.0026161328,0.000214083,0.0002829897,0.0005005565,0.00050697505,0.0009805084,0.00064747414,0.0007569181,0.00043974567],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012773367,0.00016323003,0.0006953819,0.00034621538,0.00008497313,0.00030063553,0.0003483795,0.4843411,0.10684734,0.14184283,0.0069807493,0.25677174],"study_design_scores_gemma":[0.000029560722,0.00007513683,0.00020775205,0.00002093117,0.00001793164,0.00007453447,0.000015762998,0.96704036,0.01892678,0.012003757,0.001571927,0.000015569816],"about_ca_topic_score_codex":0.0018198678,"about_ca_topic_score_gemma":0.003052156,"teacher_disagreement_score":0.002120852,"about_ca_system_score_codex":0.00040163798,"about_ca_system_score_gemma":0.0007102939,"threshold_uncertainty_score":0.0070949793},"labels":[],"label_agreement":null},{"id":"W3111934932","doi":"10.18280/ts.370506","title":"Design and Implementation of a Lossless Compression System for Hyperspectral Images","year":2020,"lang":"en","type":"article","venue":"Traitement du signal","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"National Natural Science Foundation of China","keywords":"Computer science; Field-programmable gate array; Lossless compression; Hyperspectral imaging; Pipeline (software); Data compression; Lossy compression; Computation; Computer hardware; Data flow diagram; Image compression; Throughput; Real-time computing; Algorithm; Image processing; Image (mathematics); Artificial intelligence","score_opus":0.032207661112434165,"score_gpt":0.2998021873355257,"score_spread":0.26759452622309154,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3111934932","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08791806,0.0005265792,0.8903046,0.00045675508,0.0002776009,0.0005468314,0.00029811612,0.006576355,0.013095074],"genre_scores_gemma":[0.66971695,0.0003033559,0.31681952,0.00032051725,0.00010134376,0.0004580417,0.00046884725,0.000130379,0.011681004],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99979967,0.000017265094,0.000012928579,0.000047981423,0.000097252916,0.0000249217],"domain_scores_gemma":[0.9998684,0.000015044673,0.000017408474,0.000016019738,0.00007286339,0.0000103106395],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017897847,0.00045243616,0.00028657826,0.00048732542,0.00036765702,0.0004921153,0.0010238249,0.0003992601,0.003504221],"category_scores_gemma":[0.00022730393,0.00020320773,0.00019203588,0.00025604645,0.00016614649,0.0005595933,0.000264559,0.00029321542,0.0010672575],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00061893,0.00027470774,0.004317026,0.0006322536,0.00013563356,0.0006301389,0.00048321616,0.030437259,0.49100745,0.010896044,0.014659073,0.4459083],"study_design_scores_gemma":[0.00027937192,0.0015688513,0.0070634033,0.00007627137,0.00015135917,0.0014738521,0.000120031415,0.517415,0.41312233,0.001385906,0.05723054,0.00011306674],"about_ca_topic_score_codex":0.0016863163,"about_ca_topic_score_gemma":0.0016273359,"teacher_disagreement_score":0.003504221,"about_ca_system_score_codex":0.00048528484,"about_ca_system_score_gemma":0.00075427303,"threshold_uncertainty_score":0.0117227435},"labels":[],"label_agreement":null},{"id":"W3131593928","doi":"10.5220/0010207607850792","title":"Object based Hybrid Video Compression","year":2021,"lang":"en","type":"article","venue":"","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Computer science; Data compression; Object (grammar); Compression (physics); Computer graphics (images); Computer vision; Artificial intelligence; Materials science","score_opus":0.01527160497607501,"score_gpt":0.2734245708790195,"score_spread":0.2581529659029445,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3131593928","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1010266,0.0025022153,0.8760736,0.00018761336,0.00037476575,0.00015869783,0.0004458933,0.0028306048,0.016399972],"genre_scores_gemma":[0.49596107,0.0015321934,0.46889132,0.00028239648,0.00023479888,0.00012452094,0.001488164,0.00030606787,0.031179551],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996697,0.00002552632,0.000013853996,0.000046068173,0.00021023357,0.000034739278],"domain_scores_gemma":[0.9997515,0.000055089225,0.000016298965,0.00006470195,0.00009554525,0.000016749382],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024503306,0.00058690296,0.00054830575,0.0014227979,0.0003076671,0.00097377476,0.0006612697,0.00063606753,0.005121275],"category_scores_gemma":[0.00037200857,0.00020423761,0.0003984168,0.0012328499,0.00020895718,0.0010769685,0.00077047566,0.00049682875,0.0015037662],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006531147,0.00015646688,0.0008978987,0.0001498385,0.000085787244,0.00024340206,0.000050256185,0.012550592,0.29382056,0.0064769075,0.0034480002,0.68146724],"study_design_scores_gemma":[0.00007041305,0.0004102806,0.004763475,0.000044823897,0.00013165695,0.0014891879,0.000060481307,0.5656651,0.4030495,0.0037352287,0.020520948,0.00005888541],"about_ca_topic_score_codex":0.0010867656,"about_ca_topic_score_gemma":0.0017459714,"teacher_disagreement_score":0.005121275,"about_ca_system_score_codex":0.00034133816,"about_ca_system_score_gemma":0.00023582758,"threshold_uncertainty_score":0.017132342},"labels":[],"label_agreement":null},{"id":"W3137123549","doi":"10.1109/bigdata50022.2020.9378008","title":"Data Reduction and Deep-Learning Based Recovery for Geospatial Visualization and Satellite Imagery","year":2020,"lang":"en","type":"article","venue":"","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Saskatchewan","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Geospatial analysis; Scalability; Big data; Deep learning; Pipeline (software); Data mining; Transfer of learning; Reduction (mathematics); Visualization; Satellite imagery; Computer data storage; Data science; Artificial intelligence; Database; Remote sensing","score_opus":0.04036374060985162,"score_gpt":0.3084832076063301,"score_spread":0.2681194669964785,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3137123549","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.029834533,0.00055857596,0.9654169,0.00063591846,0.00009601967,0.000054487762,0.0005276342,0.0016757903,0.0012000228],"genre_scores_gemma":[0.34717977,0.0008784889,0.6444496,0.0003351908,0.00011767391,0.00016504624,0.0036136396,0.00026524044,0.0029954056],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99947876,0.000068644105,0.00003944648,0.00009481174,0.00026529387,0.000053089952],"domain_scores_gemma":[0.99904686,0.00025052615,0.00010374284,0.00034378978,0.0002286664,0.000026470158],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00062797195,0.00065943674,0.0004608593,0.0011109356,0.000378683,0.00067793584,0.0013451095,0.00060977146,0.0016164698],"category_scores_gemma":[0.002976753,0.0002965559,0.0007358845,0.0019653467,0.000745938,0.0016536562,0.0012124082,0.0012467252,0.0006013098],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00031337605,0.00020286346,0.004394693,0.00031084288,0.00015277609,0.00034090434,0.000247451,0.2574129,0.0672036,0.019763004,0.018107153,0.63155043],"study_design_scores_gemma":[0.000011161732,0.000041160423,0.001657492,0.000021939393,0.000018149964,0.00013521206,0.00008038271,0.94668126,0.032445353,0.012732798,0.006152586,0.000022498389],"about_ca_topic_score_codex":0.004620358,"about_ca_topic_score_gemma":0.0061559663,"teacher_disagreement_score":0.004620358,"about_ca_system_score_codex":0.0005918691,"about_ca_system_score_gemma":0.00086782925,"threshold_uncertainty_score":0.0091869235},"labels":[],"label_agreement":null},{"id":"W3142011739","doi":"10.1109/icassp.2002.1005726","title":"Improved spectral tracking using interpolated linear prediction parameters","year":2002,"lang":"en","type":"article","venue":"IEEE International Conference on Acoustics Speech and Signal Processing","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Tracking (education); Computer science; Interpolation (computer graphics); Linear prediction; Artificial intelligence; Computer vision; Algorithm","score_opus":0.07952398660335253,"score_gpt":0.3189378977877926,"score_spread":0.23941391118444005,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3142011739","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.043935288,0.00022960248,0.9528743,0.000052940075,0.000064416665,0.000027421844,0.00006291402,0.0016128484,0.0011402806],"genre_scores_gemma":[0.2214104,0.00025018805,0.77446884,0.000057924313,0.00006444188,0.000056998226,0.00033516303,0.00036443415,0.0029916975],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995029,0.00006830025,0.000034315173,0.00011498611,0.00024261815,0.000036896916],"domain_scores_gemma":[0.9984628,0.0005250118,0.00017430594,0.00041723318,0.0003808379,0.000039871546],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00066971354,0.00082031,0.0005388439,0.00064322265,0.00034748143,0.0006168772,0.000911352,0.00084829616,0.0022003823],"category_scores_gemma":[0.0034713666,0.00041171524,0.00044830044,0.0009003429,0.00026776246,0.0016248015,0.00062946544,0.0011476218,0.0013881947],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00073557557,0.00021362847,0.001985168,0.00012735899,0.00008026634,0.00021720465,0.00026829957,0.13161029,0.29430294,0.0054581505,0.0016263154,0.5633748],"study_design_scores_gemma":[0.000043717362,0.0002261814,0.0013177709,0.000020247107,0.000053430373,0.00040097666,0.000025006182,0.79087687,0.19710588,0.0013859234,0.008471819,0.00007211509],"about_ca_topic_score_codex":0.0016665164,"about_ca_topic_score_gemma":0.0017652746,"teacher_disagreement_score":0.0022003823,"about_ca_system_score_codex":0.00030040205,"about_ca_system_score_gemma":0.00049672223,"threshold_uncertainty_score":0.0073610544},"labels":[],"label_agreement":null},{"id":"W3149653458","doi":"","title":"Adaptive video distribution model of QHD (Quadruple HD) with JPEG2000","year":2003,"lang":"en","type":"article","venue":"Picture Coding Symposium","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Hatch (Canada)","funders":"","keywords":"Computer science","score_opus":0.016564665437796534,"score_gpt":0.23425262350667223,"score_spread":0.2176879580688757,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3149653458","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.097231194,0.0006735483,0.8903843,0.0003765589,0.00008907527,0.00012297112,0.0004959311,0.000532232,0.010094303],"genre_scores_gemma":[0.9534587,0.00069646304,0.03340157,0.00007599264,0.000036426183,0.00008453928,0.00034344333,0.000072708994,0.011830137],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998166,0.000039046838,0.0000055289374,0.000049110175,0.00006674481,0.000023056824],"domain_scores_gemma":[0.9997819,0.000060930597,0.000029100078,0.000023609131,0.00009156375,0.0000129494365],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002823906,0.00032176706,0.000285482,0.00030858864,0.00020969727,0.0005019703,0.0008103363,0.00060231244,0.002333911],"category_scores_gemma":[0.00069496455,0.00017612202,0.00026571803,0.0004320942,0.0002803526,0.0007669846,0.00026410888,0.00048056533,0.0006398714],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00025496873,0.00008146314,0.0015093465,0.00010127023,0.000028736027,0.00015289582,0.00008253958,0.89312315,0.021891838,0.028970985,0.0015773573,0.052225534],"study_design_scores_gemma":[0.0000043061946,0.000016110827,0.00023836696,0.0000021491328,0.0000052026603,0.000023711102,0.0000037930852,0.9976163,0.0008916302,0.0009170867,0.0002774623,0.0000039739293],"about_ca_topic_score_codex":0.007855696,"about_ca_topic_score_gemma":0.005418444,"teacher_disagreement_score":0.007855696,"about_ca_system_score_codex":0.0006492869,"about_ca_system_score_gemma":0.00040599098,"threshold_uncertainty_score":0.015619934},"labels":[],"label_agreement":null},{"id":"W3174119607","doi":"10.1016/j.jvcir.2021.103185","title":"A generic, cluster-centred lossless compression framework for joint auroral data","year":2021,"lang":"en","type":"article","venue":"Journal of Visual Communication and Image Representation","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Lossless compression; Computer science; Lossy compression; Cluster analysis; Data compression; Joint (building); Real-time computing; Satellite; Compression (physics); Transmission (telecommunications); Reduction (mathematics); Data mining; Algorithm; Artificial intelligence; Telecommunications; Engineering; Aerospace engineering; Physics","score_opus":0.14796467633575522,"score_gpt":0.4356767691115531,"score_spread":0.2877120927757979,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3174119607","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0026255373,0.00014644043,0.99475527,0.000044520453,0.000038251866,0.000040545652,0.00013577264,0.0013639866,0.0008495926],"genre_scores_gemma":[0.17850603,0.0004803058,0.81033,0.0001879178,0.00014413461,0.00018696413,0.0012596434,0.0005318524,0.00837318],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994332,0.000057795933,0.000025231577,0.000082237304,0.00032428108,0.0000771401],"domain_scores_gemma":[0.9995535,0.000057303147,0.000027738757,0.00015770596,0.00017118314,0.000032418575],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006003644,0.0008628482,0.000891365,0.00071227696,0.0004838223,0.0013744746,0.0024918113,0.00094475586,0.0038639987],"category_scores_gemma":[0.0014050016,0.00026471593,0.0007212135,0.0011122333,0.00049372856,0.0012034276,0.0020105143,0.001216399,0.0024785767],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007082771,0.00024292778,0.00052180176,0.00021712553,0.00012267465,0.00025735973,0.00012418002,0.28448352,0.056992475,0.023915984,0.016959343,0.6154544],"study_design_scores_gemma":[0.000020972384,0.0000672658,0.00018501861,0.000012147868,0.000017743916,0.00016032868,0.000024850518,0.9727601,0.015233774,0.0061376425,0.005357642,0.000022479966],"about_ca_topic_score_codex":0.0037039432,"about_ca_topic_score_gemma":0.0058855284,"teacher_disagreement_score":0.0038639987,"about_ca_system_score_codex":0.0005280106,"about_ca_system_score_gemma":0.0011676508,"threshold_uncertainty_score":0.01292634},"labels":[],"label_agreement":null},{"id":"W3174705979","doi":"10.48550/arxiv.2106.10311","title":"Universal Rate-Distortion-Perception Representations for Lossy Compression","year":2021,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":22,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University; University of Toronto","funders":"","keywords":"MNIST database; Encoder; Lossy compression; Distortion (music); Perception; Computer science; Theoretical computer science; Context (archaeology); Algorithm; Representation (politics); Mathematics; Artificial intelligence; Deep learning","score_opus":0.0844820733269245,"score_gpt":0.243399075118297,"score_spread":0.1589170017913725,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3174705979","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009449121,0.0016323867,0.98291725,0.00050021487,0.00004798091,0.000048122787,0.00010515866,0.00020641224,0.0050933696],"genre_scores_gemma":[0.64091676,0.0037174262,0.3479635,0.00066152203,0.00030068206,0.0004329512,0.00032520882,0.00035781533,0.0053241616],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9968368,0.0011595305,0.00017251803,0.00054602115,0.0010417479,0.00024330615],"domain_scores_gemma":[0.99102306,0.0055663786,0.0007048611,0.0017668974,0.00076020276,0.00017863231],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004850192,0.0015002849,0.0012368461,0.0012938811,0.000489147,0.003092744,0.0018190979,0.0017528724,0.0024677094],"category_scores_gemma":[0.021401161,0.0007220119,0.0009564374,0.0016554198,0.0035350395,0.006344766,0.0039672568,0.0049071605,0.00076215836],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016722704,0.00006314456,0.0003260032,0.00021863997,0.000040502997,0.00010364575,0.00025492292,0.08996552,0.005245871,0.84067726,0.0017336381,0.061203644],"study_design_scores_gemma":[0.000027801674,0.00019770418,0.00034670543,0.00012358002,0.000032701068,0.00035971674,0.00006598978,0.40066785,0.008247371,0.58399135,0.00588523,0.0000539597],"about_ca_topic_score_codex":0.00062593847,"about_ca_topic_score_gemma":0.00034253387,"teacher_disagreement_score":0.004850192,"about_ca_system_score_codex":0.0025019657,"about_ca_system_score_gemma":0.00094653084,"threshold_uncertainty_score":0.02565056},"labels":[],"label_agreement":null},{"id":"W3209629007","doi":"10.32920/ryerson.14657373.v1","title":"Adaptive variable bit-rate speech coder for wireless applications","year":2021,"lang":"en","type":"preprint","venue":"","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Speech coding; Computer science; Codec2; Wireless; Full Rate; Harmonic Vector Excitation Coding; Speech recognition; Voice activity detection; Coding (social sciences); Adaptive Multi-Rate audio codec; Key (lock); Channel (broadcasting); Speech processing; Linear predictive coding; Telecommunications; Mathematics; Computer security","score_opus":0.03323591211979171,"score_gpt":0.3034650293304894,"score_spread":0.2702291172106977,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3209629007","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.024537852,0.003461656,0.9615277,0.00046611266,0.00022372692,0.00008894083,0.00010779982,0.0016660885,0.0079201525],"genre_scores_gemma":[0.4250661,0.0052507655,0.5426068,0.00031324086,0.0002644073,0.00015758387,0.000618175,0.00033071171,0.025392218],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999757,0.000044164604,0.0000103590055,0.000028702741,0.0001461391,0.000013673495],"domain_scores_gemma":[0.9996773,0.00014181729,0.000025241901,0.000040595278,0.00010484303,0.000010144223],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000283234,0.0002842368,0.0002467193,0.00034128138,0.00017721394,0.00041011814,0.00037298366,0.00054667704,0.0024988996],"category_scores_gemma":[0.001052546,0.00010396579,0.00012238073,0.00037873592,0.00025561472,0.00039631463,0.00020245965,0.00072677835,0.0014758215],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002512234,0.000085690655,0.0005701518,0.00027518094,0.00003693898,0.00031535697,0.00012865667,0.039780892,0.35741445,0.07231346,0.008315917,0.52051204],"study_design_scores_gemma":[0.00007113636,0.0003562783,0.0017236349,0.000068677815,0.000050947638,0.0010436499,0.00003775211,0.72307557,0.19058178,0.019169595,0.06376761,0.000053345022],"about_ca_topic_score_codex":0.00089377945,"about_ca_topic_score_gemma":0.0010558285,"teacher_disagreement_score":0.0024988996,"about_ca_system_score_codex":0.0002135835,"about_ca_system_score_gemma":0.000367282,"threshold_uncertainty_score":0.008359611},"labels":[],"label_agreement":null},{"id":"W3213992252","doi":"10.1109/istc49272.2021.9594251","title":"Exploitation of temporal structure in momentum-SGD for gradient compression","year":2021,"lang":"en","type":"article","venue":"","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Science and Engineering Research Council; Huawei Technologies","keywords":"Bottleneck; Leverage (statistics); Computer science; Momentum (technical analysis); Correlation; Volume (thermodynamics); Computer engineering; Artificial intelligence; Mathematics; Embedded system","score_opus":0.021396171757925984,"score_gpt":0.2981553570402896,"score_spread":0.27675918528236365,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3213992252","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015655193,0.0002639249,0.9805501,0.00024204887,0.00011369795,0.00005306819,0.00006409071,0.0014382736,0.0016196844],"genre_scores_gemma":[0.28940624,0.00029570283,0.7054304,0.00029102675,0.0001048427,0.00021675984,0.00040616933,0.00035430133,0.003494555],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996288,0.00009033673,0.000035117315,0.00005339188,0.00015996536,0.00003237217],"domain_scores_gemma":[0.99898857,0.00040714646,0.000071761046,0.0002478299,0.00022843009,0.000056180932],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010927775,0.0007611978,0.0007633152,0.00047583296,0.0004706633,0.0010916684,0.0009844285,0.0009895359,0.0025431642],"category_scores_gemma":[0.004525638,0.00031554638,0.0003463789,0.0007079516,0.00086087233,0.0014091046,0.0011715775,0.0014088927,0.001132869],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00048572742,0.00022925054,0.0020987245,0.00017712743,0.00006765275,0.00029745584,0.00024696812,0.36368033,0.026127048,0.029939549,0.010100876,0.5665493],"study_design_scores_gemma":[0.000025052574,0.000044273183,0.000121845886,0.00000917188,0.000004558698,0.00005114742,0.000015317264,0.9886673,0.0052155172,0.004165019,0.001672691,0.000007978545],"about_ca_topic_score_codex":0.0016332134,"about_ca_topic_score_gemma":0.0038523101,"teacher_disagreement_score":0.0025431642,"about_ca_system_score_codex":0.00051068317,"about_ca_system_score_gemma":0.001292309,"threshold_uncertainty_score":0.008507669},"labels":[],"label_agreement":null},{"id":"W37041074","doi":"10.21437/interspeech.2005-841","title":"Perceptual postfilter estimation for low bit rate speech coders using Gaussian mixture models","year":2005,"lang":"en","type":"article","venue":"","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Speech recognition; Computer science; Bit rate; Mixture model; Perception; Bit (key); Speech coding; Gaussian; Artificial intelligence; Real-time computing; Psychology","score_opus":0.03475439029683785,"score_gpt":0.309404730322239,"score_spread":0.2746503400254011,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W37041074","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0054047047,0.00021817755,0.99367934,0.00003260077,0.000015265296,0.000012921606,0.000019772138,0.00038916303,0.00022806381],"genre_scores_gemma":[0.22085933,0.00072350143,0.77558714,0.00007174484,0.000053497923,0.00007398148,0.00022542654,0.00013981524,0.0022655472],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99945766,0.00011830158,0.00004062303,0.00006553483,0.00028631347,0.00003152572],"domain_scores_gemma":[0.9988977,0.00062350946,0.00007625113,0.000105358704,0.00027878632,0.000018458019],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00086937693,0.00063620484,0.0005365643,0.0006199597,0.00029013376,0.0009367834,0.0006773085,0.0007623964,0.0014587604],"category_scores_gemma":[0.0031839968,0.00040895047,0.0004193194,0.00038167502,0.00040366699,0.0009989475,0.0005304741,0.0007434637,0.0007139872],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00071714807,0.000091738846,0.0017113707,0.00033488724,0.000112618174,0.00019554033,0.00016866904,0.1594692,0.14248563,0.015232774,0.002322058,0.67715836],"study_design_scores_gemma":[0.00002039983,0.00006922557,0.0011348688,0.00001864304,0.000037396425,0.00015115741,0.000014619142,0.95728016,0.0365725,0.002710831,0.001961491,0.000028741166],"about_ca_topic_score_codex":0.003864074,"about_ca_topic_score_gemma":0.006765834,"teacher_disagreement_score":0.003864074,"about_ca_system_score_codex":0.00052897073,"about_ca_system_score_gemma":0.00065031025,"threshold_uncertainty_score":0.007683158},"labels":[],"label_agreement":null},{"id":"W4229927242","doi":"10.1007/978-3-030-62124-7_13","title":"Basic Audio Compression Techniques","year":2021,"lang":"en","type":"book-chapter","venue":"Texts in computer science","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Code-excited linear prediction; Computer science; Speech recognition; Speech coding; Linear predictive coding; Linear prediction","score_opus":0.022280968093318216,"score_gpt":0.2860287567448563,"score_spread":0.2637477886515381,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4229927242","genre_codex":"other","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0053867297,0.041110337,0.3397595,0.0008894048,0.002827852,0.00039892568,0.0013169176,0.0048890426,0.6034213],"genre_scores_gemma":[0.027533915,0.0309488,0.095717095,0.00068754074,0.00187307,0.00025498614,0.0019194563,0.0007478452,0.8403173],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9997304,0.000008423771,0.000008728367,0.000037814956,0.00019528347,0.000019276873],"domain_scores_gemma":[0.99981123,0.000048863243,0.000008285392,0.000034844674,0.00008343423,0.000013350418],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001483283,0.0012270936,0.0005860947,0.0019457947,0.00054190104,0.0012071743,0.0009378971,0.00092048204,0.068435736],"category_scores_gemma":[0.00045921816,0.00041002178,0.00043311095,0.0018930697,0.0005439034,0.0013997155,0.00066086557,0.0013708364,0.054799903],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000678059,0.000071382594,0.00008202097,0.0005460579,0.00001108051,0.0001359698,0.000115224735,0.0008272921,0.06324854,0.018332912,0.052650798,0.8639109],"study_design_scores_gemma":[0.000026127962,0.00016028825,0.0012984953,0.0003477853,0.00003186669,0.0018395331,0.0000869377,0.0054222085,0.05558297,0.019266186,0.9158883,0.00004932536],"about_ca_topic_score_codex":0.0004162869,"about_ca_topic_score_gemma":0.0006269161,"teacher_disagreement_score":0.068435736,"about_ca_system_score_codex":0.0002964937,"about_ca_system_score_gemma":0.00036119157,"threshold_uncertainty_score":0.22894031},"labels":[],"label_agreement":null},{"id":"W4229983139","doi":"10.1109/icc.1994.369052","title":"Efficient algorithms for fixed-rate entropy-coded vector quantization","year":2002,"lang":"en","type":"article","venue":"","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University; Institut National de la Recherche Scientifique; University of Waterloo","funders":"","keywords":"Algorithm; Cartesian product; Entropy (arrow of time); Linear subspace; Computer science; Dynamic programming; Vector quantization; Theoretical computer science; Source code; Mathematics; Data structure; Discrete mathematics","score_opus":0.03449539150962558,"score_gpt":0.28577241733965414,"score_spread":0.25127702583002853,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4229983139","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0010877328,0.00025520922,0.9956371,0.000090823385,0.000047061472,0.000094761745,0.00007546531,0.0007827057,0.0019291587],"genre_scores_gemma":[0.054641727,0.00047070542,0.9394388,0.00010309521,0.000100020654,0.000452996,0.00051491597,0.00023217694,0.0040455167],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99766505,0.00043855744,0.00020951407,0.00033270815,0.0011035869,0.0002505375],"domain_scores_gemma":[0.9981438,0.0008482619,0.00013672221,0.00029736207,0.000529268,0.00004457372],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017462766,0.0012271672,0.0013660867,0.002138659,0.0009403926,0.0028510522,0.003245479,0.0014565527,0.009261325],"category_scores_gemma":[0.007693248,0.00072547636,0.00093224016,0.0026801033,0.0011598234,0.0030756607,0.002727294,0.0023009442,0.0039088945],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018101535,0.000099806704,0.00030502837,0.00019179516,0.00004986551,0.000100128374,0.00019930194,0.2066271,0.005792621,0.18604505,0.0100056445,0.5904027],"study_design_scores_gemma":[0.00006141534,0.000039630988,0.00008761858,0.000040612307,0.000011977187,0.00007863409,0.0000345433,0.8744972,0.0037841266,0.1154596,0.0058740354,0.000030571988],"about_ca_topic_score_codex":0.0037196723,"about_ca_topic_score_gemma":0.0046966732,"teacher_disagreement_score":0.009261325,"about_ca_system_score_codex":0.0018697103,"about_ca_system_score_gemma":0.0024729702,"threshold_uncertainty_score":0.030982256},"labels":[],"label_agreement":null},{"id":"W4231037206","doi":"10.1109/icce.1995.517994","title":"COMPUTATIONAL RAM IMPLEMENTATION OF AN ADAPTIVE VECTOR QUANTIZATION ALGORITHM FOR VIDEO COMPRESSION","year":2005,"lang":"en","type":"article","venue":"","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Vector quantization; Computer science; Data compression; Algorithm; Quantization (signal processing); Linde–Buzo–Gray algorithm","score_opus":0.025357643309702867,"score_gpt":0.3549105842507344,"score_spread":0.32955294094103155,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4231037206","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.057994455,0.000494814,0.9235149,0.00036262991,0.00028098925,0.00011914081,0.00014536784,0.0037116185,0.013376093],"genre_scores_gemma":[0.41608074,0.00023473523,0.57554036,0.00015603902,0.00007280647,0.00016592331,0.00030053972,0.00009424562,0.0073545882],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997937,0.000041486415,0.000014230131,0.00002198216,0.000101398575,0.000027214226],"domain_scores_gemma":[0.99961996,0.000117331736,0.000019045554,0.000074528754,0.0001517553,0.000017360882],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002933144,0.00033572392,0.00031641728,0.0004195283,0.0003820114,0.0006465045,0.0012156785,0.00036402067,0.008245907],"category_scores_gemma":[0.0015170829,0.0001296359,0.00016354297,0.00048481766,0.00023176528,0.00070442946,0.00054681674,0.0004363138,0.0010761521],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009479145,0.00024951078,0.0011841492,0.00023533711,0.00006263981,0.00020593194,0.00017673032,0.09706065,0.056647923,0.05573267,0.015151564,0.77234507],"study_design_scores_gemma":[0.00008599706,0.00016408203,0.0002807162,0.000017889028,0.000020128678,0.00010024777,0.00005880227,0.95277095,0.03232645,0.006282359,0.007877199,0.000015127357],"about_ca_topic_score_codex":0.0029954468,"about_ca_topic_score_gemma":0.0052527166,"teacher_disagreement_score":0.008245907,"about_ca_system_score_codex":0.0003848642,"about_ca_system_score_gemma":0.0007888487,"threshold_uncertainty_score":0.027585328},"labels":[],"label_agreement":null},{"id":"W4232997756","doi":"10.4018/978-1-4666-2154-1.ch009","title":"Data Transmission Oriented on the Object, Communication Media, Application, and State of Communication Systems","year":2012,"lang":"en","type":"book-chapter","venue":"IGI Global eBooks","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"École de Technologie Supérieure","funders":"","keywords":"Computer science; Orthogonal frequency-division multiplexing; Wireless; Lossless compression; Transmission (telecommunications); Channel (broadcasting); OSI model; Communications system; Fading; JPEG 2000; Computer network; Interconnection; Electronic engineering; Real-time computing; Image compression; Data compression; Image processing; Telecommunications; Image (mathematics); Engineering; Algorithm; Artificial intelligence","score_opus":0.035124283345910605,"score_gpt":0.28344955731869115,"score_spread":0.24832527397278054,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4232997756","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011001777,0.009897073,0.747642,0.0012281043,0.002017971,0.00032095733,0.00039683585,0.0049428176,0.22255246],"genre_scores_gemma":[0.16329116,0.01724472,0.41733435,0.0011697455,0.0012790943,0.0005248058,0.0017999155,0.0011459697,0.39621028],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9996829,0.000037814134,0.000025651067,0.00007454275,0.00014810947,0.000030988074],"domain_scores_gemma":[0.99974495,0.00005352973,0.00002036522,0.00008166584,0.00007777122,0.000021647467],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038535558,0.0005517971,0.0003610806,0.00087452313,0.0003698173,0.0021740608,0.0008838111,0.0007423444,0.011807078],"category_scores_gemma":[0.00048529598,0.0002685627,0.00035348596,0.0012236877,0.00083521084,0.001927262,0.0008076778,0.0012833836,0.0070514684],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009889194,0.00004989196,0.00028733248,0.0005401493,0.000023805947,0.00021505426,0.00045619498,0.0026368154,0.050422456,0.38642302,0.044582427,0.514264],"study_design_scores_gemma":[0.000022331536,0.00016939084,0.00070775393,0.00022029573,0.00003115849,0.0011855469,0.0001298237,0.026669288,0.027889498,0.04501054,0.8979242,0.000040173963],"about_ca_topic_score_codex":0.00055294146,"about_ca_topic_score_gemma":0.00042089427,"teacher_disagreement_score":0.011807078,"about_ca_system_score_codex":0.00072665926,"about_ca_system_score_gemma":0.000767077,"threshold_uncertainty_score":0.039498627},"labels":[],"label_agreement":null},{"id":"W4233778895","doi":"10.1109/icdsp.1997.628207","title":"Progressive image transmission by linear quadtree coding and wavelet transformation","year":2002,"lang":"en","type":"article","venue":"","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Quadtree; Computer science; Wavelet; Computer vision; Artificial intelligence; Coding (social sciences); Transmission (telecommunications); Wavelet transform; Linear map; Algorithm; Pattern recognition (psychology); Mathematics; Telecommunications","score_opus":0.01430383930338637,"score_gpt":0.25825486310706586,"score_spread":0.2439510238036795,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4233778895","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03026906,0.00067594653,0.9623677,0.00010464289,0.00004384193,0.00010724074,0.000043726188,0.00042235036,0.005965563],"genre_scores_gemma":[0.3676639,0.0018185851,0.61962503,0.00013808064,0.000077592624,0.00017046374,0.00023393099,0.00015337778,0.010119051],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99981576,0.000026839958,0.0000069522507,0.000018571684,0.000110527,0.00002148612],"domain_scores_gemma":[0.9997904,0.00007282269,0.000026173975,0.00003878824,0.000060234397,0.000011662124],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024329155,0.00030484863,0.00022993908,0.0005287958,0.00019354653,0.00037808114,0.00043725647,0.0003266176,0.0019815378],"category_scores_gemma":[0.0009113811,0.0001884915,0.0003516167,0.0005872107,0.00045072936,0.00087067555,0.0006095657,0.0004277352,0.00068790914],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023086704,0.000102127255,0.00052448944,0.00033534365,0.000044862623,0.00056281255,0.00035176103,0.05696095,0.37444982,0.08004474,0.0034256468,0.48296657],"study_design_scores_gemma":[0.00013187324,0.0005533021,0.0014603089,0.00009719367,0.0000904145,0.002530559,0.00013845843,0.71048087,0.21044794,0.044733077,0.029241454,0.000094486924],"about_ca_topic_score_codex":0.0011263003,"about_ca_topic_score_gemma":0.0011042183,"teacher_disagreement_score":0.0019815378,"about_ca_system_score_codex":0.00020413012,"about_ca_system_score_gemma":0.00027201738,"threshold_uncertainty_score":0.006628871},"labels":[],"label_agreement":null},{"id":"W4234289424","doi":"10.24124/2007/bpgub462","title":"A new highly efficient algorithm for lossless binary image compression.","year":2007,"lang":"en","type":"dissertation","venue":"","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Canadian Heritage; University of Northern British Columbia","funders":"","keywords":"Lossless compression; Binary number; Computer science; Algorithm; Mathematics; Arithmetic; Data compression","score_opus":0.012870591837857147,"score_gpt":0.33414735279124824,"score_spread":0.3212767609533911,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4234289424","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008183376,0.0016288506,0.9761899,0.0003389871,0.00050079124,0.0001992732,0.00027303395,0.004116742,0.008569143],"genre_scores_gemma":[0.048828065,0.0006495837,0.92348206,0.0003418769,0.00018771381,0.00031113255,0.0014081236,0.0003942337,0.024397286],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993118,0.000059987608,0.000050721046,0.000080322985,0.0004434374,0.000053719647],"domain_scores_gemma":[0.9996228,0.00009185877,0.000023398388,0.00010455993,0.00013241169,0.000025042262],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044531116,0.0007689477,0.00059634243,0.0014560873,0.0005874747,0.0012690532,0.0013456529,0.00085032213,0.008106017],"category_scores_gemma":[0.0016109501,0.00034332962,0.00036908296,0.0011696183,0.00049850787,0.0022588721,0.0014648505,0.0011918361,0.0057588923],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00031872635,0.000115146424,0.0002107197,0.00013998216,0.00003887921,0.00010529893,0.00007095169,0.005034661,0.06285853,0.013650497,0.027833354,0.8896232],"study_design_scores_gemma":[0.0003776791,0.00058345654,0.0019975433,0.00013816344,0.00009744615,0.002829019,0.00014687936,0.56802785,0.19621027,0.034318946,0.19516005,0.0001127485],"about_ca_topic_score_codex":0.0010922191,"about_ca_topic_score_gemma":0.0025820301,"teacher_disagreement_score":0.008106017,"about_ca_system_score_codex":0.00040571415,"about_ca_system_score_gemma":0.00068243133,"threshold_uncertainty_score":0.027117372},"labels":[],"label_agreement":null},{"id":"W4234617096","doi":"10.1109/tcomm.2006.876882","title":"Spectral-Efficient Differential Space–Time Coding Using Non-Full-Diverse Constellations","year":2006,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Spectral efficiency; Decoding methods; Algorithm; Space–time code; Constellation; Computer science; Coding (social sciences); Code (set theory); Antenna (radio); Differential (mechanical device); Transmit diversity; Theoretical computer science; Mathematics; Block code; Topology (electrical circuits); Telecommunications; Fading; Engineering; Beamforming","score_opus":0.03159270436252829,"score_gpt":0.28822678721589323,"score_spread":0.2566340828533649,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4234617096","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014394626,0.00021201106,0.98275244,0.00012478342,0.00003362878,0.000022842994,0.000029394103,0.00009235881,0.002337925],"genre_scores_gemma":[0.40365094,0.0006086737,0.59207267,0.00016369583,0.00007462461,0.00013646262,0.00018031301,0.00005463377,0.0030579227],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99931896,0.00023580999,0.00003306447,0.00007579641,0.00028059696,0.000055788973],"domain_scores_gemma":[0.99882704,0.0005426186,0.00012110993,0.00026883918,0.0001823879,0.000057945097],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006753249,0.0005276529,0.00057425833,0.00078585534,0.00042965834,0.00059996115,0.0006799213,0.0006069853,0.0013142244],"category_scores_gemma":[0.002805595,0.00020418483,0.00049097365,0.0009271495,0.0009341678,0.0012160196,0.0014774061,0.00081312715,0.00047536538],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00026494268,0.000097512806,0.0007340362,0.00029753157,0.000054556247,0.00041128174,0.00047906113,0.18814236,0.05689933,0.53885704,0.001804172,0.21195816],"study_design_scores_gemma":[0.000065987115,0.00021064526,0.0002635322,0.00004784229,0.000019632545,0.0007670485,0.000055665583,0.88696694,0.036357738,0.066536754,0.008657202,0.000051004306],"about_ca_topic_score_codex":0.00024737458,"about_ca_topic_score_gemma":0.00037955458,"teacher_disagreement_score":0.0013142244,"about_ca_system_score_codex":0.0004654612,"about_ca_system_score_gemma":0.0005236564,"threshold_uncertainty_score":0.004396498},"labels":[],"label_agreement":null},{"id":"W4235660709","doi":"10.1109/isit.2003.1228477","title":"Codecell convexity in optimal entropy-constrained vector quantization","year":2003,"lang":"en","type":"article","venue":"","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Convexity; Mathematics; Vector quantization; Regular polygon; Applied mathematics; Entropy (arrow of time); Mathematical optimization; Convex function; Distortion (music); Computer science; Algorithm","score_opus":0.01639277312834501,"score_gpt":0.2690541743549265,"score_spread":0.2526614012265815,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4235660709","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06596348,0.001135739,0.921144,0.0006156058,0.000042034706,0.000036846683,0.0002928467,0.00016806043,0.010601401],"genre_scores_gemma":[0.916821,0.001688307,0.07593293,0.00028079233,0.00010003303,0.00017586474,0.00057673553,0.0002540018,0.0041702674],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998767,0.0004467833,0.00006380171,0.00012905984,0.00044211498,0.00015126546],"domain_scores_gemma":[0.99295604,0.0051261582,0.0003843116,0.00044668486,0.0009703143,0.00011641735],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018419789,0.00063765596,0.001155746,0.0008012215,0.0005259391,0.002341717,0.0007536052,0.00078284467,0.002039438],"category_scores_gemma":[0.013005694,0.0005393064,0.00047111488,0.00137404,0.0020897684,0.0024030579,0.001809931,0.0015475537,0.00036751913],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001614431,0.000015687398,0.00074963074,0.00009053425,0.000025896332,0.00016375635,0.00014982696,0.5796382,0.005483501,0.3805251,0.0019547204,0.03104167],"study_design_scores_gemma":[0.000013560712,0.000029963032,0.0003019013,0.000020779462,0.000007007617,0.00006611463,0.000033993383,0.8454724,0.003955334,0.14872098,0.0013591164,0.00001886507],"about_ca_topic_score_codex":0.0030144206,"about_ca_topic_score_gemma":0.0016357625,"teacher_disagreement_score":0.0030144206,"about_ca_system_score_codex":0.0014660647,"about_ca_system_score_gemma":0.000915026,"threshold_uncertainty_score":0.0106371045},"labels":[],"label_agreement":null},{"id":"W4240255932","doi":"10.1007/978-3-030-62124-7_8","title":"Lossy Compression Algorithms","year":2021,"lang":"en","type":"book-chapter","venue":"Texts in computer science","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Lossy compression; Discrete cosine transform; Algorithm; JPEG; Data compression; Quantization (signal processing); Vector quantization; Transform coding; Trellis quantization; Data compression ratio; Computer science; Image compression; Wavelet; Mathematics; Artificial intelligence; Image processing; Image (mathematics)","score_opus":0.0262172085982806,"score_gpt":0.2949133740820806,"score_spread":0.26869616548380004,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4240255932","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0041656634,0.019712826,0.7931475,0.001122866,0.001732878,0.00021396892,0.0010377753,0.0051353667,0.17373115],"genre_scores_gemma":[0.0694845,0.026089847,0.47303635,0.0013519875,0.0022154616,0.00043981272,0.00444949,0.0022052948,0.42072728],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99943596,0.00004327262,0.000023241688,0.00007395863,0.0003892241,0.000034304237],"domain_scores_gemma":[0.9994685,0.00017021256,0.000021066837,0.00019969388,0.00012399582,0.000016490416],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042734516,0.001285393,0.00079090614,0.0018412804,0.0006121875,0.0018215828,0.0011992777,0.00093134394,0.04075077],"category_scores_gemma":[0.00161098,0.0004378982,0.0003908974,0.0028176794,0.0009202259,0.0026147135,0.0012093886,0.0021519912,0.026218524],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006693479,0.00005341022,0.00007868416,0.0002514493,0.000021541395,0.00006301803,0.00005536197,0.0063139875,0.009001161,0.09652219,0.07998808,0.80758417],"study_design_scores_gemma":[0.000056535308,0.00015334597,0.0006786586,0.00029883828,0.00004877982,0.0015985931,0.00006943107,0.09986876,0.050881684,0.22002873,0.6262534,0.00006325655],"about_ca_topic_score_codex":0.00036815103,"about_ca_topic_score_gemma":0.00050827855,"teacher_disagreement_score":0.04075077,"about_ca_system_score_codex":0.00052934047,"about_ca_system_score_gemma":0.00048521665,"threshold_uncertainty_score":0.13632494},"labels":[],"label_agreement":null},{"id":"W4240265971","doi":"10.1109/icpr.2004.1334379","title":"Prioritized region of interest coding in JPEG2000","year":2004,"lang":"en","type":"article","venue":"Proceedings of the 17th International Conference on Pattern Recognition, 2004. ICPR 2004.","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"ENCODE; JPEG 2000; Computer science; Region of interest; Coding (social sciences); Multiple description coding; Network packet; Artificial intelligence; Computer vision; Algorithm; Image compression; Decoding methods; Image (mathematics); Image processing; Computer network; Mathematics; Statistics","score_opus":0.09913364506278112,"score_gpt":0.3082992425042768,"score_spread":0.2091655974414957,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4240265971","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008138531,0.0015658953,0.9872016,0.0001039898,0.00009426977,0.00014675545,0.00009044376,0.00077929086,0.0018792214],"genre_scores_gemma":[0.08420952,0.0016409919,0.90909976,0.00016622452,0.000091288224,0.00017875755,0.00037634445,0.00014693315,0.0040901466],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9993492,0.00011496952,0.000024452176,0.00008278402,0.00037306832,0.00005556213],"domain_scores_gemma":[0.9994967,0.00013696785,0.00005208807,0.000085056054,0.000205824,0.000023378976],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006564745,0.0006620469,0.00044240023,0.0011733046,0.0003084877,0.0008301526,0.0012460557,0.00061273127,0.001506977],"category_scores_gemma":[0.0013946168,0.00033830683,0.0003482359,0.0013225727,0.0003670538,0.0010407418,0.00055387797,0.0010203788,0.0010377256],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004280334,0.00013602659,0.0004898665,0.00032035421,0.000040581213,0.00037380174,0.00018125007,0.02446699,0.30583695,0.04003779,0.0069587054,0.62072957],"study_design_scores_gemma":[0.00011947066,0.00047050425,0.0018524928,0.00013843528,0.00009268631,0.0026376855,0.00008615322,0.652808,0.27026048,0.014847972,0.056564998,0.00012112508],"about_ca_topic_score_codex":0.0027394968,"about_ca_topic_score_gemma":0.0034830517,"teacher_disagreement_score":0.0027394968,"about_ca_system_score_codex":0.0004550189,"about_ca_system_score_gemma":0.0009519487,"threshold_uncertainty_score":0.0054470897},"labels":[],"label_agreement":null},{"id":"W4241242626","doi":"10.1109/icme.2003.1220934","title":"Joint optimization of short-term and long-term predictors in CELP speech coders","year":2003,"lang":"en","type":"article","venue":"","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Institut National de la Recherche Scientifique","funders":"","keywords":"Code-excited linear prediction; Computer science; Speech recognition; Vector sum excited linear prediction; Speech coding; Linear predictive coding; Term (time); Coding (social sciences); Quantization (signal processing); Algorithm; Mathematics; Statistics","score_opus":0.022561520655480713,"score_gpt":0.27174811187279574,"score_spread":0.249186591217315,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4241242626","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08948538,0.00023771844,0.90906036,0.00008154546,0.000014060549,0.000021310945,0.000016582757,0.00023158605,0.0008514194],"genre_scores_gemma":[0.8066153,0.00018030788,0.19080268,0.000032599026,0.000022441462,0.00007173417,0.000059101476,0.00010670546,0.0021092142],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993937,0.00012892646,0.000039444065,0.0001064742,0.00026142405,0.00007009918],"domain_scores_gemma":[0.99892646,0.00056618964,0.00016166,0.00007762245,0.00022907033,0.00003892834],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011132732,0.00073958986,0.00051207654,0.00027030977,0.00022003602,0.0007558693,0.00038917863,0.0005340885,0.00059920485],"category_scores_gemma":[0.0024700041,0.00045508178,0.0003038122,0.00030975707,0.00050811656,0.0009938485,0.00069462875,0.0007220254,0.00030320024],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003558074,0.0001158856,0.002096174,0.000089561414,0.00006188221,0.00008326605,0.00008838184,0.69501907,0.122442655,0.0041813455,0.00023914163,0.1752268],"study_design_scores_gemma":[0.000010172089,0.00008831089,0.00050747243,0.000005187998,0.000015447342,0.000025999754,0.000013403746,0.96795493,0.030287182,0.0007860195,0.00029611477,0.000009742462],"about_ca_topic_score_codex":0.0017149118,"about_ca_topic_score_gemma":0.0032316688,"teacher_disagreement_score":0.0017149118,"about_ca_system_score_codex":0.00039336554,"about_ca_system_score_gemma":0.0010219452,"threshold_uncertainty_score":0.005887687},"labels":[],"label_agreement":null},{"id":"W4244387563","doi":"10.22215/etd/2013-08568","title":"Error-resilient and error concealment 3-D SPIHT for multiple description video coding with added redundancy","year":2013,"lang":"en","type":"dissertation","venue":"","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University; Carleton University; Canadian Heritage; Library and Archives Canada","funders":"","keywords":"Redundancy (engineering); Computer science; Coding (social sciences); Error detection and correction; Speech recognition; Artificial intelligence; Information retrieval; Natural language processing; Algorithm; Mathematics; Statistics; Operating system","score_opus":0.032467557390222175,"score_gpt":0.30328483479759827,"score_spread":0.2708172774073761,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4244387563","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08754703,0.000466402,0.90823567,0.00024620074,0.000099019584,0.000031024527,0.00014028122,0.0006558238,0.002578452],"genre_scores_gemma":[0.64445937,0.00080073526,0.3431915,0.00012308269,0.000071672,0.00004624946,0.00043618213,0.00013330717,0.010737853],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997807,0.000037613747,0.000011254751,0.000014793866,0.00013378657,0.000021871676],"domain_scores_gemma":[0.99951553,0.00019221126,0.000055106957,0.00009877651,0.00012396606,0.000014535588],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035142855,0.00034058062,0.00021349837,0.00041709762,0.00019855775,0.00038695234,0.00042397648,0.00041020804,0.0018473669],"category_scores_gemma":[0.0013366962,0.000178365,0.00029295022,0.00028860066,0.00029135033,0.00078757136,0.00048566874,0.00046333284,0.0004021477],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00075782737,0.00012490814,0.0008414147,0.00024284216,0.00008928835,0.0005219943,0.00029886223,0.27958977,0.34160894,0.040105667,0.004779883,0.3310386],"study_design_scores_gemma":[0.000016746284,0.0001303986,0.00024770314,0.000025588932,0.000017925167,0.00022403566,0.000021090595,0.8763121,0.11767839,0.0029139295,0.002394398,0.000017699413],"about_ca_topic_score_codex":0.0012305704,"about_ca_topic_score_gemma":0.0024524878,"teacher_disagreement_score":0.0018473669,"about_ca_system_score_codex":0.00036183558,"about_ca_system_score_gemma":0.00043437787,"threshold_uncertainty_score":0.006180048},"labels":[],"label_agreement":null},{"id":"W4246031020","doi":"10.32920/ryerson.14654985.v1","title":"Adaptive vector greedy splitting algorithm","year":2021,"lang":"en","type":"preprint","venue":"","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Orthonormal basis; Haar wavelet; Computer science; Greedy algorithm; Algorithm; Greedy randomized adaptive search procedure; Digital signal processing; MATLAB; Wavelet; Signal processing; SIGNAL (programming language); Basis (linear algebra); Wavelet transform; Discrete wavelet transform; Mathematics; Artificial intelligence","score_opus":0.02953264159705101,"score_gpt":0.28749560606587193,"score_spread":0.25796296446882094,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4246031020","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0021834138,0.00011192401,0.9955793,0.00007829257,0.000069809656,0.00003683513,0.000041307598,0.00027144793,0.0016277101],"genre_scores_gemma":[0.08522891,0.0003098502,0.90348464,0.00026831264,0.00013095571,0.00021881692,0.00046181155,0.00033550852,0.009561176],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990119,0.00021613912,0.000056225766,0.00016995739,0.0004282225,0.00011751493],"domain_scores_gemma":[0.9993067,0.00017978616,0.000046803507,0.00012915915,0.00028018226,0.000057418518],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008492489,0.00071158155,0.000995293,0.0009965716,0.0004883168,0.0012282055,0.0016713939,0.0012204046,0.007910184],"category_scores_gemma":[0.0019465559,0.00040195146,0.00068660843,0.0011573721,0.00093889394,0.0015368338,0.0017831611,0.0015849778,0.0031048094],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00030433116,0.00012674565,0.00085677794,0.00013428873,0.000090653106,0.00019312622,0.00013665228,0.20496619,0.02318042,0.11913036,0.013302348,0.63757807],"study_design_scores_gemma":[0.000055608652,0.000094628966,0.00019428233,0.000016554775,0.00001829208,0.00020044687,0.00003030633,0.9326982,0.00611317,0.044459112,0.016092878,0.000026631471],"about_ca_topic_score_codex":0.0013096207,"about_ca_topic_score_gemma":0.0010231809,"teacher_disagreement_score":0.007910184,"about_ca_system_score_codex":0.0005058448,"about_ca_system_score_gemma":0.0011129879,"threshold_uncertainty_score":0.026462257},"labels":[],"label_agreement":null},{"id":"W4247602681","doi":"10.1007/978-3-030-62124-7_10","title":"Basic Video Compression Techniques","year":2021,"lang":"en","type":"book-chapter","venue":"Texts in computer science","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Motion compensation; Video compression picture types; Computer science; Redundancy (engineering); Data compression; Block-matching algorithm; Digital video; Computer vision; Artificial intelligence; Multiview Video Coding; Reference frame; Video processing; Quarter-pixel motion; Video tracking; Frame (networking); Telecommunications","score_opus":0.022227459076791228,"score_gpt":0.28755052782686785,"score_spread":0.2653230687500766,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4247602681","genre_codex":"other","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0055498797,0.059699774,0.30051437,0.0008176715,0.002117278,0.00046961146,0.0015722043,0.004468136,0.6247911],"genre_scores_gemma":[0.02792491,0.051702984,0.10553704,0.00068673457,0.0013757338,0.00030564674,0.0027885456,0.0007651775,0.8089131],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99979,0.000007372898,0.000006857383,0.00003090536,0.00014805373,0.000016819627],"domain_scores_gemma":[0.9998448,0.000035074387,0.000007466957,0.00002531728,0.000077715296,0.000009619891],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012404898,0.0012857988,0.0005997787,0.0019969845,0.00042955967,0.0009587438,0.0009268947,0.00082278927,0.054949068],"category_scores_gemma":[0.0004011643,0.00036848584,0.00039473042,0.0022385686,0.0004031078,0.001454137,0.00053143216,0.0011962901,0.040456064],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006087657,0.00007410752,0.00007369902,0.00060967176,0.000011924255,0.0001292113,0.00009089858,0.0009814262,0.05089678,0.020530082,0.07507904,0.8514624],"study_design_scores_gemma":[0.000021898464,0.00016375163,0.0012523374,0.00042621762,0.00003171807,0.0019615064,0.00006671064,0.00786442,0.06345458,0.0166155,0.90809405,0.000047323785],"about_ca_topic_score_codex":0.0006020155,"about_ca_topic_score_gemma":0.0007504109,"teacher_disagreement_score":0.054949068,"about_ca_system_score_codex":0.00032413783,"about_ca_system_score_gemma":0.00033529897,"threshold_uncertainty_score":0.18382299},"labels":[],"label_agreement":null},{"id":"W4248571917","doi":"10.1109/iembs.2006.4398149","title":"Unbalanced 3-D Tree Structure for Region-Based Coding of Volumetric Medical Images","year":2006,"lang":"en","type":"article","venue":"Conference proceedings","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Coding (social sciences); Set partitioning in hierarchical trees; Computer science; Region of interest; Artificial intelligence; Coding tree unit; Tree structure; Tree (set theory); Tunstall coding; Pattern recognition (psychology); Algorithmic efficiency; Algorithm; Computer vision; Mathematics; Decoding methods; Image compression; Binary tree; Image (mathematics); Statistics; Image processing","score_opus":0.01682298388798185,"score_gpt":0.26548617951229714,"score_spread":0.2486631956243153,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4248571917","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006891879,0.00016857237,0.9921558,0.000076332246,0.000023077142,0.000027713731,0.00007581251,0.00016373518,0.00041706927],"genre_scores_gemma":[0.14157353,0.0006603643,0.85573924,0.00012881373,0.000064988424,0.00014543333,0.0006199358,0.00009663034,0.0009710726],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99964964,0.00007617518,0.000024563105,0.000027481998,0.00019825666,0.000023858564],"domain_scores_gemma":[0.99861825,0.0005224396,0.00012788412,0.00023507452,0.00045205062,0.00004441435],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005513098,0.00039505417,0.00029781502,0.0010372812,0.00024251407,0.0005051187,0.00063952134,0.00051271956,0.0015594459],"category_scores_gemma":[0.0030610673,0.00018021521,0.00030515683,0.0010332084,0.00032385183,0.0012984205,0.00057007495,0.00058869156,0.0006836271],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00039333676,0.00007698127,0.0011793679,0.00030817866,0.000040741717,0.0002480674,0.00024966872,0.12456146,0.20530799,0.041842144,0.0058652135,0.6199268],"study_design_scores_gemma":[0.000029180605,0.00022419608,0.00085311005,0.000048067574,0.0000320441,0.00064495933,0.000053574386,0.9001574,0.070494555,0.01221496,0.015200023,0.000047975976],"about_ca_topic_score_codex":0.0010699817,"about_ca_topic_score_gemma":0.0018015973,"teacher_disagreement_score":0.0015594459,"about_ca_system_score_codex":0.0004191949,"about_ca_system_score_gemma":0.0005485624,"threshold_uncertainty_score":0.005216837},"labels":[],"label_agreement":null},{"id":"W4249667883","doi":"10.1109/icce.2002.1013935","title":"Robust transmission of JPEG 2000 images over noisy channels","year":2003,"lang":"en","type":"article","venue":"","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Bitstream; Computer science; JPEG; Channel (broadcasting); Convolutional code; Transmission (telecommunications); Quantization (signal processing); Lossless JPEG; Code (set theory); Transform coding; JPEG 2000; Data compression; Artificial intelligence; Computer vision; Image compression; Computer hardware; Decoding methods; Image (mathematics); Algorithm; Computer network; Image processing; Telecommunications; Discrete cosine transform","score_opus":0.021652287978291187,"score_gpt":0.26266124067445734,"score_spread":0.24100895269616615,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4249667883","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.28196067,0.0018205795,0.7093433,0.00024841598,0.00012879258,0.0000739964,0.00020930135,0.001236045,0.004978885],"genre_scores_gemma":[0.8850789,0.0012686502,0.1079662,0.000080140824,0.000098990255,0.000046049277,0.00029737048,0.00007613371,0.0050875237],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998054,0.00002342365,0.0000090974845,0.000026379656,0.00011302028,0.000022825076],"domain_scores_gemma":[0.99961287,0.00012350375,0.00010518206,0.00007426344,0.000069546826,0.000014531376],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024176377,0.000351808,0.00031818514,0.00026235136,0.0001859527,0.00038367105,0.00033545116,0.00043930658,0.0007075628],"category_scores_gemma":[0.0012021455,0.00013793819,0.0001838077,0.00024243756,0.00033364564,0.0004793943,0.00036179606,0.00037871982,0.00032682254],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006159507,0.000052920896,0.000903418,0.00031210543,0.0000564125,0.0006179119,0.00016634467,0.03918964,0.75769997,0.008212723,0.0019174155,0.19025517],"study_design_scores_gemma":[0.000049607424,0.0005110909,0.0026209399,0.000058854235,0.00009030329,0.0015787039,0.000052040614,0.32582033,0.65911865,0.0026656738,0.0073828236,0.00005108187],"about_ca_topic_score_codex":0.00048488073,"about_ca_topic_score_gemma":0.00050101284,"teacher_disagreement_score":0.0007075628,"about_ca_system_score_codex":0.00019364104,"about_ca_system_score_gemma":0.0002268841,"threshold_uncertainty_score":0.0023670197},"labels":[],"label_agreement":null},{"id":"W4249894130","doi":"10.1007/978-981-10-6113-4_13","title":"Image Compression","year":2017,"lang":"en","type":"book-chapter","venue":"","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Lossy compression; Lossless compression; Image compression; Texture compression; Computer science; Compression (physics); Data compression; Computer vision; Fractal transform; Data compression ratio; Image (mathematics); Artificial intelligence; Color Cell Compression; Image processing; Materials science","score_opus":0.028596777559801584,"score_gpt":0.29934278269120157,"score_spread":0.2707460051314,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4249894130","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006372875,0.031840876,0.39100164,0.0012916806,0.0048741587,0.00028843302,0.0010382177,0.006236794,0.5570554],"genre_scores_gemma":[0.042442184,0.026034275,0.11266858,0.0010997686,0.0023538352,0.0001746767,0.0024182785,0.0013439916,0.81146437],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9997322,0.000009269366,0.0000068597988,0.000037280664,0.00019493085,0.000019362622],"domain_scores_gemma":[0.9997651,0.000040503703,0.000010333099,0.00005419271,0.00011603218,0.000013778878],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015042591,0.0011803613,0.0005867766,0.001878513,0.0004640794,0.0012341164,0.00094537984,0.0007995619,0.08057424],"category_scores_gemma":[0.00059306336,0.00034929338,0.00042088964,0.0018941928,0.0005161011,0.0016219782,0.0010452883,0.0012636803,0.04173561],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000051244708,0.000041618325,0.000060311148,0.00043902308,0.00001861409,0.00014077377,0.00005222951,0.0015881896,0.039230492,0.021825688,0.109353006,0.8271988],"study_design_scores_gemma":[0.000019978423,0.00010261083,0.000671352,0.00032289917,0.000041745647,0.0021870192,0.00006172432,0.0158632,0.0881359,0.024494763,0.8680485,0.000050407038],"about_ca_topic_score_codex":0.0004504034,"about_ca_topic_score_gemma":0.0006183131,"teacher_disagreement_score":0.08057424,"about_ca_system_score_codex":0.0003611844,"about_ca_system_score_gemma":0.00030429516,"threshold_uncertainty_score":0.2695477},"labels":[],"label_agreement":null},{"id":"W4250893040","doi":"10.22215/etd/2006-07910","title":"Parametric mixing for centralized VoIP conferencing using ITU-T recommendation G.722.2","year":2006,"lang":"en","type":"dissertation","venue":"","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University; Canadian Heritage; Library and Archives Canada","funders":"","keywords":"Computer science; Voice over IP; Codec; Network packet; Speech coding; Computer network; Speech recognition; Decoding methods; Adaptive Multi-Rate audio codec; Processing delay; Latency (audio); Real-time computing; Voice activity detection; Speech processing; Transmission delay; Telecommunications; The Internet","score_opus":0.05086402838739464,"score_gpt":0.3548150647720233,"score_spread":0.30395103638462867,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4250893040","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006745531,0.00092317845,0.94362265,0.0005455446,0.00047549309,0.00058616116,0.001372619,0.013547302,0.032181624],"genre_scores_gemma":[0.2641642,0.0020788142,0.6391711,0.00039871098,0.00075513945,0.0016149288,0.01019273,0.0031723112,0.07845206],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982811,0.0005664758,0.00011970509,0.00017283476,0.00065389083,0.00020598501],"domain_scores_gemma":[0.9982039,0.0003628409,0.00009255694,0.000651121,0.0006162016,0.000073421485],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023242137,0.0012618636,0.00080280117,0.0013908553,0.0011025508,0.0022612636,0.001597472,0.0017046323,0.03618859],"category_scores_gemma":[0.0054063564,0.0007433702,0.0006620633,0.0013060581,0.0005471892,0.0015744944,0.0014990894,0.0018064256,0.026865406],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0016150847,0.00040323858,0.0010008846,0.00042194143,0.000120468474,0.00055598177,0.0003510185,0.02228299,0.09465331,0.05739306,0.15944965,0.66175234],"study_design_scores_gemma":[0.00051572215,0.0007145212,0.0042149075,0.0002669911,0.00020238127,0.0011400265,0.00020230078,0.40511745,0.13729404,0.043827314,0.40622532,0.00027908964],"about_ca_topic_score_codex":0.0051720203,"about_ca_topic_score_gemma":0.008818145,"teacher_disagreement_score":0.03618859,"about_ca_system_score_codex":0.00095794076,"about_ca_system_score_gemma":0.0016030654,"threshold_uncertainty_score":0.121062934},"labels":[],"label_agreement":null},{"id":"W4251122878","doi":"10.32920/ryerson.14654985","title":"Adaptive vector greedy splitting algorithm","year":2021,"lang":"en","type":"preprint","venue":"","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Orthonormal basis; Haar wavelet; Greedy algorithm; Computer science; Algorithm; Greedy randomized adaptive search procedure; Digital signal processing; MATLAB; Wavelet; SIGNAL (programming language); Wavelet transform; Discrete wavelet transform; Artificial intelligence","score_opus":0.02953264159705101,"score_gpt":0.28749560606587193,"score_spread":0.25796296446882094,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4251122878","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0021834138,0.00011192401,0.9955793,0.00007829257,0.000069809656,0.00003683513,0.000041307598,0.00027144793,0.0016277101],"genre_scores_gemma":[0.08522891,0.0003098502,0.90348464,0.00026831264,0.00013095571,0.00021881692,0.00046181155,0.00033550852,0.009561176],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990119,0.00021613912,0.000056225766,0.00016995739,0.0004282225,0.00011751493],"domain_scores_gemma":[0.9993067,0.00017978616,0.000046803507,0.00012915915,0.00028018226,0.000057418518],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008492489,0.00071158155,0.000995293,0.0009965716,0.0004883168,0.0012282055,0.0016713939,0.0012204046,0.007910184],"category_scores_gemma":[0.0019465559,0.00040195146,0.00068660843,0.0011573721,0.00093889394,0.0015368338,0.0017831611,0.0015849778,0.0031048094],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00030433116,0.00012674565,0.00085677794,0.00013428873,0.000090653106,0.00019312622,0.00013665228,0.20496619,0.02318042,0.11913036,0.013302348,0.63757807],"study_design_scores_gemma":[0.000055608652,0.000094628966,0.00019428233,0.000016554775,0.00001829208,0.00020044687,0.00003030633,0.9326982,0.00611317,0.044459112,0.016092878,0.000026631471],"about_ca_topic_score_codex":0.0013096207,"about_ca_topic_score_gemma":0.0010231809,"teacher_disagreement_score":0.007910184,"about_ca_system_score_codex":0.0005058448,"about_ca_system_score_gemma":0.0011129879,"threshold_uncertainty_score":0.026462257},"labels":[],"label_agreement":null},{"id":"W4252114120","doi":"10.1007/978-0-387-30441-0_31","title":"Speech Coders","year":2008,"lang":"en","type":"book-chapter","venue":"","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Sherbrooke","funders":"","keywords":"Wireline; Computer science; Bandwidth (computing); Speech recognition; Wireless; Voice activity detection; Speech processing; Telecommunications","score_opus":0.02921394045857895,"score_gpt":0.25818317882394604,"score_spread":0.2289692383653671,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4252114120","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005253985,0.010554839,0.5797392,0.00093224685,0.0028743034,0.00034005634,0.0013297262,0.009689628,0.389286],"genre_scores_gemma":[0.020496784,0.0043710424,0.07242837,0.0006051003,0.0005903885,0.00015448837,0.0012880387,0.0010613897,0.8990044],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.999469,0.000036647834,0.000018003353,0.00009385264,0.0003490091,0.00003360952],"domain_scores_gemma":[0.99941134,0.00014974392,0.000027059852,0.000103613456,0.00027727976,0.000031009597],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003680047,0.0013348236,0.0006899899,0.0013697747,0.0007780975,0.0017821005,0.0013073904,0.0015748828,0.094180845],"category_scores_gemma":[0.0013737744,0.00047165944,0.00034692566,0.0009739692,0.0006842196,0.001509466,0.0010412128,0.0016146854,0.08458387],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012683553,0.00003948866,0.00008844994,0.00033838974,0.00001895686,0.00020651898,0.0001974162,0.0012068172,0.07494452,0.036156368,0.092111245,0.7945649],"study_design_scores_gemma":[0.000019779742,0.00009738642,0.00037627807,0.0001944652,0.000037051384,0.0012840666,0.00009349283,0.006856416,0.10383015,0.008903911,0.87825394,0.000053166365],"about_ca_topic_score_codex":0.0009161661,"about_ca_topic_score_gemma":0.0013685216,"teacher_disagreement_score":0.094180845,"about_ca_system_score_codex":0.0005794863,"about_ca_system_score_gemma":0.00052784,"threshold_uncertainty_score":0.31506634},"labels":[],"label_agreement":null},{"id":"W4252698925","doi":"10.1002/0471219282.eot299","title":"Waveform Coding","year":2003,"lang":"en","type":"other","venue":"","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Waveform; Computer science; Pulse-code modulation; Coding (social sciences); Vector quantization; Quantization (signal processing); Electronic engineering; Delta modulation; Analog transmission; Sub-band coding; Analog signal; Algorithm; Speech recognition; Pulse-amplitude modulation; Speech coding; Mathematics; Transmission (telecommunications); Telecommunications; Engineering; Pulse (music)","score_opus":0.01477899216740941,"score_gpt":0.26961994185465626,"score_spread":0.25484094968724685,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4252698925","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005639822,0.00328879,0.8150449,0.0014195999,0.0017289228,0.00024951788,0.0021182597,0.0029736003,0.16753651],"genre_scores_gemma":[0.22413775,0.00974002,0.4854926,0.00226292,0.0019546556,0.00063187804,0.01282259,0.0014182075,0.2615393],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99924636,0.00010318342,0.000054192395,0.00011112136,0.0004083841,0.000076811],"domain_scores_gemma":[0.9987581,0.00024861202,0.00007905951,0.00030113576,0.0005584214,0.000054783497],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047759252,0.0007107957,0.00045037997,0.0016180313,0.0005797225,0.0022163326,0.0011572372,0.00095798145,0.038119294],"category_scores_gemma":[0.0029395,0.0002020801,0.00040182486,0.0022836037,0.00069657114,0.0017916902,0.0015257783,0.0012714481,0.015918585],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020066864,0.0000326167,0.00026280474,0.00030899057,0.000019073674,0.0003039093,0.00013607761,0.006441696,0.013816121,0.39577323,0.062468693,0.52023613],"study_design_scores_gemma":[0.000079849975,0.00012252032,0.00042753477,0.00036153386,0.000033706587,0.0012118194,0.00011851928,0.06769068,0.026455047,0.22993943,0.6734941,0.00006533831],"about_ca_topic_score_codex":0.0011410563,"about_ca_topic_score_gemma":0.0008342158,"teacher_disagreement_score":0.038119294,"about_ca_system_score_codex":0.0006014001,"about_ca_system_score_gemma":0.00092342694,"threshold_uncertainty_score":0.1275217},"labels":[],"label_agreement":null},{"id":"W4254231645","doi":"10.22215/etd/2005-07894","title":"Region-based three-dimensional wavelet transform coding","year":2005,"lang":"en","type":"dissertation","venue":"","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Computer science; Arithmetic; Mathematics","score_opus":0.01994794205071742,"score_gpt":0.2823633634996405,"score_spread":0.26241542144892305,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4254231645","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01582288,0.00033022085,0.98028904,0.00008483385,0.00006918895,0.000030143476,0.00014651324,0.0006029236,0.0026242111],"genre_scores_gemma":[0.34381935,0.0015169821,0.63721937,0.00015882839,0.000083716164,0.00010896459,0.0014001235,0.00037001367,0.0153227085],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997336,0.000029588839,0.000015134335,0.000028789134,0.00016182674,0.000031014984],"domain_scores_gemma":[0.999423,0.0001272959,0.00004266217,0.0001741999,0.00020939324,0.000023424207],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033247808,0.00036972106,0.0004059449,0.00086922786,0.00016722248,0.00078028045,0.00062744546,0.00053960487,0.0031527006],"category_scores_gemma":[0.0011615211,0.00020398092,0.0005310053,0.0010557043,0.00034917367,0.0009962384,0.0006793947,0.00077147,0.001840827],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00033187988,0.00010096092,0.00038199942,0.00012633204,0.000035772886,0.0001411212,0.000113410075,0.053253192,0.30513144,0.030141715,0.0052077393,0.6050344],"study_design_scores_gemma":[0.00002723992,0.00012835758,0.0009234435,0.000029041745,0.000033924236,0.00038265504,0.00003572332,0.786851,0.19470884,0.0055670436,0.011271467,0.00004126924],"about_ca_topic_score_codex":0.0021322598,"about_ca_topic_score_gemma":0.0023325414,"teacher_disagreement_score":0.0031527006,"about_ca_system_score_codex":0.00032965798,"about_ca_system_score_gemma":0.0005593611,"threshold_uncertainty_score":0.0105468035},"labels":[],"label_agreement":null},{"id":"W4254382237","doi":"10.32920/ryerson.14657373","title":"Adaptive variable bit-rate speech coder for wireless applications","year":2021,"lang":"en","type":"preprint","venue":"","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Speech coding; Computer science; Codec2; Wireless; Full Rate; Harmonic Vector Excitation Coding; Speech recognition; Voice activity detection; Coding (social sciences); Key (lock); Channel (broadcasting); PSQM; Adaptive Multi-Rate audio codec; Linear predictive coding; Speech processing; Computer network; Telecommunications; Mathematics","score_opus":0.03323591211979171,"score_gpt":0.3034650293304894,"score_spread":0.2702291172106977,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4254382237","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.024537852,0.003461656,0.9615277,0.00046611266,0.00022372692,0.00008894083,0.00010779982,0.0016660885,0.0079201525],"genre_scores_gemma":[0.4250661,0.0052507655,0.5426068,0.00031324086,0.0002644073,0.00015758387,0.000618175,0.00033071171,0.025392218],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.999757,0.000044164604,0.0000103590055,0.000028702741,0.0001461391,0.000013673495],"domain_scores_gemma":[0.9996773,0.00014181729,0.000025241901,0.000040595278,0.00010484303,0.000010144223],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000283234,0.0002842368,0.0002467193,0.00034128138,0.00017721394,0.00041011814,0.00037298366,0.00054667704,0.0024988996],"category_scores_gemma":[0.001052546,0.00010396579,0.00012238073,0.00037873592,0.00025561472,0.00039631463,0.00020245965,0.00072677835,0.0014758215],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002512234,0.000085690655,0.0005701518,0.00027518094,0.00003693898,0.00031535697,0.00012865667,0.039780892,0.35741445,0.07231346,0.008315917,0.52051204],"study_design_scores_gemma":[0.00007113636,0.0003562783,0.0017236349,0.000068677815,0.000050947638,0.0010436499,0.00003775211,0.72307557,0.19058178,0.019169595,0.06376761,0.000053345022],"about_ca_topic_score_codex":0.00089377945,"about_ca_topic_score_gemma":0.0010558285,"teacher_disagreement_score":0.0024988996,"about_ca_system_score_codex":0.0002135835,"about_ca_system_score_gemma":0.000367282,"threshold_uncertainty_score":0.008359611},"labels":[],"label_agreement":null},{"id":"W4254929383","doi":"10.1145/1330107.1330136","title":"Sparse approximations for high fidelity compression of network traffic data","year":2005,"lang":"en","type":"article","venue":"","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; Data compression; Compression (physics); High fidelity; Algorithm; Theoretical computer science; Physics","score_opus":0.06365330321387311,"score_gpt":0.32679618500273866,"score_spread":0.2631428817888656,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4254929383","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.045013174,0.00024714606,0.95314574,0.00033231266,0.00004559107,0.000028226512,0.00014776777,0.00024173538,0.00079835055],"genre_scores_gemma":[0.5685443,0.001191472,0.42628706,0.00017501392,0.00018858029,0.00014590267,0.0010629602,0.000080063284,0.0023246142],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995844,0.00011178734,0.00002653896,0.000047679423,0.00019761665,0.000031978198],"domain_scores_gemma":[0.9980591,0.0013069317,0.00014211437,0.00024734443,0.00021619117,0.000028343293],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00087018166,0.00042535472,0.0003775949,0.0007774519,0.00019768708,0.0005403808,0.00042526083,0.0006137067,0.00081664306],"category_scores_gemma":[0.006081314,0.00021130189,0.00027970222,0.0011533079,0.00053432677,0.0009858627,0.00053103414,0.0010495805,0.0002956207],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003178865,0.000108535045,0.0015492633,0.00019333081,0.000050193783,0.00025758104,0.00026025157,0.672893,0.038211364,0.04085932,0.0038362155,0.24146314],"study_design_scores_gemma":[0.000005146441,0.000016646916,0.0002577729,0.000005557327,0.0000025628253,0.00004429768,0.000012096853,0.99151987,0.003398187,0.0041538808,0.00057916273,0.000004801446],"about_ca_topic_score_codex":0.0013824959,"about_ca_topic_score_gemma":0.0011206681,"teacher_disagreement_score":0.0013824959,"about_ca_system_score_codex":0.0003168692,"about_ca_system_score_gemma":0.00028960616,"threshold_uncertainty_score":0.004602015},"labels":[],"label_agreement":null},{"id":"W4255557549","doi":"10.1007/978-3-030-62124-7_9","title":"Image Compression Standards","year":2021,"lang":"en","type":"book-chapter","venue":"Texts in computer science","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"JPEG; Lossless JPEG; Lossless compression; Discrete cosine transform; Lossy compression; JPEG 2000; Computer vision; Quantization (signal processing); Artificial intelligence; Computer science; Transform coding; Image compression; Entropy encoding; Data compression; Mathematics; Image processing; Image (mathematics)","score_opus":0.018197274261824842,"score_gpt":0.30684728358943225,"score_spread":0.2886500093276074,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4255557549","genre_codex":"other","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0029887361,0.015122137,0.15245585,0.0020933142,0.0036045369,0.00029660616,0.0016112431,0.0044136676,0.8174138],"genre_scores_gemma":[0.012062322,0.01134212,0.036647398,0.00079976406,0.0008255858,0.0001877663,0.0033271092,0.001239045,0.93356895],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99940073,0.000034200493,0.0000244172,0.00005865588,0.00044625872,0.000035688663],"domain_scores_gemma":[0.9992415,0.00016816886,0.00002641607,0.000155686,0.0003759502,0.000032351018],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046834792,0.0009815468,0.0005812426,0.002699557,0.00075477164,0.0023603668,0.00092874403,0.0012943514,0.09860044],"category_scores_gemma":[0.0014708331,0.00048221913,0.00029484663,0.003256886,0.00073749886,0.0024708195,0.0010051711,0.0022082543,0.066390164],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000058308357,0.00007099617,0.00007677731,0.00035680734,0.000009751592,0.00010454198,0.00013243667,0.0010140372,0.017060587,0.09827435,0.31154472,0.57129675],"study_design_scores_gemma":[0.000009825408,0.000038269663,0.00026439357,0.00018739035,0.0000071601035,0.0004062431,0.00004306383,0.0019422425,0.013298133,0.020511348,0.96327376,0.000018220397],"about_ca_topic_score_codex":0.0008213514,"about_ca_topic_score_gemma":0.0010570709,"teacher_disagreement_score":0.09860044,"about_ca_system_score_codex":0.0007086414,"about_ca_system_score_gemma":0.0007538555,"threshold_uncertainty_score":0.32985133},"labels":[],"label_agreement":null},{"id":"W4256655336","doi":"10.1109/icassp.2003.1199156","title":"Multiple, arbitrary shape ROI coding with zerotree based wavelet coders","year":2003,"lang":"en","type":"article","venue":"2003 IEEE International Conference on Acoustics, Speech, and Signal Processing, 2003. Proceedings. (ICASSP '03).","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Computer science; Coding (social sciences); Artificial intelligence; Computer vision; Region of interest; Context-adaptive binary arithmetic coding; Pixel; Context-adaptive variable-length coding; Tunstall coding; Coding tree unit; JPEG; Sub-band coding; Wavelet; Transform coding; Data compression; MPEG-4; Image compression; JPEG 2000; Algorithm; Decoding methods; Image processing; Speech recognition; Mathematics; Speech coding; Image (mathematics); Discrete cosine transform","score_opus":0.04185330618096136,"score_gpt":0.2823497732134364,"score_spread":0.24049646703247504,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4256655336","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08069483,0.0007091427,0.91646147,0.00010816992,0.000028740651,0.000049197813,0.00004848276,0.00041491401,0.0014850872],"genre_scores_gemma":[0.49405465,0.00070612796,0.5027894,0.00007512558,0.000034873927,0.00006981783,0.00013937934,0.000118487296,0.002012271],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9996178,0.000102203056,0.000025461444,0.0000363214,0.00018087191,0.000037265025],"domain_scores_gemma":[0.99917245,0.0002986333,0.00015247201,0.00014857766,0.00019745894,0.000030399653],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00065802387,0.00041839684,0.00039782547,0.0005514215,0.00013985901,0.0004742712,0.000827764,0.00043316322,0.0008677458],"category_scores_gemma":[0.0019571865,0.00020304174,0.0003809629,0.00051053596,0.00040579075,0.0010230659,0.00072699034,0.0006264837,0.0003290542],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006706453,0.00012836186,0.001418816,0.00024785782,0.000058059853,0.0006461932,0.00021576893,0.14281374,0.46749908,0.077546254,0.0017712333,0.30698395],"study_design_scores_gemma":[0.000031994925,0.00026230718,0.0005924506,0.00003905521,0.000029836572,0.0006514036,0.00003853554,0.82444,0.16482136,0.005396256,0.0036572472,0.000039555172],"about_ca_topic_score_codex":0.00058769813,"about_ca_topic_score_gemma":0.0008355221,"teacher_disagreement_score":0.0008677458,"about_ca_system_score_codex":0.00033133925,"about_ca_system_score_gemma":0.00033034038,"threshold_uncertainty_score":0.0034799576},"labels":[],"label_agreement":null},{"id":"W4283815753","doi":"10.1109/dcc52660.2022.00053","title":"Orthonormal Matrix Codebook Design for Adaptive Transform Coding","year":2022,"lang":"en","type":"article","venue":"","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"","keywords":"Codebook; Orthonormality; Linde–Buzo–Gray algorithm; Algorithm; Stiefel manifold; Mathematics; Vector quantization; Gradient descent; Computer science; Orthonormal basis; Mathematical optimization; Artificial intelligence","score_opus":0.045022044952613416,"score_gpt":0.3011003858996346,"score_spread":0.2560783409470212,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4283815753","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00079056557,0.000070251415,0.9981029,0.00003060143,0.00002029955,0.00002692392,0.000021881915,0.00015799033,0.0007785157],"genre_scores_gemma":[0.07270847,0.0002449857,0.9208254,0.00010993144,0.00005034612,0.00025005217,0.00033348106,0.00016619157,0.0053111613],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991399,0.0001843889,0.000049858056,0.0001293661,0.0004173266,0.00007902458],"domain_scores_gemma":[0.9990126,0.00027093114,0.000072367555,0.00014663638,0.00045443486,0.000042975593],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009905226,0.00072659936,0.0007149943,0.0007701999,0.00049370405,0.001058147,0.0014657003,0.00081547396,0.005263418],"category_scores_gemma":[0.0035104775,0.00039806069,0.0005093953,0.0009140566,0.000750757,0.0013242037,0.0011343041,0.0012821937,0.0023937558],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017355694,0.00006687586,0.00042741097,0.0001609758,0.000033520737,0.00013670637,0.0001911697,0.32554504,0.026782105,0.16783918,0.01113537,0.4675082],"study_design_scores_gemma":[0.000018107905,0.00005118494,0.00005127063,0.000015326264,0.0000061972564,0.0000815324,0.000018405748,0.96791404,0.007079215,0.017008377,0.007741982,0.000014430067],"about_ca_topic_score_codex":0.0041147433,"about_ca_topic_score_gemma":0.005048297,"teacher_disagreement_score":0.005263418,"about_ca_system_score_codex":0.0010248926,"about_ca_system_score_gemma":0.0015498858,"threshold_uncertainty_score":0.017607868},"labels":[],"label_agreement":null},{"id":"W4285102625","doi":"10.1109/dslw53931.2022.9820506","title":"Practical Cognitive Speech Compression","year":2022,"lang":"en","type":"article","venue":"","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Sherbrooke","funders":"","keywords":"Codec; Computer science; Speech recognition; Speech coding; PSQM; Encoder; Telephony; Quantization (signal processing); Linear predictive coding; Computer vision; Telecommunications","score_opus":0.044860097471728526,"score_gpt":0.3631831777002367,"score_spread":0.3183230802285082,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4285102625","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04686053,0.00034757095,0.94094706,0.00016950343,0.000069970454,0.0000688682,0.00007838614,0.00085606397,0.010601985],"genre_scores_gemma":[0.59645194,0.00031522856,0.39503622,0.00018595984,0.00009305759,0.000083242725,0.00022016575,0.00007236117,0.007541807],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9996884,0.000049482678,0.000013559301,0.00005223353,0.00017319826,0.000023121815],"domain_scores_gemma":[0.99956614,0.00018011536,0.000031964715,0.00008109637,0.00012526466,0.000015420757],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037711553,0.00043168582,0.00019084393,0.00034807954,0.00019875928,0.00043025918,0.0005098296,0.00039951157,0.0024442447],"category_scores_gemma":[0.0013676449,0.00009997644,0.00020672283,0.00022949533,0.00042376856,0.0005094026,0.00056305487,0.00052422844,0.0004462635],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00024819977,0.000116757015,0.00078037626,0.00019931131,0.00004006532,0.00019343222,0.00016756538,0.082024544,0.14792657,0.025192263,0.0029455668,0.74016535],"study_design_scores_gemma":[0.000029521309,0.00019382096,0.0018683227,0.000026750567,0.000029341112,0.0005805783,0.000054973578,0.86923176,0.10669634,0.011417632,0.009838217,0.00003287121],"about_ca_topic_score_codex":0.0020506226,"about_ca_topic_score_gemma":0.003858513,"teacher_disagreement_score":0.0024442447,"about_ca_system_score_codex":0.0003681735,"about_ca_system_score_gemma":0.0004341744,"threshold_uncertainty_score":0.008176804},"labels":[],"label_agreement":null},{"id":"W4287147165","doi":"10.1080/09296174.2022.2095751","title":"Unified Parametrization of Phonetic Features and Numerical Calculation of Phonetic Distances between Speech Sounds","year":2022,"lang":"en","type":"article","venue":"Journal of Quantitative Linguistics","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Artificial Intelligence in Medicine (Canada)","funders":"Ministerstvo školstva, vedy, výskumu a športu Slovenskej republiky","keywords":"Computer science; Speech recognition; Metric (unit); Feature (linguistics); Set (abstract data type); Phonology; Phone; Natural language processing; Artificial intelligence; Speech corpus; Phonetics; Linguistics; Speech synthesis; Engineering","score_opus":0.034710223584710986,"score_gpt":0.33609749835922453,"score_spread":0.30138727477451355,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4287147165","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0019442348,0.00007575527,0.99667466,0.000027148946,0.00003071357,0.000021388529,0.000057373443,0.00016696776,0.001001753],"genre_scores_gemma":[0.16874997,0.00035948798,0.8263211,0.000046960104,0.00012343336,0.00041672235,0.00047274109,0.00025138032,0.0032581657],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99913174,0.00022263585,0.00009150464,0.00023815285,0.00026289464,0.00005316296],"domain_scores_gemma":[0.99938655,0.00019332525,0.00006133282,0.0001844645,0.00015213918,0.000022180084],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00101916,0.0009379262,0.0007531152,0.0018879189,0.0005101624,0.0023090292,0.0015745913,0.0010642634,0.003297247],"category_scores_gemma":[0.0042158403,0.0004913318,0.0010243786,0.001776592,0.001324637,0.0029180828,0.0014122684,0.0014074536,0.0018348388],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012572997,0.0000822033,0.001885127,0.00033592386,0.00009440172,0.00036097676,0.00043214016,0.2195332,0.040756993,0.40982145,0.0021413094,0.32443056],"study_design_scores_gemma":[0.000014100087,0.00009246379,0.0017198519,0.000054988115,0.000040884435,0.000547511,0.00011022577,0.8841346,0.0070122117,0.093818136,0.012368634,0.00008649113],"about_ca_topic_score_codex":0.0012102886,"about_ca_topic_score_gemma":0.0009300072,"teacher_disagreement_score":0.003297247,"about_ca_system_score_codex":0.0007219869,"about_ca_system_score_gemma":0.00080498593,"threshold_uncertainty_score":0.011030376},"labels":[],"label_agreement":null},{"id":"W4288070505","doi":"10.18280/ts.390324","title":"Hybrid Transform Based Speech Band Width Enhancement Using Data Hiding","year":2022,"lang":"en","type":"article","venue":"Traitement du signal","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Computer science; Speech recognition; Telephony; Wideband audio; Speech coding; Bandwidth (computing); Wideband; Voice activity detection; Bandwidth extension; Discrete cosine transform; Telephone network; Speech enhancement; Speech processing; Electronic engineering; Telecommunications; Artificial intelligence; Engineering; Digital audio; Background noise; Audio signal","score_opus":0.05924471149776857,"score_gpt":0.2979697449892268,"score_spread":0.23872503349145824,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4288070505","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.33321658,0.0007468667,0.66180944,0.000106926534,0.000067538705,0.000040927553,0.000083285355,0.00078401016,0.0031444007],"genre_scores_gemma":[0.8783209,0.0005155919,0.11503243,0.00003487161,0.000021252948,0.000022419583,0.00010839526,0.000036128735,0.00590798],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9999193,0.00000790469,0.00000437884,0.0000147276105,0.00004504664,0.000008636195],"domain_scores_gemma":[0.99989927,0.000030049054,0.000017483851,0.000017028777,0.000031303276,0.0000047824183],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00010738591,0.0002376815,0.0001711472,0.00023611398,0.00009282699,0.0002201271,0.00023100154,0.00023318696,0.00085440016],"category_scores_gemma":[0.00023859311,0.0001033971,0.0002588777,0.000246039,0.00017460693,0.00045767787,0.0002557093,0.00021589012,0.00029341647],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002802944,0.00006685749,0.0005670927,0.00012348905,0.000030683357,0.00017706038,0.00009815819,0.023110587,0.81116676,0.0025765167,0.00038855334,0.1614139],"study_design_scores_gemma":[0.000020485937,0.0002669004,0.0009449919,0.000010898714,0.000034198518,0.00065450405,0.000030315203,0.33825347,0.6552002,0.0005633067,0.004000855,0.00001996571],"about_ca_topic_score_codex":0.0004557295,"about_ca_topic_score_gemma":0.00054862065,"teacher_disagreement_score":0.00085440016,"about_ca_system_score_codex":0.00012870634,"about_ca_system_score_gemma":0.00013500269,"threshold_uncertainty_score":0.0028582811},"labels":[],"label_agreement":null},{"id":"W4297504231","doi":"10.18280/ts.390411","title":"Improving Medical Video Coding Using Multi Scale Quincunx Lattice: From Low Bitrate to High Quality","year":2022,"lang":"en","type":"article","venue":"Traitement du signal","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Set partitioning in hierarchical trees; Computer science; Encoder; Discrete wavelet transform; Wavelet; Artificial intelligence; Discrete cosine transform; Data compression; Wavelet transform; Coding (social sciences); Peak signal-to-noise ratio; Computer vision; Video quality; Mathematics; Image (mathematics); Statistics","score_opus":0.03908958760898291,"score_gpt":0.3231416010999844,"score_spread":0.2840520134910015,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4297504231","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12533134,0.001475573,0.868494,0.00031546975,0.00009406746,0.000057561265,0.000057068894,0.0005339851,0.0036409514],"genre_scores_gemma":[0.48953727,0.0014845952,0.50562847,0.00012252794,0.000047894264,0.00005003261,0.00014464442,0.000087492066,0.0028970174],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99975485,0.000058564518,0.000011108586,0.00003067407,0.00012931495,0.000015513584],"domain_scores_gemma":[0.9996723,0.00013103937,0.000036869995,0.000035603265,0.00010810146,0.000016218488],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004097512,0.00027114144,0.0002550023,0.00048410537,0.0001826137,0.00043764844,0.00030335638,0.0003993461,0.0013064072],"category_scores_gemma":[0.0012295101,0.00010223481,0.00024349599,0.00050532795,0.00029975834,0.0006415197,0.00034224402,0.00040243994,0.00038775452],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00042753338,0.0001464744,0.0013610813,0.00029697988,0.000036284076,0.00030483867,0.00022440683,0.08839724,0.3494424,0.016269581,0.001800521,0.54129267],"study_design_scores_gemma":[0.000031016465,0.00043256726,0.0014998455,0.00005313019,0.000027718419,0.0008349585,0.00008886507,0.8774254,0.109533854,0.0032558977,0.0067785135,0.000038314505],"about_ca_topic_score_codex":0.0010588075,"about_ca_topic_score_gemma":0.0010563326,"teacher_disagreement_score":0.0013064072,"about_ca_system_score_codex":0.00023671424,"about_ca_system_score_gemma":0.00030014385,"threshold_uncertainty_score":0.0043703914},"labels":[],"label_agreement":null},{"id":"W4311164445","doi":"10.18280/ts.390546","title":"Data Compression and Noise Reduction in Smart Grid Using Discrete Wavelet Transform","year":2022,"lang":"en","type":"article","venue":"Traitement du signal","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Smart grid; Computer science; Wavelet; Noise reduction; Data compression; Noise (video); Wavelet transform; Discrete wavelet transform; Distortion (music); Reduction (mathematics); Electronic engineering; Real-time computing; Algorithm; Engineering; Artificial intelligence; Mathematics; Electrical engineering; Telecommunications; Bandwidth (computing)","score_opus":0.04780127727969532,"score_gpt":0.2993377097949776,"score_spread":0.2515364325152823,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4311164445","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03854908,0.00046195302,0.95864844,0.00015058946,0.00007008967,0.000036059908,0.000030790216,0.0003084172,0.0017447056],"genre_scores_gemma":[0.62846106,0.0011995578,0.3648312,0.00014399395,0.00010295514,0.00010328243,0.00023653434,0.00006900516,0.004852472],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995915,0.00006213218,0.000027874103,0.000050599367,0.00024677275,0.000021040116],"domain_scores_gemma":[0.9997485,0.00006248686,0.000028588907,0.000030811556,0.00012155727,0.000008008599],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037553042,0.00036546227,0.00041983457,0.00052771426,0.00021689659,0.00045273517,0.00044653603,0.00038563085,0.0006427437],"category_scores_gemma":[0.0008612165,0.00016623839,0.0003445545,0.0007214693,0.0002555538,0.0007979764,0.0002533609,0.00039828275,0.0002968416],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000528199,0.0001392662,0.0018965371,0.00034979178,0.00007635394,0.000497056,0.00025740734,0.1038609,0.24478436,0.018106284,0.00259293,0.6269108],"study_design_scores_gemma":[0.00004130658,0.0004017491,0.0010650151,0.000033162894,0.00003825163,0.00039501247,0.0000462809,0.88964105,0.096725315,0.0029872223,0.008603232,0.000022462045],"about_ca_topic_score_codex":0.0004906057,"about_ca_topic_score_gemma":0.0003547673,"teacher_disagreement_score":0.0006427437,"about_ca_system_score_codex":0.0002269027,"about_ca_system_score_gemma":0.0001857156,"threshold_uncertainty_score":0.002150178},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.008935774984870014,"score_gpt":0.23274199312170699,"score_spread":0.22380621813683696,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4312777148","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00663793,0.0062298346,0.959896,0.001999512,0.0002611889,0.000054273387,0.00018957623,0.00014134914,0.024590405],"genre_scores_gemma":[0.65077186,0.022910837,0.3084537,0.0021449965,0.0018290227,0.00074173225,0.0005074539,0.00048209543,0.012158238],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.992,0.0031852194,0.00046248967,0.0012705665,0.0025205512,0.00056124176],"domain_scores_gemma":[0.9786597,0.01557168,0.00086803915,0.0022449484,0.0024361901,0.00021944872],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008209813,0.0019179253,0.0016534021,0.0018928078,0.00091022346,0.0046207197,0.0020619133,0.0031650038,0.003822642],"category_scores_gemma":[0.03197046,0.0006981096,0.0009793045,0.0025475759,0.006086253,0.008917762,0.003443753,0.005003355,0.0017764566],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009367977,0.00001706836,0.00021173972,0.00016127632,0.00002218682,0.00011810551,0.000090812624,0.03276613,0.0018855308,0.94134027,0.002010326,0.02128294],"study_design_scores_gemma":[0.000029823526,0.00011276276,0.00040444452,0.00017221986,0.000031685096,0.00052517455,0.000052348714,0.19538394,0.002467852,0.7870054,0.013735044,0.00007933844],"about_ca_topic_score_codex":0.0014676522,"about_ca_topic_score_gemma":0.00037467308,"teacher_disagreement_score":0.008209813,"about_ca_system_score_codex":0.0025846236,"about_ca_system_score_gemma":0.0014553332,"threshold_uncertainty_score":0.04341817},"labels":[],"label_agreement":null},{"id":"W4317555262","doi":"10.1109/pcs56426.2022.10018002","title":"Learned Image Compression with Inception Residual Blocks and Multi-Scale Attention Module","year":2022,"lang":"en","type":"article","venue":"","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada; Natural Science Foundation of Shaanxi Province; National Natural Science Foundation of China; China Scholarship Council; Google","keywords":"Residual; Computer science; Entropy encoding; Decoding methods; Entropy (arrow of time); Algorithm; Block structure; Gaussian; Coding (social sciences); Artificial intelligence; Computational complexity theory; Arithmetic coding; Data compression; Theoretical computer science; Context-adaptive binary arithmetic coding; Core (optical fiber); Mathematics","score_opus":0.018505681584190255,"score_gpt":0.27720987364952027,"score_spread":0.25870419206533,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4317555262","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06937284,0.00092337886,0.92304754,0.00024923633,0.0001132652,0.000079055564,0.00012608743,0.0030187482,0.003069865],"genre_scores_gemma":[0.586791,0.00052388856,0.4030895,0.00036900665,0.00012673992,0.00013261473,0.00054763217,0.00019595487,0.008223603],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99979645,0.000021272075,0.000011115226,0.000046317775,0.000094851646,0.000029988281],"domain_scores_gemma":[0.9997465,0.000060116752,0.000024192661,0.000062870786,0.00008613306,0.00002013557],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030509752,0.00070841255,0.0005509673,0.00062491384,0.0002100136,0.0003505305,0.00086220435,0.00048329704,0.0020336746],"category_scores_gemma":[0.00082465383,0.00021048592,0.00040995827,0.00062447716,0.0003507123,0.0009714498,0.00074965105,0.0007332196,0.0005496502],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00026407104,0.00014879601,0.0010896875,0.0001015666,0.000075298005,0.00015106586,0.00008537086,0.11583291,0.05893597,0.0064338055,0.0040780804,0.8128034],"study_design_scores_gemma":[0.000020732152,0.00006924677,0.00048130413,0.0000069664898,0.000024337061,0.00008936023,0.000008806301,0.96346253,0.03256953,0.0017235422,0.0015322765,0.000011390116],"about_ca_topic_score_codex":0.0039567132,"about_ca_topic_score_gemma":0.005234773,"teacher_disagreement_score":0.0039567132,"about_ca_system_score_codex":0.00040921292,"about_ca_system_score_gemma":0.00067638344,"threshold_uncertainty_score":0.007867336},"labels":[],"label_agreement":null},{"id":"W4321192297","doi":"10.1109/icce56470.2023.10043402","title":"Comparison of Modern Compression Standards on Medical Images for Telehealth Applications","year":2023,"lang":"en","type":"article","venue":"2023 IEEE International Conference on Consumer Electronics (ICCE)","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; Telehealth; Data compression; Image compression; Coding (social sciences); Telemedicine; Computer vision; Multimedia; Artificial intelligence; Image processing; Image (mathematics)","score_opus":0.07858285840744363,"score_gpt":0.4409752147380609,"score_spread":0.3623923563306173,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4321192297","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8815166,0.020184156,0.069352895,0.0010225482,0.0006772358,0.00056060095,0.0035819071,0.0023737461,0.020730263],"genre_scores_gemma":[0.9322309,0.007968479,0.04758161,0.00023983518,0.000152091,0.00018256299,0.009164361,0.00018742228,0.0022927364],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9977628,0.00030595745,0.00024544756,0.00015545174,0.0013913366,0.00013887497],"domain_scores_gemma":[0.99569976,0.001529097,0.0002809232,0.00048009426,0.0019279834,0.00008218107],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002051617,0.0005503595,0.00036121072,0.003065389,0.0002890148,0.00082522805,0.00046417542,0.00066457235,0.0011336624],"category_scores_gemma":[0.010221729,0.000104143204,0.00034490513,0.0021465672,0.00040196165,0.00093688065,0.00045857092,0.00036773938,0.0003721501],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0033720208,0.0005479833,0.019072121,0.0012998707,0.00031596527,0.0005068616,0.00024424942,0.067110844,0.07994887,0.006166191,0.015122763,0.8062923],"study_design_scores_gemma":[0.00043285757,0.0054998216,0.16098443,0.0007981093,0.00042066292,0.0030995235,0.0011254421,0.4937196,0.28712395,0.0073287543,0.039204255,0.00026265456],"about_ca_topic_score_codex":0.0027184892,"about_ca_topic_score_gemma":0.002457017,"teacher_disagreement_score":0.003065389,"about_ca_system_score_codex":0.0006865093,"about_ca_system_score_gemma":0.00047768012,"threshold_uncertainty_score":0.0108501315},"labels":[],"label_agreement":null},{"id":"W4321604103","doi":"10.1016/j.bspc.2023.104711","title":"Nearly-lossless-to-lossy medical image compression by the optimized JPEGXT and JPEG algorithms through the anatomical regions of interest","year":2023,"lang":"en","type":"article","venue":"Biomedical Signal Processing and Control","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Saskatchewan","funders":"","keywords":"JPEG; Region of interest; Lossy compression; JPEG 2000; Lossless compression; Computer science; Artificial intelligence; Computer vision; DICOM; Image compression; Distortion (music); Discrete cosine transform; Mathematics; Algorithm; Data compression; Image (mathematics); Image processing","score_opus":0.02700972201706286,"score_gpt":0.30786167587847413,"score_spread":0.28085195386141126,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4321604103","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08445,0.0020446698,0.90409076,0.000590576,0.00012858752,0.00012175618,0.0005342848,0.0008810069,0.007158418],"genre_scores_gemma":[0.48990574,0.0038691761,0.48480472,0.0004870307,0.00013856859,0.00010466491,0.0008248895,0.00043414187,0.019431114],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9999032,0.000016332186,0.000007582535,0.000013661261,0.00004864089,0.000010494089],"domain_scores_gemma":[0.99983907,0.000041620144,0.000023069,0.00003967337,0.000046645786,0.0000099244935],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027074362,0.00039802218,0.00017430035,0.0003721077,0.00012490609,0.00047500595,0.00029291923,0.00029638264,0.0022978047],"category_scores_gemma":[0.0011194588,0.00019103145,0.00021387367,0.0004939024,0.00027468216,0.0006498936,0.00041126626,0.0003985203,0.00065113604],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00076076196,0.00009647793,0.0016717247,0.0004141678,0.00007542009,0.00042068356,0.0001903118,0.041917533,0.37833485,0.03923769,0.008580712,0.52829975],"study_design_scores_gemma":[0.000104780345,0.0004600203,0.01751583,0.00015413719,0.0001394483,0.00641145,0.0000924767,0.43034932,0.4906987,0.019533405,0.03445733,0.00008318313],"about_ca_topic_score_codex":0.000994865,"about_ca_topic_score_gemma":0.0016965889,"teacher_disagreement_score":0.0022978047,"about_ca_system_score_codex":0.00016469347,"about_ca_system_score_gemma":0.00055049063,"threshold_uncertainty_score":0.0076869726},"labels":[],"label_agreement":null},{"id":"W4360989108","doi":"10.18280/ria.370121","title":"Feature Extraction and Classification Techniques for Wireless Endoscopy Images: A Review","year":2023,"lang":"en","type":"review","venue":"Revue d intelligence artificielle","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Computer science; Feature extraction; Wireless; Artificial intelligence; Extraction (chemistry); Pattern recognition (psychology); Computer vision; Telecommunications; Chromatography; Chemistry","score_opus":0.12414991430863698,"score_gpt":0.41316773030267495,"score_spread":0.289017815994038,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4360989108","genre_codex":"review","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":"review","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0043687387,0.937852,0.051461622,0.0010238993,0.0007502725,0.000091623224,0.0002504989,0.00035068148,0.0038505886],"genre_scores_gemma":[0.025297413,0.9228745,0.04526177,0.00049639575,0.0011230122,0.00013543581,0.0009501952,0.000081782564,0.0037795773],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99932575,0.00007226443,0.00013358063,0.00018529446,0.00024505705,0.000038137594],"domain_scores_gemma":[0.9982514,0.0009910794,0.00014266692,0.00006988177,0.0005111306,0.00003387845],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014101859,0.0011053433,0.0010246577,0.0031409645,0.0003102988,0.0011194588,0.0014587701,0.0008949899,0.0023883632],"category_scores_gemma":[0.0031630218,0.0004856724,0.0015096212,0.0043251053,0.00052202673,0.0020668595,0.00048275336,0.0009877788,0.001655553],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005062429,0.00008048,0.00075529737,0.0040110257,0.000107162625,0.00011648934,0.00008378755,0.0011802587,0.0020452784,0.0015911155,0.010755611,0.9792228],"study_design_scores_gemma":[0.00005057793,0.0010617778,0.015926387,0.0073839677,0.0010695478,0.005454181,0.0005756936,0.029582651,0.018673697,0.009383476,0.91047066,0.00036739002],"about_ca_topic_score_codex":0.0031766014,"about_ca_topic_score_gemma":0.001533455,"teacher_disagreement_score":0.0031766014,"about_ca_system_score_codex":0.0005028107,"about_ca_system_score_gemma":0.0007436954,"threshold_uncertainty_score":0.007989883},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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)","score_opus":0.03983839414224543,"score_gpt":0.3206039082887734,"score_spread":0.28076551414652795,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4376112629","genre_codex":"methods","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019248461,0.45869887,0.50513744,0.0014239936,0.00036920756,0.00018479358,0.00029149957,0.00068408303,0.013961706],"genre_scores_gemma":[0.21011949,0.5719869,0.20098749,0.0011750809,0.002342594,0.0002403146,0.0014864653,0.00029760713,0.011364092],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.999363,0.00008561497,0.00005535246,0.000094899166,0.0003727829,0.00002830491],"domain_scores_gemma":[0.9983454,0.0010865217,0.00009749675,0.0001447409,0.00029305046,0.000032913766],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011380629,0.0007724955,0.0012671123,0.0013511465,0.00021793721,0.001274061,0.0013665975,0.0009965986,0.002137955],"category_scores_gemma":[0.0034006177,0.000447107,0.00046081364,0.0021301645,0.0005425675,0.002015116,0.0008474834,0.0009800274,0.0009925866],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007988081,0.00016850333,0.0007431291,0.0013093132,0.000066404704,0.000046686313,0.000036618203,0.021488007,0.0040439893,0.007866676,0.0045171436,0.95963365],"study_design_scores_gemma":[0.00007531987,0.0011355702,0.0050861915,0.0012329719,0.00023452059,0.0025576905,0.0001908307,0.74783933,0.043491725,0.051618118,0.1463974,0.00014030826],"about_ca_topic_score_codex":0.00066917826,"about_ca_topic_score_gemma":0.0006566519,"teacher_disagreement_score":0.002137955,"about_ca_system_score_codex":0.00043114342,"about_ca_system_score_gemma":0.00060166646,"threshold_uncertainty_score":0.0071521997},"labels":[],"label_agreement":null},{"id":"W4379523021","doi":"10.21428/594757db.05a13011","title":"PCA-Enhanced Autoencoders for Nonlinear Dimensionality Reduction in Low Data Regimes","year":2023,"lang":"en","type":"article","venue":"","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"National Research Council Canada","funders":"","keywords":"Dimensionality reduction; Principal component analysis; Reduction (mathematics); Computer science; Curse of dimensionality; Nonlinear system; Pattern recognition (psychology); Artificial intelligence; Data mining; Data reduction; Dimensional reduction; Machine learning; Mathematics; Physics","score_opus":0.06154594188134382,"score_gpt":0.35309716286279197,"score_spread":0.29155122098144814,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4379523021","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014445273,0.0006978419,0.98244214,0.00022588504,0.00006942295,0.00003097833,0.00010147248,0.0006260078,0.0013609665],"genre_scores_gemma":[0.3073693,0.0018967949,0.6826942,0.00025732734,0.00017593257,0.0001892822,0.00090415665,0.00019791877,0.0063151647],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99948114,0.00012861955,0.000044082157,0.0001041425,0.00020202936,0.00003994823],"domain_scores_gemma":[0.998804,0.0006258717,0.000077454984,0.0002008244,0.00026729604,0.000024552815],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009626797,0.00089759636,0.0005920595,0.00063948723,0.00031079593,0.0005629124,0.00054554956,0.00063616666,0.0015728112],"category_scores_gemma":[0.003255029,0.0003239577,0.0006409578,0.000911161,0.00060259213,0.001095042,0.0007596506,0.0016003959,0.0008793008],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020021401,0.0001595142,0.0014345158,0.00023007851,0.00017313681,0.0001879189,0.00017824069,0.33356598,0.05131114,0.02501388,0.0068380064,0.5807073],"study_design_scores_gemma":[0.000006441206,0.000035661138,0.0006525119,0.000015994923,0.000015833484,0.00006284173,0.000014318762,0.97860515,0.011967887,0.0057454593,0.0028630574,0.000014937883],"about_ca_topic_score_codex":0.00221703,"about_ca_topic_score_gemma":0.0033202798,"teacher_disagreement_score":0.00221703,"about_ca_system_score_codex":0.00032398335,"about_ca_system_score_gemma":0.00070206606,"threshold_uncertainty_score":0.0052616},"labels":[],"label_agreement":null},{"id":"W4385080004","doi":"10.1109/iscas46773.2023.10182105","title":"Multi-Task Learning for Screen Content Image Coding","year":2023,"lang":"en","type":"article","venue":"","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Codec; Computer science; Encoder; Segmentation; Artificial intelligence; Coding (social sciences); Image segmentation; Computer vision; Task (project management); Representation (politics); Engineering; Computer hardware","score_opus":0.10203391618997015,"score_gpt":0.34371073780190486,"score_spread":0.2416768216119347,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4385080004","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.034363035,0.00057751546,0.9621025,0.00039583587,0.000059105078,0.000079298195,0.00013656063,0.0008903955,0.0013957988],"genre_scores_gemma":[0.7607854,0.00038584016,0.22995351,0.00043938274,0.00017539167,0.00029174532,0.0008040249,0.0001584589,0.00700631],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993774,0.00019537263,0.000028357303,0.00016408357,0.00013636905,0.000098414515],"domain_scores_gemma":[0.99735874,0.0016798589,0.00016480194,0.000267698,0.00040619605,0.00012273593],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014559473,0.00079640356,0.0007654743,0.0006391509,0.0003477313,0.00066815194,0.0013438994,0.0014472344,0.0022906577],"category_scores_gemma":[0.005494134,0.00029448787,0.0006163979,0.0007800232,0.00080041605,0.0012218766,0.0012020837,0.001959108,0.0008070309],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00047801263,0.00039887932,0.0011556003,0.00021519985,0.00007987067,0.00014007917,0.0001532478,0.54643244,0.011459958,0.010354039,0.0056918385,0.42344075],"study_design_scores_gemma":[0.000006759691,0.000027596865,0.00009453373,0.0000033429726,0.0000030886085,0.000011453553,0.0000069823527,0.99510455,0.0015274936,0.0029934468,0.00021681808,0.000003859204],"about_ca_topic_score_codex":0.0053369594,"about_ca_topic_score_gemma":0.004132321,"teacher_disagreement_score":0.0053369594,"about_ca_system_score_codex":0.000918884,"about_ca_system_score_gemma":0.00096547016,"threshold_uncertainty_score":0.010611832},"labels":[],"label_agreement":null},{"id":"W4385999394","doi":"10.1007/s00500-023-09106-8","title":"A development of coordinate-based fuzzy encoding algorithm in compression of grayscale images","year":2023,"lang":"en","type":"article","venue":"Soft Computing","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Grayscale; Color Cell Compression; Pixel; Lossy compression; Artificial intelligence; Computer vision; Computer science; Image compression; Algorithm; Block (permutation group theory); Data compression; Block Truncation Coding; Encoding (memory); Mathematics; Image processing; Image (mathematics)","score_opus":0.022834590239512013,"score_gpt":0.2969881383370278,"score_spread":0.2741535480975158,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4385999394","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01247068,0.00056672015,0.9840461,0.000089994894,0.00009295557,0.000047552505,0.00004285335,0.00042297604,0.0022202288],"genre_scores_gemma":[0.1620334,0.0010964648,0.8319888,0.000080569764,0.000091019654,0.00007447827,0.00016899209,0.000052142826,0.0044141375],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998147,0.000024760175,0.000013379576,0.00003773784,0.00009857389,0.000010949364],"domain_scores_gemma":[0.9997588,0.00004493232,0.000015748965,0.000029231749,0.00014180112,0.000009510218],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021922246,0.0002929801,0.00034432873,0.0006336497,0.0002889181,0.00045940795,0.00057120575,0.00040346844,0.0016883342],"category_scores_gemma":[0.0006222545,0.00013774575,0.0002857971,0.0008210052,0.0002529853,0.00068619725,0.0002364625,0.00045459252,0.0005053684],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018223438,0.0000789914,0.0007734277,0.00021315702,0.00003919262,0.00022614251,0.00014593355,0.03550365,0.16996245,0.03969763,0.0034225518,0.74975455],"study_design_scores_gemma":[0.000031988096,0.00023260665,0.001156656,0.000039625855,0.000050421182,0.0007926026,0.00005461801,0.83785856,0.14043923,0.0047307657,0.01456906,0.000043881613],"about_ca_topic_score_codex":0.0025860402,"about_ca_topic_score_gemma":0.0015009843,"teacher_disagreement_score":0.0025860402,"about_ca_system_score_codex":0.00025970017,"about_ca_system_score_gemma":0.00047100557,"threshold_uncertainty_score":0.005648017},"labels":[],"label_agreement":null},{"id":"W4386243171","doi":"10.1109/crv60082.2023.00039","title":"Hyperspectral Image Compression Using Implicit Neural Representations","year":2023,"lang":"en","type":"article","venue":"","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Ontario Tech University","funders":"","keywords":"Pixel; Hyperspectral imaging; JPEG; Artificial intelligence; Computer science; Computer vision; Image compression; JPEG 2000; Pattern recognition (psychology); Artificial neural network; Data compression; Image (mathematics); Image processing","score_opus":0.048402227457871316,"score_gpt":0.3706147091708644,"score_spread":0.3222124817129931,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4386243171","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.030874847,0.00025068165,0.9642996,0.00027786885,0.00006353336,0.00003945862,0.000096858144,0.0010193695,0.003077742],"genre_scores_gemma":[0.38557464,0.0006500157,0.6033371,0.00024842372,0.00011634129,0.00013549603,0.00064556825,0.00019399046,0.009098353],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9996644,0.000057094352,0.0000195678,0.00005909127,0.0001703268,0.000029512054],"domain_scores_gemma":[0.9994646,0.00016351893,0.00006760206,0.00014777623,0.00014296119,0.000013620073],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00048488998,0.000525981,0.00036893628,0.0005114153,0.00021345972,0.0006577621,0.0009262661,0.0005308664,0.0018062107],"category_scores_gemma":[0.0021067616,0.00023487456,0.00039662927,0.00068550475,0.00050926424,0.0019524614,0.0009015017,0.0011605595,0.00050367345],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00028000202,0.00015941517,0.00048350627,0.00012952887,0.000058234757,0.00013705787,0.00013835906,0.3127057,0.06564209,0.033211704,0.003909835,0.58314466],"study_design_scores_gemma":[0.000008134055,0.000022281009,0.00015017588,0.0000073986726,0.0000050951444,0.000040855786,0.000009628325,0.97917706,0.0142122675,0.0049808505,0.0013784391,0.000007811009],"about_ca_topic_score_codex":0.0017021173,"about_ca_topic_score_gemma":0.0024509425,"teacher_disagreement_score":0.0018062107,"about_ca_system_score_codex":0.00051313563,"about_ca_system_score_gemma":0.00044063336,"threshold_uncertainty_score":0.0060423613},"labels":[],"label_agreement":null},{"id":"W4386310553","doi":"10.2139/ssrn.4557549","title":"Enhanced Residual Swinv2 Transformer for Learned Image Compression","year":2023,"lang":"en","type":"preprint","venue":"SSRN Electronic Journal","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Residual; Transformer; Image compression; Computer science; Computer vision; Artificial intelligence; Environmental science; Image (mathematics); Electrical engineering; Image processing; Engineering; Algorithm; Voltage","score_opus":0.03359863346220957,"score_gpt":0.3339601558951198,"score_spread":0.3003615224329102,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4386310553","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.028940903,0.00037639818,0.96181536,0.0001571613,0.0001557602,0.000051277537,0.0003252409,0.0020128102,0.0061650523],"genre_scores_gemma":[0.5424969,0.0006721765,0.4283852,0.0002843928,0.00014333878,0.000074655516,0.0014265713,0.0005739219,0.025942817],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998022,0.000028396098,0.000009017667,0.000028540097,0.00010663288,0.000025196108],"domain_scores_gemma":[0.99978834,0.000044199278,0.000011587889,0.00006309314,0.00007742905,0.00001531322],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027861446,0.00061532966,0.0003228893,0.00042822192,0.00014864716,0.00055768574,0.00046368982,0.00046241225,0.009699151],"category_scores_gemma":[0.00072680437,0.00013401188,0.00027782586,0.00044679575,0.00025715155,0.00062882865,0.00063391216,0.0005523852,0.0028962425],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000865423,0.00013023907,0.00053346506,0.00020581567,0.000039440103,0.00023690051,0.000058821595,0.021601412,0.22296193,0.016230969,0.00799976,0.72913575],"study_design_scores_gemma":[0.000052884847,0.000309009,0.00089976593,0.000035695604,0.000048748017,0.0011082065,0.000055781464,0.5980941,0.3702819,0.0069210245,0.02216314,0.000029760611],"about_ca_topic_score_codex":0.0009083032,"about_ca_topic_score_gemma":0.0016965144,"teacher_disagreement_score":0.009699151,"about_ca_system_score_codex":0.00018761183,"about_ca_system_score_gemma":0.00040958755,"threshold_uncertainty_score":0.03244686},"labels":[],"label_agreement":null},{"id":"W4388135218","doi":"10.21275/sr231026061252","title":"An Evaluation of a Haar Cascade Classifiers using Multi-Resolution Images and Multi-Threading Resources on a Raspberry Pi","year":2023,"lang":"en","type":"article","venue":"International Journal of Science and Research (IJSR)","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Kwantlen Polytechnic University","funders":"","keywords":"Haar-like features; Raspberry pi; Threading (protein sequence); Cascade; Computer science; Artificial intelligence; Haar; Pattern recognition (psychology); Resolution (logic); Physics; World Wide Web; Chromatography; Chemistry; Internet of Things","score_opus":0.26888843571604737,"score_gpt":0.5146405240653702,"score_spread":0.24575208834932283,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4388135218","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.86595005,0.0036268453,0.11787181,0.00048989756,0.0006898384,0.00030547098,0.00046080138,0.0034811639,0.007124139],"genre_scores_gemma":[0.94875556,0.00052529265,0.047696512,0.00008784164,0.000049554055,0.0000667184,0.0004900187,0.00008389425,0.0022445745],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984162,0.00023441005,0.00012273375,0.0003575037,0.000687896,0.00018120301],"domain_scores_gemma":[0.99750096,0.00093076704,0.000129199,0.00021097687,0.0010770963,0.00015099911],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002453336,0.0011582032,0.0010052674,0.0010640951,0.00060668256,0.0010878604,0.0011429033,0.0012468636,0.0017407998],"category_scores_gemma":[0.0060203276,0.00034382124,0.00056201604,0.00067812554,0.0002609225,0.0012432892,0.00050787855,0.00086232874,0.0007580691],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0055222656,0.0013683682,0.0155926775,0.0006022207,0.0006026982,0.00046796046,0.00017664257,0.22303745,0.06484039,0.001059336,0.007785868,0.67894405],"study_design_scores_gemma":[0.000039360333,0.0010023866,0.007160831,0.000021932638,0.000080044825,0.00012094237,0.00006896454,0.9724401,0.018043831,0.00018368248,0.0008147981,0.000023038296],"about_ca_topic_score_codex":0.0133638475,"about_ca_topic_score_gemma":0.010635895,"teacher_disagreement_score":0.0133638475,"about_ca_system_score_codex":0.00076999667,"about_ca_system_score_gemma":0.0007916036,"threshold_uncertainty_score":0.026572108},"labels":[],"label_agreement":null},{"id":"W4389675231","doi":"10.1145/3637490","title":"Principal Component Approximation Network for Image Compression","year":2023,"lang":"en","type":"article","venue":"ACM Transactions on Multimedia Computing Communications and Applications","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Image compression; Computation; Computer science; Principal component analysis; Image (mathematics); Feature (linguistics); ENCODE; Set (abstract data type); Compression (physics); Artificial intelligence; Pattern recognition (psychology); Data compression; Component (thermodynamics); Algorithm; Image processing","score_opus":0.039394436473129166,"score_gpt":0.3352102663065216,"score_spread":0.29581582983339244,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4389675231","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012784371,0.0015456628,0.979887,0.00036885584,0.00014784833,0.000049298596,0.000120887766,0.0016018357,0.0034941374],"genre_scores_gemma":[0.5376805,0.0031897125,0.442546,0.0005468718,0.00033072341,0.00023146704,0.0009496762,0.0003017486,0.014223349],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99971133,0.000050841107,0.000012327202,0.00005694151,0.00013575288,0.00003284578],"domain_scores_gemma":[0.9995915,0.0001436318,0.000036895224,0.00006371532,0.00014662177,0.000017595172],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046479728,0.00078710355,0.0006482509,0.00080192194,0.00029354938,0.0007375442,0.0010630378,0.00076887995,0.0027615828],"category_scores_gemma":[0.0019447893,0.00027719722,0.00042324455,0.00102461,0.0005422723,0.0014718839,0.00070199743,0.0015429858,0.0010117823],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00028483567,0.00011263207,0.0007064011,0.00015710568,0.000086537315,0.0001665731,0.00005957744,0.43426085,0.01668823,0.025754947,0.008913168,0.51280916],"study_design_scores_gemma":[0.000004117518,0.000023222583,0.0000923872,0.0000061078913,0.000009702692,0.00004613436,0.000004395055,0.99145657,0.0030027162,0.0037522141,0.0015970393,0.0000053456165],"about_ca_topic_score_codex":0.0032466191,"about_ca_topic_score_gemma":0.0031119417,"teacher_disagreement_score":0.0032466191,"about_ca_system_score_codex":0.0007370067,"about_ca_system_score_gemma":0.0006713286,"threshold_uncertainty_score":0.009238362},"labels":[],"label_agreement":null},{"id":"W4390270970","doi":"10.18280/ria.370607","title":"Randomized Information Hiding in RGB Images Using Genetic Algorithm and Huffman Coding","year":2023,"lang":"en","type":"article","venue":"Revue d intelligence artificielle","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Huffman coding; Computer science; Coding (social sciences); Tunstall coding; Artificial intelligence; Algorithm; RGB color model; Information hiding; Computer vision; Pattern recognition (psychology); Mathematics; Data compression; Image (mathematics); Statistics","score_opus":0.043326654397211124,"score_gpt":0.30934184794145453,"score_spread":0.2660151935442434,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4390270970","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07405516,0.0005615139,0.92035866,0.00015566438,0.000041255214,0.000064534164,0.00003758559,0.00077251834,0.003953095],"genre_scores_gemma":[0.5195479,0.0005618527,0.47620293,0.00006195608,0.000014243132,0.0000800219,0.000071955634,0.000043548498,0.0034155867],"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99978536,0.00004266649,0.0000089106225,0.00003164119,0.00011023594,0.00002118501],"domain_scores_gemma":[0.99984014,0.00006160769,0.00002907808,0.000020396275,0.000043881224,0.0000049193054],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002731682,0.0002844851,0.00031836357,0.00047144463,0.00020994093,0.00034551133,0.00039207315,0.0003906601,0.00069197896],"category_scores_gemma":[0.0006267856,0.00016249095,0.000404841,0.00054027466,0.00033199537,0.00053282775,0.0002326815,0.00033042513,0.00017132943],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002688563,0.0001432888,0.0014406014,0.00023106899,0.00009396794,0.0002450183,0.0002709834,0.46780127,0.1463056,0.022183102,0.0010142786,0.36000195],"study_design_scores_gemma":[0.000015313182,0.0000959602,0.00062011415,0.000017773364,0.0000209302,0.00014148832,0.000025101202,0.95927733,0.036012802,0.0024226862,0.0013318568,0.000018591116],"about_ca_topic_score_codex":0.0042494168,"about_ca_topic_score_gemma":0.0039809765,"teacher_disagreement_score":0.0042494168,"about_ca_system_score_codex":0.0005622454,"about_ca_system_score_gemma":0.0005795692,"threshold_uncertainty_score":0.008449376},"labels":[],"label_agreement":null},{"id":"W4390444746","doi":"10.18280/ts.400632","title":"Advancements in Lossless and Reversible Compression of Digital Pathology Images via Auto-Recursive Set Partitioning in Hierarchical Trees and Wavelet Decomposition","year":2023,"lang":"en","type":"article","venue":"Traitement du signal","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Universiti Kebangsaan Malaysia; Ministry of Higher Education, Malaysia","keywords":"Lossless compression; Set partitioning in hierarchical trees; Wavelet; Decomposition; Set (abstract data type); Compression (physics); Data compression; Computer science; Algorithm; Artificial intelligence; Wavelet transform; Pattern recognition (psychology); Mathematics; Discrete wavelet transform; Biology; Materials science","score_opus":0.01651306819133465,"score_gpt":0.29508825994257676,"score_spread":0.2785751917512421,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4390444746","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.046163704,0.0024121406,0.9476935,0.00026906334,0.00009143206,0.000060291986,0.00005525833,0.00037400087,0.0028805658],"genre_scores_gemma":[0.34914798,0.0032532657,0.6439714,0.00015182554,0.00014605878,0.000091051596,0.00026603823,0.00012604726,0.0028463749],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99925345,0.00017423547,0.000053355445,0.00009289377,0.00038953565,0.000036542016],"domain_scores_gemma":[0.9989728,0.0004318001,0.000100435645,0.00021908518,0.0002487338,0.000027232494],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010088553,0.0004011681,0.00036194993,0.00095206924,0.00027627035,0.0008289717,0.00064850337,0.00054702366,0.0010403983],"category_scores_gemma":[0.0024898008,0.00025876716,0.0006238222,0.0012210109,0.00056328,0.001116311,0.0006409923,0.0009710083,0.0005149816],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019484795,0.000116486815,0.0011425946,0.0003703034,0.000060266404,0.00026811953,0.0003893008,0.061233725,0.15703791,0.03491631,0.0020241505,0.742246],"study_design_scores_gemma":[0.00003480432,0.00060785114,0.0031304825,0.00012330638,0.00008358331,0.0015860322,0.00014932202,0.78212863,0.16699995,0.018428104,0.026627874,0.000100109246],"about_ca_topic_score_codex":0.000963121,"about_ca_topic_score_gemma":0.0009701562,"teacher_disagreement_score":0.0010403983,"about_ca_system_score_codex":0.00043748162,"about_ca_system_score_gemma":0.00051037053,"threshold_uncertainty_score":0.0053353906},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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)","score_opus":0.023827751028728156,"score_gpt":0.3132677874961801,"score_spread":0.289440036467452,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4390480875","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01749749,0.00041293324,0.9798957,0.00016298553,0.000035810404,0.000025475609,0.000057995574,0.00045981407,0.0014518203],"genre_scores_gemma":[0.5585434,0.0010336349,0.4308082,0.00038659028,0.000109476314,0.00011933125,0.0004962822,0.00020565567,0.008297537],"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99955446,0.000070590286,0.000029053255,0.000063110994,0.00023555041,0.00004722271],"domain_scores_gemma":[0.9994623,0.00016741913,0.000057152636,0.00015298954,0.00013370137,0.000026444091],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00075365946,0.00061304495,0.00053111766,0.0005393567,0.00022832221,0.00070662645,0.0011201681,0.00060279836,0.0014800077],"category_scores_gemma":[0.0018381707,0.00020812586,0.00044580043,0.00044627918,0.00081953726,0.0018443001,0.0012836136,0.0015546868,0.00040843367],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003581359,0.000125093,0.00066530606,0.0001609053,0.00005993905,0.00022412108,0.0001855164,0.40525675,0.095389865,0.09755858,0.004659034,0.3953568],"study_design_scores_gemma":[0.0000101680325,0.000056637877,0.0001398096,0.000011739463,0.000010308289,0.00006526855,0.000013619275,0.9683508,0.01823379,0.011299266,0.0017970246,0.000011630313],"about_ca_topic_score_codex":0.001738097,"about_ca_topic_score_gemma":0.0022936708,"teacher_disagreement_score":0.001738097,"about_ca_system_score_codex":0.0005293021,"about_ca_system_score_gemma":0.00062391075,"threshold_uncertainty_score":0.0049511194},"labels":[],"label_agreement":null},{"id":"W4391344378","doi":"10.1016/j.jvcir.2024.104072","title":"Low-complexity ℓ∞-compression of light field images with a deep-decompression stage","year":2024,"lang":"lv","type":"article","venue":"Journal of Visual Communication and Image Representation","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"National Natural Science Foundation of China; H2020 Marie Skłodowska-Curie Actions; Innovative Research Group Project of the National Natural Science Foundation of China; Innovationsfonden","keywords":"Scalable Vector Graphics; Computer science; Computer graphics (images); World Wide Web","score_opus":0.03312612410471377,"score_gpt":0.39254932420687016,"score_spread":0.3594232001021564,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4391344378","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13717662,0.0011239814,0.84853995,0.0004873523,0.0002390639,0.00016709496,0.00042179384,0.0021109572,0.009733174],"genre_scores_gemma":[0.38603774,0.00056269555,0.59735376,0.0002052529,0.00014674025,0.00011390267,0.00071959256,0.00014224913,0.014718064],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99988496,0.000009272091,0.000007567364,0.000012309347,0.00006765649,0.000018242452],"domain_scores_gemma":[0.9998042,0.00006800713,0.000017681634,0.000041544656,0.00005507721,0.000013597949],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012368307,0.00057573005,0.00027465465,0.000427122,0.0002163511,0.0004225439,0.0004256664,0.00041758895,0.004424581],"category_scores_gemma":[0.0004570839,0.00015899936,0.0002120438,0.000440147,0.00024561642,0.00061457267,0.00054152054,0.00056860055,0.0011732331],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00073738396,0.00014133232,0.00055332604,0.00026419177,0.000032843847,0.0003043546,0.00012404741,0.0132416645,0.3690246,0.009118155,0.0047854832,0.60167265],"study_design_scores_gemma":[0.00011137029,0.00054323144,0.0021053297,0.0000710787,0.00005134172,0.0012495175,0.000098552744,0.48283914,0.48991466,0.00647475,0.016493723,0.000047329977],"about_ca_topic_score_codex":0.0011329472,"about_ca_topic_score_gemma":0.002540107,"teacher_disagreement_score":0.004424581,"about_ca_system_score_codex":0.00023836143,"about_ca_system_score_gemma":0.00051767123,"threshold_uncertainty_score":0.014801681},"labels":[],"label_agreement":null},{"id":"W4391470388","doi":"10.22541/essoar.170688945.51975465/v1","title":"Additional Supporting Information (Files uploaded separately) Captions for Tables S1 to Sx (if larger than 1 page, upload as separate file) Captions for Movies S1 to Sx Captions for Audio S1 to Sx","year":2024,"lang":"en","type":"preprint","venue":"","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Lockheed Martin (Canada)","funders":"","keywords":"Upload; Computer science; World Wide Web; Information retrieval; Multimedia; Database","score_opus":0.03100073009141991,"score_gpt":0.34850564649528715,"score_spread":0.31750491640386724,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4391470388","genre_codex":"dataset","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00028476698,0.00010406718,0.0029610605,0.00025709928,0.0006959979,0.0002243127,0.97532165,0.0050303065,0.015120697],"genre_scores_gemma":[0.0028441655,0.00032038405,0.009567323,0.000493078,0.00035637442,0.0011240501,0.94533736,0.007826653,0.03213064],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9989256,0.00010298163,0.000120233984,0.00033308854,0.00036807286,0.00014997649],"domain_scores_gemma":[0.99148166,0.0035314083,0.00045730965,0.0012858175,0.0024414249,0.0008024095],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0016242254,0.0021843154,0.002624828,0.0032920795,0.0017133445,0.002689553,0.0036043136,0.0017061301,0.95047045],"category_scores_gemma":[0.016373564,0.0017012237,0.0011273173,0.0068513793,0.00049588346,0.0034512496,0.0018937456,0.0028679045,0.71169627],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015139866,0.000087896755,0.0001342951,0.0005976238,0.000016286906,0.000024260129,0.000015103129,0.0001493242,0.0009304831,0.00062274066,0.989795,0.007475526],"study_design_scores_gemma":[0.001114873,0.00020194685,0.0049418937,0.00048515733,0.000065416956,0.00020461027,0.00014361728,0.0015359747,0.0057819583,0.007901783,0.97746265,0.0001601595],"about_ca_topic_score_codex":0.005576328,"about_ca_topic_score_gemma":0.009433674,"teacher_disagreement_score":0.049529552,"about_ca_system_score_codex":0.0012324596,"about_ca_system_score_gemma":0.0018654686,"threshold_uncertainty_score":0.070647836},"labels":[],"label_agreement":null},{"id":"W4391978843","doi":"10.1016/j.patrec.2025.05.001","title":"Multi-task convolution neural network-based lifting scheme for image compression","year":2025,"lang":"en","type":"article","venue":"Pattern Recognition Letters","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Novelis (Canada)","funders":"","keywords":"Convolution (computer science); Image compression; Computer science; Task (project management); Artificial intelligence; Artificial neural network; Image (mathematics); Compression (physics); Scheme (mathematics); Convolutional neural network; Data compression; Computer vision; Pattern recognition (psychology); Image processing; Algorithm; Mathematics; Mathematical analysis","score_opus":0.031048414289519658,"score_gpt":0.298761267802986,"score_spread":0.26771285351346635,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4391978843","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06375625,0.0006458747,0.9298322,0.00019236108,0.00024962315,0.00008147644,0.00013198926,0.0008109895,0.0042992025],"genre_scores_gemma":[0.5487132,0.00069065054,0.43927217,0.0001564946,0.00014778112,0.000110094996,0.00044373237,0.00005734516,0.0104085775],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998448,0.000018266683,0.000012471095,0.000021163469,0.000072845134,0.00003042153],"domain_scores_gemma":[0.9998387,0.000024630248,0.000014289248,0.000050856797,0.000056106346,0.000015286996],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002565183,0.00039319962,0.00038594034,0.0003814217,0.00031862257,0.00026766217,0.00048112386,0.00034852067,0.0033110722],"category_scores_gemma":[0.00047568724,0.00011035728,0.0002924022,0.0005721633,0.00019647654,0.0005509954,0.0005696179,0.0005700103,0.00076862023],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00065213983,0.00020490137,0.0005344737,0.0001584795,0.000041493957,0.00018623527,0.00006059138,0.03058842,0.20297001,0.011591722,0.0051086606,0.7479028],"study_design_scores_gemma":[0.000043704367,0.00029552248,0.0011766261,0.000033476146,0.000039504626,0.00044903375,0.000030220373,0.8744565,0.111700885,0.004146951,0.007597981,0.000029539553],"about_ca_topic_score_codex":0.0015103904,"about_ca_topic_score_gemma":0.0026041113,"teacher_disagreement_score":0.0033110722,"about_ca_system_score_codex":0.0001859839,"about_ca_system_score_gemma":0.0006047451,"threshold_uncertainty_score":0.011076629},"labels":[],"label_agreement":null},{"id":"W4392172639","doi":"10.1109/jsac.2024.3365886","title":"Semantically-Disentangled Progressive Image Compression for Deep Space Communications: Exploring the Ultra-low Rate Regime","year":2024,"lang":"en","type":"article","venue":"IEEE Journal on Selected Areas in Communications","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"Xiamen Southern Oceanographic Center; National Natural Science Foundation of China","keywords":"Computer science; Image compression; Data compression; Space (punctuation); Artificial intelligence; Computer vision; Image (mathematics); Image processing","score_opus":0.05587107475160344,"score_gpt":0.3515099658920929,"score_spread":0.29563889114048947,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4392172639","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0744319,0.0017518727,0.91547406,0.0006909931,0.00010459278,0.00006185586,0.00020902212,0.00071007264,0.0065655457],"genre_scores_gemma":[0.7851345,0.0018333431,0.20627846,0.00049589656,0.000106796804,0.00009259829,0.00053716655,0.00020434367,0.0053168717],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99974924,0.00004459095,0.000010556187,0.000038673516,0.00012807806,0.00002879557],"domain_scores_gemma":[0.9993444,0.00029223325,0.00006676695,0.000142075,0.00011974246,0.000034770987],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00059358,0.00062528084,0.00035639582,0.0004022771,0.00021376135,0.0007574438,0.0005639263,0.00049146294,0.0015086153],"category_scores_gemma":[0.0021838704,0.0001307562,0.00025198748,0.00045889322,0.0006876054,0.0015033617,0.0009595777,0.0015496432,0.00040912905],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00061273726,0.0002079762,0.0026004678,0.000318398,0.000085532454,0.00052568654,0.00029240618,0.3518259,0.14365782,0.06681162,0.0066792765,0.42638218],"study_design_scores_gemma":[0.000016787379,0.0001427424,0.0006291291,0.000035959,0.000018074941,0.00028794087,0.000050000654,0.9309728,0.0454488,0.017461054,0.0049137403,0.000023020237],"about_ca_topic_score_codex":0.00089790084,"about_ca_topic_score_gemma":0.0017696781,"teacher_disagreement_score":0.0015086153,"about_ca_system_score_codex":0.00034880856,"about_ca_system_score_gemma":0.00039683346,"threshold_uncertainty_score":0.0050468445},"labels":[],"label_agreement":null},{"id":"W4392305513","doi":"10.5220/0012488500003654","title":"PatchSVD: A Non-Uniform SVD-Based Image Compression Algorithm","year":2024,"lang":"en","type":"preprint","venue":"","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Lossy compression; Image compression; JPEG; Singular value decomposition; Computer science; Lossless compression; Data compression; Texture compression; Compression artifact; Compression (physics); Artificial intelligence; Algorithm; Data compression ratio; Computer vision; Image (mathematics); Image processing","score_opus":0.013832157792551416,"score_gpt":0.2979862851883155,"score_spread":0.28415412739576407,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4392305513","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015843214,0.00087316445,0.9786299,0.00013160515,0.00016580048,0.00012399456,0.00021362481,0.0026067453,0.0014119598],"genre_scores_gemma":[0.096774615,0.0006456711,0.8963868,0.00015216265,0.00010779786,0.0001301983,0.001042695,0.0002910176,0.00446908],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99955314,0.000040834333,0.00003173773,0.00007834903,0.0002658379,0.000030119572],"domain_scores_gemma":[0.99939895,0.00014493319,0.00005606878,0.00016697831,0.00019816328,0.000034892873],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00050296413,0.0005966122,0.00067222404,0.0012284331,0.0003221566,0.0007695892,0.0010479441,0.0006204105,0.002969063],"category_scores_gemma":[0.001530283,0.00024626078,0.00052313803,0.0011770468,0.00047178738,0.0009131483,0.0010837946,0.00087312807,0.0014753141],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004432108,0.000119810175,0.00086780195,0.00022219107,0.000086502434,0.0001751565,0.00008227713,0.021414416,0.089579985,0.0051822206,0.008983352,0.8728431],"study_design_scores_gemma":[0.00013888603,0.00052564614,0.0017466532,0.00003257671,0.00005486047,0.001228613,0.000068050234,0.81115735,0.1546991,0.0038492007,0.026442766,0.00005634874],"about_ca_topic_score_codex":0.001328214,"about_ca_topic_score_gemma":0.0016277257,"teacher_disagreement_score":0.002969063,"about_ca_system_score_codex":0.0003006112,"about_ca_system_score_gemma":0.00050663255,"threshold_uncertainty_score":0.009932458},"labels":[],"label_agreement":null},{"id":"W4392902789","doi":"10.1109/icassp48485.2024.10447420","title":"Efficient Learned Image Compression with Selective Kernel Residual Module and Channel-Wise Causal Context Model","year":2024,"lang":"en","type":"article","venue":"","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China; Google","keywords":"Computer science; Residual; Decoding methods; Encoding (memory); Kernel (algebra); Data compression; Image compression; Context (archaeology); Distortion (music); Artificial intelligence; Compression (physics); Algorithm; Rate–distortion theory; Image (mathematics); Pattern recognition (psychology); Theoretical computer science; Image processing; Mathematics; Bandwidth (computing)","score_opus":0.01848326567702807,"score_gpt":0.2827288535105807,"score_spread":0.2642455878335526,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4392902789","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.043885168,0.0005256937,0.9526459,0.00011619061,0.00003893361,0.00004348211,0.00006344475,0.0009506803,0.0017305855],"genre_scores_gemma":[0.72299004,0.0006126308,0.27112156,0.00019869456,0.0000794793,0.00010846669,0.0003244995,0.00012609191,0.0044386154],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99982375,0.000031007545,0.000008194664,0.000035086596,0.000075831085,0.000026100866],"domain_scores_gemma":[0.9998196,0.000043378615,0.00002305399,0.00003774202,0.00006162083,0.00001470052],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023664565,0.00053044886,0.00047292002,0.0004033629,0.0001723034,0.00029462043,0.00088105066,0.00041838508,0.0010922763],"category_scores_gemma":[0.0007423476,0.0001593875,0.00033257512,0.0004702552,0.000328557,0.0009504239,0.0006222397,0.00059444935,0.00026669266],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00030426696,0.00015833657,0.00092051865,0.00014966234,0.000075451215,0.00023869697,0.000108055065,0.33611086,0.08278207,0.01963393,0.0035581014,0.55596006],"study_design_scores_gemma":[0.0000073143146,0.000035013047,0.00014269384,0.0000037963207,0.000010527953,0.000061369865,0.000005876583,0.9868989,0.010835335,0.0013309012,0.00066104095,0.0000072290513],"about_ca_topic_score_codex":0.002823574,"about_ca_topic_score_gemma":0.003396349,"teacher_disagreement_score":0.002823574,"about_ca_system_score_codex":0.000315356,"about_ca_system_score_gemma":0.0005834341,"threshold_uncertainty_score":0.0056143403},"labels":[],"label_agreement":null},{"id":"W4398163706","doi":"10.1109/dcc58796.2024.00053","title":"Construction of Fast Data-driven Transforms for Image Compression via Multipath Coordinate Descent on Orthogonal Matrix Manifold","year":2024,"lang":"en","type":"article","venue":"","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"","keywords":"Coordinate descent; Discrete cosine transform; Computer science; Algorithm; Data compression; Image compression; Orthonormal basis; Orthogonal transformation; Gradient descent; Orthogonal matrix; Transform coding; Artificial intelligence; Computer vision; Mathematics; Image processing; Image (mathematics); Orthogonal basis","score_opus":0.028410981628839146,"score_gpt":0.33240539795948904,"score_spread":0.3039944163306499,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4398163706","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0072414526,0.000039116483,0.9921908,0.00003226164,0.000011705002,0.000019802068,0.000016023241,0.00017534838,0.00027356905],"genre_scores_gemma":[0.13074397,0.0001351479,0.8674365,0.000040216462,0.000027848526,0.00014709393,0.00021261953,0.000107404594,0.0011491999],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99974555,0.000064452564,0.000012271954,0.000042082844,0.000116533694,0.000019123429],"domain_scores_gemma":[0.9995441,0.00017640836,0.000039537834,0.00006578937,0.00014604501,0.0000280446],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00048449932,0.0007692028,0.0006948708,0.000604771,0.00029236375,0.00041873739,0.0005494598,0.0005924123,0.0011483693],"category_scores_gemma":[0.0020046378,0.000368613,0.0005786819,0.0006940346,0.00054946635,0.0007615878,0.000819616,0.00096550013,0.0005358921],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012763643,0.000107769374,0.0006998139,0.0001492066,0.000049729202,0.0002206843,0.00018951778,0.52461886,0.07728639,0.07671771,0.00377112,0.3160616],"study_design_scores_gemma":[0.00000730736,0.000035389858,0.00005373272,0.0000024472902,0.0000022536422,0.000035693287,0.000005541758,0.99051356,0.0046373587,0.003887331,0.0008137696,0.000005618157],"about_ca_topic_score_codex":0.0011413019,"about_ca_topic_score_gemma":0.0014655294,"teacher_disagreement_score":0.0011483693,"about_ca_system_score_codex":0.00040119104,"about_ca_system_score_gemma":0.000800439,"threshold_uncertainty_score":0.0038416982},"labels":[],"label_agreement":null},{"id":"W4398174344","doi":"10.1109/dcc58796.2024.00064","title":"Quantization of Content-adaptive Orthonormal Transforms using a Gauss-Markov Random Field Model for Images","year":2024,"lang":"en","type":"article","venue":"","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"","keywords":"Codebook; Linde–Buzo–Gray algorithm; Vector quantization; Algorithm; Transform coding; Mathematics; Computer science; Orthonormal basis; S transform; Discrete cosine transform; Artificial intelligence; Wavelet transform; Image (mathematics); Discrete wavelet transform","score_opus":0.07208484966164831,"score_gpt":0.3267275844294876,"score_spread":0.25464273476783933,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4398174344","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003247895,0.00029578636,0.9955284,0.00010156435,0.000027640706,0.000024211646,0.00006463468,0.00015320074,0.0005566647],"genre_scores_gemma":[0.41278884,0.0022425698,0.5751493,0.00021226393,0.00019150277,0.00024311962,0.0008971631,0.00015349075,0.008121721],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995615,0.00012522597,0.000020556143,0.00007397498,0.00018399181,0.00003475427],"domain_scores_gemma":[0.999313,0.00035212224,0.000061695246,0.00009292323,0.00016248006,0.000017743556],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00081863924,0.00040821062,0.00067045854,0.0005164972,0.00022100595,0.0006652967,0.0013148893,0.0007086725,0.0017686767],"category_scores_gemma":[0.0025927273,0.00025916123,0.0004628894,0.0010013612,0.0007112307,0.0011620579,0.00045653494,0.0011894205,0.0007910425],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001157649,0.00007328938,0.00031049893,0.000117364536,0.000024314497,0.00007127132,0.00007839876,0.7465996,0.0087473495,0.10632181,0.0041223457,0.13341801],"study_design_scores_gemma":[0.0000030170943,0.000012061082,0.000044202046,0.0000036509002,0.000002263856,0.0000129914,0.000002907694,0.99229336,0.00059104693,0.006565072,0.00046482793,0.000004606253],"about_ca_topic_score_codex":0.007926715,"about_ca_topic_score_gemma":0.009161369,"teacher_disagreement_score":0.007926715,"about_ca_system_score_codex":0.0008889604,"about_ca_system_score_gemma":0.000909159,"threshold_uncertainty_score":0.015761137},"labels":[],"label_agreement":null},{"id":"W4399911677","doi":"10.48550/arxiv.2406.14294","title":"DASB - Discrete Audio and Speech Benchmark","year":2024,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; Alliance de recherche numérique du Canada","keywords":"Benchmark (surveying); Speech recognition; Computer science; Geography; Cartography","score_opus":0.04544223868279033,"score_gpt":0.20832064122312585,"score_spread":0.16287840254033553,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4399911677","genre_codex":"empirical","genre_gemma":"dataset","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"dataset","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3920379,0.013901161,0.32189676,0.004274002,0.0042599933,0.002346451,0.14173913,0.064308584,0.055235945],"genre_scores_gemma":[0.4970284,0.0018756553,0.16249748,0.0011321659,0.0003936483,0.002218386,0.3113161,0.004115528,0.019422574],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99426466,0.0018072993,0.00052345067,0.0010927188,0.0018380567,0.0004738682],"domain_scores_gemma":[0.9943667,0.0023427673,0.00021831765,0.0014260951,0.0012201994,0.00042577652],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005597084,0.002700516,0.0016200884,0.0024479271,0.0009920823,0.0022653737,0.002925619,0.0025339916,0.009964703],"category_scores_gemma":[0.018191598,0.00043092496,0.0010858538,0.0023311367,0.0014194403,0.0025528253,0.0039983313,0.0026433254,0.009238746],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0054639913,0.002025245,0.008691399,0.0037767338,0.000676325,0.0009077085,0.0004006346,0.17264277,0.030084688,0.01529875,0.28902546,0.47100624],"study_design_scores_gemma":[0.0014895623,0.0027606532,0.014812299,0.00054361415,0.00020244818,0.0017271871,0.0010414479,0.7383884,0.07407168,0.04326812,0.121388,0.00030655233],"about_ca_topic_score_codex":0.0064409394,"about_ca_topic_score_gemma":0.0082776155,"teacher_disagreement_score":0.009964703,"about_ca_system_score_codex":0.001312144,"about_ca_system_score_gemma":0.002033873,"threshold_uncertainty_score":0.03333527},"labels":[],"label_agreement":null},{"id":"W4400114796","doi":"10.1109/i2mtc60896.2024.10561121","title":"Data Augmentation and Class Imbalance Compensation Using CTGAN to Improve Gas Detection Systems","year":2024,"lang":"en","type":"article","venue":"","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"École de Technologie Supérieure","funders":"","keywords":"Compensation (psychology); Class (philosophy); Computer science; Artificial intelligence; Psychology","score_opus":0.04672171981286508,"score_gpt":0.33707615718655576,"score_spread":0.29035443737369065,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400114796","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14671277,0.0007652887,0.84491754,0.00062646664,0.00032266398,0.00010179108,0.0004281304,0.002711623,0.003413778],"genre_scores_gemma":[0.8519873,0.00027862148,0.14371863,0.0003319996,0.000083672494,0.00012082623,0.0009922431,0.00013789107,0.002348909],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99962676,0.00009814098,0.000019925434,0.000093742834,0.000111977635,0.000049385624],"domain_scores_gemma":[0.99910057,0.00035752828,0.000097022945,0.00020214956,0.00021823127,0.00002453225],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010285563,0.00076792,0.00039096616,0.0004087055,0.00025771704,0.00047991556,0.0006373315,0.00043741823,0.0010454182],"category_scores_gemma":[0.003153399,0.00018926157,0.00041771398,0.00038670158,0.00052832504,0.0010667996,0.0009517541,0.0009946707,0.0004235249],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00066690176,0.00020898865,0.0057044765,0.00014017968,0.00010713207,0.00026352386,0.00024091432,0.52393174,0.081420675,0.007302969,0.005095271,0.37491736],"study_design_scores_gemma":[0.000009891635,0.00009625877,0.001046354,0.000013777227,0.000013804898,0.000068936875,0.000024576964,0.96441466,0.03008019,0.0023921137,0.0018244648,0.000014970378],"about_ca_topic_score_codex":0.0014612769,"about_ca_topic_score_gemma":0.0016656377,"teacher_disagreement_score":0.0014612769,"about_ca_system_score_codex":0.00043070037,"about_ca_system_score_gemma":0.00039451147,"threshold_uncertainty_score":0.0054395795},"labels":[],"label_agreement":null},{"id":"W4400275910","doi":"10.1109/lwc.2024.3422841","title":"Content-Aware Cross-Modal Stream Transmission","year":2024,"lang":"en","type":"article","venue":"IEEE Wireless Communications Letters","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Priority Academic Program Development of Jiangsu Higher Education Institutions; China Postdoctoral Science Foundation; National Natural Science Foundation of China","keywords":"Computer science; Transmission (telecommunications); Modal; Computer network; Telecommunications","score_opus":0.05226353412076621,"score_gpt":0.33223985804950185,"score_spread":0.2799763239287356,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400275910","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.050947387,0.0003455226,0.94549507,0.00013419404,0.00008045206,0.0000663752,0.000039847364,0.00078657863,0.002104548],"genre_scores_gemma":[0.8717242,0.0002710937,0.12496137,0.00015613009,0.00009268875,0.00008020808,0.00011591509,0.00009245852,0.0025060093],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994211,0.00012126762,0.0000331605,0.000113695285,0.00022211768,0.00008876428],"domain_scores_gemma":[0.9985996,0.0004520508,0.000175265,0.00026722325,0.00041558224,0.00009035422],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00071922754,0.0007088238,0.00061283115,0.0005533366,0.00057296007,0.00060028833,0.0011283084,0.00042660782,0.0017570105],"category_scores_gemma":[0.002092645,0.00023863385,0.00037313963,0.0005812687,0.00047422934,0.0011472983,0.0014340449,0.00077104225,0.0003649032],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012936068,0.00060834613,0.0026335523,0.0003146434,0.0001207548,0.00070922857,0.00051183323,0.33904967,0.23168196,0.022638144,0.0068447795,0.39359343],"study_design_scores_gemma":[0.000023454862,0.00011084827,0.0003065538,0.0000074971535,0.000016181702,0.00018150643,0.00004437689,0.97050065,0.024752837,0.0026644615,0.0013759119,0.000015789528],"about_ca_topic_score_codex":0.00095430063,"about_ca_topic_score_gemma":0.001344115,"teacher_disagreement_score":0.0017570105,"about_ca_system_score_codex":0.0005286703,"about_ca_system_score_gemma":0.00077946525,"threshold_uncertainty_score":0.005877733},"labels":[],"label_agreement":null},{"id":"W4400314741","doi":"10.1109/jsait.2024.3422011","title":"JPEG Compliant Compression for DNN Vision","year":2024,"lang":"en","type":"article","venue":"IEEE Journal on Selected Areas in Information Theory","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; Canada Research Chairs","keywords":"Computer science; JPEG; Compression (physics); Computer vision; JPEG 2000; Artificial intelligence; Image compression; Data compression; Image processing; Materials science; Image (mathematics); Composite material","score_opus":0.012691720190788503,"score_gpt":0.30502544438548407,"score_spread":0.29233372419469555,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400314741","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.020754876,0.002345235,0.9634985,0.00041162866,0.00043328467,0.00022613542,0.000867263,0.0024919491,0.008971076],"genre_scores_gemma":[0.2218094,0.0022095626,0.7645697,0.00046573704,0.00016183605,0.00021696433,0.002471602,0.00028266045,0.007812541],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9995173,0.00005042143,0.0000391929,0.00007471829,0.00028882377,0.000029545303],"domain_scores_gemma":[0.9994948,0.00010604475,0.000045230958,0.00013213349,0.00020457899,0.000017198674],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00070711144,0.00079165265,0.00031134873,0.00090163574,0.00029340808,0.0006742217,0.0009376393,0.00062425726,0.0040018326],"category_scores_gemma":[0.0023414597,0.00015835134,0.00030987873,0.00086937734,0.0004015423,0.0009895449,0.0005132948,0.0011171981,0.0013724981],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002701559,0.00011304147,0.0011288634,0.0004105788,0.00007287274,0.00025189584,0.000076520446,0.057653535,0.08382867,0.034308985,0.022328462,0.79955643],"study_design_scores_gemma":[0.000056442783,0.00020629911,0.0021239386,0.00011658979,0.00004558091,0.0008759919,0.000050219784,0.75584364,0.1708356,0.023438785,0.046354465,0.000052413496],"about_ca_topic_score_codex":0.0036761505,"about_ca_topic_score_gemma":0.0061355005,"teacher_disagreement_score":0.0040018326,"about_ca_system_score_codex":0.00071406784,"about_ca_system_score_gemma":0.00074239465,"threshold_uncertainty_score":0.013387442},"labels":[],"label_agreement":null},{"id":"W4400406036","doi":"10.36227/techrxiv.172047333.32287318/v1","title":"Quantization of KLT Matrices via GMRF Modeling of Image Blocks for Adaptive Transform Coding","year":2024,"lang":"en","type":"preprint","venue":"","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"","keywords":"Quantization (signal processing); Coding (social sciences); Computer science; Algorithm; Artificial intelligence; Mathematics; Computer vision; Pattern recognition (psychology); Statistics","score_opus":0.03718846228233142,"score_gpt":0.31962430832537925,"score_spread":0.28243584604304783,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400406036","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.001985337,0.0000597679,0.9972863,0.00007054439,0.000010247711,0.0000101321475,0.00003364119,0.00010079963,0.00044319284],"genre_scores_gemma":[0.16839981,0.0004055113,0.8278173,0.0001329805,0.00005545683,0.00011978868,0.00033766823,0.00019055951,0.0025408652],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99965155,0.00011113971,0.000016016369,0.000046248875,0.00015522822,0.000019828454],"domain_scores_gemma":[0.9992156,0.00037840946,0.00008182321,0.00015944014,0.00014011383,0.000024591482],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00074105733,0.00050106394,0.00037539494,0.00041391363,0.00018337148,0.00056125264,0.00077984156,0.0006493052,0.0018675462],"category_scores_gemma":[0.0035797972,0.00024136185,0.00042364458,0.0007049406,0.0006874596,0.0012689565,0.00058105483,0.0011732873,0.0007895074],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012549355,0.000057528327,0.0005059985,0.00016106729,0.000030781946,0.00010182946,0.00014534102,0.56390464,0.06023096,0.18030763,0.0039059112,0.19052278],"study_design_scores_gemma":[0.000004780486,0.000014580099,0.00007170276,0.000007931751,0.0000030796398,0.00003567544,0.0000071165423,0.9772933,0.0058105327,0.015209831,0.0015332948,0.00000813656],"about_ca_topic_score_codex":0.00214675,"about_ca_topic_score_gemma":0.0031923708,"teacher_disagreement_score":0.00214675,"about_ca_system_score_codex":0.0006199982,"about_ca_system_score_gemma":0.00061447633,"threshold_uncertainty_score":0.0062475204},"labels":[],"label_agreement":null},{"id":"W4401110103","doi":"10.1109/tsp63128.2024.10605936","title":"Zero-Bit Transmission of Adaptive Pre- and De-Emphasis Filters for Speech and Audio Coding","year":2024,"lang":"en","type":"article","venue":"","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Sherbrooke","funders":"","keywords":"Speech coding; Computer science; Emphasis (telecommunications); Coding (social sciences); Speech recognition; Sub-band coding; Codec2; Transmission (telecommunications); Adaptive Multi-Rate audio codec; Speech processing; Linear predictive coding; Voice activity detection; Electronic engineering; Telecommunications; Engineering; Mathematics","score_opus":0.020604201389468,"score_gpt":0.29907309571603835,"score_spread":0.27846889432657035,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4401110103","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10340328,0.0006328435,0.8934319,0.000073912925,0.0000945513,0.00004618379,0.000041126303,0.0005007324,0.0017754942],"genre_scores_gemma":[0.5922854,0.00069884595,0.40035322,0.00020153164,0.000076571276,0.000067834706,0.00018198838,0.00011265537,0.0060220826],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99981815,0.000036306134,0.000012795374,0.000029532699,0.00009205828,0.000011219871],"domain_scores_gemma":[0.9994578,0.00023004005,0.00005840474,0.00010043631,0.00013837242,0.000014984808],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032109566,0.00034913688,0.00020795803,0.00024282942,0.00017612855,0.00028238358,0.0004640427,0.00035512907,0.001179425],"category_scores_gemma":[0.0011801303,0.00015040067,0.00015437706,0.00016082682,0.00025293248,0.00048331433,0.00037829354,0.0004840661,0.0004489083],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00044089003,0.00007853949,0.0011196611,0.00015396699,0.00003518833,0.00017587055,0.000147345,0.011245565,0.61225104,0.0054100845,0.0007661121,0.36817577],"study_design_scores_gemma":[0.00003276019,0.0005047744,0.0036031178,0.00006865301,0.000077815355,0.0013089069,0.000048369944,0.34712234,0.63574076,0.00226844,0.009157625,0.00006654243],"about_ca_topic_score_codex":0.0003866822,"about_ca_topic_score_gemma":0.0008276425,"teacher_disagreement_score":0.001179425,"about_ca_system_score_codex":0.00017145101,"about_ca_system_score_gemma":0.00018864847,"threshold_uncertainty_score":0.003945589},"labels":[],"label_agreement":null},{"id":"W4401110567","doi":"10.1109/cai59869.2024.00022","title":"A Unified Approach for Binary-Class and Multi-Class Data Augmented Generation","year":2024,"lang":"en","type":"article","venue":"","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Trois-Rivières","funders":"National Science Foundation","keywords":"Class (philosophy); Computer science; Binary number; Binary data; Mathematics; Artificial intelligence; Arithmetic","score_opus":0.12722501386287285,"score_gpt":0.3486105551692555,"score_spread":0.22138554130638263,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4401110567","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0060443818,0.00018283323,0.99049956,0.00016351955,0.00006600011,0.000073909076,0.000069974034,0.0011243235,0.0017755441],"genre_scores_gemma":[0.30481312,0.0002650884,0.6878131,0.0005161151,0.00010627697,0.00042629943,0.00057151733,0.00031761653,0.0051708547],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9989557,0.00026874538,0.000046748537,0.00028042757,0.0003671237,0.00008117408],"domain_scores_gemma":[0.99903166,0.0002840997,0.00008571695,0.00034401135,0.0002027803,0.00005162996],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017287296,0.0008434288,0.00064580154,0.00082235853,0.0003953727,0.0011344953,0.0018121686,0.0011595726,0.0021944614],"category_scores_gemma":[0.0031554878,0.0004154405,0.0009144407,0.0006865312,0.0008399908,0.0018532058,0.0024688565,0.002668044,0.000743599],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019594081,0.00024004241,0.001529492,0.00015692555,0.00009912086,0.00022231948,0.00023289883,0.40722027,0.026256664,0.066300444,0.008233057,0.4893129],"study_design_scores_gemma":[0.0000098764185,0.000046829395,0.00018347987,0.000013393848,0.000009433082,0.00009429723,0.000012829126,0.9732713,0.0065259975,0.015824635,0.003992326,0.000015468253],"about_ca_topic_score_codex":0.0011754216,"about_ca_topic_score_gemma":0.0024771318,"teacher_disagreement_score":0.0021944614,"about_ca_system_score_codex":0.0007175304,"about_ca_system_score_gemma":0.00087565795,"threshold_uncertainty_score":0.009142518},"labels":[],"label_agreement":null},{"id":"W4401692002","doi":"10.1109/isit57864.2024.10619096","title":"Rate-Distortion-Perception Tradeoff for Lossy Compression Using Conditional Perception Measure","year":2024,"lang":"en","type":"article","venue":"","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University; University of Toronto","funders":"","keywords":"Lossy compression; Perception; Computer science; Measure (data warehouse); Data compression; Distortion (music); Compression (physics); Computer vision; Artificial intelligence; Data mining; Psychology; Telecommunications; Bandwidth (computing); Materials science","score_opus":0.0467049908055734,"score_gpt":0.3363420331425635,"score_spread":0.2896370423369901,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4401692002","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03185321,0.00214274,0.9607337,0.0005383471,0.000052916468,0.000037120128,0.00008868046,0.00024704085,0.004306298],"genre_scores_gemma":[0.88311327,0.0023955612,0.11051433,0.0003182383,0.00014013654,0.0001276979,0.00017734511,0.00022579188,0.002987714],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976139,0.0007926762,0.000101521,0.00032826277,0.00092610327,0.00023750208],"domain_scores_gemma":[0.9877679,0.009418651,0.00058782083,0.0011611077,0.00085078983,0.00021374619],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0045981393,0.0016480631,0.001203466,0.0008984062,0.00039408487,0.002066003,0.0020004278,0.0016801866,0.002119599],"category_scores_gemma":[0.019609015,0.00052334054,0.00049141515,0.0011267053,0.0018048416,0.006029651,0.002722857,0.0021161202,0.0005114453],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007667824,0.00013661705,0.0007495401,0.00045715045,0.000110805115,0.00042527824,0.0003127028,0.47394723,0.025895998,0.4187926,0.0020324446,0.07637276],"study_design_scores_gemma":[0.000021055766,0.00017254264,0.00029122306,0.000045612724,0.000024580888,0.00041988541,0.000039007336,0.905534,0.008252693,0.083899826,0.0012529732,0.000046535868],"about_ca_topic_score_codex":0.0005476747,"about_ca_topic_score_gemma":0.00032886193,"teacher_disagreement_score":0.0045981393,"about_ca_system_score_codex":0.0019015997,"about_ca_system_score_gemma":0.0007934641,"threshold_uncertainty_score":0.024317563},"labels":[],"label_agreement":null},{"id":"W4401878737","doi":"10.1109/tip.2024.3445737","title":"Fast and High-Performance Learned Image Compression With Improved Checkerboard Context Model, Deformable Residual Module, and Knowledge Distillation","year":2024,"lang":"en","type":"article","venue":"IEEE Transactions on Image Processing","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"National Alliance for Accessible Golf; Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Decoding methods; Computer science; Entropy (arrow of time); Entropy encoding; Residual; Context model; Artificial intelligence; Image compression; Data compression; Cross entropy; Algorithm; Checkerboard; Context (archaeology); Image processing; Pattern recognition (psychology); Image (mathematics); Mathematics","score_opus":0.014874100329704838,"score_gpt":0.2683706354828204,"score_spread":0.2534965351531156,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4401878737","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.029301662,0.0005664114,0.9645341,0.00027454356,0.00006322721,0.000052243522,0.0001336023,0.0024593198,0.0026149342],"genre_scores_gemma":[0.42893505,0.0006831919,0.56069064,0.0004024024,0.000105833744,0.000152647,0.0008501296,0.00023354085,0.007946609],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9997545,0.000028438104,0.000013061113,0.0000675337,0.000103560604,0.000032874083],"domain_scores_gemma":[0.99974376,0.00006807069,0.000027185344,0.00007636581,0.00006417902,0.00002041626],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033912022,0.0009013608,0.00062722154,0.00046795522,0.00027251034,0.0004986034,0.0014037336,0.00075425796,0.0019056803],"category_scores_gemma":[0.0011486378,0.00027938906,0.00041427265,0.00064906786,0.00042671827,0.0016621983,0.0011877782,0.0014399908,0.00068818004],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003215661,0.0001994592,0.0009621248,0.00015467657,0.0000795111,0.0002805826,0.000112493864,0.23005344,0.064029075,0.027610783,0.00713197,0.66906434],"study_design_scores_gemma":[0.000012954367,0.000034193414,0.00015294799,0.000006603949,0.000010655951,0.000062374755,0.000005822276,0.97146195,0.024252824,0.002651064,0.0013374591,0.000011078111],"about_ca_topic_score_codex":0.0040769335,"about_ca_topic_score_gemma":0.006097143,"teacher_disagreement_score":0.0040769335,"about_ca_system_score_codex":0.0004968333,"about_ca_system_score_gemma":0.0008739821,"threshold_uncertainty_score":0.0081064105},"labels":[],"label_agreement":null},{"id":"W4402307192","doi":"10.18280/ts.410448","title":"Low-Power Approximate SAD Design for Efficient Integer Motion Estimation in Video Compression","year":2024,"lang":"en","type":"article","venue":"Traitement du signal","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Integer (computer science); Estimation; Compression (physics); Data compression; Computer science; Motion estimation; Power (physics); Quarter-pixel motion; Artificial intelligence; Computer vision; Mathematics; Engineering; Materials science","score_opus":0.023138032460654375,"score_gpt":0.2901979003664025,"score_spread":0.2670598679057481,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4402307192","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.043554585,0.0013180869,0.9483708,0.00018650152,0.00014832303,0.00014029328,0.00011248827,0.0006858459,0.005483103],"genre_scores_gemma":[0.6458206,0.0007678042,0.34616572,0.00023823095,0.00008095353,0.00018940038,0.00026828857,0.000077457524,0.006391566],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99981385,0.000025878086,0.000013841743,0.00002987659,0.0000990973,0.000017559354],"domain_scores_gemma":[0.99980205,0.0000467406,0.000032854772,0.000015175493,0.000095958916,0.000007168874],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021710782,0.00040339888,0.00030695426,0.00035581543,0.00022298287,0.00060053007,0.0007166113,0.00028009052,0.0028785835],"category_scores_gemma":[0.00052013417,0.00016902045,0.00020879907,0.0002561683,0.00013311971,0.00039964775,0.00024577478,0.00034284373,0.00058381545],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00069895975,0.00021380988,0.0021025033,0.0007421519,0.00013379121,0.00040769865,0.00030651657,0.057304915,0.511202,0.016269444,0.0084212,0.40219703],"study_design_scores_gemma":[0.00011555318,0.0009935934,0.001392922,0.000077242476,0.00008158734,0.00085928326,0.00007225096,0.77097875,0.19404405,0.0014880885,0.029864723,0.000032005504],"about_ca_topic_score_codex":0.00091732916,"about_ca_topic_score_gemma":0.002656381,"teacher_disagreement_score":0.0028785835,"about_ca_system_score_codex":0.00043712894,"about_ca_system_score_gemma":0.00047941742,"threshold_uncertainty_score":0.009629786},"labels":[],"label_agreement":null},{"id":"W4402474330","doi":"10.1109/ccece59415.2024.10667302","title":"A Semantic Compression Framework for Video Surveillance Applications","year":2024,"lang":"en","type":"article","venue":"","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"École de Technologie Supérieure","funders":"","keywords":"Computer science; Data compression; Compression (physics); Artificial intelligence","score_opus":0.01927472077076458,"score_gpt":0.3351791018315817,"score_spread":0.31590438106081714,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4402474330","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0022560875,0.00029848467,0.99401915,0.00015002598,0.000035558118,0.00006321865,0.00016532646,0.0012270669,0.0017850883],"genre_scores_gemma":[0.14009914,0.001091994,0.85245776,0.00029680406,0.00016072052,0.00033977567,0.0012876538,0.0004013762,0.0038647729],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99938,0.00014055234,0.00004718323,0.00009349312,0.0002896372,0.000049153845],"domain_scores_gemma":[0.9993875,0.00020438757,0.00004225119,0.000119867356,0.00021067432,0.000035258385],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008887372,0.00092148315,0.00055519096,0.0011656998,0.00052236946,0.001286665,0.0012361294,0.0009079419,0.0029150872],"category_scores_gemma":[0.0019572256,0.00028046488,0.0009380991,0.0009400692,0.00083548547,0.0020918725,0.0011364942,0.001322067,0.0010295042],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003531603,0.00023227042,0.0007507648,0.00044070478,0.00009772111,0.00067573116,0.0004987811,0.2103481,0.038150996,0.31944463,0.01927009,0.40973705],"study_design_scores_gemma":[0.000026365224,0.000085876825,0.00030788418,0.000057015288,0.000043369524,0.0003873959,0.00007658816,0.8584016,0.01420218,0.09550114,0.030872362,0.00003830093],"about_ca_topic_score_codex":0.0043221386,"about_ca_topic_score_gemma":0.0037229413,"teacher_disagreement_score":0.0043221386,"about_ca_system_score_codex":0.0008243926,"about_ca_system_score_gemma":0.001017312,"threshold_uncertainty_score":0.009751916},"labels":[],"label_agreement":null},{"id":"W4402474923","doi":"10.1109/ccece59415.2024.10667112","title":"System-level design for DPCM Image Compression with SoC-FPGA Accelerator","year":2024,"lang":"en","type":"article","venue":"","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Lakehead University","funders":"Xilinx","keywords":"Field-programmable gate array; Computer science; Image compression; Compression (physics); Data compression; Embedded system; Computer hardware; Image (mathematics); Image processing; Artificial intelligence; Physics","score_opus":0.06357558409918174,"score_gpt":0.31530616757344226,"score_spread":0.2517305834742605,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4402474923","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1341554,0.0015991682,0.81401205,0.00034977062,0.00038939583,0.0006294172,0.0006431088,0.016086303,0.032135446],"genre_scores_gemma":[0.80419385,0.00033355257,0.18496743,0.00031210564,0.00005854434,0.00033289095,0.00058765383,0.00025035167,0.008963595],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99980575,0.000023541972,0.000015738444,0.00003463463,0.00007467317,0.000045643483],"domain_scores_gemma":[0.999811,0.000037038997,0.000021732074,0.000025751031,0.00008912962,0.000015390695],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017468687,0.00055219175,0.0002993188,0.00048293555,0.0002120628,0.00063412,0.0009026023,0.0003182965,0.0074449815],"category_scores_gemma":[0.0003537671,0.00015816589,0.00023924574,0.00032384438,0.00012177425,0.00033349902,0.00022121993,0.00039867725,0.0015712745],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0013950666,0.0003871829,0.004662343,0.0017684776,0.00025073878,0.001206395,0.00040551933,0.14189823,0.30658427,0.023500629,0.024930675,0.49301043],"study_design_scores_gemma":[0.00022141302,0.0014144923,0.0029404173,0.0001161376,0.00010687022,0.0009978501,0.00007901179,0.7495706,0.1860553,0.00273844,0.055699635,0.00005977693],"about_ca_topic_score_codex":0.0015017571,"about_ca_topic_score_gemma":0.0014984873,"teacher_disagreement_score":0.0074449815,"about_ca_system_score_codex":0.00050583587,"about_ca_system_score_gemma":0.0007822534,"threshold_uncertainty_score":0.02490592},"labels":[],"label_agreement":null},{"id":"W4402571484","doi":"10.1109/tcomm.2024.3462688","title":"Output-Constrained Lossy Source Coding With Application to Rate-Distortion-Perception Theory","year":2024,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Lossy compression; Rate–distortion theory; Computer science; Rate distortion; Electronic engineering; Coding (social sciences); Distortion (music); Perception; Algorithm; Mathematics; Data compression; Telecommunications; Engineering; Artificial intelligence; Statistics; Bandwidth (computing); Amplifier; Psychology","score_opus":0.02080988183123293,"score_gpt":0.293523723734041,"score_spread":0.27271384190280806,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4402571484","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00295493,0.00052655675,0.99272436,0.0003217405,0.000035123692,0.000013992252,0.000045200897,0.000059359503,0.003318791],"genre_scores_gemma":[0.7015003,0.004483196,0.28299165,0.00050344167,0.00044774765,0.0003036757,0.00032714492,0.00031597342,0.009126894],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99859565,0.00051097304,0.00007005389,0.00016505748,0.00057000434,0.00008829482],"domain_scores_gemma":[0.9955729,0.003097186,0.0003207211,0.00040308296,0.0005367141,0.00006940336],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002517738,0.0012367778,0.00087185396,0.0009442074,0.00028728184,0.001710853,0.0016111855,0.0011578894,0.002247707],"category_scores_gemma":[0.012558165,0.0004929138,0.0007759997,0.0013548299,0.002274653,0.0032223694,0.0028461707,0.0027141802,0.00050841377],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000058516875,0.00001893111,0.00015924507,0.00014290873,0.000032466774,0.00013259379,0.00012545218,0.218443,0.002390196,0.7557396,0.0014806703,0.021276409],"study_design_scores_gemma":[0.0000070304263,0.000023725857,0.00006679354,0.000029089024,0.000008362887,0.00010187072,0.000014679019,0.7488846,0.0012189805,0.2486123,0.0010134311,0.000019089022],"about_ca_topic_score_codex":0.0010796244,"about_ca_topic_score_gemma":0.0005062541,"teacher_disagreement_score":0.002517738,"about_ca_system_score_codex":0.0014754175,"about_ca_system_score_gemma":0.0008332632,"threshold_uncertainty_score":0.01331526},"labels":[],"label_agreement":null},{"id":"W4403483877","doi":"10.2139/ssrn.4990870","title":"Cic: Circular Image Compression","year":2024,"lang":"en","type":"preprint","venue":"SSRN Electronic Journal","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Image (mathematics); Compression (physics); Image compression; Computer science; Computer vision; Artificial intelligence; Image processing; Materials science; Composite material","score_opus":0.010292056062254064,"score_gpt":0.28769115699928244,"score_spread":0.27739910093702835,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403483877","genre_codex":"methods","genre_gemma":"software","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"software","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03422949,0.004126179,0.81486714,0.0017703733,0.0024178321,0.0006499546,0.0027700325,0.03390493,0.10526406],"genre_scores_gemma":[0.37269372,0.0022077828,0.47868684,0.001398829,0.0017655271,0.0007818085,0.008057278,0.0026397388,0.13176855],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99954236,0.00004167749,0.000023822311,0.00008471758,0.0002495168,0.000057922203],"domain_scores_gemma":[0.9993655,0.00014845906,0.000044585096,0.00020060263,0.00017977582,0.00006108479],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034706396,0.0010522652,0.0006379207,0.0015877511,0.00061452994,0.0014483954,0.00074756553,0.0009794086,0.027303843],"category_scores_gemma":[0.0015157091,0.0002446941,0.00028632127,0.0018588426,0.0006469073,0.0010789252,0.0014081863,0.0011597213,0.011351703],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00083734695,0.00013089561,0.00043562186,0.00032861507,0.000033984183,0.00036935665,0.00009934849,0.004176,0.047942948,0.062083755,0.12958565,0.75397646],"study_design_scores_gemma":[0.00042526436,0.00069066824,0.00320603,0.00023988032,0.000105552026,0.0039249123,0.00015026552,0.24734467,0.31180584,0.082093254,0.3499009,0.00011272436],"about_ca_topic_score_codex":0.0010974669,"about_ca_topic_score_gemma":0.00096405926,"teacher_disagreement_score":0.027303843,"about_ca_system_score_codex":0.00055922754,"about_ca_system_score_gemma":0.0007556857,"threshold_uncertainty_score":0.09134048},"labels":[],"label_agreement":null},{"id":"W4403701774","doi":"10.1101/2024.10.21.619417","title":"Visual objects refine head direction coding","year":2024,"lang":"en","type":"preprint","venue":"bioRxiv (Cold Spring Harbor Laboratory)","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"Schweizerischer Nationalfonds zur Förderung der Wissenschaftlichen Forschung","keywords":"Computer science; Coding (social sciences); Computer vision; Head (geology); Artificial intelligence; Computer graphics (images); Geology; Mathematics; Statistics","score_opus":0.017966768640685832,"score_gpt":0.27546411447585833,"score_spread":0.2574973458351725,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403701774","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9790623,0.00023641041,0.018808309,0.000033376735,0.000020367173,0.000010803904,0.00014659848,0.00017532846,0.0015064252],"genre_scores_gemma":[0.99048495,0.0001864931,0.007759382,0.000032601973,0.000011704429,0.000010919585,0.00016827068,0.00004837786,0.001297287],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.999941,0.000005657594,0.00000347577,0.000015424763,0.00002203458,0.000012465006],"domain_scores_gemma":[0.999777,0.000056216053,0.00006638123,0.000031448846,0.000047301703,0.000021577072],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000092518036,0.00018670705,0.00016083341,0.00029865268,0.0000645096,0.0004079362,0.0001841886,0.00018602418,0.0008839681],"category_scores_gemma":[0.00042796053,0.00013514256,0.0001127248,0.00020214274,0.0001844487,0.00031664787,0.00024032417,0.0002270581,0.0001706271],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005531412,0.000007359807,0.000770501,0.00001817993,0.00000368394,0.000017453165,0.000019869092,0.0005464569,0.9901878,0.0002763876,0.000059430495,0.00803752],"study_design_scores_gemma":[0.000020014819,0.000230573,0.11323901,0.000018206625,0.000024487452,0.00020160594,0.00006152482,0.031953875,0.85044706,0.0011028416,0.0026748392,0.000025975034],"about_ca_topic_score_codex":0.0006613381,"about_ca_topic_score_gemma":0.0005960867,"teacher_disagreement_score":0.0008839681,"about_ca_system_score_codex":0.00020930036,"about_ca_system_score_gemma":0.0001034616,"threshold_uncertainty_score":0.0029571652},"labels":[],"label_agreement":null},{"id":"W4403885729","doi":"10.48550/arxiv.2410.02942","title":"SymmetricDiffusers: Learning Discrete Diffusion on Finite Symmetric Groups","year":2024,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; Alliance de recherche numérique du Canada; Canadian Institute for Advanced Research; Vector Institute; University of British Columbia; Government of Canada","keywords":"Diffusion; Mathematics; Pure mathematics; Computer science; Statistical physics; Physics; Thermodynamics","score_opus":0.05034381625085413,"score_gpt":0.2124532152503545,"score_spread":0.16210939899950036,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403885729","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.038909677,0.00023195008,0.9574196,0.00050529354,0.000051884093,0.000064159285,0.00025105246,0.0009268647,0.0016394666],"genre_scores_gemma":[0.6661569,0.00053247914,0.32111698,0.0005769586,0.00015116921,0.0003750902,0.0015978572,0.00044824785,0.009044275],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993237,0.00022860765,0.00003671772,0.00019243406,0.00014113165,0.000077363555],"domain_scores_gemma":[0.9975827,0.001470927,0.00021278896,0.00035570917,0.00019716262,0.00018072466],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015946947,0.0008024353,0.000948883,0.00082628365,0.0004951198,0.0011264973,0.0021686752,0.0014740392,0.003173953],"category_scores_gemma":[0.007785294,0.000577986,0.0009157673,0.0007132255,0.0014861759,0.0034717612,0.00212316,0.0029059227,0.00083985756],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002803624,0.00016168469,0.002615498,0.00017079782,0.000068499874,0.00017004581,0.00022236715,0.62770253,0.0051165908,0.20732795,0.0067532496,0.14941043],"study_design_scores_gemma":[0.000012910231,0.000018022363,0.00006488784,0.0000063075404,0.000002563991,0.000015159081,0.00000766201,0.948326,0.000710055,0.050346907,0.00048347877,0.0000061413807],"about_ca_topic_score_codex":0.0025882453,"about_ca_topic_score_gemma":0.0038957794,"teacher_disagreement_score":0.003173953,"about_ca_system_score_codex":0.0013079995,"about_ca_system_score_gemma":0.001082227,"threshold_uncertainty_score":0.010617912},"labels":[],"label_agreement":null},{"id":"W4403943301","doi":"10.1007/978-3-031-72973-7_3","title":"WeConvene: Learned Image Compression with Wavelet-Domain Convolution and Entropy Model","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":19,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Computer science; Image compression; Wavelet; Convolution (computer science); Compression (physics); Entropy (arrow of time); Artificial intelligence; Algorithm; Image (mathematics); Image processing; Artificial neural network","score_opus":0.013091635755962167,"score_gpt":0.2565812821685409,"score_spread":0.24348964641257875,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403943301","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008164137,0.0006689035,0.9871454,0.0001429169,0.00009238557,0.000033620825,0.0001309541,0.0017576322,0.0018639658],"genre_scores_gemma":[0.23466216,0.0011241003,0.7471781,0.00026682997,0.0001925657,0.00013254299,0.0010523045,0.0007096657,0.014681732],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997863,0.00003273107,0.000010275958,0.000039770108,0.000110321336,0.000020610787],"domain_scores_gemma":[0.9997211,0.000118693526,0.000018948793,0.0000688913,0.00005600406,0.000016304843],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00055917504,0.0005834333,0.00076786254,0.00057205564,0.00019014209,0.00071287114,0.0010409976,0.00079470687,0.0035903633],"category_scores_gemma":[0.0013693986,0.00025656307,0.00048302076,0.0006849859,0.0005237572,0.0013126814,0.0009858819,0.0012766516,0.0009818962],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00024668928,0.00009520528,0.00027297682,0.00011558048,0.00007398265,0.00012139142,0.000034823235,0.18844502,0.01870551,0.039101288,0.010549653,0.7422379],"study_design_scores_gemma":[0.0000074739346,0.00002381976,0.000076142656,0.0000067086066,0.0000062979716,0.000057136327,0.0000023714374,0.98286855,0.007615559,0.0074862405,0.0018435286,0.000006128836],"about_ca_topic_score_codex":0.0020513663,"about_ca_topic_score_gemma":0.0022024717,"teacher_disagreement_score":0.0035903633,"about_ca_system_score_codex":0.0004761168,"about_ca_system_score_gemma":0.00049379276,"threshold_uncertainty_score":0.012010992},"labels":[],"label_agreement":null},{"id":"W4404349436","doi":"10.1109/mmsp61759.2024.10743660","title":"Synthetic Local Data Augmentation","year":2024,"lang":"en","type":"article","venue":"","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science","score_opus":0.04386647999921246,"score_gpt":0.34730522211153836,"score_spread":0.3034387421123259,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4404349436","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.27159432,0.0012582096,0.6956852,0.0009344243,0.0007413885,0.00040976328,0.01008111,0.011740655,0.007554886],"genre_scores_gemma":[0.6985956,0.00034261617,0.27616137,0.00044760786,0.00009856971,0.00041929798,0.019438071,0.0005977361,0.003899168],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99912244,0.00021209368,0.000052365463,0.00032508487,0.00021278435,0.00007512024],"domain_scores_gemma":[0.99764293,0.0007766105,0.00015076676,0.00082120573,0.00052641996,0.0000819943],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011082407,0.0012215414,0.00069893576,0.0007227551,0.00033215148,0.00092955667,0.0014942752,0.0010971021,0.0034696402],"category_scores_gemma":[0.0048065903,0.00041036846,0.0013412859,0.00090480223,0.00084174477,0.0011444967,0.001851833,0.0014954103,0.0015146278],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00093125965,0.00045306204,0.008712985,0.00059284945,0.00018492863,0.00037397034,0.0003287984,0.6952102,0.0423998,0.0042517367,0.015147616,0.23141272],"study_design_scores_gemma":[0.000020973432,0.0001371957,0.0019780765,0.00002744694,0.000020670455,0.0001412262,0.00008292686,0.9660063,0.0199655,0.0024760035,0.009113899,0.000029810682],"about_ca_topic_score_codex":0.0040676952,"about_ca_topic_score_gemma":0.005089452,"teacher_disagreement_score":0.0040676952,"about_ca_system_score_codex":0.00067884004,"about_ca_system_score_gemma":0.000729422,"threshold_uncertainty_score":0.0116071105},"labels":[],"label_agreement":null},{"id":"W4404849657","doi":"10.1109/iiswc63097.2024.00025","title":"Low-Bitwidth Floating Point Quantization for Efficient High-Quality Diffusion Models","year":2024,"lang":"en","type":"article","venue":"","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Vector Institute; University of Toronto","funders":"","keywords":"Quantization (signal processing); Computer science; Diffusion; Quality (philosophy); Algorithm; Physics; Thermodynamics","score_opus":0.03321944838472866,"score_gpt":0.32865313017798437,"score_spread":0.2954336817932557,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4404849657","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0161097,0.000653047,0.9791966,0.00031215517,0.00008495293,0.000027531143,0.00010655525,0.0013956017,0.002113837],"genre_scores_gemma":[0.5552282,0.0009004221,0.43903273,0.00032714827,0.000046266177,0.00010764496,0.0003431821,0.00039687305,0.0036175891],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99956244,0.00006415655,0.000035373185,0.000081778504,0.00021760254,0.000038639086],"domain_scores_gemma":[0.99926835,0.00027874782,0.00008325678,0.00014290764,0.0001982576,0.000028498538],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007938259,0.00061259844,0.00047158575,0.0004198424,0.00030275885,0.0009813883,0.0010291635,0.000739678,0.0037581334],"category_scores_gemma":[0.004272531,0.00025973906,0.000382101,0.00054445636,0.0005782171,0.0021196685,0.0007358901,0.0015958704,0.00076597853],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00025187407,0.00009145741,0.00089292176,0.00037494817,0.000047327358,0.00022446197,0.00026946844,0.55485016,0.07267111,0.09174618,0.00900562,0.2695745],"study_design_scores_gemma":[0.0000119533,0.000022334301,0.000080794314,0.0000186635,0.0000052343053,0.000047598554,0.000014087035,0.9735763,0.012559052,0.010915657,0.0027342532,0.000014046469],"about_ca_topic_score_codex":0.0032126612,"about_ca_topic_score_gemma":0.004160952,"teacher_disagreement_score":0.0037581334,"about_ca_system_score_codex":0.00082901074,"about_ca_system_score_gemma":0.00076261174,"threshold_uncertainty_score":0.012572229},"labels":[],"label_agreement":null},{"id":"W4405103966","doi":"10.1109/milcom61039.2024.10773846","title":"When URLLC is Worse than Rayleigh: Error Rates of Lomax Fading","year":2024,"lang":"en","type":"article","venue":"","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Sherbrooke","funders":"","keywords":"Fading; Rayleigh fading; Computer science; Statistics; Mathematics","score_opus":0.03964485110306866,"score_gpt":0.33464142288263315,"score_spread":0.2949965717795645,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4405103966","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.71575844,0.0016857192,0.26943725,0.00097479916,0.00014580095,0.00008318032,0.00040265074,0.00073026284,0.010781948],"genre_scores_gemma":[0.9965837,0.00023886695,0.0024920339,0.00006476511,0.00002964165,0.000017399689,0.000057033263,0.00002000779,0.000496443],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984244,0.00035529822,0.00005201185,0.0002987688,0.00041620337,0.0004532617],"domain_scores_gemma":[0.9918344,0.00546383,0.0011282038,0.00067304133,0.000762064,0.00013849618],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019772104,0.0007356878,0.00057163247,0.00071020686,0.0005343915,0.0010560121,0.00073824177,0.0010091696,0.0006500708],"category_scores_gemma":[0.01658988,0.00022495922,0.00018901053,0.0007811159,0.00151628,0.0020766992,0.001175167,0.0010840679,0.00022182592],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006135911,0.000103294034,0.038372386,0.00016851316,0.00008891968,0.0013877975,0.0005592309,0.8367592,0.01996495,0.058209077,0.002609764,0.04116332],"study_design_scores_gemma":[0.000019879786,0.00017736277,0.00906027,0.000051593954,0.00003255424,0.0007551495,0.00030440884,0.96243066,0.010711647,0.01523246,0.001158003,0.000066023036],"about_ca_topic_score_codex":0.002726031,"about_ca_topic_score_gemma":0.002294876,"teacher_disagreement_score":0.002726031,"about_ca_system_score_codex":0.00094241265,"about_ca_system_score_gemma":0.00065301004,"threshold_uncertainty_score":0.010456562},"labels":[],"label_agreement":null},{"id":"W4405253607","doi":"10.48550/arxiv.2412.05808","title":"SizeGS: Size-aware Compression of 3D Gaussian Splatting via Mixed Integer Programming","year":2024,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"National Natural Science Foundation of China; Institute for Catastrophic Loss Reduction","keywords":"Quantization (signal processing); Computer science; Compression (physics); Algorithm; Artificial intelligence; Materials science; Composite material","score_opus":0.04609057286614721,"score_gpt":0.2208535902280284,"score_spread":0.17476301736188118,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4405253607","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01274453,0.00021476326,0.9841399,0.00017018069,0.000026979884,0.000034968714,0.00007431361,0.0011290784,0.0014653043],"genre_scores_gemma":[0.27219236,0.00033676712,0.7231298,0.0002733921,0.00004675452,0.00015969267,0.00045752784,0.0006056798,0.0027979547],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995628,0.00008415684,0.000021472122,0.00006966555,0.0002200669,0.000041815616],"domain_scores_gemma":[0.99910396,0.0004878425,0.00008289278,0.00011609231,0.00016355723,0.000045603967],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00076498126,0.000754894,0.0005889303,0.00055605173,0.0002534759,0.0010412189,0.0009989452,0.00076730596,0.0023156824],"category_scores_gemma":[0.0025118804,0.00034002066,0.00048505524,0.0006048085,0.00070884614,0.0011043693,0.0013040862,0.0013564961,0.0005487415],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018473799,0.00008690693,0.0008710878,0.00012802823,0.00003525188,0.00012316302,0.00010270889,0.7045219,0.015859483,0.013841943,0.004607138,0.25963768],"study_design_scores_gemma":[0.0000050011135,0.00001010537,0.000038125127,0.000004440081,0.0000018868004,0.000015629443,0.0000059883355,0.9951166,0.0023372564,0.0019224178,0.00053922663,0.0000034374152],"about_ca_topic_score_codex":0.002723165,"about_ca_topic_score_gemma":0.003646867,"teacher_disagreement_score":0.002723165,"about_ca_system_score_codex":0.0007464052,"about_ca_system_score_gemma":0.0008149213,"threshold_uncertainty_score":0.0077466965},"labels":[],"label_agreement":null},{"id":"W4405441312","doi":"10.1109/tgrs.2024.3509718","title":"Hyperspectral Image Compression Using Sampling and Implicit Neural Representations","year":2024,"lang":"en","type":"article","venue":"IEEE Transactions on Geoscience and Remote Sensing","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Ontario Tech University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Hyperspectral imaging; Computer science; Artificial intelligence; Artificial neural network; Data compression; Pattern recognition (psychology); Compression (physics); Sampling (signal processing); Image (mathematics); Computer vision; Remote sensing; Geology","score_opus":0.034818449402598,"score_gpt":0.3323187623944224,"score_spread":0.2975003129918244,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4405441312","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1347955,0.00064586947,0.8598628,0.00025981455,0.00007809601,0.00006995489,0.00012080759,0.000976034,0.003191149],"genre_scores_gemma":[0.6661205,0.00056040665,0.32908455,0.00011850353,0.000065848544,0.000082673825,0.00034952693,0.00008986156,0.0035280706],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.999666,0.000059391587,0.000020270605,0.000041988533,0.000188316,0.000024094932],"domain_scores_gemma":[0.99938476,0.00020865505,0.00009546021,0.00013653612,0.00016085309,0.00001373519],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043197747,0.00043702227,0.00027976677,0.00050302764,0.00019050593,0.00044829166,0.0006249576,0.00036276312,0.000998751],"category_scores_gemma":[0.0019667512,0.00012835398,0.00021696648,0.0006262375,0.00040041312,0.0012810542,0.0005645012,0.0006061216,0.0002106359],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004937657,0.00020355446,0.0012222158,0.00019454949,0.000044582986,0.00020352825,0.0001879672,0.20910028,0.14236665,0.012421522,0.001994909,0.63156646],"study_design_scores_gemma":[0.000012671098,0.00010416617,0.0005824996,0.000015387459,0.00000957327,0.00017799473,0.00002444084,0.93842465,0.056862183,0.0023213008,0.0014516524,0.000013637851],"about_ca_topic_score_codex":0.0011722747,"about_ca_topic_score_gemma":0.0017652477,"teacher_disagreement_score":0.0011722747,"about_ca_system_score_codex":0.00037086869,"about_ca_system_score_gemma":0.00027428073,"threshold_uncertainty_score":0.003341198},"labels":[],"label_agreement":null},{"id":"W4405452372","doi":"10.5267/j.ijdns.2024.9.002","title":"Improved intensity rounding and division near lossless image compression algorithm using delta encoding","year":2024,"lang":"en","type":"article","venue":"International Journal of Data and Network Science","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Huffman coding; Lossless compression; Image compression; Computer science; Artificial intelligence; Algorithm; Row; Rounding; Pixel; Computer vision; Image processing; Data compression; Image (mathematics)","score_opus":0.040897360883620185,"score_gpt":0.3637341653492362,"score_spread":0.322836804465616,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4405452372","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08290342,0.0022442779,0.9024247,0.00034762695,0.00031460155,0.00016512773,0.00040936758,0.00409,0.00710084],"genre_scores_gemma":[0.3415643,0.0013654005,0.64077026,0.00040950664,0.00012103568,0.00017118845,0.0019393126,0.0002545545,0.013404461],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99959093,0.000025674673,0.00003234718,0.000054135853,0.00026280887,0.000034135763],"domain_scores_gemma":[0.99963796,0.000058730933,0.000034656903,0.00007517276,0.00017182111,0.0000215794],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030610999,0.000520586,0.00044493776,0.0012176359,0.00030422787,0.00086039596,0.0009199081,0.0003613697,0.0019352186],"category_scores_gemma":[0.0009488062,0.00017998938,0.00035848672,0.00088181114,0.0003027603,0.0011003845,0.00065951154,0.0007962408,0.00092811725],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00048638278,0.00012773964,0.0013375432,0.00018062706,0.000042436393,0.00037764432,0.00016805397,0.01952751,0.13543446,0.007076862,0.008070869,0.8271699],"study_design_scores_gemma":[0.00013011617,0.000561704,0.0022128092,0.000086741544,0.00007082489,0.002340921,0.00013609658,0.6437792,0.3080867,0.004471955,0.03801321,0.00010961478],"about_ca_topic_score_codex":0.0016563389,"about_ca_topic_score_gemma":0.0016397295,"teacher_disagreement_score":0.0019352186,"about_ca_system_score_codex":0.00043601068,"about_ca_system_score_gemma":0.0006733179,"threshold_uncertainty_score":0.0064739585},"labels":[],"label_agreement":null},{"id":"W4407248099","doi":"10.1109/wpmc63271.2024.10863726","title":"Image Compression for Communication: Topic Modelling of Scopus Abstracts Using BERTopic","year":2024,"lang":"en","type":"article","venue":"","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Artificial Intelligence in Medicine (Canada)","funders":"","keywords":"Scopus; Computer science; Information retrieval; Image compression; Compression (physics); Data compression; Image (mathematics); Natural language processing; Artificial intelligence; Data science; Image processing; MEDLINE","score_opus":0.0857019111088436,"score_gpt":0.35296043534540417,"score_spread":0.26725852423656055,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4407248099","genre_codex":"empirical","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.53552395,0.016463561,0.39932102,0.003725575,0.0004974497,0.001469185,0.015930172,0.0023565174,0.024712516],"genre_scores_gemma":[0.9007427,0.0044621723,0.07448826,0.00020238181,0.0003348328,0.00096199213,0.010412841,0.0001405456,0.008254249],"study_design_codex":"simulation_or_modeling","study_design_gemma":"not_applicable","domain_scores_codex":[0.99874437,0.0005255947,0.000118543874,0.0002536542,0.00024978953,0.000107933985],"domain_scores_gemma":[0.9926258,0.0059253788,0.00039931916,0.0002522101,0.000669151,0.00012808415],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003129351,0.0008768774,0.0007336351,0.0054719313,0.0005903685,0.0022392056,0.00094210106,0.000823673,0.0032525454],"category_scores_gemma":[0.011473205,0.00024279309,0.0018187359,0.00512555,0.00038836512,0.0016119357,0.0007352312,0.0007574834,0.000888943],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0013825778,0.0006639377,0.044020735,0.002649055,0.00091580197,0.00078859297,0.0019557148,0.49526235,0.0057348814,0.03252352,0.024257442,0.38984546],"study_design_scores_gemma":[0.00003728517,0.00015778859,0.011062091,0.000088205066,0.00012861575,0.00014461196,0.00030291924,0.97112155,0.0013380039,0.009171916,0.0064127366,0.00003432261],"about_ca_topic_score_codex":0.019140532,"about_ca_topic_score_gemma":0.015155767,"teacher_disagreement_score":0.019140532,"about_ca_system_score_codex":0.0016545604,"about_ca_system_score_gemma":0.0010652711,"threshold_uncertainty_score":0.03805828},"labels":[],"label_agreement":null},{"id":"W4408062700","doi":"10.5220/0013121200003905","title":"Hyperspectral Image Compression Using Implicit Neural Representation and Meta-Learned Based Network","year":2025,"lang":"en","type":"article","venue":"","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Ontario Tech University","funders":"","keywords":"Hyperspectral imaging; Computer science; Artificial intelligence; Compression (physics); Artificial neural network; Representation (politics); Image (mathematics); Image compression; Data compression; Computer vision; Pattern recognition (psychology); Image processing","score_opus":0.05741426364503136,"score_gpt":0.36649515196871923,"score_spread":0.30908088832368785,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4408062700","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.047524817,0.00058070093,0.947802,0.00031337098,0.00012236701,0.00003891396,0.00012352568,0.00065968104,0.0028346318],"genre_scores_gemma":[0.5484266,0.0006035768,0.44311044,0.000218879,0.00013786639,0.00011065068,0.00055645953,0.00012787759,0.006707672],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998466,0.000026695428,0.000009107043,0.000034221037,0.00006545931,0.000018027029],"domain_scores_gemma":[0.99968314,0.00009497902,0.000037008984,0.000076408665,0.00009687809,0.000011549039],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002974833,0.00046980268,0.0004280042,0.0004637597,0.0002500184,0.00052658474,0.0008481765,0.00056894583,0.0016212928],"category_scores_gemma":[0.0011969432,0.00019254189,0.00034787224,0.00072827074,0.00037122422,0.0013832742,0.0007287845,0.0011651625,0.00038812714],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00031680698,0.0002242862,0.0008930555,0.00014029724,0.00010122091,0.00016980502,0.00009542673,0.33163506,0.0474427,0.016309282,0.0041280626,0.598544],"study_design_scores_gemma":[0.000004417569,0.000020594542,0.00013370952,0.000005997012,0.000008033097,0.00003684534,0.0000065937575,0.9907211,0.0065552043,0.0019957344,0.000507117,0.0000045874776],"about_ca_topic_score_codex":0.0016475932,"about_ca_topic_score_gemma":0.0030088883,"teacher_disagreement_score":0.0016475932,"about_ca_system_score_codex":0.00030516906,"about_ca_system_score_gemma":0.00041942374,"threshold_uncertainty_score":0.0054237843},"labels":[],"label_agreement":null},{"id":"W4408352715","doi":"10.1109/icassp49660.2025.10890556","title":"Cross-Talk Detection in the IVAS Stereo Codec Based on GCC-PHAT","year":2025,"lang":"en","type":"article","venue":"","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Sherbrooke","funders":"","keywords":"Codec; Computer science; Computer hardware","score_opus":0.015256780142883179,"score_gpt":0.3265166066617511,"score_spread":0.3112598265188679,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4408352715","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17623924,0.00041493447,0.81340086,0.00028374177,0.0001353537,0.00011565397,0.0003759787,0.0029163342,0.0061179986],"genre_scores_gemma":[0.84856343,0.00024209124,0.14607763,0.000356087,0.00005766535,0.00010730958,0.00063211087,0.00019332254,0.0037703943],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99884343,0.00018667504,0.00003430009,0.00019753327,0.00060597324,0.00013206752],"domain_scores_gemma":[0.9986376,0.0003257633,0.0001913222,0.00017463515,0.00059915386,0.00007147109],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001029362,0.0007075712,0.00034833432,0.0011350585,0.00042622982,0.00057507056,0.00044472003,0.0006653811,0.0011825119],"category_scores_gemma":[0.0028143427,0.00017793388,0.00026378603,0.00057700236,0.00052478863,0.00054432586,0.0007586726,0.0006562365,0.00064280245],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0021294833,0.00015825467,0.019160861,0.00018098087,0.00012701807,0.0009075672,0.00037463685,0.1091204,0.34447786,0.019973602,0.0066715735,0.49671787],"study_design_scores_gemma":[0.000031962605,0.00022157289,0.005755978,0.000040286475,0.000038038903,0.00090211874,0.000050537743,0.843338,0.14132404,0.0025852325,0.005639157,0.00007316181],"about_ca_topic_score_codex":0.005182775,"about_ca_topic_score_gemma":0.006507888,"teacher_disagreement_score":0.005182775,"about_ca_system_score_codex":0.0006871383,"about_ca_system_score_gemma":0.0011451555,"threshold_uncertainty_score":0.010305226},"labels":[],"label_agreement":null},{"id":"W4408354399","doi":"10.1109/icassp49660.2025.10889750","title":"Combined object-based audio and MASA format for enhanced spatial mobile communication","year":2025,"lang":"en","type":"article","venue":"","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"VoiceAge (Canada)","funders":"","keywords":"Computer science; Object (grammar); Mobile telephony; Mobile computing; Multimedia; Mobile radio; Artificial intelligence; Telecommunications","score_opus":0.006724670466334102,"score_gpt":0.28184574649329786,"score_spread":0.27512107602696373,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4408354399","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08760967,0.0015786729,0.89876384,0.00020643165,0.00024798224,0.00016631364,0.00034021778,0.0012979098,0.009788929],"genre_scores_gemma":[0.53300905,0.001503613,0.4490045,0.00020165871,0.00021162877,0.00028032484,0.0009901082,0.0002556537,0.014543478],"study_design_codex":"bench_or_experimental","study_design_gemma":"not_applicable","domain_scores_codex":[0.9997147,0.000051503208,0.000017923106,0.00002511153,0.00016174036,0.000029077455],"domain_scores_gemma":[0.99938536,0.00014874885,0.00006494725,0.0001266922,0.0002395588,0.000034618883],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003584961,0.0005157416,0.00024323518,0.0007250682,0.00019793889,0.00070009165,0.00046372344,0.00034435943,0.0034755627],"category_scores_gemma":[0.0009042861,0.00009494939,0.00023523113,0.0006970785,0.00031839786,0.0008266652,0.00087843364,0.0005353903,0.0010686585],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00094310904,0.00007890634,0.0008953291,0.00030632273,0.000033414995,0.0004127286,0.00029355034,0.011278408,0.5219248,0.020943133,0.002644325,0.44024596],"study_design_scores_gemma":[0.000114269205,0.0011642474,0.0026147133,0.00019180033,0.00008302757,0.0022589678,0.00041978544,0.19453534,0.69181603,0.008190816,0.098487094,0.00012385355],"about_ca_topic_score_codex":0.0004424164,"about_ca_topic_score_gemma":0.0007940131,"teacher_disagreement_score":0.0034755627,"about_ca_system_score_codex":0.00020917946,"about_ca_system_score_gemma":0.0002994664,"threshold_uncertainty_score":0.011626959},"labels":[],"label_agreement":null},{"id":"W4409347088","doi":"10.1609/aaai.v39i16.33920","title":"Structural Entropy Guided Probabilistic Coding","year":2025,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Artificial Intelligence in Medicine (Canada)","funders":"Basic and Applied Basic Research Foundation of Guangdong Province; Government of Jiangxi Province; National Natural Science Foundation of China","keywords":"Probabilistic logic; Computer science; Entropy (arrow of time); Statistical physics; Artificial intelligence; Physics; Thermodynamics","score_opus":0.07748366319757934,"score_gpt":0.3370337294223721,"score_spread":0.25955006622479276,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4409347088","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0058123805,0.00022289685,0.9921325,0.00022808892,0.000027855822,0.000027967033,0.00012731567,0.0002595791,0.001161558],"genre_scores_gemma":[0.6035519,0.0012433741,0.38407874,0.00056445383,0.00021900459,0.00054424617,0.0015053625,0.00037360698,0.007919184],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986834,0.00043023733,0.00007570516,0.0002640221,0.00042687295,0.0001196645],"domain_scores_gemma":[0.9964562,0.0020219276,0.00030477278,0.000613184,0.0005147509,0.00008915527],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017638332,0.000992304,0.001030563,0.0013291207,0.00039246172,0.0012961635,0.0020350795,0.0012869561,0.0025595485],"category_scores_gemma":[0.008685242,0.0004786468,0.0009219926,0.0018924734,0.0014922523,0.004181694,0.0025649436,0.0023714697,0.0007680415],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012422103,0.00009621915,0.0010460803,0.00017238506,0.000056403256,0.00010758279,0.00018381924,0.5400882,0.00468159,0.22011188,0.005231908,0.22809972],"study_design_scores_gemma":[0.0000058081273,0.000020265225,0.00010265662,0.000011830289,0.0000066529888,0.000032185057,0.000007936347,0.94717586,0.00094867265,0.050800662,0.0008765542,0.000010915298],"about_ca_topic_score_codex":0.002046201,"about_ca_topic_score_gemma":0.0022008563,"teacher_disagreement_score":0.0025595485,"about_ca_system_score_codex":0.0010647568,"about_ca_system_score_gemma":0.001600616,"threshold_uncertainty_score":0.0093281865},"labels":[],"label_agreement":null},{"id":"W4409366272","doi":"10.1609/aaai.v39i10.33111","title":"CAMSIC: Content-aware Masked Image Modeling Transformer for Stereo Image Compression","year":2025,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Artificial Intelligence in Medicine (Canada)","funders":"","keywords":"Computer science; Transformer; Computer vision; Artificial intelligence; Image compression; Image (mathematics); Image processing; Engineering; Electrical engineering; Voltage","score_opus":0.11625040593403868,"score_gpt":0.3454110092072813,"score_spread":0.2291606032732426,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4409366272","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010218574,0.00012587928,0.98631996,0.00007035316,0.000032092652,0.00004985885,0.00015926798,0.0016870587,0.0013369255],"genre_scores_gemma":[0.33779943,0.00032518184,0.65479434,0.00031277505,0.00008792609,0.0001828133,0.0011857656,0.0004711125,0.0048407204],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9996741,0.00003485086,0.00001288657,0.00003937732,0.00021007097,0.000028726317],"domain_scores_gemma":[0.9995415,0.00009943482,0.000048768135,0.00014439081,0.00013837242,0.00002762857],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037392872,0.0006333674,0.00035598036,0.0006747777,0.00021102867,0.00042497372,0.0009871348,0.00042485664,0.002266538],"category_scores_gemma":[0.0014079054,0.00017232672,0.00042085597,0.00065066206,0.00039935374,0.0010155012,0.000883542,0.00094020355,0.0007704855],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00043734285,0.00018451731,0.0012044645,0.00014150226,0.00006433353,0.00020298373,0.00011920514,0.11058105,0.16500627,0.037322104,0.00979766,0.6749386],"study_design_scores_gemma":[0.000020609315,0.00007362489,0.00029581212,0.000007671209,0.000011908593,0.0001906289,0.000013407092,0.9131521,0.07584346,0.006102278,0.004271559,0.00001693437],"about_ca_topic_score_codex":0.002476922,"about_ca_topic_score_gemma":0.004012629,"teacher_disagreement_score":0.002476922,"about_ca_system_score_codex":0.0004828097,"about_ca_system_score_gemma":0.0008092302,"threshold_uncertainty_score":0.007582307},"labels":[],"label_agreement":null},{"id":"W4409578693","doi":"10.1093/mnras/staf622","title":"Radio AGN selection in LoTSS DR2","year":2025,"lang":"en","type":"article","venue":"Monthly Notices of the Royal Astronomical Society","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Argonne National Laboratory; DST-NRF Centre Of Excellence In Tree Health Biotechnology; Integrated Electronics Engineering Center, Binghamton University; Science and Technology Facilities Council; Ohio State University; Observatoire de Paris, Université de Recherche Paris Sciences et Lettres; SLAC National Accelerator Laboratory; Nederlandse Organisatie voor Wetenschappelijk Onderzoek; Institut sur la Nutrition et les Aliments Fonctionnels; Ministerium für Innovation, Wissenschaft und Forschung des Landes Nordrhein-Westfalen; Istituto Nazionale di Astrofisica; Centre National de la Recherche Scientifique; Max-Planck-Gesellschaft; Bundesministerium für Bildung und Forschung; University of Portsmouth; University of Hertfordshire; University College London; Deutsche Forschungsgemeinschaft; Université d'Orléans; University of Illinois at Urbana-Champaign; Lawrence Berkeley National Laboratory; Division of Astronomical Sciences; University of Pennsylvania; Financiadora de Estudos e Projetos; University of Sussex; U.S. Department of Energy; Gauss Centre for Supercomputing; University of Chicago; Fermilab; Science Foundation Ireland; National Science Foundation","keywords":"Physics; Selection (genetic algorithm); Astrophysics; Astronomy","score_opus":0.006164021976167751,"score_gpt":0.2311179112915827,"score_spread":0.22495388931541496,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4409578693","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99437475,0.000063819076,0.00039885804,0.000031796128,0.000005112296,0.000018972794,0.0024995164,0.000085420215,0.0025218304],"genre_scores_gemma":[0.9872044,0.00003242904,0.00062930695,0.00005955707,0.000011912424,0.000019628827,0.009839924,0.00003279992,0.0021700356],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.99947256,0.00008484418,0.000035735604,0.00017744163,0.0001377136,0.0000916738],"domain_scores_gemma":[0.9989784,0.00010848626,0.0003169201,0.00017602123,0.00014684573,0.00027345138],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005967168,0.00024421045,0.00028364258,0.002697201,0.0002906883,0.000794986,0.00048104956,0.00024590368,0.004696134],"category_scores_gemma":[0.0009855424,0.00018260152,0.00036932813,0.001060147,0.00023856151,0.00018224146,0.0009237689,0.00015653558,0.0021884546],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021375784,0.000080591664,0.9746815,0.000020639856,0.000040061463,0.00047981399,0.00019969906,0.00046330882,0.009571241,0.00025256418,0.0026958964,0.011301014],"study_design_scores_gemma":[0.000017947486,0.000094682066,0.99252,0.000009997181,0.000023321212,0.00094099203,0.0002098767,0.0010858366,0.0015790234,0.00007828061,0.0034268426,0.000013267563],"about_ca_topic_score_codex":0.0026997353,"about_ca_topic_score_gemma":0.006843418,"teacher_disagreement_score":0.004696134,"about_ca_system_score_codex":0.00028673816,"about_ca_system_score_gemma":0.00015020218,"threshold_uncertainty_score":0.015710115},"labels":[],"label_agreement":null},{"id":"W4409783548","doi":"10.1016/j.engappai.2025.110815","title":"A dynamic fuzzy video compression control algorithm for wireless Advanced Driver Assistance Systems","year":2025,"lang":"en","type":"article","venue":"Engineering Applications of Artificial Intelligence","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"European Regional Development Fund; Vysoká Škola Bánská - Technická Univerzita Ostrava; FP7 Coordination of Research Activities; Javna Agencija za Raziskovalno Dejavnost RS; Grantová Agentura České Republiky; European Commission","keywords":"Computer science; Fuzzy logic; Wireless; Data compression; Compression (physics); Fuzzy control system; Algorithm; Real-time computing; Artificial intelligence; Telecommunications","score_opus":0.008498432289209717,"score_gpt":0.2816300567762829,"score_spread":0.2731316244870732,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4409783548","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.041664943,0.0004439245,0.9526503,0.00011810127,0.00005817938,0.00009048216,0.000020617363,0.00030508652,0.004648331],"genre_scores_gemma":[0.8670961,0.0002840903,0.12827362,0.000093240225,0.00003381765,0.00012729291,0.000058834983,0.000020569816,0.004012335],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99985623,0.000013785103,0.000009568114,0.000038346734,0.00006304432,0.000018982286],"domain_scores_gemma":[0.99987304,0.000038496986,0.000017134642,0.0000057511106,0.000059637532,0.0000059560543],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033122714,0.00040460392,0.00030198137,0.00035794766,0.0003055356,0.00045316797,0.000580241,0.00041223675,0.0009330226],"category_scores_gemma":[0.0006382759,0.00014122014,0.00025652003,0.0002226504,0.00022637329,0.00026920953,0.0002498166,0.0004737224,0.00015026277],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022249068,0.00011406632,0.001021164,0.00011341052,0.000038127426,0.00013528463,0.00012715967,0.49908277,0.035973523,0.0068873474,0.0014564748,0.4548282],"study_design_scores_gemma":[0.000012153244,0.00006312273,0.00022230264,0.000005737491,0.000007970254,0.00002468336,0.000008092085,0.9947103,0.0037492937,0.0004257348,0.00076502806,0.000005574858],"about_ca_topic_score_codex":0.007942885,"about_ca_topic_score_gemma":0.0053343503,"teacher_disagreement_score":0.007942885,"about_ca_system_score_codex":0.00055581174,"about_ca_system_score_gemma":0.00055610714,"threshold_uncertainty_score":0.015793324},"labels":[],"label_agreement":null},{"id":"W4410427568","doi":"10.1109/tits.2025.3568227","title":"Two-Component GMM Source Coding and Optimization","year":2025,"lang":"en","type":"article","venue":"IEEE Transactions on Intelligent Transportation Systems","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"National Natural Science Foundation of China","keywords":"Component (thermodynamics); Computer science; Coding (social sciences); Mathematics; Statistics; Physics","score_opus":0.01792448174660103,"score_gpt":0.2777456023396224,"score_spread":0.25982112059302137,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4410427568","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0021168094,0.00014636123,0.9958627,0.00008531454,0.000029562609,0.000029462806,0.000073406634,0.00046285923,0.001193419],"genre_scores_gemma":[0.23166195,0.00060076563,0.755403,0.00015005482,0.00009616962,0.0003523033,0.00083019893,0.00021284989,0.010692711],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99968445,0.00006879233,0.000012296918,0.0000653777,0.00013725605,0.00003178752],"domain_scores_gemma":[0.99979347,0.000060811424,0.000017529346,0.000034501616,0.00008352979,0.00001012015],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004556702,0.0012038626,0.00075661635,0.0005645294,0.00038949357,0.0005295244,0.0010157983,0.00082169153,0.00276443],"category_scores_gemma":[0.0010161559,0.00032772706,0.00058486976,0.0010064336,0.0005029596,0.0006744138,0.0010104972,0.0011084144,0.0013708083],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017383246,0.00005649852,0.00034140362,0.00018767346,0.000057250818,0.000120638615,0.00008792521,0.5843169,0.020327413,0.06329712,0.007964261,0.32306907],"study_design_scores_gemma":[0.0000061138844,0.000016164093,0.000056034405,0.0000048242136,0.0000060978186,0.000032958433,0.0000051609572,0.9918305,0.0039338297,0.002753033,0.0013462431,0.000008972236],"about_ca_topic_score_codex":0.0058570057,"about_ca_topic_score_gemma":0.0058443807,"teacher_disagreement_score":0.0058570057,"about_ca_system_score_codex":0.0008332169,"about_ca_system_score_gemma":0.0013872617,"threshold_uncertainty_score":0.011645794},"labels":[],"label_agreement":null},{"id":"W4410478307","doi":"10.1016/j.neunet.2025.107590","title":"S2LIC: Learned image compression with the SwinV2 block, Adaptive Channel-wise and Global-inter attention Context","year":2025,"lang":"en","type":"article","venue":"Neural Networks","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Natural Science Foundation of Shaanxi Province; Aeronautical Science Foundation of China","keywords":"Computer science; Decoding methods; Entropy (arrow of time); Artificial intelligence; Pattern recognition (psychology); Entropy encoding; Feature learning; Image compression; Feature (linguistics); Data compression; Algorithm; Image processing; Image (mathematics)","score_opus":0.01353741361873444,"score_gpt":0.2685104085873866,"score_spread":0.25497299496865217,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4410478307","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.047201745,0.0013328705,0.92788804,0.0006734257,0.00056508725,0.00017973891,0.0011886051,0.011114699,0.009855776],"genre_scores_gemma":[0.3758751,0.0006649292,0.59412885,0.0006548327,0.00033302646,0.00022304819,0.0028143977,0.0008049221,0.024500923],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998185,0.000024942547,0.000007296485,0.000037796366,0.00008043785,0.00003109409],"domain_scores_gemma":[0.99976486,0.0000458248,0.000012899125,0.00006828155,0.000082508006,0.000025746354],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003437957,0.00095607794,0.0005386968,0.00059151463,0.0002837651,0.0006106767,0.0010523158,0.00073534925,0.0074496],"category_scores_gemma":[0.0011318653,0.00016848576,0.0002638937,0.0006209263,0.0003531326,0.00075323944,0.0010097235,0.0008793058,0.0016762249],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007962659,0.00023280532,0.0006995315,0.00014580385,0.000076267235,0.00016018444,0.0000402518,0.059572358,0.039686132,0.00961722,0.028964829,0.8600083],"study_design_scores_gemma":[0.000052972064,0.00014030117,0.00051276153,0.000018935565,0.00002074329,0.00012457444,0.000017921218,0.948454,0.039480027,0.0033033176,0.007855834,0.000018628705],"about_ca_topic_score_codex":0.005535729,"about_ca_topic_score_gemma":0.014472915,"teacher_disagreement_score":0.0074496,"about_ca_system_score_codex":0.00042036176,"about_ca_system_score_gemma":0.0010375279,"threshold_uncertainty_score":0.024921358},"labels":[],"label_agreement":null},{"id":"W4411799552","doi":"10.1109/tdsc.2025.3584123","title":"LocalSketch: An Accurate and Efficient Sketch for Range Spread Estimation","year":2025,"lang":"en","type":"article","venue":"IEEE Transactions on Dependable and Secure Computing","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"National Natural Science Foundation of China","keywords":"Computer science; Sketch; Range (aeronautics); Estimation; Algorithm; Engineering","score_opus":0.01670780972740703,"score_gpt":0.30358379120529594,"score_spread":0.2868759814778889,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4411799552","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006793908,0.00054430176,0.98422503,0.00007059669,0.00007908243,0.00010208809,0.0005906602,0.0066038454,0.000990454],"genre_scores_gemma":[0.31804514,0.0010367887,0.6723244,0.00015854661,0.00012579767,0.0004195852,0.0030536493,0.00096872094,0.0038673454],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988882,0.00017404476,0.00009939789,0.00020161588,0.00055592594,0.00008080759],"domain_scores_gemma":[0.99592006,0.0014549012,0.00040634125,0.0013319531,0.0006980609,0.00018856642],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009198349,0.0011448523,0.0011334907,0.0019111353,0.0003816421,0.0018405697,0.0018931006,0.0008761078,0.0055104657],"category_scores_gemma":[0.013077966,0.0006307735,0.00063994055,0.0018007803,0.00058452174,0.0036199891,0.0029682755,0.0012939785,0.002895378],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00082903006,0.00010835398,0.0053567267,0.0008754279,0.00015857394,0.0002625789,0.00037192678,0.15581447,0.028796786,0.025027694,0.014582366,0.7678161],"study_design_scores_gemma":[0.00009133158,0.0001372652,0.00097148237,0.000079451565,0.000040615585,0.00033759334,0.00012464463,0.9420238,0.020935886,0.019816212,0.015354425,0.00008715651],"about_ca_topic_score_codex":0.0012792186,"about_ca_topic_score_gemma":0.0018019524,"teacher_disagreement_score":0.0055104657,"about_ca_system_score_codex":0.00044290678,"about_ca_system_score_gemma":0.0009937927,"threshold_uncertainty_score":0.018434405},"labels":[],"label_agreement":null},{"id":"W4412081587","doi":"10.1109/tmc.2025.3586441","title":"Fed$n$nP: Federated Unlearning With Multiple Client Set Partitions","year":2025,"lang":"en","type":"article","venue":"IEEE Transactions on Mobile Computing","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Guelph","funders":"Priority Academic Program Development of Jiangsu Higher Education Institutions","keywords":"Computer science; Set (abstract data type); Theoretical computer science; Distributed computing; Computer network; Programming language","score_opus":0.014784199580807612,"score_gpt":0.2867042894395307,"score_spread":0.27192008985872307,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412081587","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.045248408,0.0001885342,0.94558626,0.0004423415,0.00007168547,0.00017305228,0.00019643139,0.0059863334,0.0021068896],"genre_scores_gemma":[0.59738135,0.00008268789,0.39682317,0.0005372743,0.000053686454,0.00029605263,0.0008712378,0.00038166804,0.003572887],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973911,0.0008621543,0.00015051667,0.0006537121,0.00060433266,0.00033808616],"domain_scores_gemma":[0.9937651,0.0023795583,0.0003018358,0.002313109,0.00095900625,0.00028136442],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0034008585,0.0010663671,0.0014932525,0.00069627346,0.0014729481,0.0016937959,0.0036181065,0.0016334171,0.0028028856],"category_scores_gemma":[0.012114735,0.00054835767,0.00086112507,0.0011437045,0.0013083689,0.004987359,0.0038270713,0.0023980218,0.0008829235],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009220556,0.00055133435,0.0040705665,0.000092675844,0.000108215514,0.00025395857,0.0002729321,0.55459005,0.004106454,0.017760938,0.010944949,0.4063259],"study_design_scores_gemma":[0.000018536392,0.000034705627,0.000105111794,0.000003971556,0.000005538128,0.00003792294,0.000021996246,0.9868063,0.0025289834,0.009770635,0.0006591434,0.0000072205808],"about_ca_topic_score_codex":0.006525318,"about_ca_topic_score_gemma":0.008010698,"teacher_disagreement_score":0.006525318,"about_ca_system_score_codex":0.0017922566,"about_ca_system_score_gemma":0.0025391963,"threshold_uncertainty_score":0.017985702},"labels":[],"label_agreement":null},{"id":"W4412082768","doi":"10.1109/cai64502.2025.00200","title":"ICARuS: Intercode-CTF Auto-Randomization System","year":2025,"lang":"en","type":"article","venue":"","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Defence Research and Development Canada","funders":"","keywords":"ICARUS; Computer science; Physics; Astronomy","score_opus":0.004976255794675445,"score_gpt":0.2585873657900988,"score_spread":0.25361110999542336,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412082768","genre_codex":"software","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05111781,0.0015712956,0.31103763,0.0014939354,0.0013432762,0.0013907856,0.02855102,0.591879,0.01161523],"genre_scores_gemma":[0.36246073,0.000596068,0.4685774,0.001979064,0.00034045655,0.0036691914,0.11863394,0.033959925,0.009783189],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99609923,0.0012331923,0.00029991503,0.0010321956,0.0009468072,0.00038870436],"domain_scores_gemma":[0.9913243,0.003959959,0.0005609494,0.0024395084,0.0013996192,0.00031559545],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004758159,0.0030346639,0.0014444937,0.0020460356,0.001039767,0.0019900203,0.0046581244,0.003312473,0.015553092],"category_scores_gemma":[0.025163658,0.0010214332,0.0023887123,0.001491814,0.0014868864,0.0027606152,0.002425169,0.004166375,0.013604574],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0024841721,0.0011342012,0.009598077,0.0011988409,0.00056576467,0.00065519696,0.0003148893,0.30878034,0.009093711,0.017237978,0.42913485,0.21980195],"study_design_scores_gemma":[0.0003525988,0.00028308426,0.0013158584,0.000052718027,0.00002886424,0.00019432082,0.000043170076,0.9569393,0.010106169,0.008403638,0.022195227,0.00008504053],"about_ca_topic_score_codex":0.013309522,"about_ca_topic_score_gemma":0.013992051,"teacher_disagreement_score":0.015553092,"about_ca_system_score_codex":0.002193476,"about_ca_system_score_gemma":0.0050000753,"threshold_uncertainty_score":0.052030265},"labels":[],"label_agreement":null},{"id":"W4412164030","doi":"10.1109/tcsvt.2025.3586792","title":"Customizable ROI-Based Deep Image Compression","year":2025,"lang":"en","type":"article","venue":"IEEE Transactions on Circuits and Systems for Video Technology","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Natural Science Foundation of Shandong Province; National Natural Science Foundation of China; Ministry of Education - Singapore; Ministry of Education and Science","keywords":"Image compression; Computer science; Computer vision; Artificial intelligence; Data compression; Computer graphics (images); Image (mathematics); Image processing","score_opus":0.01371119782523549,"score_gpt":0.2752765666893657,"score_spread":0.2615653688641302,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412164030","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0373271,0.00026481436,0.9405482,0.00016055921,0.00007352711,0.00021864955,0.00022556291,0.014890604,0.0062910295],"genre_scores_gemma":[0.41074368,0.000332031,0.5744299,0.0004281302,0.000087512606,0.00027945792,0.00070407835,0.0021230204,0.010872207],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99941003,0.0000708908,0.000054141805,0.00014291414,0.00024678325,0.0000753698],"domain_scores_gemma":[0.99867684,0.00034255162,0.00013011355,0.0005031903,0.00028848293,0.000058819012],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00062937546,0.0008737127,0.0004539155,0.0008596567,0.0002507097,0.00087687775,0.0016397077,0.00055509567,0.0054985913],"category_scores_gemma":[0.002347498,0.00032583508,0.00044458502,0.00044777765,0.00058143045,0.0018304313,0.0016762489,0.00087343255,0.001419645],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006806181,0.00019281181,0.0011967723,0.0002160808,0.000053083004,0.00046598254,0.00033638816,0.020817433,0.5765812,0.023300493,0.0090147955,0.36714438],"study_design_scores_gemma":[0.00006473245,0.00023883868,0.0011938257,0.000041321553,0.000041697185,0.0006928276,0.000059885657,0.29515505,0.672762,0.0074335937,0.02222587,0.00009035594],"about_ca_topic_score_codex":0.0005578535,"about_ca_topic_score_gemma":0.00075250113,"teacher_disagreement_score":0.0054985913,"about_ca_system_score_codex":0.0005081902,"about_ca_system_score_gemma":0.00038680682,"threshold_uncertainty_score":0.01839459},"labels":[],"label_agreement":null},{"id":"W4412403691","doi":"10.1109/lgrs.2025.3589030","title":"Toward Multitask Perception for Remote Sensing Imagery via Compression and Prompt Tuning","year":2025,"lang":"en","type":"article","venue":"IEEE Geoscience and Remote Sensing Letters","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Aeronautical Science Foundation of China","keywords":"Computer science; Perception; Task (project management); Remote sensing; Data compression; Computer vision; Artificial intelligence; Geology; Engineering","score_opus":0.020255929957180504,"score_gpt":0.2813656550506275,"score_spread":0.261109725093447,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412403691","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.068784565,0.00058142486,0.92251503,0.00038062868,0.000101051904,0.00014686331,0.00017653353,0.0043114903,0.003002427],"genre_scores_gemma":[0.5744319,0.00047743737,0.41797575,0.00044628873,0.00014900338,0.00022120577,0.0008095215,0.0003568979,0.005131983],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997347,0.00003847654,0.0000134428365,0.00007822081,0.000094968964,0.000040098388],"domain_scores_gemma":[0.99931264,0.00023651436,0.00007743326,0.0001466576,0.0001709062,0.00005576011],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005724568,0.00083890057,0.00054720795,0.00047782858,0.00021114723,0.0005671608,0.0010624105,0.00051083945,0.0014857224],"category_scores_gemma":[0.0021473006,0.0002265499,0.00037386618,0.0004950018,0.00048960245,0.0013855657,0.0009749802,0.0014034088,0.0007201696],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00057384756,0.0003404439,0.0024745557,0.00015366588,0.000044976026,0.0001827417,0.0002339289,0.11638291,0.08831041,0.0058735507,0.0067006093,0.7787283],"study_design_scores_gemma":[0.000025896565,0.00009666321,0.0008213051,0.000010989552,0.0000140109105,0.00007511149,0.000040384355,0.9625433,0.028590417,0.004654841,0.0031125948,0.000014519774],"about_ca_topic_score_codex":0.003438859,"about_ca_topic_score_gemma":0.0043854066,"teacher_disagreement_score":0.003438859,"about_ca_system_score_codex":0.0004921741,"about_ca_system_score_gemma":0.00091045076,"threshold_uncertainty_score":0.006837666},"labels":[],"label_agreement":null},{"id":"W4412509469","doi":"10.1007/978-981-96-6462-7_34","title":"Latency Reduction Techniques in Real-Time Wireless Multimedia Transmission","year":2025,"lang":"en","type":"book-chapter","venue":"Communications in computer and information science","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"École de Technologie Supérieure; Concordia University","funders":"","keywords":"Latency (audio); Computer science; Reduction (mathematics); Wireless; Transmission (telecommunications); Wireless transmission; Multimedia; Computer network; Telecommunications","score_opus":0.022541936409677662,"score_gpt":0.3070973407954576,"score_spread":0.2845554043857799,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412509469","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014595884,0.014938857,0.9527062,0.00028757984,0.00050535024,0.00005323686,0.00008185331,0.001390343,0.015440588],"genre_scores_gemma":[0.4239804,0.029458791,0.44870937,0.00042325127,0.0012633081,0.00020571199,0.0004045762,0.0009901932,0.09456432],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99976796,0.000030865976,0.000012012388,0.00002417238,0.00013620876,0.00002875525],"domain_scores_gemma":[0.99968755,0.00014809505,0.00002792638,0.00005071975,0.000075967975,0.000009817958],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020375,0.0007692189,0.00035738878,0.0005971933,0.0003695662,0.0007220884,0.0010666106,0.00032736233,0.0063590733],"category_scores_gemma":[0.00085722405,0.00024324491,0.00023748714,0.0013333757,0.0003458958,0.0011964189,0.00046597846,0.0008870668,0.0014241678],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00030775424,0.00011294523,0.00020243412,0.00055808626,0.0000391982,0.00025326366,0.00022300778,0.040184915,0.16682515,0.0628137,0.010725511,0.717754],"study_design_scores_gemma":[0.000042656156,0.00044924588,0.0008568682,0.00015201553,0.00010749027,0.0014860326,0.0002432404,0.6871156,0.17428505,0.046815116,0.088388525,0.000058188518],"about_ca_topic_score_codex":0.0009737887,"about_ca_topic_score_gemma":0.0011283959,"teacher_disagreement_score":0.0063590733,"about_ca_system_score_codex":0.0004912262,"about_ca_system_score_gemma":0.00032252903,"threshold_uncertainty_score":0.021273196},"labels":[],"label_agreement":null},{"id":"W4412536743","doi":"10.1109/tvt.2025.3591224","title":"Joint Imaging and Downlink Communication With Shared Resources","year":2025,"lang":"en","type":"article","venue":"IEEE Transactions on Vehicular Technology","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Institut National de la Recherche Scientifique","funders":"","keywords":"Joint (building); Telecommunications link; Computer science; Telecommunications; Computer network; Engineering","score_opus":0.007284670040505735,"score_gpt":0.23954037397783928,"score_spread":0.23225570393733355,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412536743","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08778312,0.0005279361,0.90321165,0.00030803974,0.000031623145,0.000037064685,0.000047281836,0.00024180482,0.00781151],"genre_scores_gemma":[0.9467068,0.0001874077,0.051366363,0.000077491975,0.000054497308,0.00004917805,0.000035910525,0.000029365774,0.0014930106],"study_design_codex":"simulation_or_modeling","study_design_gemma":"not_applicable","domain_scores_codex":[0.9986449,0.0003392055,0.00005042318,0.00019290305,0.0004225039,0.0003500867],"domain_scores_gemma":[0.99741447,0.0013029967,0.000320109,0.00046330868,0.00035720874,0.00014195977],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011546798,0.00093502545,0.001024126,0.00038364966,0.0006267265,0.0015224259,0.0010581138,0.0007579528,0.0012360605],"category_scores_gemma":[0.00376379,0.00032322103,0.00030460692,0.000894072,0.0010269417,0.0021670493,0.0020843213,0.00086884905,0.0003179265],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006250362,0.00014145621,0.003118115,0.00020659654,0.000088986555,0.0007198806,0.00037791344,0.71540517,0.040749375,0.07835274,0.0020239193,0.15819076],"study_design_scores_gemma":[0.000017660286,0.00019202258,0.00048654433,0.0000130772605,0.00002747703,0.00033119315,0.00012868484,0.9772907,0.010444518,0.009518216,0.001524548,0.000025363119],"about_ca_topic_score_codex":0.0013923369,"about_ca_topic_score_gemma":0.0015939303,"teacher_disagreement_score":0.0015224259,"about_ca_system_score_codex":0.00078570447,"about_ca_system_score_gemma":0.0010655762,"threshold_uncertainty_score":0.0061065555},"labels":[],"label_agreement":null},{"id":"W4413146431","doi":"10.1109/cvpr52734.2025.00715","title":"Multirate Neural Image Compression with Adaptive Lattice Vector Quantization","year":2025,"lang":"en","type":"article","venue":"","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Vector quantization; Image compression; Computer science; Learning vector quantization; Data compression; Quantization (signal processing); Lattice (music); Artificial neural network; Artificial intelligence; Computer vision; Algorithm; Image (mathematics); Image processing; Physics; Acoustics","score_opus":0.0150546935772587,"score_gpt":0.2893300090282168,"score_spread":0.2742753154509581,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413146431","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013309414,0.00047923182,0.98424095,0.0001273078,0.00004222627,0.00002721989,0.000030411078,0.000423642,0.0013195868],"genre_scores_gemma":[0.46201727,0.0006851384,0.5333994,0.00019886706,0.00008683783,0.00011336497,0.00015151112,0.000096688804,0.0032509156],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996612,0.000073150506,0.000020800684,0.000051124778,0.00016835232,0.000025249417],"domain_scores_gemma":[0.9995402,0.00018752209,0.000057116118,0.000077158584,0.000117279415,0.000020840856],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006750861,0.00040701247,0.0005092752,0.0005394783,0.00016057017,0.0005325518,0.0009808774,0.000527302,0.00094848033],"category_scores_gemma":[0.0017397766,0.00020012048,0.0002989689,0.0006949652,0.00053034927,0.0013366975,0.00074626046,0.00093614275,0.00028133902],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015569935,0.0001147151,0.0005890429,0.00012786768,0.00003997912,0.00007514796,0.00008022669,0.51448315,0.024656937,0.027667217,0.0019791876,0.43003082],"study_design_scores_gemma":[0.000005233613,0.000016798445,0.00004104654,0.0000040314153,0.0000018922256,0.00001600881,0.000002904966,0.995159,0.0025118468,0.0018905707,0.00034631204,0.000004385008],"about_ca_topic_score_codex":0.0025878784,"about_ca_topic_score_gemma":0.0034258105,"teacher_disagreement_score":0.0025878784,"about_ca_system_score_codex":0.00057494995,"about_ca_system_score_gemma":0.00049524434,"threshold_uncertainty_score":0.0051456094},"labels":[],"label_agreement":null},{"id":"W4413156666","doi":"10.1109/cvpr52734.2025.00875","title":"CASP: Compression of Large Multimodal Models Based on Attention Sparsity","year":2025,"lang":"en","type":"article","venue":"","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Huawei Technologies (Canada)","funders":"","keywords":"CASP; Computer science; Compression (physics); Protein structure prediction; Materials science","score_opus":0.017580730849804157,"score_gpt":0.3040140757530543,"score_spread":0.2864333449032501,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413156666","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.020650176,0.00034315392,0.9742401,0.00031566998,0.000102296246,0.00007192363,0.00034668905,0.0024669294,0.0014631065],"genre_scores_gemma":[0.44297883,0.0005752198,0.5475803,0.0005136814,0.00017706575,0.00030406404,0.0018377376,0.00057912164,0.005454012],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99951196,0.00010141999,0.000033402084,0.00007984702,0.00022613409,0.00004722692],"domain_scores_gemma":[0.99871755,0.0005871165,0.0000710414,0.00032856636,0.0002542378,0.000041573297],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007182214,0.00081308803,0.00059001014,0.00076624757,0.00033557304,0.0006480159,0.0011352991,0.0006918945,0.0040797438],"category_scores_gemma":[0.0050362665,0.00025669715,0.0005721486,0.00087203644,0.0005159142,0.001877772,0.0015691993,0.0014744146,0.0009577049],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00047941538,0.00011111377,0.0009770647,0.00017705152,0.000074258045,0.00022987502,0.00026133028,0.17556962,0.039474376,0.027378963,0.01418472,0.74108225],"study_design_scores_gemma":[0.000018644361,0.000063258354,0.00033700728,0.000017132897,0.000013171751,0.00011726526,0.000038299877,0.96652526,0.017868541,0.012260152,0.0027260063,0.000015379757],"about_ca_topic_score_codex":0.0033909935,"about_ca_topic_score_gemma":0.0041208854,"teacher_disagreement_score":0.0040797438,"about_ca_system_score_codex":0.00058777764,"about_ca_system_score_gemma":0.0006199075,"threshold_uncertainty_score":0.013648033},"labels":[],"label_agreement":null},{"id":"W4413178233","doi":"10.1109/gcwkshp64532.2024.11101151","title":"Surveillance Video Representations for Bandwidth-limited Semantic Communications","year":2024,"lang":"en","type":"article","venue":"","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"École de Technologie Supérieure","funders":"","keywords":"Computer science; Bandwidth (computing); Telecommunications","score_opus":0.041353212818182106,"score_gpt":0.35971519296739995,"score_spread":0.31836198014921785,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413178233","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.066161975,0.000656573,0.9268623,0.00030512057,0.000119699405,0.00012465788,0.00090564665,0.0012204415,0.003643555],"genre_scores_gemma":[0.5743863,0.0011022674,0.4170839,0.00016788962,0.00011146187,0.0002527357,0.0039104456,0.00021556302,0.0027693957],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9996232,0.000076639655,0.000026931288,0.000051234165,0.00018600815,0.000035926827],"domain_scores_gemma":[0.9991804,0.00025191237,0.00010544965,0.00019488587,0.0002376034,0.000029708599],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047177298,0.0005930993,0.0003336625,0.0009534232,0.00022722593,0.0008342118,0.0005879491,0.00051875843,0.0021291068],"category_scores_gemma":[0.003214117,0.00012260734,0.00032793585,0.0009991827,0.00040797758,0.0018930067,0.0007808361,0.00073636434,0.00049372355],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008354058,0.0002783329,0.0014030926,0.0003494414,0.0000695536,0.00047062838,0.0003788249,0.17297637,0.11242173,0.092702135,0.010302238,0.60781217],"study_design_scores_gemma":[0.000038867474,0.00024162322,0.001427027,0.00007063858,0.00004673732,0.00046123107,0.00019658616,0.8923128,0.0554433,0.03334681,0.01638031,0.000034002547],"about_ca_topic_score_codex":0.0014277011,"about_ca_topic_score_gemma":0.0013123708,"teacher_disagreement_score":0.0021291068,"about_ca_system_score_codex":0.0005458757,"about_ca_system_score_gemma":0.0005127249,"threshold_uncertainty_score":0.0071225762},"labels":[],"label_agreement":null},{"id":"W4413180371","doi":"10.1109/aiiot65859.2025.11105241","title":"Adaptive Bitrate Selection for Medical Video Compression Balancing Bandwidth Efficiency and Segmentation Quality","year":2025,"lang":"en","type":"article","venue":"","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Computer science; Bandwidth (computing); Data compression; Selection (genetic algorithm); Compression (physics); Segmentation; Computer network; Artificial intelligence","score_opus":0.01670312153689134,"score_gpt":0.347438793036345,"score_spread":0.33073567149945365,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413180371","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.25339708,0.008553982,0.726006,0.0012367625,0.00018208772,0.0006025522,0.0011864181,0.0032698973,0.0055652726],"genre_scores_gemma":[0.73834205,0.0020028255,0.25625753,0.00032015375,0.0001054367,0.00024295917,0.001298258,0.00022476008,0.0012060057],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99895704,0.00032311768,0.00009630246,0.00019447622,0.00034745698,0.00008146719],"domain_scores_gemma":[0.99855894,0.000581354,0.00020545605,0.00015571709,0.00042726487,0.000071335126],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026514714,0.0008108434,0.0007285428,0.0017634664,0.00035226374,0.0013552739,0.00079261017,0.00076146,0.00063656486],"category_scores_gemma":[0.0074812784,0.00020239732,0.00040365104,0.0007829264,0.00044043327,0.001005196,0.00063338736,0.00072185096,0.00033617648],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0017841759,0.00056031696,0.018145092,0.0006925754,0.0001893404,0.0003583047,0.00028244505,0.17453448,0.10988017,0.006421839,0.009176967,0.6779743],"study_design_scores_gemma":[0.00016595224,0.000502142,0.010805342,0.00016284443,0.00014116928,0.00074082764,0.00012931094,0.8993194,0.07498351,0.007224638,0.0057209344,0.00010390811],"about_ca_topic_score_codex":0.0034960469,"about_ca_topic_score_gemma":0.004148142,"teacher_disagreement_score":0.0034960469,"about_ca_system_score_codex":0.00072869734,"about_ca_system_score_gemma":0.0012853893,"threshold_uncertainty_score":0.0140224695},"labels":[],"label_agreement":null},{"id":"W4413343973","doi":"10.1109/tmc.2025.3600434","title":"SC-GIR: Goal-Oriented Semantic Communication via Invariant Representation Learning for Image Transmission","year":2025,"lang":"en","type":"article","venue":"IEEE Transactions on Mobile Computing","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"","keywords":"Computer science; Invariant (physics); Theoretical computer science; Representation (politics); Artificial intelligence; Natural language processing; Multimedia; Mathematics","score_opus":0.012042501656240072,"score_gpt":0.31176892062399836,"score_spread":0.2997264189677583,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413343973","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008687392,0.00016278136,0.9885712,0.00018837121,0.000031706077,0.000046848,0.000082834136,0.00078806246,0.0014408776],"genre_scores_gemma":[0.5472778,0.0004815957,0.44471127,0.0005622107,0.00016104818,0.00030749087,0.0009698139,0.0003182271,0.005210525],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991359,0.0002526094,0.00003935079,0.00017247915,0.0002896678,0.00011006509],"domain_scores_gemma":[0.9987777,0.00047756397,0.00016087132,0.0003321219,0.00017580437,0.00007595248],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012272607,0.0008753768,0.0007869337,0.00073283113,0.00040637876,0.0008822083,0.0016437859,0.0010656457,0.0023084152],"category_scores_gemma":[0.0041182423,0.0002597039,0.0006714211,0.0010519505,0.0012015685,0.0023944038,0.0021770338,0.0021751255,0.00087370357],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00040746454,0.00041563043,0.0011199035,0.00025114344,0.00010184,0.00027099924,0.00037153708,0.31234497,0.0350793,0.080722645,0.012228968,0.55668557],"study_design_scores_gemma":[0.000020472784,0.00011808226,0.0001738344,0.000012850564,0.000013195427,0.00007741158,0.00003562103,0.9561136,0.009171688,0.03242611,0.0018194978,0.000017596041],"about_ca_topic_score_codex":0.0014483097,"about_ca_topic_score_gemma":0.001543412,"teacher_disagreement_score":0.0023084152,"about_ca_system_score_codex":0.000646702,"about_ca_system_score_gemma":0.0012950622,"threshold_uncertainty_score":0.0077224374},"labels":[],"label_agreement":null},{"id":"W4414165854","doi":"10.1109/twc.2025.3604516","title":"Resource Allocation for Image Transmission Using Adaptive Semantic and Bit Communication","year":2025,"lang":"en","type":"article","venue":"IEEE Transactions on Wireless Communications","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia, Okanagan Campus; University of British Columbia","funders":"National Natural Science Foundation of China","keywords":"Particle swarm optimization; Channel (broadcasting); Transmission (telecommunications); Energy consumption; Resource allocation; Optimization problem; Computation; JPEG 2000; Metric (unit)","score_opus":0.03542183507105737,"score_gpt":0.3188693592607426,"score_spread":0.2834475241896852,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4414165854","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.021073032,0.00019611858,0.9760768,0.00014514264,0.000029663344,0.000041574305,0.000022517217,0.00015862881,0.002256494],"genre_scores_gemma":[0.8739513,0.00024499066,0.12235437,0.00013326596,0.00004239109,0.00012885379,0.000058879854,0.000042644147,0.003043182],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99934274,0.00018035472,0.00003493846,0.00014638618,0.00020135322,0.00009421247],"domain_scores_gemma":[0.99942255,0.00023870223,0.00007491998,0.000086206375,0.00014170507,0.00003594542],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006953875,0.0007586397,0.00074522215,0.00045578333,0.00053731684,0.00090139307,0.0014685113,0.0007609922,0.0018363827],"category_scores_gemma":[0.001928059,0.00022167432,0.00043244244,0.0007080771,0.0006970519,0.0021309745,0.0012916642,0.0007288258,0.00031692692],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000598821,0.00019627404,0.0015534308,0.00024893938,0.000093794,0.00048978324,0.00028866678,0.6734592,0.040457103,0.05302642,0.0038249579,0.2257626],"study_design_scores_gemma":[0.000010312345,0.000061889885,0.00012641597,0.0000038964226,0.0000113473225,0.00007824428,0.000033269676,0.9904683,0.0027058145,0.005829499,0.0006613182,0.0000096611275],"about_ca_topic_score_codex":0.0016898457,"about_ca_topic_score_gemma":0.0018615288,"teacher_disagreement_score":0.0018363827,"about_ca_system_score_codex":0.00052751414,"about_ca_system_score_gemma":0.0005957604,"threshold_uncertainty_score":0.0061433315},"labels":[],"label_agreement":null},{"id":"W4415401620","doi":"10.3390/electronics14204116","title":"Enhancing JPEG XL’s Weighted Average Predictor: Genetic Algorithm Optimization of Expanded Sub-Predictor Ensemble","year":2025,"lang":"en","type":"article","venue":"Electronics","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Weighting; JPEG; Entropy (arrow of time); File size; Redundancy (engineering); JPEG 2000; Population; Quantization (signal processing)","score_opus":0.004848373270500704,"score_gpt":0.2370858305989482,"score_spread":0.2322374573284475,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4415401620","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24539596,0.00018206383,0.7502275,0.00014694707,0.000044602024,0.00005880319,0.00009354323,0.0010806319,0.0027699154],"genre_scores_gemma":[0.75005335,0.00012542473,0.24642932,0.000110138346,0.000022199585,0.00011033777,0.0003085058,0.00009637728,0.0027443708],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99982184,0.000038395327,0.000005959192,0.000038747497,0.00006729599,0.000027770586],"domain_scores_gemma":[0.9996113,0.00017022293,0.000029539404,0.000036069112,0.00013390621,0.00001888635],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00062133005,0.00050944707,0.00043223283,0.00037566808,0.0001847289,0.0003450046,0.00056564243,0.00040764656,0.0005892484],"category_scores_gemma":[0.001568902,0.00016753977,0.00024231785,0.0004245407,0.00021187123,0.0004874857,0.0004119319,0.00063532015,0.00017233017],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000090852656,0.00010222128,0.0033224046,0.00002561112,0.000039091083,0.000052769763,0.00005475029,0.80675143,0.012575389,0.0020950385,0.0013051927,0.1735852],"study_design_scores_gemma":[0.000003876123,0.000029719227,0.0001983402,0.0000015076541,0.0000043666378,0.000007219321,0.0000049319083,0.99717665,0.0020999138,0.000248679,0.00022255628,0.0000021730643],"about_ca_topic_score_codex":0.004323251,"about_ca_topic_score_gemma":0.005832209,"teacher_disagreement_score":0.004323251,"about_ca_system_score_codex":0.0003520588,"about_ca_system_score_gemma":0.0008363107,"threshold_uncertainty_score":0.008596182},"labels":[],"label_agreement":null},{"id":"W4415708273","doi":"10.1109/icme59968.2025.11209028","title":"SELIC: Semantic-Enhanced Learned Image Compression via High-Level Textual Guidance","year":2025,"lang":"","type":"article","venue":"","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Image compression; Encoder; Embedding; Bitstream; Compression (physics); Data compression; Encoding (memory); Image (mathematics)","score_opus":0.02519535927821152,"score_gpt":0.32065993594849734,"score_spread":0.2954645766702858,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4415708273","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016366636,0.00075799244,0.9761574,0.00025429868,0.00008086965,0.00007618519,0.00019251056,0.002567887,0.0035462352],"genre_scores_gemma":[0.35301843,0.0012956591,0.6295586,0.0006762449,0.00019739228,0.00016317502,0.001399851,0.0006150256,0.013075644],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996617,0.00004736061,0.000013041183,0.000039967337,0.00020517042,0.00003283259],"domain_scores_gemma":[0.99959534,0.00010255332,0.000053392178,0.00009380079,0.00012710698,0.000027745102],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004305926,0.0010058801,0.00047791627,0.0007106155,0.00019603792,0.0006059836,0.0009868047,0.0006583582,0.0026207229],"category_scores_gemma":[0.0014404607,0.0001837306,0.0003850275,0.00068139023,0.0005989507,0.0012405337,0.000900968,0.0011736014,0.0011383514],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003336215,0.00018627709,0.00087287376,0.00027685228,0.00007581305,0.0002918554,0.00010455946,0.14280002,0.09380183,0.020309614,0.010461362,0.7304853],"study_design_scores_gemma":[0.000024691337,0.00014516902,0.00027415832,0.00002579846,0.000022926639,0.0003434206,0.000026612213,0.9288382,0.05852912,0.0055869734,0.0061580027,0.00002492202],"about_ca_topic_score_codex":0.0019163559,"about_ca_topic_score_gemma":0.004279923,"teacher_disagreement_score":0.0026207229,"about_ca_system_score_codex":0.00042898452,"about_ca_system_score_gemma":0.0008483992,"threshold_uncertainty_score":0.008767188},"labels":[],"label_agreement":null},{"id":"W4416117257","doi":"10.48550/arxiv.2504.04658","title":"3DM-WeConvene: Learned Image Compression with 3D Multi-Level Wavelet-Domain Convolution and Entropy Model","year":2025,"lang":"en","type":"preprint","venue":"ArXiv.org","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; Mitacs; National Natural Science Foundation of China","keywords":"Prior probability; Entropy (arrow of time); Discrete wavelet transform; Convolution (computer science); Wavelet; Image compression; Pattern recognition (psychology); Entropy encoding; JPEG 2000","score_opus":0.07514908471430566,"score_gpt":0.3167097470363515,"score_spread":0.24156066232204587,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4416117257","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019359717,0.00071424374,0.9745054,0.00017403974,0.00006134685,0.000055257966,0.0001748541,0.0027741736,0.0021810113],"genre_scores_gemma":[0.54531527,0.0012637876,0.44104028,0.00050211715,0.000100491154,0.00022673844,0.0016019506,0.0005767908,0.009372597],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997826,0.000030447125,0.00001073684,0.000038519545,0.000107422835,0.000030316507],"domain_scores_gemma":[0.999701,0.00010177755,0.000038534545,0.000068064204,0.00006730384,0.000023361556],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00050979777,0.0008089781,0.0007214047,0.0005378923,0.0001607215,0.00064894266,0.0015128015,0.0007736952,0.0018420848],"category_scores_gemma":[0.0011073822,0.00030848332,0.0006873597,0.0004700188,0.00039768746,0.0012366417,0.0010543042,0.001345681,0.00064386876],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015242574,0.00010339532,0.0009129624,0.00009762097,0.000105166095,0.00016760868,0.00004280199,0.6254032,0.0122921495,0.012046375,0.004364067,0.34431228],"study_design_scores_gemma":[0.0000026039293,0.000013810617,0.00006169006,0.0000030967315,0.0000036821516,0.000028333332,0.0000012975439,0.99638945,0.0019768642,0.0009999891,0.00051533815,0.000003792838],"about_ca_topic_score_codex":0.004179548,"about_ca_topic_score_gemma":0.0048976676,"teacher_disagreement_score":0.004179548,"about_ca_system_score_codex":0.0006194982,"about_ca_system_score_gemma":0.00072401285,"threshold_uncertainty_score":0.008310437},"labels":[],"label_agreement":null},{"id":"W4416183493","doi":"10.1109/mipr67560.2025.00038","title":"Rate-Accuracy Bounds in Visual Coding for Machines","year":2025,"lang":"","type":"article","venue":"","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Coding (social sciences); Lossy compression; Data compression; Human visual system model; Point (geometry); Visualization; Context-adaptive binary arithmetic coding","score_opus":0.02115815331522214,"score_gpt":0.3758539405301131,"score_spread":0.354695787214891,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4416183493","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.021160131,0.020668095,0.919749,0.0035163774,0.00049143756,0.00007175975,0.00025910922,0.0005500566,0.03353396],"genre_scores_gemma":[0.6846003,0.023374477,0.27518752,0.001858316,0.0020117257,0.00056548667,0.0007843375,0.00086698774,0.010750883],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99446845,0.0014338421,0.00028855947,0.00047204454,0.0026274978,0.0007095452],"domain_scores_gemma":[0.95318687,0.037585605,0.0014614935,0.0037810924,0.0036250188,0.0003599132],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006368104,0.0020378781,0.001310159,0.002647821,0.00086655637,0.0036434224,0.0019788945,0.0023979235,0.0037762476],"category_scores_gemma":[0.053197093,0.00059258146,0.00094108144,0.002049652,0.004194969,0.008724703,0.0036725544,0.006339759,0.0016557635],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023862091,0.000059496993,0.0006411272,0.00039328207,0.000043535903,0.00014438982,0.0003695121,0.16235146,0.0059523527,0.7649496,0.005542795,0.059313893],"study_design_scores_gemma":[0.000015656959,0.00007850452,0.0003973386,0.0003067269,0.000020683216,0.0002373803,0.000104283456,0.48310062,0.009666979,0.4998473,0.006169176,0.000055339548],"about_ca_topic_score_codex":0.0016172196,"about_ca_topic_score_gemma":0.00088916917,"teacher_disagreement_score":0.006368104,"about_ca_system_score_codex":0.0029956847,"about_ca_system_score_gemma":0.00095842785,"threshold_uncertainty_score":0.033678114},"labels":[],"label_agreement":null},{"id":"W4416728328","doi":"10.1109/igarss55030.2025.11243140","title":"HSCNet: AHyperspectral Image Compression Method Based on Diffusion Model","year":2025,"lang":"","type":"article","venue":"","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Research and Development; National Postdoctoral Program for Innovative Talents; National Natural Science Foundation of China; Ministry of Natural Resources","keywords":"Hyperspectral imaging; Autoencoder; Robustness (evolution); Compression (physics); Data compression; Compression ratio; Image compression; Pattern recognition (psychology)","score_opus":0.01647790761415557,"score_gpt":0.3473002159344677,"score_spread":0.3308223083203121,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4416728328","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.026300544,0.00038672512,0.97058636,0.00023732726,0.00008360547,0.000037528287,0.00006439578,0.00048624442,0.0018172278],"genre_scores_gemma":[0.49054313,0.0010553596,0.49591696,0.00025633269,0.00012049384,0.00010794459,0.0004442052,0.00015387501,0.01140177],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99986756,0.000017536415,0.000006552248,0.000025150077,0.00007311099,0.0000101133455],"domain_scores_gemma":[0.9998709,0.00003440309,0.00001810139,0.00001801121,0.000047568672,0.000011045548],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003009665,0.000499076,0.00035075328,0.00052176084,0.00021792829,0.00031757206,0.0005539369,0.00054442673,0.0011463156],"category_scores_gemma":[0.00048566062,0.0001545771,0.0003449201,0.00038401593,0.0003919418,0.0008363975,0.00051208824,0.0006475732,0.00023407442],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022814354,0.0001064755,0.0011025103,0.00018328859,0.00008119611,0.0002385756,0.00013971709,0.33486894,0.15539522,0.023389068,0.004125821,0.48014113],"study_design_scores_gemma":[0.000006044521,0.000022645358,0.00018331489,0.0000050922645,0.0000058576675,0.00008914028,0.000006305131,0.98076403,0.01604865,0.0011681749,0.0016915894,0.0000091946],"about_ca_topic_score_codex":0.002970041,"about_ca_topic_score_gemma":0.0035496913,"teacher_disagreement_score":0.002970041,"about_ca_system_score_codex":0.00043632791,"about_ca_system_score_gemma":0.000516944,"threshold_uncertainty_score":0.005905509},"labels":[],"label_agreement":null},{"id":"W4417402951","doi":"10.1109/is264627.2025.11284645","title":"Object-Based Audio Coding in Immersive Mobile Communications","year":2025,"lang":"","type":"article","venue":"","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Q & T Research; Université de Sherbrooke; VoiceAge (Canada)","funders":"","keywords":"Codec; Audio over Ethernet; Digital audio; Coding (social sciences); Speech coding; Wideband audio; Digital audio broadcasting; Adaptive Multi-Rate audio codec","score_opus":0.022453206450834644,"score_gpt":0.34046150136443065,"score_spread":0.318008294913596,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4417402951","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.026471797,0.0050662532,0.9540226,0.0002449108,0.0001565666,0.000066727756,0.000053666983,0.0005537681,0.013363764],"genre_scores_gemma":[0.48422557,0.007126057,0.49211764,0.00026077958,0.00020191658,0.00010441294,0.00017726219,0.00014467946,0.01564162],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99974114,0.000052250136,0.000011280053,0.000023273296,0.00014028543,0.000031758478],"domain_scores_gemma":[0.99965143,0.00012451755,0.000033758843,0.00006861322,0.00010554948,0.000016175887],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034449913,0.00036081063,0.0002058468,0.0005258068,0.00020564218,0.0008055937,0.00035159374,0.0004524465,0.002131858],"category_scores_gemma":[0.0007790498,0.00014856653,0.00017217545,0.00089644926,0.00045006818,0.0007416681,0.0005624402,0.00068189437,0.0007060873],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002065562,0.00006859602,0.0007697869,0.0003046322,0.000026263628,0.00040469805,0.00058555714,0.057526667,0.17469512,0.21094683,0.0042575453,0.55020785],"study_design_scores_gemma":[0.000034598237,0.000364995,0.0013202279,0.00027468783,0.000040423405,0.0016026534,0.00029794028,0.6728301,0.16956356,0.05388171,0.09968316,0.000105991516],"about_ca_topic_score_codex":0.001996806,"about_ca_topic_score_gemma":0.001888502,"teacher_disagreement_score":0.002131858,"about_ca_system_score_codex":0.00040224512,"about_ca_system_score_gemma":0.00044607036,"threshold_uncertainty_score":0.0071317554},"labels":[],"label_agreement":null},{"id":"W4417471863","doi":"10.5120/ijca2025926002","title":"Representation Learning with Adaptive Superpixel Coding","year":2025,"lang":"","type":"article","venue":"International Journal of Computer Applications","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Windsor","funders":"","keywords":"Coding (social sciences); Representation (politics); Feature learning; Neural coding; Pattern recognition (psychology)","score_opus":0.018325307062052074,"score_gpt":0.33513877500133527,"score_spread":0.31681346793928317,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4417471863","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011160341,0.0001488361,0.98621166,0.0001141964,0.000030724204,0.00003566923,0.000084115905,0.0008479637,0.0013665807],"genre_scores_gemma":[0.4742249,0.00036140243,0.5188643,0.00028444765,0.000069867565,0.00015494144,0.00064287847,0.0002539894,0.0051432797],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99966264,0.00006996688,0.00001434589,0.00008829961,0.0001219067,0.000042866795],"domain_scores_gemma":[0.9995402,0.00013391521,0.000049723392,0.0001329131,0.000116446885,0.000026936757],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00066096254,0.0006020043,0.000558008,0.00058267696,0.0001778806,0.00068257184,0.0017046778,0.0007490562,0.0019469897],"category_scores_gemma":[0.0018998365,0.00026184108,0.00049537705,0.0008858779,0.00055806246,0.001629546,0.0011128093,0.0014782146,0.00068596477],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019175735,0.00014535192,0.00075275986,0.00009973014,0.00006218513,0.000087513035,0.00008517405,0.37662593,0.023803236,0.036717933,0.0071675847,0.55426097],"study_design_scores_gemma":[0.0000046061673,0.000019306752,0.000062816194,0.0000032955986,0.000003967441,0.00002298364,0.0000043704204,0.98965144,0.003802126,0.005841544,0.0005806175,0.0000029905632],"about_ca_topic_score_codex":0.0031713378,"about_ca_topic_score_gemma":0.00505244,"teacher_disagreement_score":0.0031713378,"about_ca_system_score_codex":0.00068216375,"about_ca_system_score_gemma":0.00080792117,"threshold_uncertainty_score":0.0065132976},"labels":[],"label_agreement":null},{"id":"W45057407","doi":"","title":"Low-Band-Shifted Hierarchical Backward Motion Estimation, Compensation for Wavelet-Based Video Coding.","year":2002,"lang":"en","type":"article","venue":"Indian Conference on Computer Vision, Graphics and Image Processing","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Motion compensation; Motion estimation; Quarter-pixel motion; Computer science; Wavelet; Inter frame; Reference frame; Artificial intelligence; Computer vision; Wavelet transform; Block-matching algorithm; Quantization (signal processing); Algorithm; Mathematics; Frame (networking); Video processing; Telecommunications; Video tracking","score_opus":0.026795928142501098,"score_gpt":0.28672285332308795,"score_spread":0.25992692518058685,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W45057407","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009345107,0.0009497233,0.988112,0.000068802605,0.000060858958,0.00005494564,0.00005230579,0.00033176527,0.0010244683],"genre_scores_gemma":[0.16885266,0.0011473161,0.8250591,0.000097559154,0.00006093764,0.00009826123,0.00039908127,0.000048413338,0.0042366674],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9998599,0.000027081862,0.000008027141,0.000014853795,0.00007796739,0.0000121981975],"domain_scores_gemma":[0.99989474,0.000020580064,0.000017471904,0.000023141702,0.000035337056,0.000008783431],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028613,0.00036902598,0.00024774822,0.00036261257,0.00020654808,0.00026461147,0.000540736,0.00037132506,0.0009582284],"category_scores_gemma":[0.00045296803,0.00015408515,0.00024116725,0.00041706386,0.00022020016,0.00041035414,0.00032036484,0.00048746943,0.0005306549],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019903637,0.00008291905,0.0005413105,0.00023311556,0.00004462563,0.00019275708,0.00009787066,0.04212206,0.3909527,0.034624465,0.0064767855,0.52443236],"study_design_scores_gemma":[0.000037590253,0.00016557086,0.00078573666,0.00003511611,0.00003407097,0.00036205552,0.000019871186,0.8937879,0.08486802,0.0054449723,0.014428794,0.000030208477],"about_ca_topic_score_codex":0.002289441,"about_ca_topic_score_gemma":0.0050130114,"teacher_disagreement_score":0.002289441,"about_ca_system_score_codex":0.00029225866,"about_ca_system_score_gemma":0.000462829,"threshold_uncertainty_score":0.0045521855},"labels":[],"label_agreement":null},{"id":"W67692142","doi":"10.1007/978-1-4615-0265-4_9","title":"Digital Video Compression Techniques","year":2003,"lang":"en","type":"book-chapter","venue":"","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Digital video; Compression (physics); Computer science; Data compression; Computer graphics (images); Computer vision; Materials science; Telecommunications; Composite material","score_opus":0.016797208747747996,"score_gpt":0.2551472656774637,"score_spread":0.23835005692971573,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W67692142","genre_codex":"other","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006320025,0.0497797,0.3894731,0.000856468,0.002692593,0.00027966258,0.0004664598,0.0032572795,0.5468747],"genre_scores_gemma":[0.035512373,0.044542808,0.12026156,0.00062586344,0.0012339976,0.00017033178,0.000941414,0.00043929918,0.7962724],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997615,0.000008916427,0.0000064441892,0.00002923361,0.00017973682,0.000014174681],"domain_scores_gemma":[0.9998067,0.000038513197,0.000009758244,0.000038056813,0.000095400384,0.000011610513],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013733434,0.0010320448,0.00053690956,0.0019338746,0.0004911829,0.00091038214,0.00092319644,0.00067097624,0.038440082],"category_scores_gemma":[0.0004214371,0.00031556052,0.00033307137,0.0020051007,0.00046085333,0.0012824953,0.0006731164,0.0011075469,0.021804187],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000034342604,0.000048318365,0.00006976622,0.00038916554,0.000013304859,0.00012422404,0.00008803243,0.0011335224,0.033848282,0.022906145,0.059933387,0.88141155],"study_design_scores_gemma":[0.00001903021,0.0001073265,0.0007408015,0.0003254729,0.00004660466,0.001842048,0.00006529527,0.011680944,0.055954363,0.015545802,0.91363496,0.000037209735],"about_ca_topic_score_codex":0.0006828012,"about_ca_topic_score_gemma":0.0011295059,"teacher_disagreement_score":0.038440082,"about_ca_system_score_codex":0.0004146344,"about_ca_system_score_gemma":0.00034457108,"threshold_uncertainty_score":0.12859488},"labels":[],"label_agreement":null},{"id":"W68119398","doi":"10.1007/bf02994792","title":"Control mechanisms to improve the robustness of mpeg-2 based communications over ATM networks","year":2000,"lang":"en","type":"article","venue":"Annals of Telecommunications","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Humanities; Computer science; Telecommunications; Art","score_opus":0.03751922478094628,"score_gpt":0.3318578389301215,"score_spread":0.2943386141491752,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W68119398","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.35259062,0.0024481236,0.62713915,0.00071577245,0.0006583501,0.00023989577,0.00020015922,0.0051754937,0.010832597],"genre_scores_gemma":[0.97039515,0.00030172948,0.026818365,0.00017236154,0.0002753014,0.000044787474,0.00006710201,0.00009380451,0.0018314524],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996362,0.000058389378,0.00003561947,0.000042892734,0.00013958145,0.000087396],"domain_scores_gemma":[0.99842525,0.0006904929,0.00022758587,0.00026876974,0.0003373942,0.000050484065],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00097348396,0.0006876843,0.0002954243,0.0008332073,0.00038477854,0.00093360554,0.0009268028,0.00063589937,0.0034092632],"category_scores_gemma":[0.0035293787,0.00019443456,0.00019730482,0.0002832645,0.00041788106,0.0010609911,0.00063038105,0.00082775694,0.00032244142],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0018143321,0.0004863693,0.0012393177,0.00026751283,0.000091241185,0.0003944462,0.000278836,0.10026509,0.5262226,0.043216217,0.004793623,0.32093042],"study_design_scores_gemma":[0.00020156459,0.0006496577,0.0014796932,0.000056096545,0.00011763976,0.00026012553,0.00005601326,0.74639183,0.23360929,0.011110009,0.0060032285,0.000064931795],"about_ca_topic_score_codex":0.0006323179,"about_ca_topic_score_gemma":0.0007538469,"teacher_disagreement_score":0.0034092632,"about_ca_system_score_codex":0.00037981628,"about_ca_system_score_gemma":0.00021863863,"threshold_uncertainty_score":0.01140511},"labels":[],"label_agreement":null},{"id":"W6910212255","doi":"10.4224/21263089","title":"GDAC DAQ file format Version 2","year":2012,"lang":"en","type":"article","venue":"NPARC","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Data acquisition; Channel (broadcasting); File format; Software; Data file; Computer file","score_opus":0.013365194801498703,"score_gpt":0.2582659396431931,"score_spread":0.2449007448416944,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6910212255","genre_codex":"dataset","genre_gemma":"software","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"software","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0029544125,0.0005598304,0.12654814,0.0014419736,0.0023041894,0.0021723995,0.56332374,0.140356,0.16033936],"genre_scores_gemma":[0.013819069,0.00068421103,0.05886035,0.0014116961,0.0005985007,0.002740063,0.6985852,0.04895096,0.17434993],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99752444,0.0002979256,0.0003441483,0.00033670972,0.0012350375,0.00026174058],"domain_scores_gemma":[0.9875766,0.0014530221,0.0004444062,0.0023592333,0.007962193,0.00020451607],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0019719359,0.0015666538,0.0012307434,0.0035927303,0.0013856159,0.003924661,0.0034706842,0.0017271602,0.45057476],"category_scores_gemma":[0.011213626,0.0010246421,0.00064553885,0.004180673,0.00045697603,0.0035751194,0.0018370085,0.0022591958,0.36597392],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003074303,0.000039099767,0.00022821063,0.00029962297,0.000017377177,0.00008863877,0.00006550015,0.00035869188,0.003144973,0.0034768495,0.951507,0.040466662],"study_design_scores_gemma":[0.00008389479,0.00003685804,0.0005965886,0.000114207185,0.000012299113,0.00020928092,0.000051159826,0.00091917394,0.0059696166,0.0016411296,0.99030954,0.000056185934],"about_ca_topic_score_codex":0.0064007062,"about_ca_topic_score_gemma":0.0032211533,"teacher_disagreement_score":0.45057476,"about_ca_system_score_codex":0.0014805067,"about_ca_system_score_gemma":0.0018860544,"threshold_uncertainty_score":0.7836884},"labels":[],"label_agreement":null},{"id":"W6930366858","doi":"10.5281/zenodo.11109658","title":"Testovate Male Performance Supplement in USA, CA, UK, NZ, AU, ZA","year":2024,"lang":"en","type":"other","venue":"Zenodo (CERN European Organization for Nuclear Research)","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Libido; Aphrodisiac; Testosterone (patch); Sexual function; Erectile dysfunction; Performance enhancement","score_opus":0.03088711936764973,"score_gpt":0.26967978721951963,"score_spread":0.2387926678518699,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6930366858","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003730155,0.007808401,0.0013283114,0.002198938,0.0025961602,0.0004480916,0.005829707,0.0025264742,0.9735338],"genre_scores_gemma":[0.00974405,0.003238541,0.0018271374,0.0009132987,0.00021584601,0.00014235305,0.0020973892,0.00066241587,0.9811591],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99959093,0.000029216639,0.000022152906,0.000075906464,0.00023991699,0.000041900985],"domain_scores_gemma":[0.99943334,0.0000545889,0.000043365166,0.000046844274,0.00026171427,0.0001600241],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0005248462,0.0005624397,0.00046738086,0.0014100443,0.0012241802,0.00142165,0.00057863444,0.0008576105,0.5292398],"category_scores_gemma":[0.0014283356,0.0003144913,0.0003953471,0.0007776786,0.0004961809,0.001395408,0.001329441,0.0009858345,0.26686954],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00038741986,0.00012792784,0.0004231315,0.00090284017,0.0000090575195,0.00012228177,0.00023683181,0.000035047684,0.0065452657,0.004071444,0.66475093,0.3223878],"study_design_scores_gemma":[0.00001176568,0.000052389325,0.0009452129,0.000091978574,0.0000034644652,0.000050901202,0.000040755032,0.0000114865425,0.0002981075,0.000099461475,0.99839157,0.000002835867],"about_ca_topic_score_codex":0.0141189555,"about_ca_topic_score_gemma":0.052533314,"teacher_disagreement_score":0.5292398,"about_ca_system_score_codex":0.00078342535,"about_ca_system_score_gemma":0.0022662578,"threshold_uncertainty_score":0.6714823},"labels":[],"label_agreement":null},{"id":"W6930385221","doi":"10.5281/zenodo.14033619","title":"FIGURES 1–2 in A revision and addition to Zopheridae (Coleoptera: Tenebrionoidea) in Baltic amber: possible connections between modern Holarctic distributions and Eocene 'amber forests'","year":2024,"lang":"en","type":"other","venue":"Zenodo (CERN European Organization for Nuclear Research)","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Royal Saskatchewan Museum; University of Regina","funders":"","keywords":"Holarctic; Scale (ratio); Dorsum; Neogene; Biostratigraphy","score_opus":0.023227369842647706,"score_gpt":0.2737765940388787,"score_spread":0.250549224196231,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6930385221","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.062780485,0.02870563,0.032528207,0.006929061,0.03711388,0.002244732,0.079153374,0.008074518,0.7424701],"genre_scores_gemma":[0.27684414,0.025686182,0.08666245,0.002569853,0.005113801,0.0015238397,0.077782124,0.0032046607,0.520613],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9997634,0.000028839346,0.000026042404,0.000075853626,0.000074255855,0.00003150795],"domain_scores_gemma":[0.99967146,0.000035229874,0.000052215313,0.000066235116,0.00014381036,0.00003103454],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003169517,0.0009388863,0.00036524827,0.0044757337,0.0013894042,0.00083717617,0.0011135478,0.00083841314,0.099524215],"category_scores_gemma":[0.0010004786,0.00034050058,0.0003738557,0.0029115665,0.0011438603,0.0018552374,0.00067283935,0.0015692277,0.034481924],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00024389295,0.00007754661,0.005501759,0.0009850985,0.0000551619,0.0006054864,0.0012325306,0.0003885871,0.007875826,0.0055704406,0.5480702,0.42939353],"study_design_scores_gemma":[0.000010939644,0.00002004658,0.01609918,0.00014701324,0.00002130661,0.0006167393,0.00018425845,0.000117319665,0.00039433702,0.00054994307,0.98182756,0.00001142284],"about_ca_topic_score_codex":0.012691547,"about_ca_topic_score_gemma":0.0367349,"teacher_disagreement_score":0.099524215,"about_ca_system_score_codex":0.000839136,"about_ca_system_score_gemma":0.0009023146,"threshold_uncertainty_score":0.33294165},"labels":[],"label_agreement":null},{"id":"W6930503977","doi":"10.5281/zenodo.14817863","title":"A Maternity Roost of Silver-Haired Bats (Lasionycteris noctivagans) in New Brunswick: First Evidence of Parturition in Atlantic Canada","year":2021,"lang":"en","type":"article","venue":"Zenodo (CERN European Organization for Nuclear Research)","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"White (mutation); Atlantic forest; Wildlife; Pinus <genus>","score_opus":0.035102138902098165,"score_gpt":0.25073004202306887,"score_spread":0.2156279031209707,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6930503977","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9848332,0.0009305144,0.00023307938,0.00045419656,0.000040018116,0.000057091278,0.0036759519,0.000043622415,0.009732331],"genre_scores_gemma":[0.9849974,0.0011206021,0.0010068673,0.00020275387,0.000015774614,0.000021640777,0.00251557,0.000023780554,0.010095769],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.9998628,0.000005708659,0.0000045047636,0.000020290478,0.000046185734,0.00006050476],"domain_scores_gemma":[0.9993943,0.000044910845,0.000067741144,0.000020678412,0.00026620206,0.00020620113],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017402816,0.00020666646,0.0002170389,0.0013312737,0.0023275232,0.0003907493,0.0005222422,0.00029702362,0.0029328356],"category_scores_gemma":[0.00043545538,0.00022587136,0.00015119209,0.0009775879,0.0005120014,0.00013726953,0.00058769557,0.0004710666,0.00063746277],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":true,"about_ca_topic_consensus":true,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00046821855,0.00006499216,0.89195913,0.00016324261,0.000055513814,0.013777572,0.012103128,0.00016780179,0.031387046,0.00026514792,0.008183281,0.04140506],"study_design_scores_gemma":[0.000003448911,0.000050470455,0.9875382,0.000045281005,0.000010831238,0.0012304762,0.004233132,0.000047441823,0.0005348305,0.000019653055,0.006273266,0.000013063185],"about_ca_topic_score_codex":0.8997772,"about_ca_topic_score_gemma":0.98466486,"teacher_disagreement_score":0.100222826,"about_ca_system_score_codex":0.003888294,"about_ca_system_score_gemma":0.0034258852,"threshold_uncertainty_score":0.20162606},"labels":[],"label_agreement":null},{"id":"W6945280292","doi":"10.25316/ir-13920","title":"Nanaimo Free Press [Monday, February 13, 1893]","year":2019,"lang":"en","type":"other","venue":"VIUSpace (Vancouver Island University Library)","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"","score_opus":0.00766661698174278,"score_gpt":0.19436056645282873,"score_spread":0.18669394947108595,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6945280292","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0009235582,0.013564699,0.00015642178,0.0026895476,0.004124439,0.00003195025,0.004176406,0.00021493192,0.97411805],"genre_scores_gemma":[0.001337071,0.0018438615,0.00006599479,0.0001036049,0.00012607808,0.000008603252,0.00035167695,0.000065511886,0.99609756],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9996599,0.000019001087,0.000012878401,0.000051955867,0.00019047507,0.00006588753],"domain_scores_gemma":[0.99971515,0.000030379348,0.00001571524,0.00002172166,0.00015952061,0.0000574261],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00029627528,0.0010220449,0.0006604484,0.0023019144,0.0038890329,0.005444563,0.00077955174,0.0015153526,0.3924629],"category_scores_gemma":[0.0012953812,0.00046946114,0.00034295456,0.00394188,0.0006946083,0.0018821715,0.001251144,0.0023996388,0.14517799],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004692477,0.000009902945,0.00021368859,0.00012332897,0.0000054709076,0.00012686508,0.00011378544,0.00007697669,0.00015075761,0.008926149,0.94300526,0.04720092],"study_design_scores_gemma":[0.0000021231501,0.0000024431765,0.00046253687,0.000051599938,0.0000010125308,0.000019900093,0.000038693954,0.000014617318,0.000040769613,0.0002685934,0.9990946,0.0000029969244],"about_ca_topic_score_codex":0.16606167,"about_ca_topic_score_gemma":0.5638807,"teacher_disagreement_score":0.6075371,"about_ca_system_score_codex":0.00474181,"about_ca_system_score_gemma":0.0028414463,"threshold_uncertainty_score":0.8665779},"labels":[],"label_agreement":null},{"id":"W6948951707","doi":"10.5281/zenodo.10796956","title":"MODERNIZATION OF A PROGRESSIVEBTC ALGORITHM FOR DISTRIBUTED IMAGE COMPRESSION","year":2024,"lang":"en","type":"article","venue":"Zenodo (CERN European Organization for Nuclear Research)","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Bell (Canada)","funders":"","keywords":"Image compression; Image processing; Data compression; Image (mathematics); Compression (physics); Compression ratio; Image quality","score_opus":0.026508791143436468,"score_gpt":0.28706378987626974,"score_spread":0.2605549987328333,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6948951707","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004075959,0.00044753827,0.99237,0.00010482263,0.00009001571,0.00008622089,0.000035007633,0.00058448367,0.0022059206],"genre_scores_gemma":[0.07554468,0.00073596364,0.9184036,0.000095030235,0.00012606112,0.00017744405,0.0003153586,0.00014047613,0.0044613658],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99938333,0.00005697855,0.000030927513,0.00006878827,0.0004255615,0.000034386183],"domain_scores_gemma":[0.99925894,0.00015968063,0.00004446023,0.00014709921,0.00035999002,0.000029841702],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005039575,0.000654672,0.00044364564,0.0013946175,0.0005505476,0.00077571656,0.0008935078,0.00078268733,0.002756348],"category_scores_gemma":[0.0017198824,0.00023181854,0.0004642677,0.0013351548,0.0006966843,0.0008856497,0.00085014716,0.0013379782,0.0012391655],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017588533,0.00008435812,0.00050330686,0.00020991781,0.00003840167,0.00025582552,0.00020973569,0.060055956,0.13267553,0.04854727,0.0052457033,0.7519981],"study_design_scores_gemma":[0.000065127686,0.00020141272,0.000812343,0.000059424714,0.000029577177,0.0010649745,0.000050897776,0.8635345,0.079132415,0.013864873,0.041138783,0.000045729368],"about_ca_topic_score_codex":0.0032891396,"about_ca_topic_score_gemma":0.003173526,"teacher_disagreement_score":0.0032891396,"about_ca_system_score_codex":0.00073423696,"about_ca_system_score_gemma":0.0011210536,"threshold_uncertainty_score":0.009220958},"labels":[],"label_agreement":null},{"id":"W6949749950","doi":"10.5281/zenodo.3385073","title":"Mobility Emissions Tool 1.1","year":2019,"lang":"en","type":"other","venue":"Zenodo (CERN European Organization for Nuclear Research)","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Work (physics); Greenhouse gas; Production (economics); Climate change; Air pollution","score_opus":0.03002261062211866,"score_gpt":0.2715241611914287,"score_spread":0.24150155056931003,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6949749950","genre_codex":"software","genre_gemma":"software","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"software","genre_consensus":"software","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0017125283,0.00066613464,0.1748379,0.00077037315,0.0004210126,0.00033109394,0.0844085,0.6649199,0.07193256],"genre_scores_gemma":[0.045698967,0.0016022539,0.20122218,0.0015894659,0.00030907927,0.0018288441,0.30386108,0.28622365,0.15766451],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9985707,0.00017964808,0.00010392485,0.00020480467,0.0007566483,0.00018425733],"domain_scores_gemma":[0.9983972,0.00054447784,0.00007932928,0.00031068386,0.0005914886,0.000076713164],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014475466,0.0020682476,0.0011467241,0.0030254954,0.00083767885,0.0029701497,0.0044968384,0.0019145493,0.24574062],"category_scores_gemma":[0.008032477,0.0016793477,0.0014030113,0.0024853272,0.00041010347,0.0036394726,0.0028627736,0.0021168867,0.14964567],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001733197,0.000050675742,0.0006064308,0.00046964787,0.0000330028,0.00011534709,0.00009647863,0.0023225688,0.0013421591,0.017227778,0.924349,0.053213533],"study_design_scores_gemma":[0.0001200414,0.000034219567,0.0004444382,0.00017474103,0.000028049819,0.00028545622,0.00006685128,0.013260606,0.00707178,0.01844858,0.95998716,0.000078042816],"about_ca_topic_score_codex":0.0061313733,"about_ca_topic_score_gemma":0.006968341,"teacher_disagreement_score":0.24574062,"about_ca_system_score_codex":0.001123329,"about_ca_system_score_gemma":0.0015873482,"threshold_uncertainty_score":0.8220843},"labels":[],"label_agreement":null},{"id":"W6950350503","doi":"10.5683/sp3/m4m8yb","title":"Data from: Influence of ecological and geological features on rangewide patterns of genetic structure in a widespread passerine.","year":2020,"lang":"en","type":"dataset","venue":"Borealis","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Lethbridge","funders":"","keywords":"Biological dispersal; Range (aeronautics); Genetic structure; Panmixia; Plateau (mathematics); Gene flow; Cline (biology)","score_opus":0.0273292924290745,"score_gpt":0.29384934463718343,"score_spread":0.2665200522081089,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6950350503","genre_codex":"empirical","genre_gemma":"dataset","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"dataset","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99696785,0.00003447814,0.000116637275,0.00003351026,0.000004500974,0.0000054462307,0.0018157447,0.00000608164,0.0010157584],"genre_scores_gemma":[0.9926346,0.000057109388,0.00038028383,0.000036769634,0.000005975542,0.000028060367,0.0048730695,0.000013590539,0.001970692],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.9998611,0.00003587364,0.000009809067,0.000054958142,0.000024078958,0.0000142260005],"domain_scores_gemma":[0.9995116,0.00014656725,0.00011881009,0.00004125333,0.0000608343,0.000120956574],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024243824,0.00009895126,0.00013904907,0.00031742526,0.00021229243,0.0002581671,0.0001460311,0.00019003479,0.0084068775],"category_scores_gemma":[0.00079875963,0.00008559452,0.000089815665,0.00031899914,0.00017992897,0.00012403906,0.00020996777,0.00021816426,0.0012594975],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004279212,0.00008184367,0.97232485,0.000040014256,0.00012477647,0.0002482802,0.0007396199,0.00018649618,0.009254887,0.00005723038,0.0018435412,0.014670489],"study_design_scores_gemma":[0.0000037921568,0.000021405436,0.9993087,0.000004430809,0.0000075496782,0.000035798203,0.000054030013,0.00006768879,0.00007128338,0.0000069898197,0.0004171361,0.0000010628892],"about_ca_topic_score_codex":0.014722526,"about_ca_topic_score_gemma":0.037869684,"teacher_disagreement_score":0.014722526,"about_ca_system_score_codex":0.00015630813,"about_ca_system_score_gemma":0.000114624294,"threshold_uncertainty_score":0.029273689},"labels":[],"label_agreement":null},{"id":"W6967411402","doi":"10.5281/zenodo.10360699","title":"HYBRID IMAGE COMPRESSION TECHNIQUES USING DWT AND NEURAL NETWORKS","year":2023,"lang":"en","type":"article","venue":"Zenodo (CERN European Organization for Nuclear Research)","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Bell (Canada)","funders":"","keywords":"Lossless compression; Image compression; Lossy compression; Texture compression; Data compression; Data compression ratio; Artificial neural network; Compression (physics); Pattern recognition (psychology)","score_opus":0.03857139537532728,"score_gpt":0.2842687702323905,"score_spread":0.24569737485706322,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6967411402","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04602338,0.001921023,0.9463782,0.00014430734,0.00013497079,0.00010846594,0.000097715514,0.000915136,0.0042768535],"genre_scores_gemma":[0.392896,0.0027016287,0.59455884,0.00021051776,0.00013998867,0.00016904982,0.0003870711,0.00011101814,0.008825889],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996486,0.000027188384,0.00002284375,0.00005333889,0.00022851299,0.000019398316],"domain_scores_gemma":[0.9997205,0.00008229869,0.000040222563,0.00004141835,0.0001070077,0.000008438129],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031883435,0.00054172624,0.00037358704,0.0011336457,0.00018537504,0.0004923114,0.00053503236,0.0004812367,0.0013560195],"category_scores_gemma":[0.0008358131,0.00018537346,0.00029924838,0.001235123,0.00027618845,0.0011618354,0.000436666,0.00047567586,0.0005195762],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022363069,0.00010933265,0.00071098364,0.00035508236,0.00010094006,0.00022752334,0.0000738151,0.04742265,0.21300387,0.0061062626,0.0017198931,0.729946],"study_design_scores_gemma":[0.00003563539,0.00025139705,0.0017889537,0.000056746772,0.0000667982,0.00087175384,0.000039758204,0.78797805,0.19459248,0.003728303,0.0105442405,0.000045881847],"about_ca_topic_score_codex":0.0008536316,"about_ca_topic_score_gemma":0.0012134272,"teacher_disagreement_score":0.0013560195,"about_ca_system_score_codex":0.0002969302,"about_ca_system_score_gemma":0.00018652734,"threshold_uncertainty_score":0.004536271},"labels":[],"label_agreement":null},{"id":"W6982360336","doi":"","title":"Image Data Compression . Blue Book. Issue 1 - CCSDS 122.0-B-1 Cor.3","year":2005,"lang":"en","type":"article","venue":"Biblioteca Digital da Memória Científica do INPE (National Institute for Space Research)","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Nuclear Physics; National Institute of Information and Communications Technology; Japan Aerospace Exploration Agency; Canadian Space Agency; Korea Aerospace Research Institute; European Organization for the Exploitation of Meteorological Satellites; Iran Telecommunication Research Center; European Space Agency; Agenzia Spaziale Italiana; U.S. Geological Survey; Indian Space Research Organisation; Centre National d’Etudes Spatiales; Commonwealth Scientific and Industrial Research Organisation; National Aeronautics and Space Administration; National Oceanic and Atmospheric Administration; National Space Organization; Belgian Federal Science Policy Office","keywords":"Nucleofection; Gestational period; TSG101; Dysgeusia; Diafiltration; Durvalumab; Triacetin; Emperipolesis; Hyporeflexia","score_opus":0.11769710881222337,"score_gpt":0.41007160140509674,"score_spread":0.2923744925928734,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6982360336","genre_codex":"other","genre_gemma":"software","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"software","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0009270846,0.010886791,0.052628744,0.0040401276,0.008680518,0.0007867221,0.017706588,0.021946207,0.88239723],"genre_scores_gemma":[0.0021471388,0.0046905996,0.010839252,0.00096021604,0.0010435529,0.00015475952,0.012691569,0.0036249235,0.963848],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99900156,0.00004490523,0.00005035525,0.00009730048,0.0007586609,0.00004729166],"domain_scores_gemma":[0.9974349,0.00034670558,0.00008574432,0.00038065852,0.0015940749,0.00015804911],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0008209449,0.0017885555,0.0009582051,0.0053696767,0.0008504089,0.0030737182,0.001869277,0.0018943243,0.4599968],"category_scores_gemma":[0.0029882225,0.00095690775,0.0005076847,0.0038137638,0.0005757273,0.0027605651,0.0010508437,0.002174397,0.43202505],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003402088,0.000025207539,0.000044975583,0.00021555509,0.0000046769414,0.000028469622,0.000017791164,0.00013646873,0.002346551,0.004434689,0.84973055,0.14298107],"study_design_scores_gemma":[0.000008594557,0.000017606,0.00026310695,0.00009452854,0.0000025128763,0.000100880025,0.000010561933,0.00032155353,0.0014523538,0.0012370086,0.996482,0.000009220797],"about_ca_topic_score_codex":0.006460722,"about_ca_topic_score_gemma":0.009268985,"teacher_disagreement_score":0.4599968,"about_ca_system_score_codex":0.0014277222,"about_ca_system_score_gemma":0.0018341377,"threshold_uncertainty_score":0.770249},"labels":[],"label_agreement":null},{"id":"W6997358968","doi":"","title":"Variable frame size for vector quantization and application to speech coding","year":2005,"lang":"en","type":"dissertation","venue":"eScholarship@McGill (McGill)","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"McGill University; Library and Archives Canada","funders":"","keywords":"Gratitude; Quality (philosophy); Filter (signal processing); The Internet","score_opus":0.01261226711689991,"score_gpt":0.2768442613223895,"score_spread":0.2642319942054896,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6997358968","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0036965457,0.00075245264,0.989165,0.00020556439,0.00024330978,0.00013184531,0.00033202823,0.0027781143,0.0026950932],"genre_scores_gemma":[0.13984817,0.0012084754,0.84465224,0.00012546417,0.0001529298,0.00044024736,0.0013649855,0.0002906664,0.011916821],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992724,0.00018806026,0.00007265486,0.000105436935,0.0002983785,0.00006304663],"domain_scores_gemma":[0.998976,0.00043332388,0.000043410728,0.00014404401,0.00037641492,0.000026812555],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011804546,0.0006001899,0.00048050281,0.0011501926,0.00040630403,0.00094340753,0.0010731964,0.00097234384,0.013629257],"category_scores_gemma":[0.0043837037,0.00030027117,0.0004365116,0.0016486007,0.00043995993,0.0010103263,0.00079865305,0.0009860871,0.0035679606],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00034502643,0.00006118102,0.00045669795,0.0002754878,0.000028926313,0.000097352684,0.00020006778,0.03952724,0.025148934,0.041515246,0.015490229,0.8768535],"study_design_scores_gemma":[0.000082864964,0.00020702033,0.0012249283,0.00014955178,0.000026222448,0.00024215804,0.00015914346,0.8817349,0.04057048,0.029716434,0.045824837,0.00006151428],"about_ca_topic_score_codex":0.009874362,"about_ca_topic_score_gemma":0.0091684265,"teacher_disagreement_score":0.013629257,"about_ca_system_score_codex":0.0007009963,"about_ca_system_score_gemma":0.0011091849,"threshold_uncertainty_score":0.045594394},"labels":[],"label_agreement":null},{"id":"W6999509932","doi":"","title":"Compressão de Dados Livre de Perdas - CCSDS 120.0-G-2 -S","year":2006,"lang":"pt","type":"article","venue":"Biblioteca Digital da Memória Científica do INPE (National Institute for Space Research)","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Nuclear Physics; National Institute of Information and Communications Technology; Japan Aerospace Exploration Agency; Canadian Space Agency; Korea Aerospace Research Institute; European Organization for the Exploitation of Meteorological Satellites; Iran Telecommunication Research Center; European Space Agency; Agenzia Spaziale Italiana; U.S. Geological Survey; Indian Space Research Organisation; Centre National d’Etudes Spatiales; Commonwealth Scientific and Industrial Research Organisation; National Aeronautics and Space Administration; National Oceanic and Atmospheric Administration; National Space Organization; Belgian Federal Science Policy Office","keywords":"Data system; Space (punctuation); Data transmission; Network packet; Data format; Data link","score_opus":0.08872075968668794,"score_gpt":0.38698055391634684,"score_spread":0.29825979422965887,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6999509932","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011969122,0.009195157,0.56356376,0.007460696,0.009621043,0.0021280975,0.015251294,0.039648324,0.3411626],"genre_scores_gemma":[0.095333524,0.01517701,0.3088596,0.005408612,0.003212696,0.0018347466,0.04225271,0.008792056,0.51912904],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9970607,0.00040308503,0.00021408644,0.00024691375,0.0018963182,0.0001789631],"domain_scores_gemma":[0.99649364,0.00070340553,0.00014718682,0.0007028221,0.0017872782,0.00016560215],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020207826,0.0013305518,0.00094158645,0.0028517735,0.0010802695,0.0043469137,0.001946584,0.0017096951,0.073865],"category_scores_gemma":[0.0063882605,0.0005730349,0.00065179385,0.0026763997,0.001097723,0.0033693977,0.0022691437,0.002213893,0.040354904],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007488218,0.00009774551,0.0008603808,0.00091443065,0.00005020129,0.0005206891,0.00049286307,0.0049130316,0.027533224,0.11238238,0.46217802,0.38930815],"study_design_scores_gemma":[0.000049481212,0.000121678095,0.0007190657,0.00027356434,0.000020288002,0.0004406597,0.0001248074,0.008808543,0.013586659,0.00897987,0.96681833,0.00005708205],"about_ca_topic_score_codex":0.011381549,"about_ca_topic_score_gemma":0.009941702,"teacher_disagreement_score":0.073865,"about_ca_system_score_codex":0.002139921,"about_ca_system_score_gemma":0.00278481,"threshold_uncertainty_score":0.24710304},"labels":[],"label_agreement":null},{"id":"W7000040129","doi":"","title":"Efficient data encoder for endoscopic\\nimaging applications","year":2010,"lang":"en","type":"article","venue":"University Library - University of Saskatchewan (University of Saskatchewan)","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Encoder; Bandwidth (computing); Process (computing); Data transmission; Image quality; Image compression; Medical imaging; Wireless; Data compression","score_opus":0.012115281742097713,"score_gpt":0.2068074005006644,"score_spread":0.19469211875856668,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7000040129","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0679898,0.0020932357,0.9210748,0.00025916667,0.00012828641,0.00014218033,0.00040925582,0.0034956783,0.004407621],"genre_scores_gemma":[0.4976277,0.0012676663,0.4894607,0.00016273752,0.00009565386,0.00017409706,0.0015148862,0.00014166239,0.009554844],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99971396,0.000043557124,0.000021231612,0.000031550768,0.00015937215,0.000030305002],"domain_scores_gemma":[0.99950683,0.0001667406,0.000059522572,0.000054381944,0.0001949739,0.000017554396],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031162522,0.0005073018,0.0003532688,0.00072773243,0.00028820886,0.0005792409,0.0007770812,0.0005097166,0.003171184],"category_scores_gemma":[0.00088008656,0.00015833956,0.00019903257,0.0007867017,0.00018173354,0.0010593872,0.00034908397,0.00046014664,0.0010517652],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0013646958,0.00022450218,0.001659375,0.00073378405,0.000059738435,0.0005336476,0.00019760543,0.043423027,0.23515587,0.016548852,0.010287093,0.6898118],"study_design_scores_gemma":[0.00009825427,0.00062801316,0.0011074297,0.00008048402,0.00006450288,0.00078712445,0.00009338954,0.5710777,0.39250913,0.0028376724,0.030666536,0.000049762835],"about_ca_topic_score_codex":0.0011455554,"about_ca_topic_score_gemma":0.0010965514,"teacher_disagreement_score":0.003171184,"about_ca_system_score_codex":0.00049667346,"about_ca_system_score_gemma":0.00054100127,"threshold_uncertainty_score":0.0106086135},"labels":[],"label_agreement":null},{"id":"W7001483446","doi":"","title":"11. Jimmy Mulville: Have I got a personal question for you","year":2020,"lang":"en","type":"other","venue":"Bulletin of Miscellaneous Information (Royal Gardens Kew)","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Anecdote; Creativity; Discoverability; Headline; Gloom; Nonsense","score_opus":0.00830175022866213,"score_gpt":0.216948865251158,"score_spread":0.20864711502249586,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7001483446","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005246841,0.0077150203,0.0011096842,0.471533,0.02997628,0.00018612988,0.0010195813,0.0011030455,0.48211044],"genre_scores_gemma":[0.01082664,0.0017750786,0.00031230136,0.088156745,0.0025310554,0.000108936074,0.00023015801,0.00029133793,0.89576775],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9990477,0.00028319913,0.00003360378,0.00009861199,0.0002685165,0.00026828356],"domain_scores_gemma":[0.99731004,0.00053499726,0.00013254183,0.00012519366,0.00059146044,0.0013057641],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0011579071,0.00046612168,0.00052329514,0.000488524,0.0074453023,0.0047364365,0.0009291144,0.0058190078,0.24460445],"category_scores_gemma":[0.009154026,0.00031478168,0.00042527504,0.00049134373,0.0012747943,0.0063176923,0.0031100165,0.006547082,0.15151522],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008760251,0.000011630654,0.00018217241,0.000023822986,6.1845174e-7,0.00015830463,0.0011380316,0.000002287638,0.000056625067,0.0006388956,0.9898086,0.007970274],"study_design_scores_gemma":[0.0000023342925,0.00001020836,0.00043180832,0.000081391285,0.0000011065129,0.0003173996,0.0052268645,0.000012156974,0.00004753093,0.0002910973,0.99357235,0.000005696408],"about_ca_topic_score_codex":0.009635098,"about_ca_topic_score_gemma":0.02530958,"teacher_disagreement_score":0.75539553,"about_ca_system_score_codex":0.0016161989,"about_ca_system_score_gemma":0.0016153653,"threshold_uncertainty_score":0.81828344},"labels":[],"label_agreement":null},{"id":"W7019679700","doi":"","title":"Image Data Compression - CCSDS 120.1-G-1","year":2007,"lang":"en","type":"article","venue":"Biblioteca Digital da Memória Científica do INPE (National Institute for Space Research)","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Nuclear Physics; National Institute of Information and Communications Technology; Japan Aerospace Exploration Agency; Canadian Space Agency; National Commission for Science and Technology; Iran Telecommunication Research Center; European Space Agency; Agenzia Spaziale Italiana; European Organization for the Exploitation of Meteorological Satellites; Korea Aerospace Research Institute; U.S. Geological Survey; Indian Space Research Organisation; National Oceanic and Atmospheric Administration; National Space Organization; Belgian Federal Science Policy Office; Chinese Academy of Sciences; Centre National d’Etudes Spatiales; Commonwealth Scientific and Industrial Research Organisation; National Aeronautics and Space Administration","keywords":"Nucleofection; Gestational period; TSG101; Dysgeusia; Diafiltration; Liquation; Emperipolesis; Triacetin; Hyporeflexia","score_opus":0.15873628351599225,"score_gpt":0.43202957138034026,"score_spread":0.27329328786434803,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7019679700","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011685899,0.007836789,0.6307228,0.0055387565,0.0066318777,0.0048922673,0.012913837,0.02709927,0.29267845],"genre_scores_gemma":[0.1080545,0.01172764,0.56597227,0.004653498,0.003655301,0.0055521084,0.06047089,0.0070767985,0.23283702],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99288166,0.00074890646,0.0005686046,0.00033691587,0.005175,0.00028889798],"domain_scores_gemma":[0.9939738,0.0006502287,0.0002752861,0.0008902944,0.0040447167,0.0001657695],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027593828,0.0016817477,0.0012261232,0.0048890444,0.0011762707,0.0044185836,0.0024001424,0.0027825693,0.0462196],"category_scores_gemma":[0.010322939,0.0005879578,0.00058728206,0.0028884725,0.0016312816,0.0023281456,0.0018540705,0.0024012362,0.045987725],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005925459,0.00022417486,0.0007490475,0.0014230144,0.0000444903,0.0006320956,0.00021170493,0.0055730753,0.05543785,0.1320119,0.39331,0.4097901],"study_design_scores_gemma":[0.00011950563,0.0003317781,0.0016535914,0.00067747314,0.000030396686,0.001320297,0.0001251471,0.016912965,0.063345745,0.020448096,0.8949306,0.00010432129],"about_ca_topic_score_codex":0.0050092028,"about_ca_topic_score_gemma":0.0041667074,"teacher_disagreement_score":0.0462196,"about_ca_system_score_codex":0.0024658977,"about_ca_system_score_gemma":0.0041258293,"threshold_uncertainty_score":0.15461993},"labels":[],"label_agreement":null},{"id":"W7019825147","doi":"","title":"Image Data Compression . Blue Book. Issue 1. November 2005 - CCSDS 122.0-B-1","year":2005,"lang":"en","type":"article","venue":"Biblioteca Digital da Memória Científica do INPE (National Institute for Space Research)","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Nuclear Physics; National Institute of Information and Communications Technology; Japan Aerospace Exploration Agency; Canadian Space Agency; Korea Aerospace Research Institute; European Organization for the Exploitation of Meteorological Satellites; Iran Telecommunication Research Center; European Space Agency; Agenzia Spaziale Italiana; U.S. Geological Survey; Indian Space Research Organisation; Centre National d’Etudes Spatiales; Commonwealth Scientific and Industrial Research Organisation; National Aeronautics and Space Administration; National Oceanic and Atmospheric Administration; National Space Organization; Belgian Federal Science Policy Office","keywords":"Nucleofection; Gestational period; TSG101; Dysgeusia; Diafiltration; Durvalumab; Emperipolesis; Triacetin; Hyporeflexia","score_opus":0.10283896971717708,"score_gpt":0.40241033950529,"score_spread":0.2995713697881129,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7019825147","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.001179546,0.021342197,0.032588303,0.0063412525,0.013517011,0.0006601768,0.02077016,0.014231949,0.8893693],"genre_scores_gemma":[0.0018910388,0.0061410787,0.005746162,0.00081990525,0.0011367798,0.00009385421,0.0109659275,0.0016698915,0.9715353],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99920136,0.000038162318,0.00004081502,0.000075234435,0.0006048726,0.000039530005],"domain_scores_gemma":[0.99746895,0.00029194445,0.00008540464,0.0002575546,0.0017367478,0.00015942195],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0007263269,0.0014993174,0.0009344136,0.004749787,0.0007710926,0.0027937563,0.0016459352,0.0017425979,0.40738446],"category_scores_gemma":[0.002725523,0.000869628,0.0003997781,0.0036289813,0.00047370075,0.0025837854,0.0008013907,0.0020206238,0.3725329],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000027057966,0.000019363126,0.000039724266,0.00015412689,0.0000029038831,0.000018684397,0.0000108412805,0.00011206865,0.0009701555,0.002066863,0.89305323,0.10352501],"study_design_scores_gemma":[0.0000075717107,0.000020981264,0.0003927422,0.000111792506,0.0000025157656,0.000086832326,0.00001148966,0.00027426795,0.00086322357,0.00089671643,0.99732333,0.000008483141],"about_ca_topic_score_codex":0.0075441343,"about_ca_topic_score_gemma":0.011966808,"teacher_disagreement_score":0.40738446,"about_ca_system_score_codex":0.00140385,"about_ca_system_score_gemma":0.0016856567,"threshold_uncertainty_score":0.8452941},"labels":[],"label_agreement":null},{"id":"W7020112026","doi":"","title":"Joint source-channel decoding of JPEG2000 images with unequal loss protection","year":2008,"lang":"en","type":"dissertation","venue":"Summit (Simon Fraser University)","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Simon Fraser University","keywords":"Decoding methods; Joint (building); JPEG 2000; Correctness; Context (archaeology); Sequential decoding; List decoding","score_opus":0.017795599579765668,"score_gpt":0.2225153213302782,"score_spread":0.20471972175051253,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7020112026","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12576278,0.00051619456,0.86692446,0.00014800065,0.000056282548,0.000045086064,0.000073261646,0.0006612207,0.0058128214],"genre_scores_gemma":[0.687287,0.0006309546,0.29919952,0.000044359425,0.000045948604,0.00004108018,0.00025354826,0.00016406096,0.012333597],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9995696,0.000072495655,0.000019530373,0.00004451657,0.00023911992,0.000054737626],"domain_scores_gemma":[0.99956864,0.0001811708,0.000035850633,0.00009529648,0.000103286504,0.000015671187],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047795274,0.00044761592,0.00039711443,0.00037087314,0.00020585484,0.0005486939,0.0003642968,0.0004015551,0.0013679985],"category_scores_gemma":[0.0016509466,0.00020122813,0.0003060668,0.00038202194,0.00035478998,0.00069229555,0.0006224485,0.0005300395,0.0005719839],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006528359,0.00013734533,0.0015961073,0.00019556092,0.00006030318,0.00032687353,0.0002946822,0.24917871,0.24524824,0.049885456,0.0023517597,0.45007208],"study_design_scores_gemma":[0.00003410128,0.0001296354,0.0006378764,0.000020050797,0.00002468523,0.00026247074,0.000030336989,0.680398,0.30790564,0.0063556954,0.004178525,0.00002296646],"about_ca_topic_score_codex":0.0008766748,"about_ca_topic_score_gemma":0.001558418,"teacher_disagreement_score":0.0013679985,"about_ca_system_score_codex":0.00030324908,"about_ca_system_score_gemma":0.0006402688,"threshold_uncertainty_score":0.004576385},"labels":[],"label_agreement":null},{"id":"W7020653240","doi":"","title":"Lossless Data Compression . Green Book. Issue 3. April 2013.CCSDS 120.0-G-3","year":2013,"lang":"en","type":"article","venue":"Biblioteca Digital da Memória Científica do INPE (National Institute for Space Research)","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Nuclear Physics; National Institute of Information and Communications Technology; Japan Aerospace Exploration Agency; Canadian Space Agency; Center for Long-Term Cybersecurity, University of California Berkeley; Geo-Informatics and Space Technology Development Agency; Iran Telecommunication Research Center; European Space Agency; Agenzia Spaziale Italiana; European Organization for the Exploitation of Meteorological Satellites; Korea Aerospace Research Institute; National Commission for Science and Technology; Türkiye Bilimsel ve Teknolojik Araştırma Kurumu; National Oceanic and Atmospheric Administration; National Space Organization; China National Space Administration; Belgian Federal Science Policy Office; Chinese Academy of Sciences; U.S. Geological Survey; Indian Space Research Organisation; Centre National d’Etudes Spatiales; Commonwealth Scientific and Industrial Research Organisation; National Aeronautics and Space Administration","keywords":"Nucleofection; Gestational period; TSG101; Dysgeusia; Diafiltration; Hyporeflexia; Hemopericardium; Liquation; Triacetin","score_opus":0.12441656601732498,"score_gpt":0.38985898078015824,"score_spread":0.26544241476283326,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7020653240","genre_codex":"other","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0016032789,0.04626,0.1864225,0.01196359,0.040609095,0.0007969048,0.010736701,0.01615686,0.68545115],"genre_scores_gemma":[0.0046571847,0.018193724,0.024035873,0.0018656052,0.003643005,0.0002043562,0.0069833016,0.002830126,0.93758684],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9982297,0.00008028039,0.000080559716,0.000102335296,0.0014512461,0.000055835302],"domain_scores_gemma":[0.9969965,0.0004850509,0.00012300981,0.00038379375,0.0018391319,0.00017255687],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011357447,0.0015437963,0.0010030827,0.0040141004,0.0008601791,0.0035250564,0.0020229127,0.0019757233,0.23674808],"category_scores_gemma":[0.004335633,0.00088374026,0.00047576564,0.0033896994,0.00109166,0.003285549,0.0014591917,0.0032191928,0.18264167],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000052842483,0.000023372155,0.000045537825,0.00032261002,0.0000066553866,0.00004686941,0.000022393893,0.00041415828,0.0025737192,0.010134245,0.7997613,0.18659623],"study_design_scores_gemma":[0.000008013152,0.0000307393,0.0001941548,0.00020919275,0.0000035689561,0.00017205263,0.000018900908,0.0008648962,0.0016661821,0.0038839073,0.99293387,0.000014562457],"about_ca_topic_score_codex":0.0031786268,"about_ca_topic_score_gemma":0.004547534,"teacher_disagreement_score":0.23674808,"about_ca_system_score_codex":0.0016219645,"about_ca_system_score_gemma":0.0023501865,"threshold_uncertainty_score":0.79200125},"labels":[],"label_agreement":null},{"id":"W7024077216","doi":"","title":"Recapping An Amazing Trip To Ottawa, Julien Gauthier Trade Reaction + Senators vs Bruins Preview","year":2023,"lang":"en","type":"other","venue":"Bulletin of Miscellaneous Information (Royal Gardens Kew)","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Favourite; Taste; Code (set theory); Publishing; Neighbourhood (mathematics)","score_opus":0.011082449262070552,"score_gpt":0.22937442671079283,"score_spread":0.21829197744872228,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7024077216","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002751059,0.0043935035,0.000715245,0.03261623,0.027684573,0.00018472192,0.0043415907,0.002272075,0.92504096],"genre_scores_gemma":[0.0021227163,0.00057806197,0.00013143886,0.0018364729,0.00022318668,0.000014775653,0.00034323343,0.00039498936,0.9943552],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9992487,0.000049480164,0.000018342178,0.000114576425,0.00029586884,0.00027299457],"domain_scores_gemma":[0.99860674,0.000054455188,0.00003564837,0.000094575385,0.0006136676,0.0005949989],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00054098014,0.0015422791,0.00053029566,0.000957553,0.011760406,0.0072186403,0.0013756375,0.0025826036,0.48562598],"category_scores_gemma":[0.0019895516,0.0009243944,0.0005578564,0.0011979851,0.0014270771,0.0038002096,0.003873755,0.003934977,0.35427967],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":true,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011437726,0.0000057040884,0.00007572298,0.000013625607,0.0000010005637,0.000048092494,0.0001898206,0.000011738315,0.00011762053,0.0005023377,0.9945127,0.0045102173],"study_design_scores_gemma":[0.0000010468435,0.0000037233435,0.0002474786,0.000020374018,9.3494174e-7,0.000024565987,0.0006641118,0.0000068677864,0.000054886597,0.000041204286,0.9989272,0.0000075656253],"about_ca_topic_score_codex":0.45771167,"about_ca_topic_score_gemma":0.82464814,"teacher_disagreement_score":0.5422883,"about_ca_system_score_codex":0.007943652,"about_ca_system_score_gemma":0.007269684,"threshold_uncertainty_score":0.910095},"labels":[],"label_agreement":null},{"id":"W7083318253","doi":"10.7870/cjcmh-2025-005","title":"Social Support Moderates the Impact of Homophobic Victimization on Psychological Adjustment and Behaviours of Youth of Lesbian and Gay Parents","year":2025,"lang":"en","type":"article","venue":"Canadian Journal of Community Mental Health","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"Université TÉLUQ; Université du Québec à Montréal","funders":"","keywords":"Lesbian; Psychosocial; Social support; Coping (psychology); Intervention (counseling); Sexual minority; Homosexuality","score_opus":0.06679464460240704,"score_gpt":0.4034935684818283,"score_spread":0.3366989238794213,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7083318253","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9996432,0.00007385682,0.000007753363,0.000024444587,0.0000013011505,0.0000019326187,0.000009844101,4.6919618e-7,0.00023715326],"genre_scores_gemma":[0.9998092,0.00006672739,0.000020714775,0.000009035213,0.0000016410764,0.0000024234162,0.000013134704,2.704541e-7,0.00007684635],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.999602,0.0002010232,0.000018432287,0.00002968731,0.00005996647,0.00008890812],"domain_scores_gemma":[0.998681,0.00030909333,0.00045045654,0.000066048444,0.00007831831,0.00041496975],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004650619,0.00019733624,0.00022977426,0.00041948174,0.00051311165,0.0007955021,0.00016607821,0.00026620767,0.0020058306],"category_scores_gemma":[0.0029273485,0.00021356944,0.00028732486,0.00020843564,0.0003551043,0.00022286958,0.0006648299,0.0005423995,0.00009401743],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012758817,0.00016829696,0.9924429,0.000013933299,0.000058852682,0.0001322242,0.0009483968,0.000028479662,0.0005515038,0.000052219017,0.000047462687,0.005428207],"study_design_scores_gemma":[0.0000020546563,0.0000809894,0.9983438,0.000009563887,0.000020001615,0.000060366594,0.0012684044,0.00004902025,0.000069655085,0.000020869718,0.000073829084,0.0000014392732],"about_ca_topic_score_codex":0.009243998,"about_ca_topic_score_gemma":0.022735618,"teacher_disagreement_score":0.009243998,"about_ca_system_score_codex":0.00024402005,"about_ca_system_score_gemma":0.0004722567,"threshold_uncertainty_score":0.018380404},"labels":[],"label_agreement":null},{"id":"W7096793181","doi":"","title":"DESCRIPTION OF THE FRENCH NATO CANDIDATE","year":2008,"lang":"en","type":"article","venue":"","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Intelligibility (philosophy); Noise reduction; Coding (social sciences); Filter (signal processing); Noise (video); Speech enhancement; Artificial noise; Wiener filter","score_opus":0.02557860404898898,"score_gpt":0.25011395656888924,"score_spread":0.22453535251990026,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7096793181","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.021722026,0.0135323005,0.012191719,0.00938696,0.0035607007,0.0006623875,0.014947855,0.0010384216,0.92295754],"genre_scores_gemma":[0.06576302,0.00809588,0.014779648,0.0034139105,0.0009470243,0.00068556296,0.013286272,0.0004989775,0.89252967],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99945134,0.00009474099,0.00002938025,0.00009971491,0.00020398507,0.00012082258],"domain_scores_gemma":[0.9996973,0.000028480932,0.000028010567,0.000026831096,0.00015602834,0.00006333661],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006082081,0.0007114063,0.0002603115,0.001829064,0.0017423865,0.0014216054,0.0005200025,0.00084056414,0.07681683],"category_scores_gemma":[0.00074029394,0.00013610978,0.00025091774,0.0011526863,0.00035034757,0.0007287932,0.00085784105,0.0005731548,0.05609984],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00038201507,0.00012135847,0.004703903,0.00038020904,0.000011024316,0.0010493435,0.0006273246,0.00083175127,0.008693449,0.09133404,0.5559531,0.33591253],"study_design_scores_gemma":[0.0000023363823,0.000033165496,0.0009320563,0.000021500959,9.821608e-7,0.000221553,0.000040040642,0.00004779477,0.0002960161,0.0003301253,0.9980685,0.0000058536893],"about_ca_topic_score_codex":0.021691833,"about_ca_topic_score_gemma":0.017236896,"teacher_disagreement_score":0.07681683,"about_ca_system_score_codex":0.0026167103,"about_ca_system_score_gemma":0.0023396916,"threshold_uncertainty_score":0.25697792},"labels":[],"label_agreement":null},{"id":"W7097620516","doi":"","title":"WESCANEX `93 - 1 - Sk, CANADA; 1993; 1/9/96, v 1.0 (revised)","year":2007,"lang":"en","type":"article","venue":"","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Vector quantization; Pattern recognition (psychology); Codebook; Rate of convergence; Quantization (signal processing); Image compression; Simulated annealing; Feature vector; Feature (linguistics)","score_opus":0.009555432461452113,"score_gpt":0.25279300328552423,"score_spread":0.24323757082407213,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7097620516","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013581237,0.02280929,0.042744093,0.0058519985,0.0035183167,0.0006408223,0.02226875,0.010023554,0.878562],"genre_scores_gemma":[0.008309209,0.0040383777,0.008163292,0.0001656026,0.000074402866,0.00006467525,0.0049825073,0.0011625377,0.97303945],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9987161,0.00006862968,0.00005761984,0.00033920072,0.00055512186,0.00026325812],"domain_scores_gemma":[0.9981104,0.0002029023,0.000076631106,0.00018335939,0.0012314002,0.00019531316],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0011928771,0.002222713,0.001387485,0.0025812846,0.0026336347,0.0059814327,0.0021419975,0.0020505805,0.49069163],"category_scores_gemma":[0.0024443623,0.0012161696,0.00057371537,0.004188025,0.0016093365,0.002258536,0.0014565145,0.0014464828,0.37838918],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00056936895,0.00012028724,0.0014654126,0.0005861555,0.000055388697,0.00061201304,0.0002535123,0.003806897,0.0051292903,0.03157395,0.54193217,0.41389552],"study_design_scores_gemma":[0.000045618006,0.00005179926,0.0015301927,0.00029159084,0.0000143525485,0.00019996721,0.00012958134,0.0036725097,0.0022764076,0.0027662113,0.9889746,0.000047284364],"about_ca_topic_score_codex":0.3727402,"about_ca_topic_score_gemma":0.5470765,"teacher_disagreement_score":0.50930834,"about_ca_system_score_codex":0.013109724,"about_ca_system_score_gemma":0.008676774,"threshold_uncertainty_score":0.7411412},"labels":[],"label_agreement":null},{"id":"W7098116233","doi":"","title":"Author manuscript, published in &amp;quot;International Conference on Acoustics, Speech, and Signal Processing (ICASSP), Vancouver: Canada (2013)&amp;quot; UNIVERSAL WYNER-ZIV CODING FOR GAUSSIAN SOURCES","year":2013,"lang":"en","type":"article","venue":"","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Decoding methods; Shannon–Fano coding; Gaussian; Variable-length code; Coding (social sciences); Source code; Tunstall coding; Lossy compression; Quantization (signal processing)","score_opus":0.03985044722831242,"score_gpt":0.27397287135225323,"score_spread":0.2341224241239408,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7098116233","genre_codex":"other","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019647853,0.027574057,0.28717637,0.028941354,0.13328558,0.0008903158,0.009118368,0.006842312,0.48652384],"genre_scores_gemma":[0.036621872,0.007841675,0.046429902,0.00095498,0.0040271375,0.000093555245,0.0029720953,0.0011750886,0.8998838],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99911946,0.00016058357,0.000060331506,0.00021797749,0.0003227421,0.00011880279],"domain_scores_gemma":[0.9974367,0.0005211772,0.00008112288,0.00036521038,0.0013819722,0.00021377923],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016519073,0.0009351243,0.0012804589,0.0014524063,0.0012409732,0.0042053936,0.0011842969,0.0015946248,0.28894508],"category_scores_gemma":[0.0053218463,0.00058817246,0.0006026407,0.002039374,0.0012667092,0.0019319215,0.0014103565,0.0011127578,0.08361043],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00050746714,0.0000761113,0.0011803512,0.0006541429,0.00012219879,0.0005027788,0.00025962328,0.0036318616,0.0082217995,0.02650664,0.6109239,0.34741312],"study_design_scores_gemma":[0.00004626494,0.00014134664,0.0009860817,0.00021128182,0.000033513334,0.00051763625,0.00018284429,0.015263663,0.010206501,0.008993974,0.963373,0.000044012635],"about_ca_topic_score_codex":0.0050389287,"about_ca_topic_score_gemma":0.013055324,"teacher_disagreement_score":0.28894508,"about_ca_system_score_codex":0.0013580938,"about_ca_system_score_gemma":0.0019680257,"threshold_uncertainty_score":0.9666176},"labels":[],"label_agreement":null},{"id":"W7098244528","doi":"","title":"Stroke Prevention What Are the Options?","year":2006,"lang":"en","type":"article","venue":"","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Stroke (engine); Blood pressure; Secondary prevention; Primary prevention; Ischemic stroke; Risk factor; Losartan","score_opus":0.01823485499141169,"score_gpt":0.2833603713994554,"score_spread":0.2651255164080437,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7098244528","genre_codex":"commentary","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0013473174,0.29123905,0.0030473194,0.6424625,0.010347504,0.00008388996,0.00074754265,0.00020326157,0.050521594],"genre_scores_gemma":[0.039712794,0.6014642,0.0126897115,0.26278678,0.045492213,0.00056354306,0.0011627912,0.00015194934,0.03597605],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99795794,0.0008791938,0.00016443219,0.00016915845,0.0006459296,0.00018329729],"domain_scores_gemma":[0.9960329,0.0015555052,0.0003368083,0.00016552115,0.0008751962,0.0010339628],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024907899,0.00094404374,0.0017577728,0.0014923554,0.0009787775,0.0032800932,0.0015112608,0.0040558362,0.0422874],"category_scores_gemma":[0.011233677,0.0002766077,0.0010109276,0.0007608286,0.0012079322,0.0046333647,0.0012887114,0.007080196,0.01030051],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00047560074,0.00044465298,0.0011565692,0.0023459368,0.00021299491,0.0005241324,0.00013299145,0.00039963773,0.0001832578,0.0169729,0.36822432,0.60892695],"study_design_scores_gemma":[0.0003967543,0.00026210706,0.002333445,0.023465088,0.00030066186,0.0013932515,0.001086301,0.0003808863,0.0002183326,0.11157907,0.85850644,0.00007775717],"about_ca_topic_score_codex":0.0018428515,"about_ca_topic_score_gemma":0.00491987,"teacher_disagreement_score":0.0422874,"about_ca_system_score_codex":0.0011401252,"about_ca_system_score_gemma":0.0030920825,"threshold_uncertainty_score":0.14146549},"labels":[],"label_agreement":null},{"id":"W7106531849","doi":"10.1587/transfun.2025smp0002","title":"A Proposed for Lossless Compression of Images for Hardware Implementation","year":2025,"lang":"en","type":"article","venue":"IEICE Transactions on Fundamentals of Electronics Communications and Computer Sciences","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Microsemi (Canada)","funders":"","keywords":"Lossless compression; Lossy compression; Data compression; Data compression ratio; Image compression; Lossless JPEG; Compression (physics)","score_opus":0.029904428147059438,"score_gpt":0.372366292713548,"score_spread":0.3424618645664885,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7106531849","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017006908,0.0016964354,0.9675272,0.00046088963,0.0004906376,0.00021819574,0.00017514639,0.0027712595,0.009653358],"genre_scores_gemma":[0.24767806,0.0020370618,0.71765065,0.00074497244,0.0003235471,0.00038154703,0.00063127297,0.0002209381,0.030331893],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997117,0.000023103288,0.000017868337,0.000045180062,0.00018270899,0.000019436355],"domain_scores_gemma":[0.9997279,0.000038181006,0.00002355332,0.00005924343,0.00013576756,0.000015277552],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019688181,0.00061191915,0.00025869982,0.00079404115,0.00039005652,0.0007693798,0.0009065251,0.00055888353,0.0053524454],"category_scores_gemma":[0.0005801559,0.00023677136,0.00028577095,0.0005165093,0.00028704395,0.0010326151,0.0003795278,0.0007006033,0.0018822245],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00037591407,0.0001369688,0.0005837989,0.00047990054,0.00006591695,0.0003724654,0.000117003,0.0074140807,0.34861514,0.022898395,0.013751145,0.60518926],"study_design_scores_gemma":[0.0001928025,0.0007178192,0.0016811169,0.00010948928,0.00012126434,0.0032241142,0.000060714417,0.29372722,0.54315335,0.0056593874,0.15125899,0.00009370565],"about_ca_topic_score_codex":0.00053291634,"about_ca_topic_score_gemma":0.0006733737,"teacher_disagreement_score":0.0053524454,"about_ca_system_score_codex":0.00035087115,"about_ca_system_score_gemma":0.000504007,"threshold_uncertainty_score":0.017905712},"labels":[],"label_agreement":null},{"id":"W7110844513","doi":"10.1109/icjece.2025.3618647","title":"A New Singular Vector Sparse Representation Technique for Crop Image Compression","year":2025,"lang":"","type":"article","venue":"Canadian Journal of Electrical and Computer Engineering","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Wavelet; Image compression; Pattern recognition (psychology); Compression ratio; Compressed sensing; Singular value decomposition; Wavelet transform; Data compression; Singular value; Iterative reconstruction","score_opus":0.00996440083812439,"score_gpt":0.25120724075523365,"score_spread":0.24124283991710926,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7110844513","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016611261,0.0009209097,0.97950965,0.00016584006,0.0001297555,0.00004868626,0.000090549904,0.0004701968,0.0020530997],"genre_scores_gemma":[0.21186508,0.0025168888,0.7771926,0.00020528812,0.00021882818,0.00013816808,0.00072579115,0.0001029002,0.007034389],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99971765,0.000033046537,0.000015163362,0.000039261962,0.00017873156,0.000016064807],"domain_scores_gemma":[0.9998348,0.00003913904,0.000023398954,0.000024633908,0.000069921756,0.000008047226],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025502976,0.00050552835,0.00043976895,0.0008762518,0.00022529859,0.00030470014,0.00035234287,0.0004398903,0.0014720086],"category_scores_gemma":[0.0006667541,0.00016755829,0.0005828639,0.0012883063,0.00024511275,0.00074707944,0.00037417104,0.00063326064,0.0005527191],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017512405,0.00007867614,0.0005249875,0.00025862636,0.00006613365,0.000357722,0.000119328026,0.03595868,0.24957922,0.013713873,0.0058733104,0.69329435],"study_design_scores_gemma":[0.0000438787,0.00033452938,0.0014553102,0.000043959448,0.000060903967,0.0015667634,0.000061100545,0.8609652,0.106503315,0.004073393,0.02483788,0.000053734242],"about_ca_topic_score_codex":0.0008296864,"about_ca_topic_score_gemma":0.0009927932,"teacher_disagreement_score":0.0014720086,"about_ca_system_score_codex":0.00016410736,"about_ca_system_score_gemma":0.00030460517,"threshold_uncertainty_score":0.0049242973},"labels":[],"label_agreement":null},{"id":"W7113601707","doi":"","title":"Study of the effect of JPEG compression on the diagnostic quality of digital diabetic images","year":2002,"lang":"en","type":"article","venue":"Explore Bristol Research","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Institute of Infection and Immunity","funders":"","keywords":"Compression (physics); Quality (philosophy); Data compression; Image quality; JPEG; Compression artifact","score_opus":0.1959818217888355,"score_gpt":0.4249936319402564,"score_spread":0.2290118101514209,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7113601707","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9954585,0.0009601353,0.0026538884,0.000044371845,0.000021932017,0.00001726816,0.00009608021,0.000029130671,0.00071860355],"genre_scores_gemma":[0.9955882,0.000787555,0.0022269394,0.0000325078,0.000031034368,0.0000074479067,0.00012973428,0.000025949827,0.001170658],"study_design_codex":"bench_or_experimental","study_design_gemma":"observational","domain_scores_codex":[0.9997476,0.00007550873,0.000017427034,0.000024055476,0.000107152955,0.000028256023],"domain_scores_gemma":[0.99387205,0.0049860124,0.00032006268,0.00015303165,0.0005358549,0.00013296709],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045481857,0.00021618385,0.00020689754,0.00046014314,0.00014962352,0.00022185827,0.00018818746,0.00037197876,0.0019563949],"category_scores_gemma":[0.004484628,0.00012383908,0.00025332102,0.0005048119,0.00029281146,0.00034537766,0.00013351024,0.00025329785,0.0001409301],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0100343665,0.00055185304,0.012684712,0.000713076,0.00014418019,0.00095442135,0.00027576106,0.004891866,0.9027319,0.00036485263,0.0003989863,0.06625411],"study_design_scores_gemma":[0.00022314329,0.0067164567,0.1178132,0.00006385661,0.00041864955,0.0026455703,0.00019432486,0.035946507,0.8340866,0.00017839124,0.0016611622,0.000052322684],"about_ca_topic_score_codex":0.0013578358,"about_ca_topic_score_gemma":0.0010826467,"teacher_disagreement_score":0.0019563949,"about_ca_system_score_codex":0.00016737945,"about_ca_system_score_gemma":0.00012588597,"threshold_uncertainty_score":0.0065448284},"labels":[],"label_agreement":null},{"id":"W7127312548","doi":"10.1109/ccece64018.2025.11364379","title":"Semantic Video Compression on Embedded Devices for Satellite-Assisted Remote Surveillance","year":2025,"lang":"","type":"article","venue":"","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"École de Technologie Supérieure","funders":"","keywords":"Ranging; Data compression; Object (grammar); Object detection; Video tracking; Enhanced Data Rates for GSM Evolution; Compression (physics); Compression ratio","score_opus":0.028159339504384928,"score_gpt":0.3370495848565036,"score_spread":0.3088902453521187,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7127312548","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13115887,0.0008820223,0.85911125,0.00019417428,0.00010361356,0.000121802615,0.00018318422,0.0022354964,0.0060094795],"genre_scores_gemma":[0.7051668,0.00060695695,0.2894737,0.00017763632,0.00007882849,0.00007817604,0.0005108021,0.00014058595,0.0037664704],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99981135,0.000025650888,0.000008724954,0.000028246888,0.00010803363,0.000018094426],"domain_scores_gemma":[0.9998147,0.000052058007,0.00002504762,0.000043071912,0.000054985576,0.00001024647],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021768366,0.00036300495,0.00024309837,0.0003910666,0.00021947763,0.00039904186,0.00051213027,0.0002970304,0.0014205005],"category_scores_gemma":[0.0006525322,0.00009096828,0.00015014417,0.00041309887,0.00021946823,0.00082993077,0.00038905028,0.00039140208,0.00039945616],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007705508,0.00013773113,0.0015391862,0.00023667821,0.000045953806,0.00050634856,0.00028900435,0.025919946,0.4043625,0.013824039,0.0054662153,0.5469019],"study_design_scores_gemma":[0.00007311202,0.0005199151,0.0034040967,0.00009838504,0.000053904438,0.0010882524,0.00018591117,0.50474614,0.45660424,0.007077021,0.026097577,0.00005155241],"about_ca_topic_score_codex":0.00059519283,"about_ca_topic_score_gemma":0.000785904,"teacher_disagreement_score":0.0014205005,"about_ca_system_score_codex":0.00028801025,"about_ca_system_score_gemma":0.00024193739,"threshold_uncertainty_score":0.00475204},"labels":[],"label_agreement":null},{"id":"W7131074035","doi":"10.1109/iccvw69036.2025.00422","title":"Enhancing Generalization in Data-Free Quantization via Mixup-Class Prompting","year":2025,"lang":"","type":"article","venue":"","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Hyperion Technologies (Canada)","funders":"Institute for Information and Communications Technology Promotion; Ministry of Science and ICT, South Korea","keywords":"Quantization (signal processing); Generalizability theory; Generative grammar; Synthetic data; Convolutional neural network; Vector quantization; Adversarial system; Generalization; Source code","score_opus":0.031673825108456226,"score_gpt":0.33094094918383776,"score_spread":0.29926712407538153,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7131074035","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04268968,0.00035141603,0.9487787,0.0004624026,0.00012848534,0.00008933202,0.00029772028,0.0050229044,0.0021793349],"genre_scores_gemma":[0.67929924,0.00029943368,0.3121045,0.0007119302,0.00009517893,0.00024838845,0.0010749457,0.00089957373,0.005266883],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99910337,0.00021491246,0.000049663475,0.00026966116,0.00028106882,0.00008129424],"domain_scores_gemma":[0.9973781,0.001199429,0.0001568605,0.0007840452,0.00038477784,0.00009687277],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001467013,0.00095600507,0.0007134043,0.00043966895,0.00040301486,0.0009769319,0.0012560172,0.00094198395,0.004439749],"category_scores_gemma":[0.009725652,0.00029973206,0.00047493054,0.00056568044,0.0010667269,0.002672973,0.0023928895,0.0023982455,0.001378463],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006639754,0.00027771306,0.0020606178,0.00021655887,0.000042697666,0.00022271584,0.00040660088,0.26711538,0.050705943,0.022814047,0.012237027,0.64323676],"study_design_scores_gemma":[0.000046930854,0.00012432801,0.00042868505,0.000022730952,0.000010423327,0.000106690495,0.00007316922,0.9452436,0.028084578,0.022105573,0.0037268053,0.000026541842],"about_ca_topic_score_codex":0.0013051198,"about_ca_topic_score_gemma":0.0018923366,"teacher_disagreement_score":0.004439749,"about_ca_system_score_codex":0.00065322634,"about_ca_system_score_gemma":0.0007996815,"threshold_uncertainty_score":0.014852405},"labels":[],"label_agreement":null},{"id":"W7132976544","doi":"","title":"HVS-based shape adaptive wavelet colour image coding","year":2003,"lang":"","type":"dissertation","venue":"TSpace","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"University of Toronto","keywords":"Wavelet; Human visual system model; Wavelet transform; Coding (social sciences); JPEG; Pattern recognition (psychology); JPEG 2000; Image quality","score_opus":0.03456038851922767,"score_gpt":0.3603526226353097,"score_spread":0.32579223411608205,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7132976544","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.049554195,0.0005065131,0.9426824,0.0001418122,0.0001357254,0.00008385285,0.00012619776,0.00071591215,0.0060534356],"genre_scores_gemma":[0.50407416,0.0011807485,0.47743708,0.00015765021,0.00011947151,0.000096718686,0.0005579216,0.00009570052,0.016280504],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998078,0.000029110768,0.000007532429,0.000020638316,0.00011981454,0.000015228119],"domain_scores_gemma":[0.9997937,0.00004056602,0.000014652105,0.000036175636,0.000106381594,0.00000844526],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023825168,0.00021336979,0.000211286,0.00043353045,0.00012477193,0.0003363289,0.00036989313,0.0002532266,0.0017098791],"category_scores_gemma":[0.0005782502,0.00008856789,0.0002516823,0.00043689832,0.0002906559,0.00035322923,0.00026480202,0.00034818242,0.00061057194],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00028157607,0.000067544555,0.00045639536,0.00014967645,0.000030048068,0.00010412405,0.00007990917,0.06939669,0.3445523,0.02998124,0.0040645422,0.55083597],"study_design_scores_gemma":[0.000027418862,0.00016849884,0.0008777053,0.000021044054,0.000021305887,0.00025116312,0.000020080837,0.8673463,0.11902212,0.0031324886,0.009091409,0.000020534584],"about_ca_topic_score_codex":0.0014007677,"about_ca_topic_score_gemma":0.0014646588,"teacher_disagreement_score":0.0017098791,"about_ca_system_score_codex":0.0002620606,"about_ca_system_score_gemma":0.0003388061,"threshold_uncertainty_score":0.0057201385},"labels":[],"label_agreement":null},{"id":"W771238818","doi":"10.1007/978-3-319-16631-5_24","title":"Towards Efficient Feedback Control in Streaming Computer Vision Pipelines","year":2015,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ontario Institute of Technology","funders":"","keywords":"Computer science; Pipeline transport; Multimedia; Control (management); Human–computer interaction; Feedback control; Computer graphics (images); Computer vision; Artificial intelligence; Control engineering","score_opus":0.018378467116258023,"score_gpt":0.28725059205504605,"score_spread":0.26887212493878804,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W771238818","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011677373,0.0005548334,0.9845243,0.00015707673,0.0000630307,0.000031638556,0.00004029819,0.0010921936,0.0018592948],"genre_scores_gemma":[0.6211787,0.0010347636,0.36530682,0.00017331798,0.00013386949,0.000120724115,0.00019196648,0.00026878185,0.01159111],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997547,0.000031103256,0.000012349012,0.000047846803,0.00011641314,0.00003749226],"domain_scores_gemma":[0.99953496,0.00023082193,0.000037444894,0.000057927467,0.00010994663,0.000028924635],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00053353165,0.00067838986,0.00066714885,0.00029766883,0.000393025,0.0008942334,0.0011761922,0.00076029013,0.0045513324],"category_scores_gemma":[0.0016783056,0.0004090405,0.00026525787,0.00041906128,0.0005024581,0.0011468645,0.0011697364,0.0012737863,0.00071944896],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00042042314,0.00015917701,0.00034480906,0.00040420785,0.000049945556,0.00012469794,0.0002601676,0.3145636,0.14171611,0.058715105,0.008681563,0.4745602],"study_design_scores_gemma":[0.000014928276,0.00005538472,0.00008595178,0.000012160817,0.0000061857722,0.000026753632,0.000012212233,0.97435445,0.011940931,0.011198435,0.0022838563,0.000008750742],"about_ca_topic_score_codex":0.0035644004,"about_ca_topic_score_gemma":0.0038151355,"teacher_disagreement_score":0.0045513324,"about_ca_system_score_codex":0.0007230438,"about_ca_system_score_gemma":0.0007001907,"threshold_uncertainty_score":0.0152257085},"labels":[],"label_agreement":null},{"id":"W84802234","doi":"","title":"NOVEL VIDEO ENCODING ALGORITHMS FOR REMOTE MONITORING AND DISTRIBUTED HUMAN-HUMAN INTERACTION","year":2005,"lang":"en","type":"article","venue":"ESASP","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Computer science; Fidelity; Videoconferencing; Encoding (memory); Distributed computing; Latency (audio); Real-time computing; Computer network; Multimedia; Telecommunications; Artificial intelligence","score_opus":0.05743034617652667,"score_gpt":0.36924462149300114,"score_spread":0.3118142753164745,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W84802234","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0022960745,0.00040425695,0.9956033,0.00009272309,0.00007658733,0.00003962355,0.000023409977,0.00027854956,0.0011855484],"genre_scores_gemma":[0.045325924,0.0011069779,0.9466106,0.00011758263,0.00014954481,0.00014577874,0.00018849777,0.000121806894,0.0062332302],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995321,0.000091099246,0.000034547444,0.00007706508,0.00022832518,0.000036917318],"domain_scores_gemma":[0.99915516,0.0003513209,0.000078341895,0.00013368971,0.0002519937,0.000029415272],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00073326397,0.0007825554,0.00048393046,0.0009723693,0.0003829063,0.000965668,0.0010402417,0.00097057596,0.0045498484],"category_scores_gemma":[0.0034553686,0.0002516149,0.00036196236,0.0010174835,0.0004745364,0.002099499,0.00077932456,0.0014186862,0.0018783559],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020274658,0.00010582012,0.0002906757,0.00016668257,0.000030050294,0.00008018947,0.00013133242,0.027873058,0.057921022,0.071701996,0.0062761977,0.83522034],"study_design_scores_gemma":[0.0000839976,0.00014181295,0.00048461586,0.00007390823,0.000046383368,0.00063700095,0.000063923224,0.87755996,0.064074636,0.030407308,0.02638482,0.000041553205],"about_ca_topic_score_codex":0.0011457691,"about_ca_topic_score_gemma":0.0018946481,"teacher_disagreement_score":0.0045498484,"about_ca_system_score_codex":0.00065315317,"about_ca_system_score_gemma":0.0005357481,"threshold_uncertainty_score":0.015220821},"labels":[],"label_agreement":null},{"id":"W85012173","doi":"","title":"Benefits of hybrid DCT domain image matching","year":2000,"lang":"en","type":"article","venue":"Queensland's institutional digital repository (The University of Queensland)","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"","keywords":"Discrete cosine transform; Pixel; Algorithm; Mathematics; Matching (statistics); Resampling; Image (mathematics); Window (computing); Image quality; Computer science; Artificial intelligence; Statistics","score_opus":0.007431639703100855,"score_gpt":0.20013776947087425,"score_spread":0.1927061297677734,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W85012173","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04506849,0.0006598953,0.9404191,0.00030798002,0.00013170426,0.000085103056,0.00012962554,0.0014770456,0.0117211165],"genre_scores_gemma":[0.34658295,0.0005347676,0.6382146,0.00034097768,0.00014599515,0.000069240275,0.00044193302,0.0002523104,0.013417222],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9991228,0.00014364073,0.000045370743,0.00011945803,0.0005173781,0.000051344174],"domain_scores_gemma":[0.9987716,0.0003375798,0.00006883801,0.00038332597,0.0004072596,0.000031298285],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00068977685,0.00048303665,0.00050620345,0.0007646501,0.00026707584,0.000782709,0.0008942351,0.00080384343,0.003895544],"category_scores_gemma":[0.0033141514,0.00030255545,0.00041298804,0.00122967,0.00025002818,0.0012985503,0.0011104187,0.00046257203,0.0018543563],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006883801,0.00024511613,0.002476237,0.00016225898,0.0000741352,0.0002727543,0.00008285607,0.04483076,0.16611275,0.015877144,0.0040567876,0.7651208],"study_design_scores_gemma":[0.00012763041,0.0005639527,0.004971581,0.000046201534,0.000103376005,0.0036305129,0.00010105201,0.78509146,0.15918195,0.01139211,0.03471135,0.00007881009],"about_ca_topic_score_codex":0.0011274145,"about_ca_topic_score_gemma":0.0013710298,"teacher_disagreement_score":0.003895544,"about_ca_system_score_codex":0.00020537217,"about_ca_system_score_gemma":0.00035692268,"threshold_uncertainty_score":0.0130319},"labels":[],"label_agreement":null},{"id":"W85472367","doi":"10.1007/978-3-642-23687-7_40","title":"Content Makes the Difference in Compression Standard Quality Assessment","year":2011,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Sherbrooke","funders":"","keywords":"JPEG 2000; Computer science; JPEG; Image compression; Artificial intelligence; Image quality; Compression (physics); Computer vision; Data compression; Image processing; Image (mathematics)","score_opus":0.08622401803913511,"score_gpt":0.33505408543867204,"score_spread":0.24883006739953695,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W85472367","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5005867,0.013525741,0.3182161,0.007695047,0.003200903,0.00045663898,0.0017122396,0.0034241523,0.15118259],"genre_scores_gemma":[0.9185028,0.0029966203,0.056531522,0.0010975972,0.0010718233,0.00007032176,0.0010386893,0.0017394281,0.016951183],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99609727,0.00084976124,0.00024665231,0.00042380678,0.0021863014,0.00019621602],"domain_scores_gemma":[0.9736042,0.014697029,0.0011199485,0.0026007292,0.007421836,0.00055614446],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004528922,0.00068575627,0.0006263607,0.0021088447,0.00044557595,0.005198282,0.0007970295,0.001828184,0.008107581],"category_scores_gemma":[0.03851609,0.00041592674,0.0004571039,0.001644279,0.0013844623,0.0060675987,0.0012082596,0.0011782348,0.0040140375],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0033782183,0.00024094366,0.04138791,0.0008811882,0.0003383764,0.00051593117,0.0010551603,0.005988801,0.14605977,0.030988066,0.010591073,0.75857455],"study_design_scores_gemma":[0.00034751694,0.002571605,0.22092308,0.0014485787,0.002337378,0.0050564003,0.0025882013,0.12871595,0.43590707,0.13022652,0.06936405,0.0005135546],"about_ca_topic_score_codex":0.0008809692,"about_ca_topic_score_gemma":0.0011846777,"teacher_disagreement_score":0.008107581,"about_ca_system_score_codex":0.00077496923,"about_ca_system_score_gemma":0.00047628747,"threshold_uncertainty_score":0.027122557},"labels":[],"label_agreement":null},{"id":"W956508669","doi":"10.1007/978-3-540-69139-6_129","title":"An Optimized Two-Stage Method for Ultrasound Breast Image Compression","year":2008,"lang":"en","type":"book-chapter","venue":"World Congress on Medical Physics and Biomedical Engineering, September 7 - 12, 2009, Munich, Germany","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Biorthogonal system; Image compression; Wavelet; Artificial intelligence; Breast ultrasound; Haar wavelet; Computer science; Computer vision; Wavelet transform; Mathematics; Pattern recognition (psychology); Image (mathematics); Discrete wavelet transform; Image processing; Medicine; Breast cancer; Internal medicine","score_opus":0.012915496268505841,"score_gpt":0.2934537831275859,"score_spread":0.28053828685908005,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W956508669","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0061401436,0.00039881677,0.9906984,0.00005476083,0.000119110075,0.000056452373,0.000065774184,0.00071358203,0.0017528738],"genre_scores_gemma":[0.0521733,0.00038887025,0.93439305,0.00008693317,0.000084884065,0.000102871185,0.0002623395,0.00016443753,0.012343318],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996971,0.00004357513,0.000017428465,0.000034273853,0.0001876748,0.000019958386],"domain_scores_gemma":[0.9997392,0.00010672943,0.000012481951,0.000042366104,0.00008812936,0.000011059418],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003012243,0.00070747174,0.0003964646,0.0005539992,0.00024722438,0.0004970448,0.00080520887,0.00070866576,0.007118482],"category_scores_gemma":[0.00064106437,0.00030004367,0.00049533264,0.0005466825,0.00018563612,0.0006292684,0.00058858295,0.00064316834,0.001558962],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00035569043,0.00014613483,0.00033430822,0.00015384697,0.00006105428,0.00013335148,0.0000669255,0.020391855,0.18096943,0.0073550087,0.0056888247,0.78434366],"study_design_scores_gemma":[0.000060651775,0.00026170217,0.0013924269,0.00002548075,0.00006710371,0.001207485,0.00002125211,0.8618335,0.11727532,0.002258082,0.015541092,0.00005591405],"about_ca_topic_score_codex":0.0010867391,"about_ca_topic_score_gemma":0.0027139296,"teacher_disagreement_score":0.007118482,"about_ca_system_score_codex":0.00019030787,"about_ca_system_score_gemma":0.0004935017,"threshold_uncertainty_score":0.023813725},"labels":[],"label_agreement":null}]}