{"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000761868,0.005398397,0.7938548,0.009914259,0.00029228453,0.0012817875,0.000037044447,0.0019849932,0.18716028],"genre_scores_gemma":[0.0046360367,0.017532626,0.9205762,0.0001582354,0.000057901474,0.000107654094,0.000011416585,0.00016479078,0.056755133],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99770385,0.000018419049,0.0006608722,0.0007553216,0.00044529076,0.00041621897],"domain_scores_gemma":[0.99702585,0.00022461826,0.0004861976,0.0020760207,0.00012145336,0.00006584243],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00026908435,0.0005128676,0.00069276796,0.0006802215,0.0002515617,0.000112547,0.0020351128,0.00052177906,0.000016287306],"category_scores_gemma":[0.00007197365,0.00036674735,0.00007717861,0.00020754217,0.0007052964,0.00023136204,0.0026833264,0.0011341615,0.000041783875],"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.0000027222195,0.000031835472,0.0000039102283,0.000088695466,0.000022399705,0.00011637831,0.00007752528,9.095101e-7,0.00036495854,0.9521171,0.0031923817,0.043981217],"study_design_scores_gemma":[0.00022168142,0.00006550562,0.0000031189516,0.00060425187,0.0000101963915,0.00014597754,0.000007448101,0.0023508433,0.0012813236,0.89408994,0.100830615,0.00038910809],"about_ca_topic_score_codex":0.0000019634263,"about_ca_topic_score_gemma":0.00001056484,"teacher_disagreement_score":0.13040514,"about_ca_system_score_codex":0.00009151644,"about_ca_system_score_gemma":0.00007119687,"threshold_uncertainty_score":0.99987847},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000007994793,0.0002307817,0.91275775,0.00025799574,0.0009724253,0.0006057743,0.000009271992,0.0017814228,0.08337661],"genre_scores_gemma":[0.0051579373,0.0001868709,0.9684307,0.0014308889,0.00048268403,0.00005619026,0.000013153692,0.00008404611,0.02415755],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9939547,0.00007354937,0.0009434763,0.0024670693,0.0016617974,0.0008993777],"domain_scores_gemma":[0.9942237,0.00029917824,0.0006456064,0.004173803,0.00032827424,0.00032943193],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0015460206,0.00078815204,0.0008696727,0.0015896809,0.00037493254,0.00055757776,0.009876581,0.0004079534,0.00006414825],"category_scores_gemma":[0.000048211714,0.0007252771,0.00015995736,0.0005815341,0.0010806927,0.0015363928,0.0073478003,0.00110661,0.00022261485],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000003047777,0.00002457457,0.000005925776,0.000029627423,0.0000028626084,0.000051391995,0.00006362141,0.00005356298,0.00037454072,0.26948574,0.007061566,0.7228435],"study_design_scores_gemma":[0.00036059966,0.00039090094,0.0001475778,0.0030447352,0.000008405178,0.00014695329,3.6151428e-7,0.102200195,0.018197328,0.33202562,0.5414219,0.0020554417],"about_ca_topic_score_codex":0.000009752798,"about_ca_topic_score_gemma":0.000005866825,"teacher_disagreement_score":0.7207881,"about_ca_system_score_codex":0.0003964002,"about_ca_system_score_gemma":0.00039337671,"threshold_uncertainty_score":0.9995198},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00037014208,0.00010964922,0.99592257,0.00069018157,0.00021300226,0.00029593921,0.000048748814,0.0008580198,0.0014917692],"genre_scores_gemma":[0.052155513,0.0000046762966,0.94684845,0.00037350316,0.00012438693,0.000092220034,0.00003286431,0.000014743727,0.00035364207],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988899,0.00003605843,0.00021423702,0.00038845808,0.00019306115,0.00027823402],"domain_scores_gemma":[0.9984779,0.00031268978,0.0001067218,0.0009557893,0.000086191234,0.000060737562],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000120192,0.00013822119,0.00015809012,0.00007470658,0.00014482974,0.00012568956,0.0011380933,0.00008865469,0.00002373818],"category_scores_gemma":[0.00007770813,0.0001194494,0.00006116458,0.00021926018,0.000046126348,0.0005682443,0.00042008774,0.0001461501,0.000037503985],"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.000012890384,0.00007384357,0.00003913158,0.000019449122,0.0000039805855,0.000015066165,0.000048806054,0.00004643521,0.012636876,0.82376385,0.14489117,0.018448481],"study_design_scores_gemma":[0.00022469298,0.000041660544,0.00030562014,0.000074471754,0.0000024896178,0.000007686348,0.0000051798106,0.010372049,0.071467906,0.76283723,0.15444471,0.00021632474],"about_ca_topic_score_codex":0.000020498068,"about_ca_topic_score_gemma":0.0000015324837,"teacher_disagreement_score":0.060926657,"about_ca_system_score_codex":0.000022861952,"about_ca_system_score_gemma":0.000024498853,"threshold_uncertainty_score":0.4871005},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00063636614,0.00026771546,0.9867864,0.00027734923,0.00004521117,0.00012927255,7.505588e-7,0.00078285957,0.011074049],"genre_scores_gemma":[0.0773871,0.000050505525,0.9214637,0.00037697383,0.000008808872,0.000022838834,8.32922e-7,0.000007278642,0.00068191515],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99911195,0.0000708761,0.00013174277,0.00028206743,0.00016283717,0.00024053399],"domain_scores_gemma":[0.9992016,0.000041083116,0.000029426816,0.0006005376,0.000037416565,0.00008994579],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018078527,0.00009613974,0.00008455868,0.000057667206,0.00009956894,0.00011009084,0.0006710464,0.00003893992,0.000121277546],"category_scores_gemma":[0.0000329952,0.0000758665,0.000034902438,0.00021605783,0.000035753903,0.0005841128,0.00007479675,0.000069602705,0.000043306627],"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.000005225388,0.00012215337,0.0003114425,0.0000122157135,0.000004635329,0.00003738842,0.000164498,0.000025075477,0.037884165,0.37386757,0.0147807775,0.57278484],"study_design_scores_gemma":[0.00013904937,0.000054898126,0.00016286173,0.000015023991,0.0000012342815,0.000041894124,0.000005808764,0.0030804146,0.6757309,0.048767585,0.27183166,0.00016869104],"about_ca_topic_score_codex":0.0000053586114,"about_ca_topic_score_gemma":9.2099367e-7,"teacher_disagreement_score":0.6378467,"about_ca_system_score_codex":0.000021181175,"about_ca_system_score_gemma":0.000067260204,"threshold_uncertainty_score":0.3093746},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0015190077,0.00021529332,0.9921203,0.00055784296,0.0001051284,0.0003153685,0.00002259559,0.0014256033,0.0037188279],"genre_scores_gemma":[0.22037266,0.000008466463,0.7787288,0.00043487232,0.000102299964,0.00004463421,0.000011486698,0.000024976656,0.0002718332],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99791795,0.000103586426,0.00036893113,0.0006702618,0.0005156612,0.00042360005],"domain_scores_gemma":[0.9982458,0.00010332536,0.00015366392,0.0011824418,0.000111413814,0.00020340837],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024649507,0.00027254765,0.00027990303,0.0001579435,0.00016828714,0.0001082167,0.0012906415,0.00012237312,0.00009538218],"category_scores_gemma":[0.00002090925,0.00023451688,0.00011485175,0.00035898303,0.000066031396,0.0012409374,0.00026542062,0.00026934774,0.00020534161],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001136548,0.0003647873,0.00003105529,0.00016860354,0.000030468344,0.0001388602,0.00084686966,0.00013613662,0.15957493,0.060409375,0.039592557,0.7385927],"study_design_scores_gemma":[0.0008788993,0.00013759987,0.00028977217,0.0003970622,0.000007708677,0.00001959338,0.00006241298,0.562486,0.2960852,0.00035247125,0.13874921,0.000534093],"about_ca_topic_score_codex":0.00004164149,"about_ca_topic_score_gemma":0.0000042736474,"teacher_disagreement_score":0.7380586,"about_ca_system_score_codex":0.00018672447,"about_ca_system_score_gemma":0.00009416094,"threshold_uncertainty_score":0.956332},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000021206735,0.0003263407,0.95922375,0.00036012998,0.00088328787,0.00036768967,0.0000071389636,0.00063928467,0.03817118],"genre_scores_gemma":[0.016206982,0.00038193102,0.9571909,0.002052025,0.00039331376,0.000028011107,0.000006903324,0.00006903927,0.02367095],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.995414,0.000042099866,0.000655323,0.0020829323,0.0011065574,0.0006990421],"domain_scores_gemma":[0.99618435,0.0003389452,0.00040343116,0.002544221,0.00020452087,0.00032451272],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0012944856,0.0005734032,0.00064289744,0.0010052604,0.0003083809,0.00065529265,0.0054527456,0.0002547437,0.000029957448],"category_scores_gemma":[0.00006554539,0.00054361916,0.000077000695,0.0003819222,0.0011454545,0.0012825999,0.0060900208,0.00071858964,0.00010289317],"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.0000019827535,0.000011148045,0.000010364737,0.000026546366,0.000002649023,0.00004432491,0.0001138686,0.000039029834,0.00010929368,0.5444749,0.0027478281,0.45241806],"study_design_scores_gemma":[0.0005620521,0.00032193444,0.00033704133,0.001487913,0.0000085270085,0.00025034673,7.0005404e-7,0.2349174,0.0017394236,0.43242404,0.3261668,0.0017838099],"about_ca_topic_score_codex":0.000007963461,"about_ca_topic_score_gemma":0.000007242512,"teacher_disagreement_score":0.45063424,"about_ca_system_score_codex":0.00018346176,"about_ca_system_score_gemma":0.00025300443,"threshold_uncertainty_score":0.99992824},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000031312222,0.00012330852,0.8650518,0.0025062084,0.0011637056,0.00055121636,0.000029786883,0.0001508368,0.13041998],"genre_scores_gemma":[0.01243995,0.004168307,0.9494011,0.008923235,0.0011343842,0.00059602363,0.00018842563,0.000060074683,0.023088548],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9977024,0.000015331396,0.00068599096,0.0004734508,0.00085351465,0.00026929085],"domain_scores_gemma":[0.9978174,0.00012254114,0.0005373767,0.0005410085,0.0009189612,0.00006270315],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00071243313,0.00031409948,0.00028260652,0.00061640085,0.00056298,0.0007851402,0.0018589334,0.00009033527,0.0000062595855],"category_scores_gemma":[0.00006619808,0.00023682762,0.000057452162,0.00022810168,0.00088765373,0.011456404,0.0011653831,0.00027984584,0.000020280553],"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.000051899446,0.000013268664,0.0000034692512,0.00004925622,0.000020129715,0.0000045288434,0.002101705,0.00023567761,0.000005336719,0.6083188,0.008298685,0.38089725],"study_design_scores_gemma":[0.0004389487,0.00023489074,0.0001213242,0.00048250792,0.0000054291745,0.00008887172,0.0002015485,0.052353077,0.000049960898,0.08629897,0.8592469,0.00047756018],"about_ca_topic_score_codex":0.0000016157411,"about_ca_topic_score_gemma":0.000008441393,"teacher_disagreement_score":0.8509482,"about_ca_system_score_codex":0.0002692014,"about_ca_system_score_gemma":0.00012332562,"threshold_uncertainty_score":0.965755},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000030285102,0.0005188432,0.9940764,0.00019397779,0.0032946367,0.00084474956,0.000035922367,0.0005646817,0.00044052748],"genre_scores_gemma":[0.019588957,0.00005116077,0.9779074,0.000945932,0.0012413367,0.000030844825,0.000015009153,0.00006129709,0.00015802319],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99565905,0.000043257383,0.00076777424,0.0019004986,0.0007343487,0.00089508307],"domain_scores_gemma":[0.9966288,0.00060175726,0.00054327305,0.0017493947,0.0002897686,0.00018696612],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00073492085,0.00062090694,0.0006215533,0.0006337738,0.00055032107,0.000640999,0.0034596508,0.00030666418,0.000017292494],"category_scores_gemma":[0.00013940429,0.00059527514,0.00017723229,0.00060378603,0.00049591175,0.0015925489,0.001946665,0.00083517504,0.0000051896313],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019906138,0.00003149788,0.00008182777,0.00009036411,0.000015946383,0.000055413202,0.000274278,0.19221115,0.0005245198,0.014908987,0.00081674726,0.7909694],"study_design_scores_gemma":[0.00021156827,0.0001748844,0.00001247412,0.0009279194,0.000009327447,0.000103866514,4.438552e-8,0.8569026,0.0013048522,0.13473447,0.005118322,0.00049966364],"about_ca_topic_score_codex":0.000008497594,"about_ca_topic_score_gemma":0.000009432677,"teacher_disagreement_score":0.7904697,"about_ca_system_score_codex":0.00044247712,"about_ca_system_score_gemma":0.00017279068,"threshold_uncertainty_score":0.9996499},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010769584,0.0001317982,0.984616,0.00053358753,0.000045386365,0.000121458426,0.00003128623,0.0012706772,0.0024802652],"genre_scores_gemma":[0.72270405,0.00009272866,0.27570882,0.0001906586,0.000032225544,0.00005959083,0.000013333875,0.000012952155,0.001185661],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99842757,0.00007264877,0.00026163453,0.0005682336,0.00038269546,0.00028720507],"domain_scores_gemma":[0.99834305,0.00015507237,0.00011245384,0.0011540726,0.000113537084,0.00012180245],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000121841615,0.00019768075,0.00028075706,0.00027863725,0.00017098895,0.00011842466,0.00077033247,0.000073380754,0.00045731364],"category_scores_gemma":[0.00005246309,0.00015099315,0.0000810518,0.001084112,0.00007351585,0.0010047172,0.00023439867,0.00013226704,0.000054280023],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008062377,0.0011488961,0.0060599563,0.000061617706,0.0019309702,0.00018067293,0.001678097,0.0051630787,0.061985895,0.0076915245,0.24811383,0.6659048],"study_design_scores_gemma":[0.00019730156,0.00018460122,0.0011138263,0.00003973242,0.00021582893,0.000040662584,0.0000696028,0.76687086,0.22523876,0.00035435718,0.0051654694,0.00050900533],"about_ca_topic_score_codex":0.000075333715,"about_ca_topic_score_gemma":0.000013705473,"teacher_disagreement_score":0.7617078,"about_ca_system_score_codex":0.00006789635,"about_ca_system_score_gemma":0.000013115365,"threshold_uncertainty_score":0.61573213},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00056566217,0.00061507395,0.9948188,0.0023719992,0.000011313646,0.0003370035,0.0000033269243,0.0002777195,0.0009991138],"genre_scores_gemma":[0.35653394,0.00054619665,0.64264375,0.0002131534,0.00000278847,0.00003148005,0.000006996851,0.000004497006,0.000017224518],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99916655,0.000035276476,0.00025133055,0.0002701374,0.00016594946,0.00011078061],"domain_scores_gemma":[0.99819505,0.000079096535,0.000080262376,0.0014508384,0.00007825962,0.0001164963],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001198331,0.00009256764,0.00013323533,0.000102155216,0.000103235405,0.000026151576,0.0011553096,0.00004425678,0.0000028633729],"category_scores_gemma":[0.000011367279,0.00007703094,0.000021043375,0.00030143562,0.000058365484,0.00040798122,0.0006626839,0.00007900423,0.000009385085],"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.0000060497828,0.000077145545,0.000079815945,0.000013802571,0.00000192943,2.008379e-7,0.00028290375,0.00007482265,0.17333063,0.14170061,0.00008055793,0.68435156],"study_design_scores_gemma":[0.0005871203,0.0001655443,0.0045762714,0.00025321922,0.000005828058,0.000011417446,0.000028798573,0.015818736,0.6463591,0.08791585,0.24396282,0.0003152812],"about_ca_topic_score_codex":0.00005758037,"about_ca_topic_score_gemma":0.000004605596,"teacher_disagreement_score":0.68403625,"about_ca_system_score_codex":0.00002049929,"about_ca_system_score_gemma":0.00001824529,"threshold_uncertainty_score":0.31412306},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003144222,0.00014238046,0.9900945,0.0006050163,0.000059127815,0.00013031234,0.00001212205,0.00050102547,0.0053112865],"genre_scores_gemma":[0.3701483,0.000027159436,0.6289644,0.00021669496,0.00002389823,0.000010771932,0.0000044645467,0.000005551257,0.0005987464],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9990202,0.00003915244,0.00025084114,0.00027731594,0.00024152249,0.00017093131],"domain_scores_gemma":[0.99885285,0.00009091637,0.000118233744,0.00078568095,0.00008685756,0.00006543924],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00011008873,0.000106540145,0.00016798745,0.00008366739,0.00005271408,0.00003181826,0.0011827651,0.00004426402,0.000091099784],"category_scores_gemma":[0.000021983846,0.00008208679,0.0000386176,0.00020081199,0.00006356743,0.00091193005,0.0007398608,0.00008572293,0.000041177882],"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.000018353614,0.00033156032,0.00032753742,0.00003309713,0.000010399967,0.000007546242,0.00013861274,0.0006029825,0.27503026,0.10852949,0.14105156,0.4739186],"study_design_scores_gemma":[0.00019676579,0.0000444169,0.0003658405,0.00004031698,0.0000014243789,0.0000061827454,0.000006208762,0.031221515,0.9130679,0.0029991793,0.051918145,0.000132122],"about_ca_topic_score_codex":0.000010494747,"about_ca_topic_score_gemma":0.0000017838616,"teacher_disagreement_score":0.6380376,"about_ca_system_score_codex":0.000019566454,"about_ca_system_score_gemma":0.000020906542,"threshold_uncertainty_score":0.33474025},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0009878419,0.00009977056,0.9968437,0.00011175697,0.00020823929,0.00010967047,0.000001168806,0.0007926156,0.00084522995],"genre_scores_gemma":[0.7383667,0.000015287722,0.26123506,0.00022348025,0.00005780111,0.000004982513,0.0000021190301,0.0000065800496,0.000087976034],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99925995,0.000041576903,0.00013236838,0.00025562284,0.00014342507,0.00016703148],"domain_scores_gemma":[0.9993662,0.000043485255,0.00006001756,0.00042860498,0.000050436545,0.00005120789],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00004783186,0.00008472849,0.00007953134,0.000055220233,0.000091991,0.00007341386,0.00048671162,0.00004031992,0.00007484783],"category_scores_gemma":[0.000023490094,0.00007269909,0.000022606611,0.00030200568,0.000021859038,0.0010650952,0.00027129138,0.00008857081,0.000009009388],"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.000017810658,0.00032845692,0.0027353463,0.000016541651,0.00003378685,0.000051370625,0.00061823486,0.49397624,0.006880231,0.17550296,0.0372997,0.28253934],"study_design_scores_gemma":[0.000058442594,0.000032786593,0.00022901507,0.000007710095,0.0000013112478,0.000008336027,0.0000022452841,0.99687827,0.001632623,0.00056690734,0.00049367757,0.00008869058],"about_ca_topic_score_codex":0.0000075134435,"about_ca_topic_score_gemma":6.976194e-7,"teacher_disagreement_score":0.73737884,"about_ca_system_score_codex":0.000025972395,"about_ca_system_score_gemma":0.0000027866072,"threshold_uncertainty_score":0.29645827},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00035252,0.000055387387,0.9970647,0.0006540042,0.000068411886,0.00014701032,0.000002718624,0.0006149703,0.0010402893],"genre_scores_gemma":[0.10065358,0.00000897723,0.8982117,0.00102409,0.000038552836,0.000005692046,0.00000116902,0.000008099829,0.000048137783],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990305,0.000020571628,0.00015352046,0.00037348282,0.00021075286,0.00021118723],"domain_scores_gemma":[0.999209,0.000103067876,0.000047308396,0.00045127654,0.000028738114,0.00016064438],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013645698,0.0001286073,0.00013681757,0.000103593615,0.00010372225,0.00012525659,0.00044394983,0.000041927582,0.000013883203],"category_scores_gemma":[0.00002734998,0.00010706983,0.000027498601,0.00017067352,0.000019708266,0.0003965243,0.00018310636,0.000106702035,0.000010419761],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008826896,0.00005300223,0.000035106852,0.000006502716,0.0000050129966,0.000036219804,0.00015273971,0.0014571517,0.0014399954,0.026691617,0.0009802884,0.96913356],"study_design_scores_gemma":[0.0023516717,0.00017107696,0.00019367461,0.00025043666,0.0000055898504,0.00003338306,0.000017459364,0.87015903,0.10410258,0.019136092,0.0031304278,0.00044858255],"about_ca_topic_score_codex":0.000059970516,"about_ca_topic_score_gemma":0.000008812002,"teacher_disagreement_score":0.968685,"about_ca_system_score_codex":0.000039033454,"about_ca_system_score_gemma":0.00005042055,"threshold_uncertainty_score":0.4366181},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00093976944,0.0003238431,0.9902301,0.0017615178,0.000055738226,0.00029391568,0.000043563337,0.000709538,0.005642018],"genre_scores_gemma":[0.13103086,0.00014184629,0.8665383,0.0009416542,0.00002503149,0.00006180102,0.000023320934,0.000010732518,0.0012264795],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990143,0.00003901726,0.00018799666,0.00029633727,0.00026292595,0.00019943445],"domain_scores_gemma":[0.99872756,0.00014623548,0.0000895201,0.00081600365,0.000152685,0.00006798689],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001898756,0.00011566263,0.00013571775,0.00006389343,0.00020281125,0.00014704818,0.0014043271,0.000050872226,0.00020403025],"category_scores_gemma":[0.000015667754,0.00010006963,0.00004701613,0.00016000344,0.000036669713,0.00101921,0.0005072916,0.0000951558,0.000046690613],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003792013,0.00022573069,0.00029668442,0.00011611146,0.0000288098,0.0000048422703,0.0027933936,0.000008429208,0.0042524496,0.109747365,0.14822079,0.7342675],"study_design_scores_gemma":[0.000657802,0.00018197348,0.0000860284,0.00008621895,0.000005552586,0.000020884381,0.0001160807,0.52667916,0.048764084,0.030713173,0.39231053,0.00037852037],"about_ca_topic_score_codex":0.000018657269,"about_ca_topic_score_gemma":0.000026957983,"teacher_disagreement_score":0.7338889,"about_ca_system_score_codex":0.000042730255,"about_ca_system_score_gemma":0.000009956087,"threshold_uncertainty_score":0.40807208},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01605507,0.00000953101,0.9819525,0.00039332203,0.000042691383,0.00015912596,0.0000029167227,0.0003876747,0.000997201],"genre_scores_gemma":[0.6858744,0.000013618969,0.3138901,0.00014102811,0.000011929083,0.0000136872695,0.0000061713113,0.0000049978717,0.000044060856],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99922734,0.000009746653,0.00013333804,0.00029709516,0.0001771622,0.00015529657],"domain_scores_gemma":[0.9995595,0.00002462493,0.000043959026,0.00026933095,0.000041829095,0.000060757582],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00006238624,0.00011023909,0.000110777,0.00006695104,0.00007790368,0.000081547616,0.00026773365,0.000030894378,0.0000100400375],"category_scores_gemma":[0.000008143258,0.00007216658,0.000012947128,0.00017396429,0.000046526668,0.001039648,0.00007224286,0.00008297066,0.0000034074621],"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.00009765906,0.00012149974,0.00079299515,0.000027723316,0.000020691648,0.0000384416,0.0020692146,0.00042848615,0.04230559,0.41544908,0.00021706348,0.5384316],"study_design_scores_gemma":[0.0031200536,0.0007748231,0.0067738686,0.0002262973,0.0000093497165,0.000101460275,0.0001811175,0.021177324,0.9079616,0.05696697,0.0020367207,0.0006703866],"about_ca_topic_score_codex":0.00010049358,"about_ca_topic_score_gemma":0.00014147442,"teacher_disagreement_score":0.865656,"about_ca_system_score_codex":0.000029744298,"about_ca_system_score_gemma":0.000027799622,"threshold_uncertainty_score":0.2942868},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00022373187,0.00004805656,0.9814233,0.0009906798,0.00009068092,0.00037379382,0.00001221742,0.0015443781,0.01529314],"genre_scores_gemma":[0.0073747844,0.00003080745,0.9880726,0.0006333248,0.00006299656,0.000056024062,0.000008948512,0.000017478202,0.003743063],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99874073,0.000043312804,0.0002169549,0.00047834322,0.0002222332,0.00029842494],"domain_scores_gemma":[0.99843574,0.00024900943,0.00008861382,0.0010475477,0.00006452172,0.00011454346],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00010249558,0.00016328943,0.00018343702,0.000104641025,0.0001501722,0.00008692734,0.0012655851,0.000058493228,0.0003028158],"category_scores_gemma":[0.0000527383,0.00012351372,0.00007323901,0.00019414863,0.000035093588,0.0004941825,0.00053157884,0.00011152409,0.00014153874],"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.000012058841,0.00013011075,0.000012379288,0.000024709509,0.000008983469,0.000009164424,0.00017067775,0.00016738425,0.1520599,0.035487816,0.496063,0.3158538],"study_design_scores_gemma":[0.00055523135,0.00019142525,0.00006174693,0.000086685955,0.000004265027,0.000033242966,0.0000034931927,0.32023188,0.18986337,0.053034306,0.43547168,0.00046265573],"about_ca_topic_score_codex":0.000008674015,"about_ca_topic_score_gemma":9.034864e-7,"teacher_disagreement_score":0.3200645,"about_ca_system_score_codex":0.000021059108,"about_ca_system_score_gemma":0.0000067053143,"threshold_uncertainty_score":0.5036743},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015014827,0.00007984926,0.98421204,0.00002147617,0.000058145808,0.00024131528,4.0056213e-7,0.00014648719,0.0002254536],"genre_scores_gemma":[0.7911173,0.0000035930852,0.2088257,0.000014871293,0.000005657748,0.000015279218,0.0000015442599,0.0000026420003,0.000013409231],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99915105,0.00008882106,0.00013032266,0.00016185283,0.00039529672,0.00007266077],"domain_scores_gemma":[0.999199,0.000055609315,0.00007739526,0.000294628,0.0003263305,0.000047034897],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00089147466,0.000054461216,0.00007287672,0.00006924079,0.000024340947,0.000021462809,0.00023981169,0.000023034436,0.0000056722383],"category_scores_gemma":[0.00017144758,0.000046460482,0.000005758558,0.00017169905,0.000022980988,0.0007253531,0.00011059986,0.000029418192,0.00000436178],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000030525138,0.00007852199,0.0004181802,0.000029544552,0.000011701666,4.3643115e-7,0.0010861584,0.099331595,0.012002951,0.11328747,0.0021673702,0.77155554],"study_design_scores_gemma":[0.00019658679,0.000110364104,0.0011248419,0.0000198793,0.000004295492,0.0000029871512,0.0000065669483,0.9687662,0.02072141,0.008969875,0.00001659302,0.000060409522],"about_ca_topic_score_codex":0.0000038205076,"about_ca_topic_score_gemma":2.5150723e-7,"teacher_disagreement_score":0.8694346,"about_ca_system_score_codex":0.000038626964,"about_ca_system_score_gemma":0.00010977474,"threshold_uncertainty_score":0.18946034},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0014624199,0.000028116829,0.99108946,0.00017394914,0.00008888809,0.000086454325,0.000006242116,0.00083471136,0.0062297545],"genre_scores_gemma":[0.4116798,0.0000074956774,0.58786196,0.00011159931,0.000020062029,0.0000029739683,0.0000022733068,0.0000061073256,0.0003077166],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991485,0.000015074304,0.0001528111,0.00029088804,0.00017479433,0.00021791997],"domain_scores_gemma":[0.99928606,0.000048553415,0.000057682773,0.0005046867,0.000036611687,0.0000664162],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000047207242,0.00010081219,0.000086427586,0.00008389269,0.00011963114,0.00025886565,0.0005904397,0.000030872725,0.00008326843],"category_scores_gemma":[0.00005009345,0.00009015233,0.000036233036,0.00019508193,0.00003954428,0.0029649609,0.00050333404,0.00007777273,0.00007990339],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000063631333,0.00029555644,0.00040855928,0.000029168164,0.000019000336,0.000105704676,0.0005976821,0.00036204015,0.2690021,0.058622528,0.05904957,0.6115017],"study_design_scores_gemma":[0.00012848133,0.000018056266,0.00004528497,0.000026506994,9.543579e-7,0.000023407221,0.00000916436,0.9603645,0.03334246,0.001602226,0.0042671496,0.00017176587],"about_ca_topic_score_codex":0.000007805963,"about_ca_topic_score_gemma":2.7565426e-7,"teacher_disagreement_score":0.9600025,"about_ca_system_score_codex":0.000049525053,"about_ca_system_score_gemma":0.000003983061,"threshold_uncertainty_score":0.36763054},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04175876,0.000058839636,0.9480363,0.00019252187,0.000101676174,0.00015785676,0.0000016682276,0.0009972377,0.008695128],"genre_scores_gemma":[0.5352899,0.000041094907,0.4626608,0.00091841875,0.000022649629,0.000026083351,0.000004522763,0.00001146898,0.0010250565],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99862146,0.000067889734,0.0002746397,0.00050336367,0.00022661683,0.00030602916],"domain_scores_gemma":[0.99868524,0.00004180829,0.000051466282,0.0010359192,0.00006729793,0.00011829553],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015562357,0.00014438243,0.00018442638,0.00016549967,0.00011248852,0.00008553307,0.001436331,0.00005514578,0.00012414258],"category_scores_gemma":[0.000034064127,0.00012338735,0.000029912519,0.0003279742,0.000047595582,0.0026176507,0.00060046604,0.00018279234,0.00008119941],"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.00015102232,0.0024888506,0.022124283,0.00008657892,0.00003413752,0.002023607,0.012902397,0.0043371045,0.35256356,0.24134329,0.12609534,0.23584983],"study_design_scores_gemma":[0.0012962726,0.00037354312,0.005091116,0.00020107198,0.0000020406535,0.00022877584,0.00013363095,0.64189774,0.3101039,0.007949922,0.031632014,0.0010899883],"about_ca_topic_score_codex":0.000072420626,"about_ca_topic_score_gemma":0.00005189903,"teacher_disagreement_score":0.6375606,"about_ca_system_score_codex":0.000035437224,"about_ca_system_score_gemma":0.000045107023,"threshold_uncertainty_score":0.503159},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.021156326,0.00013980918,0.9773453,0.00045824883,0.00067850255,0.00012739224,0.000015012581,0.00007382249,0.0000055698492],"genre_scores_gemma":[0.402324,0.00010882381,0.59725183,0.000060445876,0.00021198629,0.0000043558084,5.226559e-7,0.000014288314,0.000023769115],"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99898183,0.000012941566,0.00041827635,0.00011903321,0.0003012117,0.00016671694],"domain_scores_gemma":[0.9988126,0.00009721176,0.00043221566,0.00040235624,0.0002023004,0.000053324],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004646772,0.000114072034,0.00022567311,0.0000408006,0.000072280694,0.000026661593,0.0010320316,0.0000677447,7.4371036e-7],"category_scores_gemma":[0.00011835503,0.00008210501,0.00036050827,0.0002279356,0.000027588228,0.0005335682,0.00023933519,0.0002605509,3.5375936e-7],"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.000030963572,0.00012754028,0.000337673,0.00042500618,0.00030933274,0.000003986054,0.0025744443,0.7299037,0.24220198,0.008153703,0.010912807,0.0050188494],"study_design_scores_gemma":[0.0023244568,0.0004133769,0.002901377,0.0018395872,0.000080137506,0.00020681287,0.000100910795,0.17633967,0.7964813,0.0050775628,0.013847846,0.00038697603],"about_ca_topic_score_codex":8.710053e-7,"about_ca_topic_score_gemma":6.673555e-8,"teacher_disagreement_score":0.5542793,"about_ca_system_score_codex":0.00015187224,"about_ca_system_score_gemma":0.00007323308,"threshold_uncertainty_score":0.33481452},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.044267237,0.000021912036,0.9542934,0.00009115776,0.000026516682,0.00012821204,0.0000064244564,0.0003220363,0.0008431092],"genre_scores_gemma":[0.415455,0.000015224906,0.5844201,0.00006911965,0.000009886592,0.0000052482205,0.000005399543,0.000005916405,0.0000141361525],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9989791,0.000029971185,0.000203269,0.00037164945,0.0002077705,0.00020827506],"domain_scores_gemma":[0.99915314,0.000040991647,0.00010540605,0.0005374293,0.0000671362,0.00009587188],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012868282,0.00013938414,0.00018082403,0.000105379404,0.00008821586,0.000100300305,0.0005364919,0.0000419196,0.000019144398],"category_scores_gemma":[0.000012219358,0.00010354679,0.000016539721,0.00015447447,0.00009640577,0.0014312,0.00022482296,0.00008783462,0.0000023096013],"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.00009211701,0.00025492965,0.0007392437,0.00009938483,0.00004192202,0.00019068336,0.0019069129,0.0015902409,0.6992562,0.26569426,0.0004975178,0.02963657],"study_design_scores_gemma":[0.0014218102,0.00044021668,0.0004973448,0.00016673027,0.000010799735,0.00023533331,0.00017216372,0.03856339,0.9315134,0.026189137,0.00026871727,0.000520936],"about_ca_topic_score_codex":0.00005554088,"about_ca_topic_score_gemma":0.000024550129,"teacher_disagreement_score":0.37118778,"about_ca_system_score_codex":0.00001770476,"about_ca_system_score_gemma":0.000043435437,"threshold_uncertainty_score":0.42225152},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0040754443,0.0000068794448,0.9916276,0.0014365488,0.00022864519,0.00015246913,0.000009036238,0.0008342362,0.0016291842],"genre_scores_gemma":[0.7771111,0.0000053598687,0.22197485,0.0006572473,0.000051239876,0.000038123864,0.000035573536,0.000007232374,0.00011928677],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9986603,0.000042971402,0.00023189021,0.00046140607,0.0003693092,0.00023411209],"domain_scores_gemma":[0.9990655,0.0001071633,0.00011480767,0.0005326464,0.000087589644,0.00009226078],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012833727,0.00015503916,0.00014415142,0.00014953483,0.00024792264,0.000119361335,0.00043822528,0.00006411758,0.000098981494],"category_scores_gemma":[0.000057103338,0.00013636501,0.00004086637,0.00023202358,0.000042544165,0.00068282813,0.00009879401,0.00021723552,0.00006000253],"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.00008535644,0.0004421066,0.00009360221,0.000018885134,0.000013691763,0.000028282395,0.0001286376,0.032279722,0.06525148,0.8219887,0.002927492,0.076742075],"study_design_scores_gemma":[0.0013781756,0.00031249336,0.0012637095,0.0003111046,0.000005412758,0.000064328095,0.000035068668,0.45352063,0.45772165,0.082651675,0.0021863305,0.0005494433],"about_ca_topic_score_codex":0.000050393763,"about_ca_topic_score_gemma":0.0000058507735,"teacher_disagreement_score":0.77303565,"about_ca_system_score_codex":0.00013766043,"about_ca_system_score_gemma":0.000075497504,"threshold_uncertainty_score":0.55608034},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00006666329,0.000053948086,0.9355973,0.00050253514,0.000078564466,0.00045475378,0.0000060678626,0.0012168053,0.06202336],"genre_scores_gemma":[0.021374378,0.000024390576,0.9733178,0.0008059128,0.000019404311,0.00006461425,0.0000051730512,0.000014052978,0.004374269],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984085,0.00004464418,0.00024853947,0.0006096128,0.00032526706,0.00036343286],"domain_scores_gemma":[0.9984175,0.000040305986,0.000050213264,0.0011842495,0.000078041325,0.0002297082],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012945342,0.00019349004,0.00020275597,0.0001708955,0.00015488904,0.00012965663,0.0016592899,0.00006921977,0.00016615081],"category_scores_gemma":[0.000027844348,0.00015648433,0.00006484369,0.0005303,0.00003328913,0.0013875372,0.00065617904,0.00017104873,0.00036439078],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019301948,0.0015348505,0.000027015452,0.0000814718,0.000020161393,0.000029607205,0.0025762117,0.00023011828,0.20968527,0.020098247,0.5621239,0.20357388],"study_design_scores_gemma":[0.00082827604,0.00010875021,0.0000944831,0.0000765185,0.0000041606886,0.000032616106,0.00007204058,0.6957767,0.21631292,0.0015238271,0.084561154,0.0006085854],"about_ca_topic_score_codex":0.000013790378,"about_ca_topic_score_gemma":0.0000010943812,"teacher_disagreement_score":0.69554657,"about_ca_system_score_codex":0.000040585317,"about_ca_system_score_gemma":0.000007453799,"threshold_uncertainty_score":0.6381246},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11247748,0.0042372565,0.79493254,0.04634492,0.008179498,0.006552868,0.00015393243,0.0018840436,0.025237447],"genre_scores_gemma":[0.9282015,0.0003983143,0.06158278,0.0014457323,0.00017732359,0.0005301571,0.000047846657,0.000039815946,0.007576552],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.9969574,0.00030652355,0.00062884705,0.0007966899,0.00058785826,0.0007226349],"domain_scores_gemma":[0.9974718,0.00041951204,0.0009819006,0.0005828586,0.00025346022,0.00029044194],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008595906,0.00037982033,0.00044269842,0.00023423675,0.00039888636,0.00025429146,0.0005573514,0.00013935572,0.00008856478],"category_scores_gemma":[0.00016950408,0.00038261942,0.000060495066,0.00053717586,0.0000954308,0.0012661549,0.00023037202,0.0007032957,0.000039420982],"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.00013262685,0.00036212214,0.031081432,0.00014565949,0.000014132025,0.0000015472758,0.0007397054,0.000020184913,0.0008498782,0.8886616,0.0012851332,0.07670598],"study_design_scores_gemma":[0.0038504393,0.003740923,0.6142128,0.0035183444,0.00005786532,0.0000368481,0.0031667452,0.015459829,0.0069296835,0.07725386,0.2682766,0.0034960567],"about_ca_topic_score_codex":0.00019261503,"about_ca_topic_score_gemma":0.000091136186,"teacher_disagreement_score":0.815724,"about_ca_system_score_codex":0.00067354785,"about_ca_system_score_gemma":0.000444064,"threshold_uncertainty_score":0.99986255},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00021019633,0.000044998244,0.9918216,0.00024561668,0.00007827361,0.00029309228,0.000025255089,0.00046888788,0.00681208],"genre_scores_gemma":[0.40085113,0.000015628506,0.59715825,0.00029503074,0.000017073917,0.00017254987,0.000022983197,0.000010284682,0.0014570702],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99871385,0.00007871303,0.00026942676,0.00046539778,0.00022502366,0.00024756845],"domain_scores_gemma":[0.99848676,0.00044758338,0.00012738965,0.00072856515,0.00012496882,0.00008475537],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032496723,0.0001452005,0.00023869723,0.00019146263,0.00013988161,0.00015063868,0.0006282001,0.00006400597,0.00027459432],"category_scores_gemma":[0.00043655196,0.00012539842,0.00011760195,0.0006803159,0.000022599,0.0006770716,0.000074364616,0.00006343028,0.00002173714],"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.000018886712,0.0001771208,0.00024119216,0.000029638204,0.00024683276,0.0000045919546,0.000089833964,0.00005799386,0.11326844,0.6485742,0.12364958,0.11364169],"study_design_scores_gemma":[0.00013174347,0.000035084235,0.000039662864,0.000010998291,0.000048820406,0.0000026180685,0.0000155187,0.018838456,0.91499,0.0069533316,0.058709353,0.00022440446],"about_ca_topic_score_codex":0.00001731676,"about_ca_topic_score_gemma":0.00001270365,"teacher_disagreement_score":0.8017216,"about_ca_system_score_codex":0.00007055592,"about_ca_system_score_gemma":0.000034111104,"threshold_uncertainty_score":0.51135993},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0038978711,0.0001408199,0.9927343,0.00027748902,0.00017752271,0.000418214,0.000057278736,0.0015808472,0.00071563304],"genre_scores_gemma":[0.6322045,0.00004141882,0.36726472,0.0002996541,0.00002692036,0.00006766712,0.000004672826,0.00003009971,0.00006035691],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9970672,0.00016419217,0.0006618171,0.0009984978,0.0005469041,0.0005613948],"domain_scores_gemma":[0.998186,0.0001240284,0.00018415772,0.00091107603,0.00036558876,0.00022916404],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00027602448,0.0004395869,0.00042906025,0.0002405772,0.00085529336,0.00040058146,0.0010440331,0.00015393236,0.00020799437],"category_scores_gemma":[0.000009087558,0.00042163467,0.0001398825,0.0005656409,0.00026513523,0.003920838,0.000014861051,0.000710051,0.00012694682],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009987961,0.00022420115,1.284709e-7,0.000033674933,0.000012678663,0.000024459661,0.00024811068,0.011446542,0.13129042,0.0000653657,0.00008485519,0.8564697],"study_design_scores_gemma":[0.0005285468,0.00007912168,0.0000019905015,0.0002922507,0.000014930659,0.000037056412,0.00004596064,0.6705193,0.3241581,0.0038923696,0.00006726658,0.00036313533],"about_ca_topic_score_codex":0.00008710871,"about_ca_topic_score_gemma":0.000009497051,"teacher_disagreement_score":0.8561066,"about_ca_system_score_codex":0.00013189539,"about_ca_system_score_gemma":0.00014831955,"threshold_uncertainty_score":0.9998236},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000016711214,0.00071612664,0.9951665,0.00012325331,0.001460371,0.0010992403,0.00005508753,0.00064548943,0.0007172188],"genre_scores_gemma":[0.036263492,0.00006516025,0.96158034,0.0005064866,0.00088617275,0.00026406843,0.00006949148,0.00006593732,0.00029885152],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9951299,0.00006163751,0.000714482,0.002303979,0.0010837417,0.0007062554],"domain_scores_gemma":[0.9953341,0.0004813747,0.00051358336,0.002911053,0.0005180837,0.00024180593],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000729917,0.000596449,0.00059823156,0.00087140594,0.00033912982,0.0008962621,0.0046828245,0.00035779126,0.000011016292],"category_scores_gemma":[0.00006122281,0.0005490821,0.0001445049,0.000542341,0.00045071027,0.0013890028,0.0012122707,0.0004856137,0.000010489159],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009652234,0.000071446695,0.0000016452369,0.000040866336,0.0000061206206,0.000023950348,0.00031661786,0.3751878,0.002210289,0.057924252,0.0001977035,0.5640096],"study_design_scores_gemma":[0.00021130075,0.0002692706,0.0000029278754,0.00027352394,0.000005920071,0.000048319387,4.1035773e-7,0.9293816,0.011346874,0.045533795,0.012294128,0.000631901],"about_ca_topic_score_codex":0.000027326963,"about_ca_topic_score_gemma":0.00001746011,"teacher_disagreement_score":0.56337774,"about_ca_system_score_codex":0.0003899955,"about_ca_system_score_gemma":0.0003221932,"threshold_uncertainty_score":0.9996961},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0012526606,0.0010250192,0.99083334,0.000094146686,0.00016097522,0.00011680772,5.691819e-7,0.00023100757,0.00628548],"genre_scores_gemma":[0.35419306,0.0008243574,0.6355768,0.000714311,0.000009630556,0.00004236475,4.603426e-7,0.000010526641,0.008628531],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9992794,0.00007645451,0.00012025291,0.00025030292,0.00010137124,0.0001722142],"domain_scores_gemma":[0.99914724,0.00016298979,0.000056190045,0.00052444445,0.00005091339,0.000058201305],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002499065,0.000095024785,0.00007684393,0.000026833446,0.00019278546,0.00004188874,0.000466188,0.000026715637,0.000010899371],"category_scores_gemma":[0.000060545644,0.00005854454,0.00001326158,0.00006796963,0.000114116236,0.0006346535,0.00018713868,0.00010269246,0.0000130845365],"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.000035396894,0.000088012996,0.0013417697,0.0000130189155,0.000020084808,0.000012322965,0.0007068516,0.000042081687,0.004716418,0.648176,0.06754509,0.27730295],"study_design_scores_gemma":[0.0004416795,0.00016851336,0.0022978827,0.000028131355,0.0000027548879,0.000027297632,0.00003754896,0.12240339,0.049534097,0.0045689167,0.82015485,0.00033496262],"about_ca_topic_score_codex":0.0000064221103,"about_ca_topic_score_gemma":0.000008437312,"teacher_disagreement_score":0.7526097,"about_ca_system_score_codex":0.00005746024,"about_ca_system_score_gemma":0.00004274228,"threshold_uncertainty_score":0.23873772},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015928322,0.000038633465,0.981238,0.00005052037,0.00009115098,0.00014261981,0.0000017911664,0.00035983254,0.0021491172],"genre_scores_gemma":[0.44230077,0.000015600639,0.55754364,0.00007468175,0.0000050645563,0.000003571636,7.973586e-7,0.000005694752,0.00005017865],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9991223,0.000043049185,0.00018726254,0.00031199516,0.00012291741,0.00021244309],"domain_scores_gemma":[0.99945986,0.000061424755,0.000047277008,0.00031906698,0.00004219971,0.00007019131],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020853478,0.000118505224,0.00011754614,0.00009917028,0.00014510921,0.00018304528,0.00028095482,0.000039440853,0.00001561277],"category_scores_gemma":[0.00007576702,0.00010531996,0.000025704805,0.0001513698,0.000039153816,0.0020469502,0.00012431896,0.0001091647,0.0000031701202],"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.000004577831,0.000037393973,0.00028594385,0.000025456442,0.000005300755,0.000008034817,0.0004956849,0.0000063479374,0.8468044,0.051536724,0.0002652866,0.100524865],"study_design_scores_gemma":[0.00048198848,0.00005389018,0.00020277905,0.0001212212,0.0000048960264,0.00012807467,0.00015994837,0.37212643,0.6033627,0.01615131,0.006828073,0.0003786939],"about_ca_topic_score_codex":0.00001943224,"about_ca_topic_score_gemma":0.000007805197,"teacher_disagreement_score":0.42637244,"about_ca_system_score_codex":0.000047906367,"about_ca_system_score_gemma":0.000014736279,"threshold_uncertainty_score":0.42948234},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000025846573,0.00005332225,0.4716818,0.00002633593,0.00014876507,0.00024281543,0.00007525831,0.0006145809,0.52713126],"genre_scores_gemma":[0.0005926801,0.00019349728,0.06222063,0.00012069551,0.00009989812,0.0000012715508,0.00002316614,0.000052925014,0.9366952],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9980283,0.000036868187,0.00023597531,0.0009804755,0.00034392253,0.00037448443],"domain_scores_gemma":[0.9976534,0.00015678475,0.00035464688,0.0013955641,0.00017122058,0.00026836252],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00016165053,0.00047006994,0.00046749826,0.00029879867,0.00069972296,0.00019521281,0.0018673615,0.00044537868,0.0000034697296],"category_scores_gemma":[0.000027791752,0.0005520275,0.00013033893,0.000014827365,0.0004067325,0.00067359046,0.0050880266,0.0010734558,0.000006030359],"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.0000151001,0.000005744953,5.39874e-7,0.000055352884,0.000028942448,0.00014894422,0.000071214316,2.6276362e-7,0.007957717,0.96651953,0.012713833,0.012482835],"study_design_scores_gemma":[0.00032918583,0.000047588575,0.0000030038661,0.00030644113,0.000045274268,0.000064581094,0.00001013557,0.0008454208,0.018888632,0.00019558455,0.9786296,0.00063456356],"about_ca_topic_score_codex":0.000040141364,"about_ca_topic_score_gemma":0.0000011209643,"teacher_disagreement_score":0.9663239,"about_ca_system_score_codex":0.00010613352,"about_ca_system_score_gemma":0.000070153714,"threshold_uncertainty_score":0.9996931},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0006560836,0.000015063489,0.9953097,0.0007181996,0.000033364842,0.00034632435,0.0000028027239,0.0007334056,0.0021850402],"genre_scores_gemma":[0.5811255,0.000017666956,0.41820616,0.0003974084,0.000021505199,0.00006734965,0.000009236816,0.0000067603955,0.00014844841],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99913436,0.000025850277,0.00014556407,0.00033238705,0.00019926312,0.00016254479],"domain_scores_gemma":[0.9992067,0.000037601487,0.00007111001,0.00049990776,0.00010319199,0.00008144113],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000066074776,0.000090069916,0.000083112915,0.000056813766,0.0000874542,0.00010219328,0.00038878844,0.000025756435,0.000071283284],"category_scores_gemma":[0.000024099663,0.000073642404,0.000012130845,0.00050737365,0.000015964875,0.0009609765,0.00011928261,0.00004959418,0.00025323927],"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.00001957909,0.00023440355,0.0008805886,0.000030775587,0.000009213404,0.000011017498,0.0005967011,0.0006440693,0.2693612,0.53707606,0.039950237,0.15118615],"study_design_scores_gemma":[0.00033147514,0.00017512779,0.00084699044,0.000050176273,0.000004332693,0.0000116320525,0.000019546938,0.532675,0.43064937,0.0018197744,0.033056732,0.00035981144],"about_ca_topic_score_codex":0.0000075432454,"about_ca_topic_score_gemma":0.0000037864886,"teacher_disagreement_score":0.58046937,"about_ca_system_score_codex":0.000042257365,"about_ca_system_score_gemma":0.0000049822215,"threshold_uncertainty_score":0.3254963},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00180783,0.00003594044,0.98891294,0.00033918393,0.000044540066,0.00014813391,0.0000017736531,0.0012172522,0.0074924305],"genre_scores_gemma":[0.1573438,0.000009899924,0.8416427,0.00041604677,0.00001149569,0.000023584154,0.0000050587464,0.000010819791,0.00053663953],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99890393,0.000015008201,0.0001586073,0.00041162834,0.00022851223,0.00028229316],"domain_scores_gemma":[0.99900424,0.000018993122,0.000061738574,0.00072044093,0.00010998842,0.00008459901],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00009292149,0.00015665627,0.00013846142,0.00009460784,0.00013551752,0.00014186602,0.0008891913,0.00004615391,0.0000402335],"category_scores_gemma":[0.00000935696,0.00010058574,0.00002149174,0.00042262784,0.0000669489,0.0012466154,0.00035489586,0.00017906602,0.000068190275],"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.00017139649,0.0003576556,0.00042061458,0.000020680673,0.000064679945,0.0004572345,0.00095284625,0.0031785541,0.038739696,0.8398228,0.008784127,0.10702971],"study_design_scores_gemma":[0.001207809,0.00052887574,0.00015948083,0.0004027245,0.000004544323,0.00015860709,0.00008356874,0.024407232,0.8236703,0.048141684,0.10050087,0.00073428865],"about_ca_topic_score_codex":0.00017519592,"about_ca_topic_score_gemma":0.000014621857,"teacher_disagreement_score":0.7916811,"about_ca_system_score_codex":0.000090131325,"about_ca_system_score_gemma":0.000120960576,"threshold_uncertainty_score":0.41017675},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000029345498,0.0007034306,0.99512297,0.00017661342,0.001629143,0.0013064987,0.00007188761,0.000437833,0.00052229356],"genre_scores_gemma":[0.032474194,0.000033332453,0.9654144,0.0009514802,0.0009375844,0.000030717063,0.000017238908,0.00006899017,0.00007203607],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9949594,0.000080364036,0.0008509028,0.002269737,0.00082364,0.0010159175],"domain_scores_gemma":[0.9954333,0.0010812104,0.0008111232,0.001900709,0.0005079147,0.00026580037],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00064399006,0.0008625807,0.00095975725,0.0008296502,0.0005300909,0.0005750741,0.004307863,0.0004951719,0.0000175998],"category_scores_gemma":[0.0000963363,0.00079156,0.00023964008,0.00049123506,0.0013801771,0.002088394,0.0030988778,0.0010769143,0.000004421745],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004190267,0.00002590178,0.0000063220546,0.00001831806,0.000013987858,0.00004869443,0.00013747138,0.14929634,0.0012497928,0.007733437,0.00008052892,0.8413473],"study_design_scores_gemma":[0.000398516,0.00016894627,0.000010953767,0.00052449614,0.000012355569,0.00014106363,2.3124744e-7,0.94217694,0.0060737077,0.04893168,0.00072431547,0.0008368061],"about_ca_topic_score_codex":0.000015484136,"about_ca_topic_score_gemma":0.000013403566,"teacher_disagreement_score":0.8405105,"about_ca_system_score_codex":0.0005369188,"about_ca_system_score_gemma":0.00036814043,"threshold_uncertainty_score":0.99945354},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00013257086,0.00015467567,0.99689496,0.00017449544,0.00009917639,0.00015315364,0.000004777114,0.00011712858,0.0022690813],"genre_scores_gemma":[0.80206853,0.00005659141,0.19757858,0.000015719164,0.0000105143545,0.00002898455,3.325296e-7,0.0000023166483,0.00023844808],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99963063,0.0000147269475,0.00014009887,0.000093771276,0.000070749105,0.000050004157],"domain_scores_gemma":[0.9992577,0.0002216274,0.00009585509,0.00032891266,0.00008681368,0.000009085202],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00008036234,0.000036825502,0.000056920722,0.000058170557,0.000051773706,0.000009313506,0.00029101735,0.000016548971,0.0000125991555],"category_scores_gemma":[0.00006589409,0.000023924546,0.00003615839,0.00016999939,0.00003012024,0.00033343406,0.00008832096,0.000029168354,0.0000011017428],"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.000004017546,0.000046281355,0.000031007934,0.0000111488625,0.000008461105,2.773924e-8,0.00012766966,0.000026050586,0.2838303,0.019246053,0.0026401414,0.69402885],"study_design_scores_gemma":[0.00006826642,0.00006907247,0.00041468986,0.00001125386,0.0000036072993,0.0000016055607,0.000017447594,0.11878578,0.8652398,0.010840743,0.0045090923,0.00003864725],"about_ca_topic_score_codex":0.000021646438,"about_ca_topic_score_gemma":0.000006579945,"teacher_disagreement_score":0.801936,"about_ca_system_score_codex":0.0000060901916,"about_ca_system_score_gemma":0.0000019096913,"threshold_uncertainty_score":0.09756146},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003932287,0.000008796105,0.9860297,0.00041571792,0.00009409247,0.0003163459,0.0000021048743,0.0005439279,0.008657019],"genre_scores_gemma":[0.50575376,0.0000030051265,0.49343678,0.0004685341,0.00002306436,0.00006289581,0.00003340966,0.000008186325,0.00021037163],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99854445,0.00017871869,0.00028659613,0.000532826,0.00022986569,0.00022756704],"domain_scores_gemma":[0.9987494,0.00006824477,0.00008457595,0.0009122903,0.00007600322,0.000109529305],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000511106,0.00014193574,0.00016052094,0.00017101146,0.00006949897,0.00010042764,0.0009200169,0.000063210246,0.000011959745],"category_scores_gemma":[0.00009583334,0.00012109794,0.000024978272,0.00047786022,0.000023886027,0.0010529826,0.00052022235,0.00012854877,0.00009798861],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006878818,0.00080963335,0.0011990909,0.00011138611,0.0000074799455,0.0000055970245,0.0012582598,0.0044789813,0.37912136,0.22086494,0.099776156,0.29229835],"study_design_scores_gemma":[0.00060129294,0.0001391728,0.011386777,0.00011964199,0.00000239135,0.000007983694,0.000033766875,0.65243965,0.27336973,0.018379606,0.04290255,0.0006174338],"about_ca_topic_score_codex":0.00006018113,"about_ca_topic_score_gemma":0.000008987357,"teacher_disagreement_score":0.64796066,"about_ca_system_score_codex":0.00007680804,"about_ca_system_score_gemma":0.000016767084,"threshold_uncertainty_score":0.49382305},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00032228424,0.000048682046,0.9972535,0.00080733927,0.00024409115,0.00027781483,0.0000041212734,0.00074425683,0.00029794592],"genre_scores_gemma":[0.1304878,0.000011427909,0.86835164,0.00058035005,0.00012160289,0.000049196864,0.000008730621,0.0000087156095,0.00038053884],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99912685,0.000012268503,0.00018614095,0.00032056248,0.00017493703,0.00017925077],"domain_scores_gemma":[0.9990412,0.00019929335,0.00006180622,0.00053711963,0.00010236983,0.00005819943],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000147017,0.00009363674,0.0000991698,0.000088977235,0.00009559805,0.000093582166,0.0007159435,0.000047422072,0.000037666414],"category_scores_gemma":[0.00012882793,0.00007682098,0.0000389846,0.00018796483,0.000011350775,0.0011073162,0.00024611742,0.000041089635,0.000064416374],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010959325,0.00005289662,0.00001240977,0.000004775419,0.0000022280276,4.3101144e-7,0.000053185075,0.0008440701,0.005956368,0.17820865,0.033790782,0.78106326],"study_design_scores_gemma":[0.0002695936,0.00008120558,0.00007244854,0.00002760513,0.0000013917535,0.000003742509,0.0000025536203,0.56322545,0.16403936,0.027519455,0.24457002,0.0001872008],"about_ca_topic_score_codex":0.0000020587959,"about_ca_topic_score_gemma":0.0000034169075,"teacher_disagreement_score":0.78087604,"about_ca_system_score_codex":0.00002802969,"about_ca_system_score_gemma":0.000018125533,"threshold_uncertainty_score":0.31326684},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03032366,0.0000107849955,0.9643317,0.00046966842,0.000052070176,0.0003690015,0.000015335354,0.00048460288,0.0039432133],"genre_scores_gemma":[0.7509854,0.00005787671,0.24824093,0.0001552787,0.00004264067,0.00002745254,0.00003114723,0.000017879618,0.00044139705],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9986762,0.00010464709,0.00026376825,0.0003425575,0.00041027338,0.00020257356],"domain_scores_gemma":[0.99892366,0.00012675214,0.0001078491,0.0006907279,0.00009000186,0.000061012786],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001555676,0.00012083543,0.00014349946,0.00020405526,0.000062341715,0.00003859929,0.0006151224,0.00004398819,0.00063304295],"category_scores_gemma":[0.000023459193,0.000101629616,0.00004074479,0.00039514032,0.00003232283,0.00035561164,0.00021750681,0.00010073989,0.00009143974],"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.000024925923,0.00020156396,0.000041548497,0.000051062278,0.000014906241,0.000005449591,0.001499616,0.0017245148,0.6678922,0.02510947,0.017364157,0.28607056],"study_design_scores_gemma":[0.0004805408,0.0006640689,0.0005893624,0.00006608106,0.0000036045062,0.000009374559,0.00007801179,0.17820655,0.8160538,0.0031024416,0.00047942912,0.00026675733],"about_ca_topic_score_codex":0.00007221184,"about_ca_topic_score_gemma":0.000008631672,"teacher_disagreement_score":0.7206617,"about_ca_system_score_codex":0.00003569963,"about_ca_system_score_gemma":0.000017279368,"threshold_uncertainty_score":0.6931376},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00013974274,0.000110579305,0.9975814,0.00013568319,0.00015112745,0.0003976192,0.000030105013,0.0005680032,0.0008857276],"genre_scores_gemma":[0.0358648,0.00009135327,0.9628941,0.0003683065,0.000019964848,0.000086444925,0.00005615825,0.000011954535,0.0006069611],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9987961,0.00006678639,0.00020380512,0.0005643185,0.00013375856,0.00023522446],"domain_scores_gemma":[0.9979176,0.0002768643,0.000054361364,0.0016166454,0.00004716645,0.000087391185],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004707312,0.0001207726,0.0001411905,0.00006006353,0.00013788107,0.00009432644,0.0017134135,0.000047676545,0.0000708641],"category_scores_gemma":[0.00006338153,0.000096645475,0.000027797829,0.00017963405,0.000019717814,0.0015474836,0.00036808307,0.00007555087,0.000013809519],"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.000023004972,0.0001317588,0.000015112096,0.00005497155,0.000012927913,0.000008826065,0.000079184225,0.00019974125,0.081350654,0.3491575,0.12453317,0.44443315],"study_design_scores_gemma":[0.00030273286,0.0000667221,0.000009285048,0.000034277644,0.0000030961537,0.000004511889,0.000006561157,0.036832877,0.32332093,0.022029905,0.61720765,0.00018148783],"about_ca_topic_score_codex":0.0000063374114,"about_ca_topic_score_gemma":6.2250734e-7,"teacher_disagreement_score":0.49267444,"about_ca_system_score_codex":0.000017731032,"about_ca_system_score_gemma":0.000044900073,"threshold_uncertainty_score":0.39410883},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00052205275,0.00008793429,0.9945651,0.0012482369,0.00014152509,0.0004652191,0.000057107165,0.0005209477,0.002391854],"genre_scores_gemma":[0.3477034,0.0000693369,0.6474253,0.00097300124,0.000079698526,0.0002978019,0.000012210899,0.000017746115,0.0034214894],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99903625,0.00002572975,0.00015277139,0.00041356677,0.00012457733,0.00024709138],"domain_scores_gemma":[0.9991897,0.00013470864,0.00006685456,0.0004317356,0.000066571236,0.00011042927],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00007533413,0.00013240546,0.00015967787,0.00008510334,0.00011058417,0.00010904014,0.000459428,0.000053083237,0.00017574546],"category_scores_gemma":[0.000061837265,0.000107007705,0.00003526312,0.00017319618,0.00004961011,0.00068834197,0.00029203467,0.00006433376,0.000025259198],"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.000059497128,0.000291022,0.00013413987,0.000049432783,0.00004310963,0.000030272846,0.0021493817,0.000014349122,0.011837999,0.32757002,0.4877896,0.17003119],"study_design_scores_gemma":[0.0020352104,0.0009849928,0.0017472483,0.00014629653,0.000015207501,0.00005333642,0.00011276978,0.58727974,0.12017195,0.022642689,0.2637169,0.0010936604],"about_ca_topic_score_codex":0.0000028790437,"about_ca_topic_score_gemma":0.0000023438138,"teacher_disagreement_score":0.5872654,"about_ca_system_score_codex":0.000015321282,"about_ca_system_score_gemma":0.0000065429517,"threshold_uncertainty_score":0.43636474},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00026311842,0.000010568091,0.9806311,0.00021340667,0.00018488878,0.0002475528,0.000004554858,0.0008986858,0.01754614],"genre_scores_gemma":[0.14026561,0.0000023973378,0.8584809,0.0009111017,0.000009888072,0.00002464328,0.00001209395,0.00001129226,0.0002821149],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99857736,0.0001730489,0.00022612415,0.0004757419,0.0003106776,0.00023703118],"domain_scores_gemma":[0.9984566,0.00015400739,0.000094686104,0.0011001145,0.0000838969,0.00011069859],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021984405,0.00017000447,0.00015582988,0.00013414923,0.00015941639,0.00010319304,0.0007280387,0.00006272647,0.000148987],"category_scores_gemma":[0.000063617044,0.00013748402,0.00005023178,0.00022842489,0.00004491764,0.00067171553,0.00015665955,0.00015704907,0.00017203389],"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.000066716806,0.002786632,0.0022336766,0.00008059934,0.000012623715,0.000058391848,0.0003009839,0.0026237005,0.5860242,0.20003976,0.0921229,0.113649815],"study_design_scores_gemma":[0.00060424354,0.000072791154,0.0011299889,0.000049674316,0.0000012957051,0.0000030454314,0.000006636289,0.66454285,0.31034842,0.0016214722,0.021387337,0.00023223223],"about_ca_topic_score_codex":0.000006309309,"about_ca_topic_score_gemma":0.0000025296665,"teacher_disagreement_score":0.6619192,"about_ca_system_score_codex":0.00004401899,"about_ca_system_score_gemma":0.000032390635,"threshold_uncertainty_score":0.56064355},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00018582786,0.000068496796,0.9974974,0.00021042132,0.00017908306,0.0009156884,0.00011813896,0.000621965,0.00020302588],"genre_scores_gemma":[0.005597183,0.0000023898524,0.9933478,0.00029597984,0.00021426137,0.00022789584,0.00007783891,0.000020824222,0.0002157937],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99883914,0.000016182332,0.00020277718,0.0004906385,0.00015595034,0.0002953043],"domain_scores_gemma":[0.998926,0.00010867914,0.000088657405,0.00067021337,0.00014529022,0.000061175466],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014945211,0.00016237305,0.00015006454,0.00012515853,0.00023071685,0.00017209329,0.0006144683,0.000070631635,0.0000069447483],"category_scores_gemma":[0.000013063244,0.00013578661,0.00007621327,0.00017027587,0.00003465947,0.0008828287,0.0001232189,0.00007555989,0.0000015648166],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000025267203,0.00014155915,0.000035252233,0.000021517028,0.000006780669,0.0000010590404,0.000011258171,0.0030141925,0.04144709,0.018931579,0.011200432,0.925164],"study_design_scores_gemma":[0.00046113998,0.00034132515,0.000060681137,0.000026982809,0.000015347101,0.000011222135,0.000010896155,0.5748055,0.26012737,0.124435276,0.039394226,0.0003100115],"about_ca_topic_score_codex":0.000060313156,"about_ca_topic_score_gemma":0.000016925786,"teacher_disagreement_score":0.924854,"about_ca_system_score_codex":0.000038054182,"about_ca_system_score_gemma":0.000029183388,"threshold_uncertainty_score":0.5537217},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003911732,0.00008177328,0.99049014,0.00036806858,0.0003524918,0.0002847279,0.00000503085,0.0004731772,0.0040328563],"genre_scores_gemma":[0.9367292,0.0000075146872,0.06249697,0.00036722675,0.00020322198,0.000017210643,0.0000063424654,0.000022045362,0.00015029525],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99834466,0.00032735712,0.00028226286,0.00037532317,0.0002769673,0.00039342695],"domain_scores_gemma":[0.9986036,0.0004005514,0.00027860625,0.00041211303,0.0002172902,0.000087870336],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00083165785,0.00020201347,0.00016391024,0.00008292959,0.00063483766,0.00032435567,0.00086614006,0.00004305361,0.000021179929],"category_scores_gemma":[0.00019822366,0.00014648229,0.00005551226,0.00020643669,0.00008224116,0.0010988995,0.00025687608,0.0002445288,0.000023003306],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020425691,0.00020251457,0.00036422687,0.000081325124,0.000014334591,0.0000042355564,0.0017791534,0.00019662752,0.11139377,0.03430255,0.0072438912,0.8442131],"study_design_scores_gemma":[0.00040813413,0.00040779109,0.0009295785,0.0008764729,0.000022231465,0.000026660011,0.0001996203,0.8692465,0.11838259,0.0025985928,0.006320707,0.0005811408],"about_ca_topic_score_codex":0.00002175653,"about_ca_topic_score_gemma":0.0000023534226,"teacher_disagreement_score":0.93281746,"about_ca_system_score_codex":0.00004157385,"about_ca_system_score_gemma":0.000083282954,"threshold_uncertainty_score":0.5973374},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000046023517,0.00016913113,0.99353087,0.00036570584,0.000048428035,0.0002524693,0.000001467491,0.0010018365,0.0045840675],"genre_scores_gemma":[0.08227965,0.00000879755,0.91556096,0.0003749274,0.000032793483,0.00006832048,9.2056007e-7,0.000008151073,0.0016654896],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992282,0.000013732639,0.00013805443,0.00028235733,0.00013122332,0.00020643983],"domain_scores_gemma":[0.9992959,0.000059695605,0.00005298409,0.00046752614,0.000067515386,0.000056370936],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0000932892,0.00008681188,0.000097881304,0.00006844724,0.00011355228,0.0001097695,0.0008062284,0.000034183326,0.000043294447],"category_scores_gemma":[0.00004061298,0.00007055978,0.000028978357,0.00020021548,0.000016803424,0.0007840428,0.00017087751,0.00004847921,0.000042195734],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000012406863,0.00005330956,0.00000862101,0.000037551035,0.00000208466,0.0000053191957,0.0001004721,0.000013445195,0.005063503,0.06814154,0.043718766,0.88285416],"study_design_scores_gemma":[0.00025647678,0.00009521749,0.000013259181,0.00007177253,0.0000030153753,0.000060075876,0.000010072974,0.7113838,0.1518723,0.046290126,0.08962165,0.00032222352],"about_ca_topic_score_codex":0.0000019209892,"about_ca_topic_score_gemma":5.802629e-7,"teacher_disagreement_score":0.88253194,"about_ca_system_score_codex":0.000021441485,"about_ca_system_score_gemma":0.0000090624135,"threshold_uncertainty_score":0.28773442},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0009995404,0.0000949271,0.9882238,0.00085321785,0.000041467396,0.0002680863,0.000015744763,0.00061545585,0.008887787],"genre_scores_gemma":[0.5482084,0.000027140735,0.45085225,0.00077559234,0.000010281338,0.000017220736,0.0000034556845,0.000009478284,0.000096204174],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986203,0.00004449265,0.00023575807,0.0005248099,0.0003063412,0.00026831904],"domain_scores_gemma":[0.99898356,0.00011033119,0.000052628744,0.00064289325,0.00007579647,0.0001347856],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00011496363,0.00020497921,0.00020459101,0.00012261335,0.00015977955,0.00009912664,0.00058706437,0.00004405222,0.00011934973],"category_scores_gemma":[0.000019530085,0.0001626833,0.000045939665,0.00010552165,0.000054761666,0.0009961476,0.00018138507,0.00021232394,0.000031720338],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008031234,0.00034736635,0.000006001977,0.000029949302,0.000012010289,0.000066662185,0.00025418474,0.0013729199,0.015174155,0.039926343,0.013790646,0.92893946],"study_design_scores_gemma":[0.0004820892,0.00013616511,0.0000022102286,0.000093622184,0.000001449493,0.00000718947,0.000013196051,0.93058044,0.06325648,0.003732232,0.0014858331,0.00020909085],"about_ca_topic_score_codex":0.000016390179,"about_ca_topic_score_gemma":0.0000012317466,"teacher_disagreement_score":0.9292075,"about_ca_system_score_codex":0.00003054975,"about_ca_system_score_gemma":0.000009211001,"threshold_uncertainty_score":0.6634032},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0063190395,0.000060228555,0.9805422,0.00016112813,0.0001238722,0.00012180992,0.0000026314244,0.00047287802,0.0121962335],"genre_scores_gemma":[0.49025562,0.000061564264,0.5075252,0.00015465239,0.000013556076,0.0000087250855,0.000001571123,0.000005083634,0.0019740264],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99904543,0.00006484198,0.00024366162,0.0002903122,0.0001851714,0.00017058948],"domain_scores_gemma":[0.99889964,0.00006418295,0.0001137594,0.0007669985,0.000100614554,0.000054796354],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001889374,0.0001006492,0.00014253134,0.000091914924,0.000040284925,0.00003914765,0.0007863649,0.000045617362,0.0003146202],"category_scores_gemma":[0.000057801622,0.00008560193,0.000036999103,0.00028626889,0.00003746306,0.0009253203,0.00030458963,0.00008070639,0.00012031377],"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.0000047658664,0.00007826666,0.000011431043,0.000009368298,0.0000037372356,0.0000044455173,0.000107086336,0.000017530914,0.7901572,0.019673195,0.01514339,0.17478961],"study_design_scores_gemma":[0.00014655436,0.000079575504,0.00008922149,0.00002522258,0.0000013564869,0.0000068941717,0.000005657761,0.04264924,0.94029266,0.011792756,0.0047823945,0.00012844896],"about_ca_topic_score_codex":0.000010843515,"about_ca_topic_score_gemma":0.000005524938,"teacher_disagreement_score":0.48393658,"about_ca_system_score_codex":0.000021233398,"about_ca_system_score_gemma":0.000006380188,"threshold_uncertainty_score":0.34907454},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.074255385,0.00043711514,0.92234194,0.000117937474,0.0001903434,0.00016189863,0.000005345015,0.0005117881,0.001978265],"genre_scores_gemma":[0.6514371,0.00010569141,0.34769702,0.00013055527,0.000033722183,0.000012486554,0.0000016600783,0.000010364757,0.0005714275],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99854416,0.000056876463,0.0003193712,0.00041065816,0.0003678423,0.00030107802],"domain_scores_gemma":[0.9987043,0.0001834217,0.00017698898,0.00076275045,0.00007223924,0.00010028469],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015770148,0.00016338013,0.00025173326,0.00041768645,0.00009001017,0.000073542644,0.0013269718,0.000062587365,0.00040817837],"category_scores_gemma":[0.00006434588,0.00013814596,0.00007334012,0.000875878,0.000057935536,0.0008840551,0.00086196145,0.00011768576,0.00003310888],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000056810743,0.0016884062,0.002265907,0.00020704581,0.00014361746,0.0002009712,0.0023908424,0.011069327,0.16517906,0.44539374,0.082019396,0.28938487],"study_design_scores_gemma":[0.00035621334,0.00013778346,0.00015873043,0.000046834182,0.000004768694,0.000013881116,0.000028169443,0.6511625,0.34360185,0.0011025466,0.0031295686,0.000257142],"about_ca_topic_score_codex":0.000013841335,"about_ca_topic_score_gemma":2.2385458e-7,"teacher_disagreement_score":0.6400932,"about_ca_system_score_codex":0.000029277982,"about_ca_system_score_gemma":0.000007889359,"threshold_uncertainty_score":0.56334287},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0065629096,0.000012646095,0.98267883,0.00029628372,0.000037070506,0.000079825404,0.00001104565,0.0003887148,0.009932645],"genre_scores_gemma":[0.45088032,0.000005985092,0.5487739,0.00023869872,0.000004440442,0.000004242363,0.0000016118,0.000002891966,0.00008791079],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9992712,0.00001606626,0.00015949814,0.00023739172,0.00019430924,0.000121510966],"domain_scores_gemma":[0.99897563,0.000051091505,0.00006229268,0.000821308,0.00004077214,0.000048882997],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00008528284,0.00007643766,0.00010704157,0.00005164405,0.000036694666,0.000023534136,0.0007828756,0.000030319794,0.000043981217],"category_scores_gemma":[0.000030507195,0.00006016883,0.000030149095,0.00015682877,0.000048023074,0.00032886528,0.0002600995,0.00006753517,0.000027910835],"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.000006236143,0.00016391592,0.000023301327,0.000004810221,0.0000029543814,0.000004717204,0.00004430549,0.0021762073,0.0026250123,0.9650427,0.0014336304,0.028472215],"study_design_scores_gemma":[0.00033020432,0.00022771508,0.0004883257,0.000047940295,0.000001120875,0.0000044184358,0.0000042386905,0.0020962101,0.73133665,0.26173377,0.0035779397,0.00015143878],"about_ca_topic_score_codex":0.000046773945,"about_ca_topic_score_gemma":0.000004469922,"teacher_disagreement_score":0.72871166,"about_ca_system_score_codex":0.00002883045,"about_ca_system_score_gemma":0.000044631877,"threshold_uncertainty_score":0.24536136},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[1.11293225e-7,0.00014979785,0.63582826,0.00007514421,0.00010161047,0.00014144061,0.0000010644193,0.00055749685,0.36314508],"genre_scores_gemma":[0.00010572596,0.00042942903,0.6806,0.0000952354,0.00002789494,0.000011790478,0.000014164165,0.000033807642,0.31868196],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99836963,0.00012425719,0.00039571692,0.0006390949,0.00026093773,0.00021038351],"domain_scores_gemma":[0.99845266,0.00027635557,0.00023410055,0.00090521394,0.000068332054,0.000063329484],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00037231206,0.00028538177,0.00034522865,0.0003819922,0.00004937544,0.000079418925,0.0011031937,0.0002791364,0.0010313218],"category_scores_gemma":[0.00012029622,0.00026106817,0.00007396387,0.00010300068,0.000064688305,0.00036200092,0.00061433396,0.0005911985,0.00019119232],"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":[9.670492e-7,0.000006888885,0.0000024725596,0.000011682986,0.0000029480364,0.000010486229,0.000036942434,0.000033826782,0.000090773414,0.8941025,0.00094395626,0.10475651],"study_design_scores_gemma":[0.00013462448,0.00012841242,0.000014230381,0.00026830845,0.0000060036195,0.000013368051,0.0000013834632,0.060609497,0.002918107,0.5292555,0.4060583,0.00059226766],"about_ca_topic_score_codex":0.000004163747,"about_ca_topic_score_gemma":0.0000015711333,"teacher_disagreement_score":0.40511435,"about_ca_system_score_codex":0.000078835685,"about_ca_system_score_gemma":0.000023123916,"threshold_uncertainty_score":0.99998415},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00019165837,0.0004275062,0.99471384,0.0010137586,0.0010374044,0.0008131762,0.00002071215,0.00047545423,0.0013064919],"genre_scores_gemma":[0.06813658,0.00007896431,0.9294956,0.0015942202,0.00025597666,0.000040361752,0.000013297763,0.00005974867,0.0003252732],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99462545,0.00004753744,0.000662039,0.0024431893,0.0013356543,0.00088612764],"domain_scores_gemma":[0.9957729,0.0004855228,0.0005473078,0.002464664,0.0003527718,0.0003768255],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00073730166,0.0008007781,0.000781324,0.0007521698,0.0004920979,0.000618928,0.003754381,0.0004427592,0.00003401087],"category_scores_gemma":[0.00012844431,0.0006440553,0.00007399308,0.00049761817,0.0016798587,0.0011463901,0.0030074918,0.0017135793,0.000015424985],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000049606333,0.00007545266,0.00007082031,0.00012212458,0.000027950191,0.0004044336,0.0019108006,0.003266639,0.0070346002,0.06311563,0.00020829639,0.9237136],"study_design_scores_gemma":[0.0024118943,0.0021884835,0.00049851777,0.0062142727,0.00006447449,0.0014242266,0.0000043102746,0.35670763,0.10186001,0.45450404,0.06844693,0.00567523],"about_ca_topic_score_codex":0.000027773029,"about_ca_topic_score_gemma":0.00012546412,"teacher_disagreement_score":0.9180384,"about_ca_system_score_codex":0.00024460373,"about_ca_system_score_gemma":0.00060158974,"threshold_uncertainty_score":0.99960107},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0073157325,0.000035897538,0.9877547,0.0002966478,0.000091526235,0.0000763554,0.0000027849571,0.0002910368,0.0041352976],"genre_scores_gemma":[0.35404557,0.000016455915,0.6455999,0.0001268163,0.000051009396,0.0000018727304,0.0000014860072,0.000004130303,0.00015278201],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9991835,0.000013059884,0.00021668022,0.0002014962,0.00024090875,0.00014439954],"domain_scores_gemma":[0.9993177,0.000044412205,0.000084962616,0.00044297014,0.000057685735,0.000052292235],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014040267,0.00007887955,0.000113485956,0.00010584917,0.0000613722,0.000020417187,0.000543337,0.000036658887,0.00007086077],"category_scores_gemma":[0.00002020331,0.00005928216,0.000030730025,0.00020821717,0.000034683195,0.0010851217,0.00031710783,0.00007514533,0.0000077720715],"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.000015959708,0.00021668636,0.00091368164,0.00004031014,0.000023939303,0.000021619408,0.00041387408,0.0006958385,0.52522546,0.07300576,0.008488495,0.39093837],"study_design_scores_gemma":[0.00013081261,0.000027597702,0.00032588738,0.00004331477,0.0000018755047,0.0000564068,0.000012051491,0.13533369,0.8512847,0.005001102,0.0076656197,0.00011697595],"about_ca_topic_score_codex":0.000015658343,"about_ca_topic_score_gemma":0.0000025532977,"teacher_disagreement_score":0.3908214,"about_ca_system_score_codex":0.000041047246,"about_ca_system_score_gemma":0.00003250342,"threshold_uncertainty_score":0.24174562},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014826682,0.000066066306,0.97963095,0.00052358664,0.000053933672,0.00012465895,0.0000014187614,0.00053836405,0.0042343377],"genre_scores_gemma":[0.5187443,0.000012034454,0.48040932,0.00028544723,0.000029737881,0.000011363003,0.0000016791474,0.0000054040916,0.00050071295],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99881685,0.00004266859,0.00025766494,0.00040744437,0.00019426348,0.00028109434],"domain_scores_gemma":[0.9991595,0.000115302006,0.000059712696,0.00055875495,0.000027496131,0.000079242614],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000217697,0.00011611517,0.00012511243,0.0001467015,0.0000865569,0.000052225365,0.0008030525,0.000048580427,0.00016263135],"category_scores_gemma":[0.00003245672,0.00010275252,0.000029048118,0.00025829158,0.000022819992,0.0010724249,0.0008803524,0.00014035906,0.00010122175],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019820058,0.00016787855,0.0012019523,0.0000119007545,0.0000054995458,0.0000858461,0.0008927787,0.007230562,0.17197047,0.031306885,0.021172056,0.76593435],"study_design_scores_gemma":[0.0003473404,0.000028735534,0.00042040093,0.000073525734,8.2403966e-7,0.000040388124,0.000011071212,0.5408676,0.42955303,0.001117434,0.027258785,0.0002808632],"about_ca_topic_score_codex":0.00004237198,"about_ca_topic_score_gemma":0.00006339168,"teacher_disagreement_score":0.7656535,"about_ca_system_score_codex":0.00016270671,"about_ca_system_score_gemma":0.000018684907,"threshold_uncertainty_score":0.4190126},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014249794,0.000023666387,0.9499881,0.0016386021,0.000039485516,0.00015699217,0.000015290574,0.0013474394,0.03254058],"genre_scores_gemma":[0.2635382,3.8488088e-7,0.73177797,0.001021101,0.00004926079,0.000010423987,0.000014045941,0.000011147439,0.0035774952],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998962,0.00001155361,0.00014282911,0.00036315588,0.0002905018,0.00023000245],"domain_scores_gemma":[0.9990873,0.000073978634,0.00004949963,0.0006339957,0.00004577663,0.00010948442],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000048284754,0.00013083978,0.0001113818,0.00006636323,0.00006601071,0.00014470353,0.0007214179,0.00002381195,0.0001934906],"category_scores_gemma":[0.000010156035,0.00009284213,0.000028202807,0.00016449187,0.00005068393,0.002015917,0.00048059627,0.000080491154,0.0006477878],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009638456,0.0006399298,0.00028982182,0.000008755797,0.00005672391,0.000119473,0.00023039762,0.013600241,0.028241668,0.041737735,0.24433097,0.6706479],"study_design_scores_gemma":[0.0018427507,0.0004952673,0.00032263686,0.000105273124,0.000006856525,0.00030654419,0.000012094378,0.7208816,0.15970068,0.011695439,0.10338668,0.0012442053],"about_ca_topic_score_codex":0.0000025341094,"about_ca_topic_score_gemma":0.0000010563293,"teacher_disagreement_score":0.70728135,"about_ca_system_score_codex":0.000026007203,"about_ca_system_score_gemma":0.000030996736,"threshold_uncertainty_score":0.8326218},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000095826515,0.00013196237,0.9863586,0.0013685079,0.00014413467,0.00036314173,0.000015735373,0.00089964416,0.010622436],"genre_scores_gemma":[0.027935527,0.000011624646,0.9671382,0.002025023,0.00006901898,0.000119261225,0.0000058341197,0.000014077021,0.0026814465],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99887127,0.000057951,0.0001816524,0.00039829547,0.00023119994,0.0002596382],"domain_scores_gemma":[0.9986899,0.0003826685,0.0001176863,0.0006425823,0.00008437361,0.00008279994],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012448663,0.0001394222,0.00016929375,0.000083949555,0.00016061423,0.00006813347,0.0010205621,0.00005627428,0.00011862015],"category_scores_gemma":[0.00013218106,0.000106369764,0.00007324463,0.00017838077,0.00002944566,0.00049279025,0.00045132142,0.00014396437,0.000038064394],"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.000008334169,0.00014351335,0.000034496406,0.000018437639,0.000018404586,0.0000061506657,0.0006869497,0.00012329097,0.008997148,0.037064373,0.42395648,0.5289424],"study_design_scores_gemma":[0.0010642217,0.00024817092,0.00019931789,0.00010406379,0.0000075526323,0.000017015811,0.000039874478,0.24848348,0.2203957,0.13965291,0.38911933,0.0006683596],"about_ca_topic_score_codex":0.0000042604497,"about_ca_topic_score_gemma":0.0000024442006,"teacher_disagreement_score":0.52827406,"about_ca_system_score_codex":0.000038090606,"about_ca_system_score_gemma":0.0000067202923,"threshold_uncertainty_score":0.4337633},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0011602717,0.00039045862,0.9915717,0.00054314395,0.000038265665,0.000086811386,0.000007770361,0.00031979784,0.005881754],"genre_scores_gemma":[0.7064414,0.00016416654,0.2921951,0.0004494707,0.000012513033,0.0000026244368,0.0000039409706,0.000004112889,0.0007266492],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992849,0.000018765852,0.000107264525,0.0003602371,0.00010152381,0.00012728533],"domain_scores_gemma":[0.9984737,0.00022692437,0.000022885697,0.00121781,0.000012643507,0.00004602141],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00007697267,0.00006456475,0.00007466653,0.000052730247,0.00003019866,0.000061618535,0.0012293451,0.000025078143,0.000040113107],"category_scores_gemma":[0.00011274509,0.000053288935,0.0000036079969,0.00015445535,0.000024283996,0.00080648763,0.00095025235,0.000074942,0.00003783076],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000040480904,0.00012701287,0.0007599515,0.000011446404,0.0000036386516,0.00021353312,0.00019991174,0.00009749831,0.002912892,0.0051490115,0.036919687,0.95360136],"study_design_scores_gemma":[0.00018262507,0.00002401645,0.00015962386,0.000017553934,7.334162e-7,0.000037253998,0.0000049760342,0.90689915,0.0062271343,0.0029557429,0.083329186,0.00016198141],"about_ca_topic_score_codex":0.000016231283,"about_ca_topic_score_gemma":0.000024556137,"teacher_disagreement_score":0.9534394,"about_ca_system_score_codex":0.0000065826316,"about_ca_system_score_gemma":0.0000027692759,"threshold_uncertainty_score":0.22844496},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00015172057,0.000016559357,0.99649465,0.0009711772,0.00006637496,0.00024710255,0.000011318979,0.00071777165,0.0013233499],"genre_scores_gemma":[0.14475764,0.000012133479,0.8544619,0.00037139934,0.000050371327,0.00004584921,0.000009073158,0.000006288233,0.00028533267],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99926376,0.00001803482,0.00014411083,0.00028773362,0.0001189653,0.00016736476],"domain_scores_gemma":[0.99927044,0.000114860435,0.00006707655,0.0003869181,0.00011632809,0.000044378343],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012125884,0.000083135994,0.000084136605,0.00005776693,0.000094816794,0.00008470799,0.0005870391,0.000029007166,0.000024345385],"category_scores_gemma":[0.00009612437,0.000072580966,0.000028395469,0.0001630784,0.000025099203,0.0016718069,0.00018698927,0.000046944206,0.000035838082],"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.0000051421753,0.000028281956,0.000011684209,0.000009047697,0.0000030131555,0.0000014312334,0.00012972859,0.000057935962,0.17399739,0.7222675,0.0099775,0.093511306],"study_design_scores_gemma":[0.0001671877,0.00005244615,0.0000594446,0.00002579446,0.0000015407594,0.000005989002,0.0000099441395,0.3482088,0.6115014,0.009420254,0.030369014,0.0001781715],"about_ca_topic_score_codex":0.0000037299985,"about_ca_topic_score_gemma":0.0000032668797,"teacher_disagreement_score":0.7128473,"about_ca_system_score_codex":0.00004922979,"about_ca_system_score_gemma":0.000024289257,"threshold_uncertainty_score":0.2959766},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0015950543,0.0014925082,0.9792095,0.0021620593,0.00018880535,0.0001919661,0.0000018739665,0.0010887979,0.014069429],"genre_scores_gemma":[0.4958935,0.0002814354,0.5029542,0.00045623956,0.000019041287,0.00008558122,0.0000025782713,0.00000802433,0.00029942897],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99886805,0.000033851094,0.00022640922,0.0003742546,0.00022852144,0.00026892967],"domain_scores_gemma":[0.9989297,0.000040718543,0.00006926678,0.00078646454,0.00007837282,0.000095488685],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002039658,0.00011687468,0.00016266265,0.00023418547,0.000025184361,0.000030212617,0.0012290172,0.00007178928,0.000011729155],"category_scores_gemma":[0.000083295934,0.000095190444,0.000015539608,0.00063816254,0.000090541216,0.0011839602,0.0007610404,0.0001425877,0.000065321416],"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.0000072522416,0.00007574885,0.0043430123,0.000005282735,0.0000017114904,0.00005936197,0.00012213696,0.00004968478,0.00037203796,0.7394812,0.0035403322,0.25194225],"study_design_scores_gemma":[0.00065878563,0.00019508613,0.000117082884,0.000051171122,7.388592e-7,0.000037981645,0.00015341117,0.0046132207,0.06285514,0.583376,0.347622,0.00031938768],"about_ca_topic_score_codex":0.000009928178,"about_ca_topic_score_gemma":0.000020678608,"teacher_disagreement_score":0.49429846,"about_ca_system_score_codex":0.000082338454,"about_ca_system_score_gemma":0.00006328833,"threshold_uncertainty_score":0.38817537},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008236795,0.00004400594,0.9675464,0.00034453886,0.00007336554,0.0000780084,0.0000017020255,0.00033817644,0.023337023],"genre_scores_gemma":[0.4287483,0.000035091158,0.56948334,0.00007518861,0.000017309672,0.0000029933194,0.0000013621429,0.0000037606471,0.0016326731],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99929935,0.000019682964,0.00016345896,0.00019869911,0.00018894736,0.00012986532],"domain_scores_gemma":[0.9993366,0.00006188077,0.00007495713,0.00044961227,0.00003903272,0.000037944366],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000072808274,0.000065455686,0.00008960862,0.00007174099,0.000043719498,0.000020101552,0.00051195035,0.000025903946,0.00038519962],"category_scores_gemma":[0.000022905622,0.000057153047,0.000028053488,0.0001986478,0.000025272031,0.00055667874,0.00028960194,0.000047563648,0.000076413184],"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.0000051464963,0.00009199053,0.00052894617,0.00002585338,0.000008664182,0.00002401275,0.0005344064,0.000033546705,0.17609757,0.44938743,0.061251394,0.31201103],"study_design_scores_gemma":[0.00019834004,0.000073883515,0.0009161612,0.00003318108,0.0000015445735,0.000039245908,0.000010231435,0.08737163,0.87562567,0.026886199,0.008661827,0.0001820737],"about_ca_topic_score_codex":0.0000062386835,"about_ca_topic_score_gemma":0.0000029582266,"teacher_disagreement_score":0.6995281,"about_ca_system_score_codex":0.000034451507,"about_ca_system_score_gemma":0.0000026926318,"threshold_uncertainty_score":0.42176655},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00036833296,0.000319704,0.9955299,0.0026161792,0.000086205044,0.00061187136,0.000020123698,0.00026121552,0.00018647675],"genre_scores_gemma":[0.8252962,0.00013219204,0.17263539,0.0017149933,0.000019875119,0.000084249434,0.000015725318,0.000007780766,0.000093578456],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989344,0.0001884284,0.000240152,0.00037993077,0.00007232625,0.00018474557],"domain_scores_gemma":[0.99741167,0.0014673043,0.00009111208,0.00092524133,0.000060050606,0.000044608798],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00081271376,0.0001132676,0.00017790451,0.000059436014,0.00010279522,0.00016072628,0.0007689434,0.00007407054,0.000010665475],"category_scores_gemma":[0.00044916876,0.000069822665,0.000016655202,0.00020362524,0.00008815796,0.000890499,0.00041467592,0.0002397271,0.0000021160965],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00025446742,0.00015895632,0.00020272398,0.000026168113,0.00004467308,0.00042377095,0.0009437041,0.0075769075,0.00038500168,0.57871866,0.07219833,0.33906665],"study_design_scores_gemma":[0.0016646225,0.000027270695,0.000014596599,0.000037403966,0.000004827159,0.00016960586,0.000039511,0.9917608,0.00005933947,0.003121915,0.0030012976,0.000098835735],"about_ca_topic_score_codex":0.00008756384,"about_ca_topic_score_gemma":0.00014000118,"teacher_disagreement_score":0.98418385,"about_ca_system_score_codex":0.000017986618,"about_ca_system_score_gemma":0.000007184197,"threshold_uncertainty_score":0.28472856},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00028405417,0.00006982203,0.98290867,0.00008659871,0.00019380746,0.00012370701,0.0000033594222,0.0012315222,0.015098451],"genre_scores_gemma":[0.13491073,0.000026782824,0.8636813,0.00032154648,0.000026190928,0.0000051904653,0.0000011077387,0.000012425645,0.0010147017],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987167,0.000049664053,0.0002311347,0.00043356215,0.00024873353,0.0003201763],"domain_scores_gemma":[0.9987824,0.00010956218,0.00009614657,0.00086171384,0.0000499934,0.00010018579],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001596955,0.00014747625,0.00016217372,0.00011588793,0.00017614766,0.00014994852,0.001004367,0.000056026918,0.00027942852],"category_scores_gemma":[0.00006722771,0.0001322313,0.000036854555,0.00040744172,0.00003784086,0.0011692152,0.00057992147,0.00013714432,0.00007657136],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004438731,0.00017297003,0.0005057871,0.00003721163,0.00002424458,0.00009516087,0.00034178808,0.0013944644,0.14732705,0.7332262,0.030772293,0.08609842],"study_design_scores_gemma":[0.0002298089,0.000021992562,0.000040348124,0.000047948743,0.0000029053583,0.000029625437,0.000013060929,0.9459334,0.028671417,0.0023416234,0.02239077,0.0002770764],"about_ca_topic_score_codex":0.000052041218,"about_ca_topic_score_gemma":0.0000022599056,"teacher_disagreement_score":0.94453895,"about_ca_system_score_codex":0.000059514394,"about_ca_system_score_gemma":0.000011584238,"threshold_uncertainty_score":0.5392236},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00018340432,0.0003673687,0.99364096,0.00012504368,0.0010597632,0.00050886086,0.000017561339,0.002245404,0.0018516285],"genre_scores_gemma":[0.053748127,0.00000599907,0.94526774,0.0005386734,0.0002546598,0.000008219207,0.000011441049,0.000057629994,0.00010752965],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9945771,0.00005262349,0.00087032246,0.0021206106,0.0014318458,0.00094746443],"domain_scores_gemma":[0.996085,0.00043805776,0.0006246763,0.002306695,0.00035397106,0.00019162009],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000800956,0.0007398815,0.0006856017,0.0011003267,0.00047114026,0.00059358455,0.004672584,0.0003987997,0.000010548944],"category_scores_gemma":[0.000101054735,0.0006938527,0.00014357548,0.0009521638,0.00073490775,0.0004677801,0.0035590034,0.0009814647,0.000025706311],"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.0000021765036,0.00003119663,0.000010402203,0.00002909581,0.000004198362,0.000091456706,0.000099694735,0.8682724,0.001514336,0.0085039735,0.00012294314,0.12131809],"study_design_scores_gemma":[0.00016174896,0.000055768625,0.000018842711,0.00070699176,0.0000055270875,0.00008107808,4.546551e-8,0.9571241,0.005280916,0.035218596,0.0006036424,0.0007427508],"about_ca_topic_score_codex":0.00005252642,"about_ca_topic_score_gemma":0.000011660639,"teacher_disagreement_score":0.12057534,"about_ca_system_score_codex":0.00062813825,"about_ca_system_score_gemma":0.00056304893,"threshold_uncertainty_score":0.99955124},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00207442,0.00007929602,0.99613124,0.00034806822,0.00008916022,0.00027163088,0.000010959719,0.0003559743,0.00063927],"genre_scores_gemma":[0.41361856,0.00006908055,0.58553797,0.00017665981,0.000013176394,0.000024644305,0.0000065075883,0.000008618979,0.00054481474],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9992046,0.000034708628,0.00021374601,0.00025683903,0.00013364684,0.00015646513],"domain_scores_gemma":[0.9990882,0.00015145954,0.000107305335,0.00048559727,0.00012807219,0.000039358274],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001636656,0.00009184764,0.00012883169,0.00008318132,0.00004870821,0.00004032356,0.00062653795,0.000037991882,0.00010377817],"category_scores_gemma":[0.00010053064,0.000079520185,0.000041636158,0.00022410191,0.000032931854,0.0005856986,0.00015336575,0.000042780517,0.000022255788],"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.000033053864,0.0004845625,0.00028981,0.00026269522,0.000035703513,0.000007695684,0.00035805645,0.0002659762,0.34346884,0.3269702,0.074021965,0.25380147],"study_design_scores_gemma":[0.00028155794,0.00009430845,0.0001957415,0.000033292785,0.000003182971,0.000002160897,0.0000065109743,0.2848482,0.7038236,0.0070868847,0.0034775853,0.00014692456],"about_ca_topic_score_codex":0.0000073584984,"about_ca_topic_score_gemma":0.0000037920172,"teacher_disagreement_score":0.41154414,"about_ca_system_score_codex":0.000015480096,"about_ca_system_score_gemma":0.0000095485375,"threshold_uncertainty_score":0.3242739},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00020477622,0.0000658776,0.98933655,0.00096049334,0.00003733624,0.00017276451,0.000001979736,0.0006064101,0.008613785],"genre_scores_gemma":[0.18779708,0.00008654152,0.81071335,0.00033589732,0.0000103145685,0.000040100836,0.000002961023,0.000004777952,0.0010089681],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99948406,0.000020698568,0.000117498465,0.00016690248,0.00009173707,0.00011912934],"domain_scores_gemma":[0.9988234,0.00014535457,0.00004846178,0.00089611276,0.000054585154,0.00003209521],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000111142566,0.00005749941,0.000070386544,0.00004217837,0.00011649782,0.00006612588,0.0011002767,0.000027108008,0.000049536135],"category_scores_gemma":[0.000025175983,0.00005093557,0.000023240127,0.00012078046,0.000018457325,0.00060130295,0.0003451327,0.000052820702,0.00003012312],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[8.0400525e-7,0.000035885692,0.000015803946,0.000005975079,0.000002019261,5.576407e-7,0.00008061259,0.000002500353,0.0043227007,0.4666446,0.044839077,0.4840495],"study_design_scores_gemma":[0.00026972478,0.00004358229,0.000040457595,0.000040069917,0.0000016381518,0.000011205752,0.000014412919,0.6604582,0.17856851,0.046177574,0.11415364,0.00022097537],"about_ca_topic_score_codex":0.000004228639,"about_ca_topic_score_gemma":0.0000019330287,"teacher_disagreement_score":0.6604557,"about_ca_system_score_codex":0.000017409504,"about_ca_system_score_gemma":0.0000024404067,"threshold_uncertainty_score":0.20770924},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0021921685,0.000021680205,0.99541664,0.0002624635,0.0000983834,0.00022171924,0.0000035938556,0.00015018915,0.001633172],"genre_scores_gemma":[0.4613065,0.000015214395,0.5381362,0.00011501358,0.000012291591,0.000013825717,6.216448e-7,0.0000042690676,0.00039605374],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993596,0.000032972628,0.00017659023,0.00018329069,0.00012913666,0.00011841314],"domain_scores_gemma":[0.99911,0.00018400977,0.000102739185,0.0004941126,0.00008854366,0.00002062117],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020832474,0.000064470754,0.0000809902,0.000040093626,0.00008307807,0.0000316656,0.00071003713,0.000027024964,0.00001341471],"category_scores_gemma":[0.000050445215,0.000043587177,0.000043642704,0.00018585993,0.00002104001,0.0004912746,0.0001904601,0.00004963808,0.0000048454576],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008254157,0.00013279295,0.000041753134,0.00010224791,0.000013025707,0.00000134034,0.00085499696,0.072814755,0.06460958,0.73199606,0.011110092,0.11831512],"study_design_scores_gemma":[0.000069801135,0.0000101653995,0.000005332572,0.000032874887,9.620577e-7,7.819023e-7,0.000005752894,0.8136956,0.13340703,0.052262392,0.00045852672,0.00005077355],"about_ca_topic_score_codex":0.000005466036,"about_ca_topic_score_gemma":5.627087e-7,"teacher_disagreement_score":0.74088085,"about_ca_system_score_codex":0.0000138153255,"about_ca_system_score_gemma":0.000005293193,"threshold_uncertainty_score":0.17774336},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00057959586,0.000081488935,0.9972802,0.0006338776,0.0000963615,0.00020974489,0.000021735492,0.00039101214,0.0007060302],"genre_scores_gemma":[0.5056957,0.000003881045,0.4938928,0.00017192299,0.000040438,0.0000138740825,0.000015953934,0.0000068806316,0.00015852448],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99869674,0.000030079169,0.00030202683,0.00033726817,0.00041903162,0.00021486217],"domain_scores_gemma":[0.99857825,0.0004223053,0.00015859462,0.0006282981,0.00014574545,0.00006682781],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013212362,0.00012235985,0.00021490359,0.00023003524,0.000061868464,0.0000327086,0.0011264845,0.00009356603,0.000033374876],"category_scores_gemma":[0.00028534458,0.00009657903,0.00006645447,0.0006165063,0.00007400416,0.00030028663,0.00017631945,0.000093385,8.0156804e-7],"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.00005525671,0.00022879962,0.004447428,0.00019686458,0.000017018907,0.000033113887,0.000018087847,0.00044858822,0.0478103,0.22681905,0.25872636,0.46119913],"study_design_scores_gemma":[0.0012047451,0.00015137893,0.0033301013,0.0001101467,0.0000061753913,0.000012914057,0.000004099864,0.2629975,0.67711395,0.047781467,0.0069659124,0.00032158958],"about_ca_topic_score_codex":0.000041089053,"about_ca_topic_score_gemma":0.000013905189,"teacher_disagreement_score":0.6293037,"about_ca_system_score_codex":0.00002669218,"about_ca_system_score_gemma":0.000087194785,"threshold_uncertainty_score":0.39383784},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015797582,0.00007589694,0.98184234,0.00064376125,0.000015865955,0.00009343252,0.0000020195255,0.00010523824,0.0014238366],"genre_scores_gemma":[0.6217551,0.00006118706,0.37801784,0.00004395207,0.0000047795957,0.000003673468,0.0000010436938,0.0000034666814,0.00010890167],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9992098,0.00003650226,0.00033828142,0.0002038049,0.00009201195,0.00011957634],"domain_scores_gemma":[0.99920636,0.00006218557,0.00009916303,0.00054357917,0.000044205874,0.000044502052],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00011394236,0.00007795123,0.0001698115,0.00016909669,0.000016075466,0.000008269353,0.0008221324,0.000047343132,0.000043865057],"category_scores_gemma":[0.000009298796,0.00006333708,0.000037177757,0.00032518813,0.000063380416,0.000499107,0.00017649245,0.00009421614,0.0000024306728],"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.000015833863,0.0003119726,0.00016737201,0.00003509811,0.00000323616,0.000003499321,0.00046276287,0.0008752616,0.05787664,0.2144981,0.002766356,0.7229839],"study_design_scores_gemma":[0.00038148215,0.000093075556,0.0006098176,0.00037753358,0.000001646428,0.0000070834903,0.00002921227,0.09469932,0.8796049,0.008435991,0.015591084,0.00016884714],"about_ca_topic_score_codex":0.000049107908,"about_ca_topic_score_gemma":0.00006744009,"teacher_disagreement_score":0.8217283,"about_ca_system_score_codex":0.00001802542,"about_ca_system_score_gemma":0.000033346972,"threshold_uncertainty_score":0.25828114},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.33831736,0.00009365072,0.6584572,0.000034459492,0.000092716466,0.00011256855,0.000022737442,0.000194165,0.0026751296],"genre_scores_gemma":[0.8621496,0.00003188267,0.13761035,0.000025390502,0.000009820653,4.5151316e-7,0.000012504901,0.0000063614,0.00015367639],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998786,0.00009658713,0.00020610893,0.00034825082,0.00034568823,0.0002173643],"domain_scores_gemma":[0.9984239,0.00007362755,0.0004214867,0.0007963745,0.00017575716,0.00010887364],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019731848,0.0001394857,0.00027850148,0.00025690623,0.00021701584,0.000017036067,0.0014805491,0.00009927592,0.00021833405],"category_scores_gemma":[0.000027533166,0.00015584166,0.00009276459,0.00040264142,0.00031484183,0.0014505526,0.0008228451,0.0001345511,0.00003507438],"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.00005318208,0.00023416645,0.003899835,0.000063530686,0.000044026285,0.000017434486,0.0035807244,0.000023167075,0.0009835912,0.9887312,0.0017465826,0.0006225295],"study_design_scores_gemma":[0.00034058967,0.00013447023,0.0048971083,0.000067953704,0.00001547844,0.000004246281,0.00044162577,0.00065217784,0.0010610631,0.9916495,0.0005698531,0.00016595295],"about_ca_topic_score_codex":0.00023739642,"about_ca_topic_score_gemma":0.000048412523,"teacher_disagreement_score":0.5238322,"about_ca_system_score_codex":0.00003059138,"about_ca_system_score_gemma":0.000045231835,"threshold_uncertainty_score":0.6355038},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003049856,0.000040161525,0.99484473,0.00044829046,0.00007379414,0.00019899385,0.0000049170153,0.00024473591,0.0010945265],"genre_scores_gemma":[0.6066486,0.00003758613,0.39200053,0.00019217031,0.00002131819,0.000030150315,0.0000041060166,0.000005865662,0.0010596804],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99929917,0.000025659867,0.00018997196,0.00023577875,0.00011281444,0.00013662102],"domain_scores_gemma":[0.9992233,0.0001164003,0.00008547674,0.00043557523,0.00010009861,0.000039129525],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001551651,0.000077640856,0.000113171685,0.00005463538,0.000063841195,0.00003034331,0.0005325331,0.00003504793,0.00011462824],"category_scores_gemma":[0.000068403206,0.00006639302,0.000035839897,0.0001516593,0.00003371081,0.00059127074,0.00013970325,0.00004118086,0.00001530763],"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.000016422757,0.00021938738,0.00013614136,0.000114631584,0.00001821371,0.0000022411284,0.0017409871,0.00028077135,0.46823776,0.1984872,0.13388462,0.19686161],"study_design_scores_gemma":[0.0004334654,0.00016206293,0.00019226604,0.000077165336,0.0000035445348,0.0000047476506,0.000056719775,0.4041713,0.5771907,0.006129014,0.011343827,0.00023518801],"about_ca_topic_score_codex":0.000003469265,"about_ca_topic_score_gemma":0.000001266611,"teacher_disagreement_score":0.6035988,"about_ca_system_score_codex":0.00001731775,"about_ca_system_score_gemma":0.000007680582,"threshold_uncertainty_score":0.27074286},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013070667,0.00036777655,0.9733072,0.00017305577,0.00013665245,0.00039812544,0.0000140019565,0.0013893194,0.011143181],"genre_scores_gemma":[0.10916262,0.00016320868,0.8874075,0.00072621065,0.000029086128,0.000026629577,0.0000051082534,0.000029415382,0.0024502366],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99788207,0.00012106588,0.00036630195,0.0007973787,0.00037484118,0.00045836813],"domain_scores_gemma":[0.99818915,0.00013737647,0.00016091207,0.0012090995,0.00010754511,0.00019591625],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00039689906,0.0003042411,0.00032823253,0.00018888144,0.00028684209,0.00019274588,0.00081839075,0.00009272191,0.00011590806],"category_scores_gemma":[0.00012936688,0.0002620631,0.000057579902,0.0003096497,0.00013793395,0.0011649841,0.0011088977,0.00020965059,0.000019218149],"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.00004819159,0.00028610302,0.0028028246,0.0001023137,0.000055795022,0.00035722638,0.00023826964,0.000012129035,0.55493015,0.07563985,0.13716237,0.2283648],"study_design_scores_gemma":[0.00018005895,0.00006298723,0.000015737633,0.00006227551,0.000005667839,0.0004929316,0.00000685954,0.0020567344,0.86628705,0.020512676,0.109959394,0.00035764047],"about_ca_topic_score_codex":0.00005447657,"about_ca_topic_score_gemma":0.000022343422,"teacher_disagreement_score":0.3113569,"about_ca_system_score_codex":0.00019110348,"about_ca_system_score_gemma":0.00006633606,"threshold_uncertainty_score":0.99998313},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00077343726,0.000029232488,0.9958083,0.0005963852,0.00012199286,0.00017417932,0.0000062359823,0.00031104346,0.002179176],"genre_scores_gemma":[0.08654918,0.000004642104,0.9131766,0.00014100755,0.000012493814,0.0000101886335,0.0000024638964,0.000005633243,0.00009780404],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99929214,0.000021462913,0.00019425259,0.00023163817,0.0001242881,0.0001362468],"domain_scores_gemma":[0.99916476,0.00012674749,0.00011328957,0.00046399038,0.00008590155,0.00004533962],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00010437244,0.00007694537,0.00011898185,0.00009071477,0.000058496094,0.00002937061,0.00038879414,0.000041881398,0.000103677776],"category_scores_gemma":[0.000058002166,0.00006858101,0.000045936587,0.00015224532,0.000044565437,0.00042786758,0.000058624686,0.000044644537,0.0000046810887],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000031755774,0.000029580886,0.000034865483,0.000017911676,0.0000021876963,0.0000010952426,0.000019140927,0.000017978373,0.010174639,0.005128368,0.006387454,0.9781836],"study_design_scores_gemma":[0.00023065442,0.000056086683,0.000015711274,0.000037775564,0.000001783973,0.000014458408,0.0000070052624,0.35480252,0.6214189,0.020265078,0.003048084,0.000101991],"about_ca_topic_score_codex":0.000003234387,"about_ca_topic_score_gemma":0.0000015359486,"teacher_disagreement_score":0.9780816,"about_ca_system_score_codex":0.000018850902,"about_ca_system_score_gemma":0.000012643275,"threshold_uncertainty_score":0.27966523},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0017582298,0.000045518216,0.9961594,0.00013173213,0.00010991098,0.0003125615,0.0000068790887,0.00038575212,0.0010900224],"genre_scores_gemma":[0.19523518,0.000007902566,0.8035204,0.0003920156,0.000010236157,0.00008887386,0.000008497172,0.000007151409,0.0007297852],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9992723,0.00003128114,0.0001435895,0.0002812604,0.000107286396,0.00016429051],"domain_scores_gemma":[0.9992013,0.0001898896,0.00005359173,0.00040493754,0.00010124468,0.000049048722],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001436089,0.00008883035,0.000091078524,0.00006338077,0.000081952545,0.00008170425,0.00034613058,0.000020960637,0.000028539556],"category_scores_gemma":[0.00016470414,0.00007262156,0.00003056728,0.00009792153,0.000019109126,0.00069769076,0.000061064246,0.000039197046,0.000019809897],"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.000019882322,0.00022449408,0.000222964,0.000060119128,0.000017506669,0.0000085776155,0.00027890143,0.00020978464,0.052184466,0.7655577,0.10283912,0.078376465],"study_design_scores_gemma":[0.000504565,0.00006741553,0.00011873435,0.000022334722,0.0000017037371,0.000008964434,0.000009550179,0.092528224,0.70870167,0.13838269,0.059440292,0.00021386283],"about_ca_topic_score_codex":0.0000026309076,"about_ca_topic_score_gemma":0.0000012734373,"teacher_disagreement_score":0.6565172,"about_ca_system_score_codex":0.000014558318,"about_ca_system_score_gemma":0.00002399619,"threshold_uncertainty_score":0.29614213},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0055744983,0.00004084374,0.9932868,0.00017746493,0.000010248782,0.00030904028,0.000012178891,0.00016233667,0.00042659967],"genre_scores_gemma":[0.5934612,0.0000014067383,0.4063599,0.00007268627,0.000011206378,0.00003933557,0.000010227771,0.000004896358,0.00003909726],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991691,0.000015952364,0.0002370811,0.00025767373,0.00015236174,0.00016779991],"domain_scores_gemma":[0.9995296,0.000034400622,0.00009745405,0.00025169432,0.00004557032,0.000041289357],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0000779077,0.00008816174,0.00011106565,0.000114772476,0.0000354907,0.00007784853,0.00049061584,0.000028532968,0.000044192966],"category_scores_gemma":[0.000006440012,0.00007435751,0.000024966863,0.00017174419,0.00002364446,0.001432303,0.00012894104,0.00005989242,0.0000010594803],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000043715127,0.00005783925,0.00018938816,0.00001905701,8.6719297e-7,9.882724e-7,0.0004999709,0.00035624974,0.0016825617,0.0014852803,0.0003725421,0.99533087],"study_design_scores_gemma":[0.0025351064,0.0010505549,0.0025339832,0.00013764402,0.000005970734,0.000028526887,0.0009913867,0.7648849,0.114417344,0.10669303,0.0059183515,0.0008031983],"about_ca_topic_score_codex":0.00001292124,"about_ca_topic_score_gemma":0.000028775357,"teacher_disagreement_score":0.9945277,"about_ca_system_score_codex":0.000016269201,"about_ca_system_score_gemma":0.000016416197,"threshold_uncertainty_score":0.3032211},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0011410161,0.000042840496,0.9938229,0.00033427676,0.00005799266,0.00045992472,0.000055060555,0.0004075678,0.0036784313],"genre_scores_gemma":[0.11252995,0.00005299103,0.88536197,0.000121624114,0.000037494723,0.00003349222,0.000015952874,0.000018146553,0.0018283891],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9986478,0.000027633325,0.00028070356,0.00040286424,0.0003800913,0.0002608777],"domain_scores_gemma":[0.9985617,0.00010853977,0.00019533483,0.000786016,0.0002696485,0.00007877995],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020030343,0.00015905352,0.00023676797,0.00013337519,0.00009860323,0.00008716319,0.00074567087,0.00006279036,0.00030452342],"category_scores_gemma":[0.000083791536,0.000121858575,0.00004108401,0.0004135669,0.000055131466,0.00081137294,0.00025773176,0.00008501623,0.000010483049],"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.00022240874,0.00032067078,0.0006511562,0.00026935624,0.00009310596,0.000048141035,0.0009744023,0.0007215261,0.035187345,0.10205953,0.1489488,0.7105035],"study_design_scores_gemma":[0.0010746698,0.00048609782,0.00003391109,0.00018008439,0.000012301357,0.000025336469,0.00003699562,0.12494034,0.795536,0.006261198,0.07102614,0.0003869542],"about_ca_topic_score_codex":0.00002605049,"about_ca_topic_score_gemma":0.000030217161,"teacher_disagreement_score":0.7603486,"about_ca_system_score_codex":0.00005308257,"about_ca_system_score_gemma":0.00002928761,"threshold_uncertainty_score":0.49692485},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000716404,0.000037756367,0.9901446,0.0003745907,0.000050055194,0.0003078431,0.000014708762,0.00089384,0.008104951],"genre_scores_gemma":[0.05235563,0.000020335354,0.9390414,0.0008323233,0.000023141904,0.00007631454,0.00000309386,0.000010127875,0.007637656],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990811,0.000010436075,0.00017486594,0.00034238878,0.00015471996,0.00023651838],"domain_scores_gemma":[0.99905026,0.00008642274,0.00005372998,0.0006670417,0.00006140692,0.00008116079],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00010118163,0.000109232686,0.00012348183,0.000072321745,0.00010509894,0.00007784094,0.0008724469,0.00003940925,0.00006510876],"category_scores_gemma":[0.000037664384,0.00009375982,0.000048024584,0.000102307975,0.000021202908,0.0007093711,0.00029458836,0.000066666486,0.0000387716],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008501266,0.00036427513,9.769891e-7,0.000015247405,0.0000062000004,0.000008611621,0.0002790804,0.00026011703,0.017336402,0.29187396,0.1856909,0.50415576],"study_design_scores_gemma":[0.00058710895,0.00006718337,5.149611e-8,0.000011206878,0.0000013510839,0.000007234858,0.0000019685667,0.8980957,0.059444938,0.027093478,0.014563449,0.00012627593],"about_ca_topic_score_codex":0.0000014852412,"about_ca_topic_score_gemma":8.945131e-7,"teacher_disagreement_score":0.8978356,"about_ca_system_score_codex":0.000024937939,"about_ca_system_score_gemma":0.000009203813,"threshold_uncertainty_score":0.38234147},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.074949056,0.000009280255,0.92158943,0.00006650684,0.0005612339,0.0005577832,0.000021048214,0.002221199,0.000024436553],"genre_scores_gemma":[0.50434387,0.000001685446,0.49542034,0.00005178542,0.000041841115,0.000060055663,0.00005197321,0.000027648985,8.363273e-7],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978576,0.0000965768,0.0004527218,0.00084607245,0.00034623386,0.00040084604],"domain_scores_gemma":[0.9979946,0.0002376438,0.00016303694,0.0011625851,0.00019706771,0.00024503586],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003279771,0.00043433404,0.00033595282,0.0004985387,0.00017617544,0.0003896824,0.00079445844,0.00021214857,0.000010323276],"category_scores_gemma":[0.000056076056,0.00040130288,0.00006602496,0.00048940873,0.000055677043,0.00060877897,0.00028510342,0.0008028157,0.000007014253],"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.000021827378,0.0002033096,0.000019977135,0.000039325896,0.0000070645547,0.000051566367,0.00007432539,0.13868272,0.826253,0.009060685,0.000056902485,0.025529323],"study_design_scores_gemma":[0.00024517797,0.00017316401,0.00073209667,0.00026505388,0.0000030394253,0.000029751043,0.0000017283081,0.68157834,0.31628174,0.000102941,0.000275213,0.00031179696],"about_ca_topic_score_codex":0.000035746918,"about_ca_topic_score_gemma":0.0000030000763,"teacher_disagreement_score":0.5428956,"about_ca_system_score_codex":0.00009876967,"about_ca_system_score_gemma":0.000040237024,"threshold_uncertainty_score":0.9998439},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0009565263,0.000027164084,0.9940266,0.0008439112,0.0001737847,0.00037708753,0.000073262534,0.000910216,0.002611457],"genre_scores_gemma":[0.19591105,0.0000067901974,0.80217475,0.0004633027,0.000045585166,0.00006620417,0.000010910263,0.00001133512,0.001310065],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99864566,0.000064828426,0.00025988295,0.000524994,0.00021961557,0.00028498756],"domain_scores_gemma":[0.998457,0.00021471568,0.00011527661,0.00095804397,0.00016920638,0.0000857487],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014330153,0.00016436006,0.00020478448,0.00007820177,0.00013040457,0.00011221746,0.001004775,0.0000665918,0.00027124473],"category_scores_gemma":[0.00012378783,0.0001312013,0.00006207591,0.00022608697,0.00006869577,0.0009348625,0.0003980085,0.0001210454,0.000043820033],"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.000028162709,0.00015914791,0.00013595453,0.00003156968,0.000029673736,0.000007627898,0.0005032663,0.000019076586,0.049039844,0.5945024,0.089754105,0.26578918],"study_design_scores_gemma":[0.0012029138,0.00019129323,0.0036516574,0.00002025664,0.0000068169634,0.000013692882,0.00005436603,0.04745171,0.63816273,0.29120454,0.017299576,0.00074043806],"about_ca_topic_score_codex":0.000062051135,"about_ca_topic_score_gemma":0.000026158696,"teacher_disagreement_score":0.5891229,"about_ca_system_score_codex":0.00004432813,"about_ca_system_score_gemma":0.000010821738,"threshold_uncertainty_score":0.5350234},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005580402,0.00015661241,0.9747598,0.00038482866,0.0003105837,0.0017208513,0.00004576163,0.0008112054,0.016229955],"genre_scores_gemma":[0.6382877,0.00094358827,0.3075397,0.000042981177,0.0013147041,0.00016243443,0.001429215,0.00017704243,0.05010257],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9975023,0.00024793015,0.00033662387,0.00091444765,0.00044731132,0.00055134215],"domain_scores_gemma":[0.99776226,0.00050869625,0.00031232092,0.0008227735,0.00033057353,0.000263401],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00047954047,0.00031803627,0.00032796658,0.0014437393,0.0010326236,0.0004054972,0.0012826017,0.0002269863,0.000010392497],"category_scores_gemma":[0.00008488024,0.00034424147,0.00012595885,0.0008548645,0.00007923766,0.0018276,0.0003941506,0.00059536344,0.0000034637808],"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.00033267087,0.00011345538,0.00048879394,0.00033400828,0.000122025995,0.00009654403,0.001309583,0.000031351803,0.040387984,0.17870487,0.019285446,0.75879323],"study_design_scores_gemma":[0.00080448465,0.00064303156,0.0017337545,0.0004109972,0.00003877668,0.000051168303,0.0012952852,0.010483587,0.79891515,0.023184007,0.16166897,0.00077076466],"about_ca_topic_score_codex":0.0016176506,"about_ca_topic_score_gemma":0.00257326,"teacher_disagreement_score":0.75852716,"about_ca_system_score_codex":0.00062626257,"about_ca_system_score_gemma":0.00063251803,"threshold_uncertainty_score":0.99990094},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00006706689,0.000018648347,0.9274878,0.011507411,0.000066866036,0.00027408733,0.000011623209,0.0006760895,0.05989044],"genre_scores_gemma":[0.43342665,0.00003478796,0.5595989,0.0053736786,0.000040608094,0.00003919201,0.000008558872,0.000021519503,0.0014560668],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986619,0.000085123946,0.0002004758,0.0003811559,0.00039997182,0.00027141205],"domain_scores_gemma":[0.9982245,0.00027838745,0.000056399884,0.0013237152,0.00003342648,0.00008356419],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016690056,0.00017430849,0.00013419855,0.000070366266,0.00023065034,0.0001316914,0.0015761679,0.00004676295,0.00084479724],"category_scores_gemma":[0.000028352679,0.00009316073,0.000074433665,0.00022161791,0.00007411092,0.0006417751,0.00019402744,0.00021981202,0.0001814208],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000026138716,0.00033552208,0.000014136794,0.00002335756,0.000010095578,0.00004426618,0.0003218652,0.00016892837,0.020260356,0.16853118,0.37489837,0.4353658],"study_design_scores_gemma":[0.00021353764,0.00009015735,0.000045304278,0.000053837877,0.0000015252498,0.000002919306,0.000006842865,0.7759401,0.13829428,0.006243793,0.07891918,0.00018846853],"about_ca_topic_score_codex":0.000006482104,"about_ca_topic_score_gemma":8.7302675e-7,"teacher_disagreement_score":0.7757712,"about_ca_system_score_codex":0.000024032248,"about_ca_system_score_gemma":0.0000064744177,"threshold_uncertainty_score":0.92499375},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0019015372,0.00002569247,0.99235845,0.000505203,0.00008305508,0.000101582584,0.000003232634,0.0012490719,0.0037721773],"genre_scores_gemma":[0.12326123,0.000040021332,0.8706902,0.003889161,0.000036321377,0.000023209348,0.0000036816957,0.0000104677,0.0020456966],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9990918,0.000026047637,0.0001259953,0.00034541925,0.00022631297,0.00018439791],"domain_scores_gemma":[0.9989937,0.00009208592,0.000029638111,0.0007780797,0.000035536734,0.000070952134],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00004178018,0.000110793044,0.00010353012,0.000065264234,0.000113260015,0.00002293707,0.00090834295,0.00004236757,0.00016788456],"category_scores_gemma":[0.000020130432,0.000083974104,0.000043036565,0.00013124954,0.000040004918,0.00053601584,0.00017203279,0.0001244572,0.00042903834],"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.000029582785,0.000428456,0.0012621403,0.000019056664,0.00002064686,0.0004287219,0.0019578787,0.00009717342,0.0028151628,0.06541479,0.40915677,0.5183696],"study_design_scores_gemma":[0.0014613667,0.0010474887,0.016701693,0.00019461263,0.0000067260007,0.00041693237,0.000035320994,0.009238056,0.39870587,0.06592446,0.50448406,0.001783421],"about_ca_topic_score_codex":0.000008957493,"about_ca_topic_score_gemma":0.0000011738288,"teacher_disagreement_score":0.5165862,"about_ca_system_score_codex":0.000016470014,"about_ca_system_score_gemma":0.000020049078,"threshold_uncertainty_score":0.55145633},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00058875035,0.00002700306,0.993406,0.0020335156,0.00006695215,0.0002682142,0.000010444956,0.00056015904,0.003038973],"genre_scores_gemma":[0.20679896,0.000004816239,0.7918702,0.00065365847,0.00008944121,0.00009824766,0.000036847134,0.000005336053,0.00044251163],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991747,0.000023130748,0.00016775605,0.0003046445,0.00018664745,0.00014308948],"domain_scores_gemma":[0.99921614,0.00012660309,0.00006356886,0.00044592572,0.00009208856,0.000055651984],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00008062411,0.000078488854,0.000085966945,0.000069891306,0.0001138086,0.00006727081,0.00056043814,0.0000347747,0.000039523205],"category_scores_gemma":[0.000022175938,0.000066641165,0.00004204383,0.0001288901,0.000016276646,0.0011207021,0.00022768423,0.000047550246,0.000025361473],"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.000024803887,0.00013491517,0.0000717432,0.000008107761,0.000005863454,0.0000010838636,0.00009983876,0.0006450251,0.04433994,0.5966304,0.071495995,0.28654233],"study_design_scores_gemma":[0.0007643013,0.000080570324,0.0012201112,0.000043454835,0.0000034305383,0.000020547892,0.000012662869,0.43660548,0.38762885,0.070237815,0.10307836,0.00030440147],"about_ca_topic_score_codex":0.000003339391,"about_ca_topic_score_gemma":0.0000018009074,"teacher_disagreement_score":0.5263926,"about_ca_system_score_codex":0.000027876698,"about_ca_system_score_gemma":0.000016719288,"threshold_uncertainty_score":0.27175477},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0001689326,0.000047229703,0.9958845,0.0011055783,0.0001633077,0.00039890513,0.000010120979,0.0009732144,0.0012482371],"genre_scores_gemma":[0.09753285,0.000021194435,0.9012514,0.00035505055,0.00005434839,0.00008177978,0.000015598825,0.0000130530925,0.0006747432],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989393,0.00004097055,0.0002200976,0.0004038131,0.0001582364,0.00023761968],"domain_scores_gemma":[0.99890065,0.0001698698,0.00007753004,0.0006663874,0.000094367155,0.000091173286],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000097460805,0.0001245503,0.00013725743,0.00008315713,0.00014388123,0.00011567304,0.0008132195,0.000060636947,0.000109084016],"category_scores_gemma":[0.00010430463,0.00009925013,0.000054215943,0.0001899298,0.00003902233,0.00093275594,0.00034879107,0.000100568206,0.000027589385],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018571336,0.00024730738,0.000018818868,0.00003575134,0.0000075640137,0.000003985336,0.00013963955,0.000012026929,0.46961173,0.23975606,0.07829784,0.2118507],"study_design_scores_gemma":[0.00032534145,0.000101683516,0.000061471794,0.000017793733,0.0000015333519,0.0000048245593,0.0000019553265,0.8251232,0.14416334,0.007968432,0.022065166,0.0001652538],"about_ca_topic_score_codex":0.0000036039207,"about_ca_topic_score_gemma":8.569115e-7,"teacher_disagreement_score":0.82511115,"about_ca_system_score_codex":0.000020269645,"about_ca_system_score_gemma":0.0000069070106,"threshold_uncertainty_score":0.4047303},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0005186703,0.000056099372,0.9423534,0.00018087539,0.00015265917,0.00013578746,0.0000022981226,0.0008435047,0.055756666],"genre_scores_gemma":[0.120875165,0.00002032799,0.87323433,0.0014018988,0.000018508763,0.000020631844,0.0000028820823,0.000012387156,0.0044138855],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9987576,0.00006454784,0.00019475022,0.00042713253,0.00026640337,0.00028953564],"domain_scores_gemma":[0.9985871,0.00007986603,0.000058127334,0.0010847388,0.00007766129,0.00011251247],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018955207,0.00014730763,0.00014133054,0.000083592146,0.00008417264,0.00009855156,0.0009844771,0.00006166145,0.0004000204],"category_scores_gemma":[0.00008232704,0.000113174305,0.000044843317,0.00032485105,0.000032868753,0.0007750444,0.0003228618,0.00013593932,0.00025359733],"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.0000034308057,0.00017718306,0.00015722522,0.00001211102,0.000010947437,0.0000768358,0.00008393847,0.000028322931,0.006258588,0.70844537,0.12709689,0.15764916],"study_design_scores_gemma":[0.00025057443,0.00005757381,0.000033856748,0.00002737817,0.0000018661501,0.00011876777,0.000010470284,0.0041604755,0.637586,0.06385018,0.29356804,0.0003348029],"about_ca_topic_score_codex":0.000013136605,"about_ca_topic_score_gemma":0.000012917309,"teacher_disagreement_score":0.6445952,"about_ca_system_score_codex":0.000045021414,"about_ca_system_score_gemma":0.00004926453,"threshold_uncertainty_score":0.4615114},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0029232798,0.00010420028,0.9794302,0.0003946139,0.00025253432,0.0010637824,0.0001152058,0.00029899462,0.015417193],"genre_scores_gemma":[0.05268638,0.0032198012,0.8267036,0.000038502527,0.00023255225,0.000028786397,0.0016619794,0.00015624506,0.11527212],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9971686,0.00017490948,0.00020698688,0.00078276184,0.0010940507,0.0005727048],"domain_scores_gemma":[0.9975948,0.00035885535,0.00022931377,0.0008743118,0.0007263302,0.00021642058],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00071467017,0.00023740857,0.00041465327,0.00095033745,0.0006344406,0.00009649623,0.0029975183,0.0003378807,0.00025928026],"category_scores_gemma":[0.00007092042,0.0002824569,0.00020904133,0.00074300205,0.0001490624,0.0012308344,0.00034524893,0.00066570455,0.00002461896],"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.00009239693,0.00050443964,0.000050216655,0.0027117429,0.00011390468,0.00021317307,0.0046005836,0.00000902833,0.099353395,0.11602017,0.19505136,0.5812796],"study_design_scores_gemma":[0.0026946214,0.00091244624,0.001302596,0.002402345,0.000047720998,0.000008494274,0.0021434093,0.21155448,0.104176156,0.016699234,0.65659446,0.0014640313],"about_ca_topic_score_codex":0.00005363793,"about_ca_topic_score_gemma":0.00004959735,"teacher_disagreement_score":0.57981557,"about_ca_system_score_codex":0.00014460974,"about_ca_system_score_gemma":0.00013455914,"threshold_uncertainty_score":0.99996275},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005360672,0.00023524245,0.96309656,0.00446076,0.00015614467,0.0002544843,0.000012041718,0.0011457771,0.025278307],"genre_scores_gemma":[0.8135186,0.00039028545,0.17473058,0.0035783863,0.00009551321,0.000047510184,0.0000064833725,0.000023149783,0.007609521],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99814665,0.00017197186,0.00039952373,0.00050864887,0.0004331006,0.00034008158],"domain_scores_gemma":[0.9975354,0.0003436731,0.00014275647,0.0017338771,0.00013255331,0.00011173766],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042310526,0.00020305863,0.00021091443,0.000050494797,0.0002309676,0.00014994957,0.0021779542,0.00008159909,0.00033056052],"category_scores_gemma":[0.000046502963,0.00012652462,0.00007323648,0.00041574554,0.00011079765,0.0007430358,0.0009796565,0.0002676,0.00051605364],"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.000016156855,0.0005269468,0.0017387964,0.000032060605,0.000039707174,0.000047989717,0.00067616673,0.00023019128,0.0064169597,0.4894438,0.33955908,0.16127212],"study_design_scores_gemma":[0.0013115444,0.00021874385,0.0052198246,0.00010778736,0.000018636953,0.000094850264,0.000077177414,0.48642415,0.053185515,0.022032646,0.42996275,0.0013463894],"about_ca_topic_score_codex":0.00017506487,"about_ca_topic_score_gemma":0.00006834605,"teacher_disagreement_score":0.80815786,"about_ca_system_score_codex":0.000033901695,"about_ca_system_score_gemma":0.000011116402,"threshold_uncertainty_score":0.6632998},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16129437,0.00025961892,0.8365038,0.00008720222,0.00056747004,0.00051367446,0.00003341692,0.0006669657,0.00007349404],"genre_scores_gemma":[0.4682825,0.000041783383,0.5313609,0.000043269683,0.00005881036,0.00006284374,0.000040270133,0.000024054221,0.000085528394],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99738425,0.00024358503,0.00062670204,0.00094042777,0.00042322627,0.00038178128],"domain_scores_gemma":[0.99678814,0.00031903808,0.0006099205,0.001955073,0.00023102276,0.0000967955],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00041996478,0.00037999626,0.0004938144,0.00022660621,0.00009512512,0.00009043942,0.0022610722,0.0003164709,0.000011875874],"category_scores_gemma":[0.00024209118,0.0003797505,0.00015116109,0.00026868854,0.000116046984,0.0006936519,0.0024578443,0.00060573284,0.000045966855],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00037863638,0.0017517234,0.2545806,0.001218059,0.00033914167,0.00022669027,0.0013956467,0.2793314,0.38563365,0.008465825,0.03969409,0.026984584],"study_design_scores_gemma":[0.0010174153,0.00031721324,0.14984165,0.0010379123,0.000081997074,0.00001921471,0.000024204584,0.47641546,0.3616459,0.004680963,0.0032592264,0.0016588394],"about_ca_topic_score_codex":0.0002500533,"about_ca_topic_score_gemma":0.0000048045736,"teacher_disagreement_score":0.30698812,"about_ca_system_score_codex":0.000113097645,"about_ca_system_score_gemma":0.0001448652,"threshold_uncertainty_score":0.9998654},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004106726,0.00017171503,0.993864,0.000101995654,0.000109337445,0.00028688536,0.00018574602,0.00039199222,0.00078158866],"genre_scores_gemma":[0.21863438,0.000084122374,0.7809736,0.00007937852,0.00004170917,0.000003495593,0.00008632787,0.000018533217,0.00007846029],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997946,0.00007478827,0.0004973613,0.0007417322,0.00040508836,0.0003349929],"domain_scores_gemma":[0.9962466,0.00009558378,0.00019549658,0.0031962576,0.00010199734,0.00016409894],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002645655,0.00022057029,0.00032438998,0.0002786549,0.00012472968,0.0000890147,0.0039092647,0.00009455666,0.00011067751],"category_scores_gemma":[0.00004429834,0.00017173075,0.000048271275,0.0008445817,0.000084809035,0.0034653414,0.0014311259,0.00019637067,0.0000054419083],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022736258,0.0007878767,0.00007528606,0.00008945166,0.000026184027,0.000018006393,0.00032111627,0.00015166472,0.12891877,0.0023297367,0.0014352502,0.8658239],"study_design_scores_gemma":[0.00032291058,0.00010675949,0.000042133022,0.000047337573,0.000006700387,0.000012881277,0.000014246809,0.90023446,0.0959961,0.0004832263,0.002508183,0.00022509541],"about_ca_topic_score_codex":0.00009384704,"about_ca_topic_score_gemma":0.0000074571653,"teacher_disagreement_score":0.90008277,"about_ca_system_score_codex":0.000026344185,"about_ca_system_score_gemma":0.000021624055,"threshold_uncertainty_score":0.72644514},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003291494,0.00005018697,0.9783456,0.0020566783,0.0000445143,0.00039019116,0.000025735202,0.00051148556,0.015284155],"genre_scores_gemma":[0.92878574,0.000004681266,0.06962585,0.00083813665,0.00003428965,0.000031636722,0.0000052525743,0.000013834731,0.00066057517],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99821424,0.00006689255,0.00035779292,0.00043243496,0.0006539364,0.00027467994],"domain_scores_gemma":[0.99794215,0.00060451304,0.00021264261,0.0010090552,0.00014613861,0.00008547417],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000176131,0.0002048379,0.00022025342,0.00011472455,0.00012842563,0.0001522258,0.0018256672,0.00006566115,0.0006606512],"category_scores_gemma":[0.00009731623,0.000117830015,0.00008238734,0.0004147099,0.00010988707,0.00071997,0.00038628385,0.00019972963,0.00010643987],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003970483,0.0007403228,0.00008292299,0.000055512268,0.000018506864,0.000031249274,0.000150423,0.00029528735,0.04813111,0.031264894,0.0726866,0.8465035],"study_design_scores_gemma":[0.00026232534,0.00026426735,0.00005160484,0.0001643595,0.000002158499,0.000005745577,0.000011168976,0.23508783,0.7486905,0.006280026,0.008949094,0.0002309421],"about_ca_topic_score_codex":0.0000028329966,"about_ca_topic_score_gemma":3.1148863e-7,"teacher_disagreement_score":0.92549425,"about_ca_system_score_codex":0.000020961952,"about_ca_system_score_gemma":0.000022256676,"threshold_uncertainty_score":0.72336674},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.001709935,0.0000097575585,0.99220216,0.0011157949,0.000055426517,0.00031804797,0.00000660984,0.00024368543,0.0043385723],"genre_scores_gemma":[0.42191955,0.0000130514645,0.5765347,0.00059504446,0.000017130822,0.00010452788,0.0000012195163,0.0000073319147,0.0008074931],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.999352,0.000041911007,0.00014300816,0.00019555079,0.00015221497,0.00011536184],"domain_scores_gemma":[0.9988005,0.0005755051,0.00008783469,0.00042207213,0.00008979833,0.000024270552],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012379316,0.00007303295,0.000090899826,0.000051718027,0.00011528364,0.000029360523,0.0006111595,0.000029906198,0.0002612969],"category_scores_gemma":[0.00012583162,0.000042397613,0.000041703,0.00019257459,0.00003090951,0.0003028809,0.00015316144,0.00006172614,0.00001600401],"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.00002061245,0.00021232956,0.0000170937,0.000016976086,0.000008130032,5.1087073e-7,0.00009466576,0.000058032005,0.16065668,0.41331097,0.36991376,0.055690262],"study_design_scores_gemma":[0.00011219797,0.00018587895,0.00006709356,0.000032713302,0.0000016262975,0.0000019730842,0.00000523528,0.31658587,0.662112,0.010574667,0.010247464,0.00007326345],"about_ca_topic_score_codex":0.0000038867533,"about_ca_topic_score_gemma":9.3422096e-7,"teacher_disagreement_score":0.5014553,"about_ca_system_score_codex":0.00001677416,"about_ca_system_score_gemma":0.0000041608732,"threshold_uncertainty_score":0.2861018},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000025981033,0.00011423198,0.99556303,0.0005577879,0.00021041647,0.00035680708,0.000002281951,0.00030853378,0.0028609207],"genre_scores_gemma":[0.077790275,0.000046191733,0.9188736,0.0012928522,0.000020442569,0.000121473335,0.0000057070833,0.000010391904,0.0018390911],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99926203,0.000036485333,0.00014732541,0.00023074215,0.00016684555,0.00015656794],"domain_scores_gemma":[0.9989872,0.00016489916,0.00006181647,0.0006741165,0.00008310382,0.000028851497],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002612904,0.00007526077,0.000063793945,0.000030945033,0.00022044599,0.00011704614,0.00067745266,0.000026930451,0.000038843944],"category_scores_gemma":[0.00012949991,0.000046822282,0.000028132246,0.00016845207,0.000028374952,0.00056041125,0.00012583658,0.000039316743,0.000018002482],"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.0000019267786,0.00002776641,0.00007081234,0.0000036313868,0.0000049188243,2.7472092e-7,0.000043773518,0.00006105185,0.00245218,0.9273872,0.024980342,0.04496617],"study_design_scores_gemma":[0.0003110319,0.000055695986,0.000103450024,0.000013882213,0.000004301645,0.000003493211,0.000016781714,0.07326646,0.15326887,0.08521345,0.6875701,0.00017248068],"about_ca_topic_score_codex":0.0000034104971,"about_ca_topic_score_gemma":0.0000028948377,"teacher_disagreement_score":0.8421737,"about_ca_system_score_codex":0.000015906826,"about_ca_system_score_gemma":0.000028400496,"threshold_uncertainty_score":0.19093572},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0002648875,0.00003714301,0.9427272,0.00008426769,0.000015059131,0.00011903253,0.0000015305202,0.0002569711,0.056493875],"genre_scores_gemma":[0.1888428,0.000022118367,0.81063706,0.000116174444,0.0000024097592,0.0000044644935,4.563671e-7,0.000005414827,0.00036911276],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9992942,0.000012563978,0.00014735533,0.00020948371,0.00018966664,0.00014670954],"domain_scores_gemma":[0.99933046,0.000030740834,0.000044461656,0.000475348,0.000048311853,0.000070685215],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000085415275,0.00008771725,0.00012455363,0.000059688664,0.00002858011,0.000027770599,0.0004987253,0.000023073053,0.000014918317],"category_scores_gemma":[0.0000064024207,0.00006195547,0.000023861414,0.00022984324,0.000027448872,0.0016270112,0.00004775114,0.00006137766,0.0000028305863],"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.000006808298,0.00003359705,0.000005301751,0.000010741966,0.000005472516,0.0000042411134,0.00020747034,0.00019518708,0.03590106,0.9192103,0.00240669,0.042013124],"study_design_scores_gemma":[0.00045979794,0.000119079945,0.00002258805,0.000062901054,0.0000032251262,0.000017254595,0.00004072917,0.034385208,0.69885576,0.26218203,0.00363474,0.00021664903],"about_ca_topic_score_codex":0.000034628487,"about_ca_topic_score_gemma":0.000003715348,"teacher_disagreement_score":0.66295475,"about_ca_system_score_codex":0.000011141991,"about_ca_system_score_gemma":0.00007296922,"threshold_uncertainty_score":0.25264707},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0001321366,0.00004967477,0.98243725,0.00036674598,0.0001033422,0.00011398214,0.000017325377,0.00082490395,0.015954608],"genre_scores_gemma":[0.0145678045,0.000044234057,0.9826018,0.00031872868,0.000022782555,0.000013726335,0.000004288257,0.000012294534,0.0024143134],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988506,0.00004247544,0.00020436839,0.0003502792,0.0002701653,0.00028212462],"domain_scores_gemma":[0.99868816,0.00015884038,0.00007118775,0.00084240193,0.00014736482,0.000092041126],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00010704094,0.00012533322,0.00012596528,0.000048552865,0.00019167544,0.000372265,0.001317627,0.000037984057,0.0009566345],"category_scores_gemma":[0.00015283244,0.00011040676,0.000017444458,0.00032474461,0.000056606394,0.0012722948,0.0010879098,0.00014060407,0.00019687122],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000023893324,0.0001475962,0.00022694567,0.000053731503,0.000013513766,0.00010034261,0.0005112269,0.00012820875,0.0070818285,0.33312824,0.49704623,0.16155975],"study_design_scores_gemma":[0.00016711355,0.000030666968,0.00014160757,0.000032299024,0.0000021747735,0.000013876933,0.0000105853405,0.9283485,0.018672697,0.014313276,0.03799226,0.0002749832],"about_ca_topic_score_codex":0.000021311667,"about_ca_topic_score_gemma":0.0000031531838,"teacher_disagreement_score":0.9282203,"about_ca_system_score_codex":0.000023089191,"about_ca_system_score_gemma":0.0000119936285,"threshold_uncertainty_score":0.9999566},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00009900231,0.000016057438,0.98765934,0.0007151438,0.00003063781,0.00016390947,0.000003575039,0.00044616303,0.010866151],"genre_scores_gemma":[0.0975622,0.0000040390164,0.90090024,0.0005422256,0.00005494273,0.000033778397,0.0000060397565,0.0000051387847,0.0008913866],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992203,0.000011993797,0.00013858775,0.00030237323,0.00012687813,0.00019984815],"domain_scores_gemma":[0.999289,0.00010238268,0.000029859566,0.0004715616,0.00003555351,0.00007169172],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014798729,0.00008059259,0.000102516125,0.000063822554,0.000070310896,0.000079731275,0.00069080445,0.000033931756,0.00001890875],"category_scores_gemma":[0.000037486145,0.0000642311,0.000043553413,0.00013247636,0.000024697662,0.00062605774,0.00022784497,0.00005930434,0.000010674664],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000071790705,0.00007732819,0.000053112817,0.000011745957,0.0000075742423,7.7563436e-7,0.00006539861,0.00022120368,0.0010565307,0.7288827,0.079650104,0.18996635],"study_design_scores_gemma":[0.00019389688,0.000029734847,0.000040151972,0.000005520249,0.000002028702,0.0000062650724,0.0000065627364,0.8644588,0.022758296,0.003886338,0.10847344,0.00013895327],"about_ca_topic_score_codex":0.0000012270508,"about_ca_topic_score_gemma":4.698123e-7,"teacher_disagreement_score":0.8642376,"about_ca_system_score_codex":0.000025440282,"about_ca_system_score_gemma":0.0000125738,"threshold_uncertainty_score":0.26192683},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00044437157,0.00008658265,0.9851696,0.00063160306,0.00013863841,0.000088039626,6.5850605e-7,0.0011338869,0.012306606],"genre_scores_gemma":[0.15172122,0.000050769646,0.84447855,0.0020333284,0.00015193982,0.000007349096,0.0000016936057,0.000008901215,0.0015462246],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989918,0.000026142267,0.00018179443,0.00033795074,0.0002040258,0.00025830092],"domain_scores_gemma":[0.9988894,0.000095213356,0.000058939873,0.0008409764,0.000031628053,0.000083849205],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015640525,0.00011088285,0.00011034642,0.00006169574,0.000082959945,0.000107926746,0.0009996642,0.000076412296,0.00024487864],"category_scores_gemma":[0.000028407438,0.00009252053,0.000036483478,0.00023352308,0.00002271291,0.0011152113,0.0006694016,0.00021524912,0.0001218843],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000038635453,0.00006376895,0.00030905093,0.0000029710222,0.000007348325,0.000020496509,0.00006283927,0.0037950259,0.0022610528,0.28148842,0.14801885,0.56396633],"study_design_scores_gemma":[0.0001361595,0.00002391157,0.00044637657,0.000027554026,0.0000012863742,0.00001995945,0.0000021143828,0.70312494,0.018826922,0.004255922,0.2728993,0.00023554171],"about_ca_topic_score_codex":0.0000075468133,"about_ca_topic_score_gemma":0.0000042115184,"teacher_disagreement_score":0.6993299,"about_ca_system_score_codex":0.00004042055,"about_ca_system_score_gemma":0.000011471238,"threshold_uncertainty_score":0.37728778},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00047532842,0.000015016709,0.9944223,0.00017561184,0.0001669158,0.00029912667,0.000005422301,0.0005328385,0.0039073993],"genre_scores_gemma":[0.1600971,0.000009207059,0.83915794,0.00034573683,0.000013500521,0.00002003085,0.000010691601,0.0000073392966,0.00033846573],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99910945,0.000043172644,0.00018317481,0.0003167037,0.00014989368,0.00019761056],"domain_scores_gemma":[0.9991081,0.00013939057,0.00007381149,0.00051929196,0.000103098566,0.00005630504],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024102665,0.00009925148,0.000120834404,0.000064405096,0.00014812447,0.000089660716,0.0004898686,0.000038974405,0.000043051277],"category_scores_gemma":[0.00018324079,0.00008703716,0.000033989174,0.00021322949,0.000034668632,0.00069025956,0.00011202584,0.00005315222,0.000013952715],"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.0000028296122,0.00004084407,0.00013099235,0.00001769696,0.0000019797335,0.000001231943,0.00002822292,0.00002346226,0.008740042,0.9654428,0.009021624,0.016548315],"study_design_scores_gemma":[0.00028452434,0.000049730133,0.00008027895,0.000028675591,0.0000016806935,0.000010913775,0.000008551644,0.027111974,0.72751516,0.21824041,0.026469467,0.00019863574],"about_ca_topic_score_codex":0.0000058543437,"about_ca_topic_score_gemma":0.0000075349894,"teacher_disagreement_score":0.74720234,"about_ca_system_score_codex":0.000025281272,"about_ca_system_score_gemma":0.000025591626,"threshold_uncertainty_score":0.3549272},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00013963557,0.000034360655,0.99362516,0.0015875761,0.000028175362,0.0005234837,0.000005554003,0.00040280327,0.0036532462],"genre_scores_gemma":[0.3725432,0.0000040862024,0.6269159,0.0003322366,0.00003000609,0.00003923086,7.6086815e-7,0.0000073554,0.00012728186],"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99875087,0.00003998944,0.00018905498,0.00034505222,0.0004232948,0.0002517371],"domain_scores_gemma":[0.9986079,0.000088033165,0.00008238967,0.0010688439,0.00006226323,0.00009056807],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002571489,0.0001417507,0.00016484025,0.00005050483,0.00007863991,0.000047395173,0.0016167925,0.000030283412,0.000019357662],"category_scores_gemma":[0.000018013108,0.00007962472,0.000021696696,0.0003655838,0.00007201886,0.0003362464,0.00023504581,0.000114836585,0.000013072668],"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.00045768576,0.00030798427,0.0003529485,0.000025759626,0.00008470654,0.000008279719,0.0023405151,0.38158095,0.024239052,0.35229713,0.12605971,0.11224529],"study_design_scores_gemma":[0.0012347098,0.00071154843,0.0010939026,0.00015610617,0.000023904611,0.00002291049,0.00018435439,0.21301584,0.70423007,0.0055544223,0.07283713,0.0009350766],"about_ca_topic_score_codex":0.0000040531163,"about_ca_topic_score_gemma":0.00001697122,"teacher_disagreement_score":0.67999107,"about_ca_system_score_codex":0.00003934741,"about_ca_system_score_gemma":0.000049194998,"threshold_uncertainty_score":0.32470018},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00618652,0.000021851276,0.99243337,0.00015230762,0.00007864742,0.00038662378,0.000020883082,0.0003852012,0.00033462472],"genre_scores_gemma":[0.4896552,0.0000014805631,0.51024663,0.00002514584,0.00002477876,0.000020640846,0.0000041999897,0.0000035803048,0.00001837042],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99917954,0.00002330207,0.00027630504,0.00021603546,0.00016306166,0.00014177227],"domain_scores_gemma":[0.9992625,0.000093020535,0.00015347474,0.00037959832,0.000079525336,0.000031893014],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013710008,0.000083558094,0.00014993176,0.000085978776,0.000050627208,0.00003542902,0.00051285565,0.000026419011,0.000026209396],"category_scores_gemma":[0.000013767128,0.00006754586,0.000045037483,0.000121930236,0.00001113707,0.000471576,0.0001413959,0.000029459416,0.0000018780056],"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.000010581143,0.00000812713,0.00005764645,0.00005944314,0.000008469378,4.955001e-7,0.000106749365,0.0000070168676,0.08488019,0.61506903,0.0030674743,0.29672477],"study_design_scores_gemma":[0.00054835127,0.00006737034,0.0005134933,0.000025920252,0.000004182815,0.0000067289884,0.0001710698,0.026455613,0.9677172,0.0021805328,0.0022036077,0.000105957406],"about_ca_topic_score_codex":0.000031933992,"about_ca_topic_score_gemma":0.000044445405,"teacher_disagreement_score":0.882837,"about_ca_system_score_codex":0.00003686824,"about_ca_system_score_gemma":0.000024248506,"threshold_uncertainty_score":0.275444},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0060089193,0.000047274454,0.990965,0.0017174359,0.00016984351,0.0007489709,0.000010026122,0.00019430068,0.0001382077],"genre_scores_gemma":[0.40185887,0.000081998114,0.5963366,0.0011218924,0.00008675055,0.00013017606,0.00001337543,0.000012795652,0.00035755162],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988626,0.00013497016,0.00035875267,0.00025575483,0.00020758178,0.00018033841],"domain_scores_gemma":[0.99850166,0.00024248465,0.00026758254,0.0007844245,0.00017524001,0.000028638879],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000484823,0.00012135243,0.00013470532,0.00006221077,0.00028981827,0.00010719728,0.0011709782,0.000044695378,0.00001538851],"category_scores_gemma":[0.00020919292,0.000066307315,0.000078975405,0.00033137752,0.000047380774,0.0008153937,0.00037100894,0.00006113223,0.0000029867945],"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.000022190443,0.00007114666,0.00013151618,0.000041187297,0.000017478944,2.0112044e-7,0.0005824265,0.023253497,0.4120926,0.46131954,0.011876963,0.09059127],"study_design_scores_gemma":[0.00025442571,0.0000085053925,0.00009947806,0.000032102136,0.000003613945,0.000001319907,0.000007103465,0.5548338,0.43569183,0.0029692915,0.0060261595,0.00007236279],"about_ca_topic_score_codex":0.000014002504,"about_ca_topic_score_gemma":0.000019139274,"teacher_disagreement_score":0.5315803,"about_ca_system_score_codex":0.000047420024,"about_ca_system_score_gemma":0.000031030726,"threshold_uncertainty_score":0.27039337},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0019638976,0.00013244184,0.9632761,0.00012965978,0.00005282045,0.00009238562,0.0000012121826,0.000493547,0.03385795],"genre_scores_gemma":[0.3480254,0.000037640046,0.6491624,0.00046550104,0.000012543918,0.000009443246,0.0000012248248,0.000008790857,0.0022770131],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99923575,0.000039874478,0.00012517022,0.00030018672,0.000118930155,0.0001800959],"domain_scores_gemma":[0.9993186,0.0001030271,0.000038491824,0.0004409639,0.000025573492,0.00007334755],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014550312,0.0000959992,0.00010348374,0.000059068214,0.000108785665,0.000115116505,0.0003397146,0.00003499826,0.00006919089],"category_scores_gemma":[0.000056109016,0.000081344326,0.000015679805,0.00014035008,0.000025883102,0.00059364224,0.00024918866,0.00008350328,0.000031690884],"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.000007028398,0.00009679951,0.0011115458,0.000039192197,0.000021379934,0.0000657447,0.00038255562,0.000047896243,0.1637709,0.6954712,0.053199347,0.085786395],"study_design_scores_gemma":[0.0005062792,0.00008889484,0.00017601857,0.00008272626,0.0000045963966,0.00019577125,0.00000815268,0.03881055,0.82099617,0.043369588,0.09520002,0.0005612596],"about_ca_topic_score_codex":0.0000026469736,"about_ca_topic_score_gemma":2.0766416e-7,"teacher_disagreement_score":0.65722525,"about_ca_system_score_codex":0.00001067265,"about_ca_system_score_gemma":0.000012580771,"threshold_uncertainty_score":0.33171254},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00029799528,0.0004413945,0.9955083,0.000048277983,0.0010854418,0.0005773409,0.00003587272,0.00027624558,0.0017291124],"genre_scores_gemma":[0.19910638,0.00012936989,0.80031425,0.0002164818,0.00012462103,0.000005263477,0.000026556138,0.000047379963,0.000029703424],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9952463,0.00008567,0.0009840433,0.0017151972,0.0013255965,0.00064322207],"domain_scores_gemma":[0.99537057,0.00041156597,0.0010652193,0.0024149213,0.0005421137,0.00019563492],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00066776125,0.0006991135,0.00088863587,0.001042074,0.00024156155,0.00025580017,0.004238919,0.00041244063,0.000045844903],"category_scores_gemma":[0.000073137395,0.00064055447,0.0001674851,0.0005195343,0.0010959395,0.0015237733,0.00328023,0.0008239847,0.000014367105],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003437495,0.00009069644,0.00018325861,0.00012804878,0.000014393166,0.000094229945,0.00065758306,0.0048993514,0.020008242,0.011200577,0.000014263616,0.962675],"study_design_scores_gemma":[0.0004444405,0.0002171098,0.0005438029,0.002327847,0.00001783095,0.00009745166,2.5309674e-7,0.6118909,0.122084446,0.2604279,0.0008002571,0.0011477346],"about_ca_topic_score_codex":0.00013178874,"about_ca_topic_score_gemma":0.000036030036,"teacher_disagreement_score":0.9615272,"about_ca_system_score_codex":0.00028834995,"about_ca_system_score_gemma":0.00038502258,"threshold_uncertainty_score":0.9996046},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000002782484,0.00015634541,0.85432756,0.00238928,0.0026933455,0.0006271676,0.00018872628,0.00017649881,0.13943827],"genre_scores_gemma":[0.042795826,0.020961443,0.8612207,0.024571449,0.0030673586,0.0006194671,0.0016679182,0.00015029601,0.044945516],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99719286,0.000019892697,0.000767409,0.00068644056,0.0010156165,0.000317762],"domain_scores_gemma":[0.9970168,0.00030475098,0.0005453117,0.0014321638,0.0006189929,0.0000820007],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009857384,0.00035996418,0.00036056776,0.0006339278,0.00061184465,0.00065106526,0.0050916825,0.00010082942,0.00001219649],"category_scores_gemma":[0.00009069014,0.0002635547,0.000052282787,0.00021813848,0.0009246197,0.010936553,0.0057032546,0.00035375374,0.000023285935],"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.000043202213,0.000014438812,0.0000065406944,0.00003997068,0.000037744518,0.0000043499786,0.0010496624,0.00014226855,0.0000045450925,0.65778285,0.023572735,0.31730166],"study_design_scores_gemma":[0.00033670437,0.00012930416,0.000073727606,0.0005384334,0.000005222986,0.0000654345,0.00012094957,0.06984053,0.000043071308,0.030512474,0.89796895,0.00036518785],"about_ca_topic_score_codex":0.0000025815839,"about_ca_topic_score_gemma":0.000008508762,"teacher_disagreement_score":0.8743962,"about_ca_system_score_codex":0.00020585692,"about_ca_system_score_gemma":0.00009511006,"threshold_uncertainty_score":0.99998164},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13566934,0.0000039952106,0.8604945,0.0000053302324,0.000075478,0.00008804048,0.000017049602,0.00062651624,0.003019732],"genre_scores_gemma":[0.9458419,0.00004347589,0.053711098,0.00004126688,0.000017341172,2.7571485e-7,0.000008965699,0.000012294279,0.0003233853],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987699,0.0000860787,0.00014778775,0.000589443,0.00007544995,0.0003313906],"domain_scores_gemma":[0.9986068,0.00007247752,0.00015194555,0.0009155796,0.000103368286,0.0001498343],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012836873,0.00017458905,0.000181576,0.00009458006,0.00023242849,0.00004769827,0.0012669282,0.000084452,0.00007682349],"category_scores_gemma":[0.000027732445,0.00019161993,0.000070006616,0.0006897601,0.00011798187,0.0012543959,0.00086824095,0.00016076375,0.00006888719],"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.00007279848,0.00023958023,0.041566823,0.000031452775,0.00006339381,0.0006803334,0.00059023855,0.006175066,0.004919852,0.9415799,0.0013439142,0.0027366455],"study_design_scores_gemma":[0.00080299086,0.00007891136,0.004848932,0.00015502183,0.00005413138,0.0000669258,0.00019990784,0.87627584,0.037520897,0.07480895,0.004163166,0.001024358],"about_ca_topic_score_codex":0.00027218185,"about_ca_topic_score_gemma":0.000009627438,"teacher_disagreement_score":0.87010074,"about_ca_system_score_codex":0.00011921814,"about_ca_system_score_gemma":0.000041854557,"threshold_uncertainty_score":0.7814034},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005131832,0.000056109355,0.9911123,0.00045367138,0.00006533433,0.00037217612,0.000004648142,0.00020765392,0.0025962777],"genre_scores_gemma":[0.24075475,0.000013461265,0.75899816,0.00010692511,0.00003142735,0.000035622325,0.0000026072755,0.00000515668,0.00005187057],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9982313,0.0003759046,0.0003335535,0.00038283464,0.00048200446,0.0001944107],"domain_scores_gemma":[0.9980716,0.0008676632,0.00014582634,0.0005866407,0.00028917033,0.000039062597],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028294907,0.00011278571,0.00021665219,0.00022566573,0.000032396583,0.000019962852,0.00071166956,0.000073266216,0.00006593052],"category_scores_gemma":[0.0011321941,0.00010057532,0.000030440742,0.0005188686,0.000042538974,0.0008499587,0.00036656784,0.00014880857,0.000012975831],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005575425,0.000090983965,0.0014235007,0.0000048922884,0.000004580762,0.000002239389,0.00034404334,0.0005940649,0.024255918,0.00856766,0.0003783566,0.96432817],"study_design_scores_gemma":[0.0003295839,0.00006144247,0.0044150734,0.000026579573,0.000004336002,0.000009359294,0.000028288847,0.44188762,0.5366937,0.016050301,0.00038014297,0.0001135744],"about_ca_topic_score_codex":0.00007591469,"about_ca_topic_score_gemma":0.00005758792,"teacher_disagreement_score":0.9642146,"about_ca_system_score_codex":0.00014649045,"about_ca_system_score_gemma":0.00008278779,"threshold_uncertainty_score":0.41013426},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000013830908,0.00040771943,0.9967418,0.0016154315,0.00007940699,0.00041503782,0.000041877352,0.000117352436,0.00058001274],"genre_scores_gemma":[0.036390793,0.00004917426,0.962333,0.0009489766,0.000052052936,0.000048979728,0.000024036428,0.0000065362624,0.00014639714],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99893117,0.00004918838,0.00018683255,0.0003028316,0.00030121885,0.00022876676],"domain_scores_gemma":[0.9978831,0.0005755698,0.00008997807,0.0012038185,0.00016496298,0.00008261819],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00051972846,0.000087607405,0.00009764448,0.000090475594,0.00032509642,0.00006387216,0.002954422,0.000047567006,0.000058154983],"category_scores_gemma":[0.00006978147,0.000057650024,0.000023178496,0.00040084202,0.000062219275,0.00071740366,0.0005773922,0.00008905759,0.0000043078567],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000053540816,0.00004141027,0.00008548343,0.000009312338,0.000026544898,0.0000011023008,0.000042593387,0.009913393,0.0002960596,0.1560853,0.7845465,0.048946947],"study_design_scores_gemma":[0.00009551639,0.000018012031,0.00006957102,0.000020475638,0.0000018273054,0.0000025909023,0.0000011749374,0.88749903,0.00026745547,0.015506188,0.09644553,0.00007262509],"about_ca_topic_score_codex":0.0020431492,"about_ca_topic_score_gemma":0.002331996,"teacher_disagreement_score":0.87758565,"about_ca_system_score_codex":0.000022986671,"about_ca_system_score_gemma":0.00008683723,"threshold_uncertainty_score":0.54901004},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00018294874,0.000015725078,0.9978937,0.00008102926,0.00005758172,0.0000873926,0.00000324807,0.00015475869,0.001523609],"genre_scores_gemma":[0.032043483,0.000012646311,0.9677849,0.00008282284,0.0000048310158,0.00001623094,0.0000027867104,0.0000030998965,0.000049238653],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99940556,0.000028719542,0.00016202002,0.00015445762,0.00013502903,0.000114219474],"domain_scores_gemma":[0.9994852,0.000027721488,0.00006306589,0.00035274416,0.000032420037,0.000038840077],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000107595704,0.000055719684,0.00007395991,0.00005796169,0.000024974092,0.000016486363,0.00034592478,0.00001577451,0.00014569354],"category_scores_gemma":[0.000010946231,0.000048391397,0.000019159097,0.00013702309,0.000012192982,0.00045237073,0.000119070006,0.000031767526,0.000006011136],"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":[3.9502405e-7,0.000020897358,0.00013037355,0.00000590992,0.000005113675,0.0000049842597,0.00022086749,0.000011498885,0.008564525,0.1470058,0.0021264409,0.8419032],"study_design_scores_gemma":[0.00040571782,0.00008730187,0.0005692135,0.000015056284,0.0000018303341,0.000021497,0.0001644486,0.0113988295,0.9121766,0.054059036,0.020901151,0.00019931799],"about_ca_topic_score_codex":0.00003070798,"about_ca_topic_score_gemma":0.000006853801,"teacher_disagreement_score":0.9036121,"about_ca_system_score_codex":0.000010609031,"about_ca_system_score_gemma":0.000021968843,"threshold_uncertainty_score":0.1973344},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0027785453,0.000083914645,0.9952122,0.000048059446,0.0005670434,0.00040914034,0.0000081787575,0.0007247306,0.00016821022],"genre_scores_gemma":[0.059970647,0.0000081439175,0.9392245,0.00014860468,0.000058932703,0.00014090494,0.0000051565394,0.000017381204,0.0004257685],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9986218,0.000053729098,0.00023732397,0.0005022124,0.00022446293,0.00036044122],"domain_scores_gemma":[0.9985268,0.00029283803,0.00007607772,0.0008200083,0.00014477124,0.00013951142],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024993802,0.0001857042,0.00017031688,0.000106565516,0.00013844772,0.00009600159,0.00086273707,0.00007857052,0.000040584186],"category_scores_gemma":[0.00018075203,0.00016180125,0.00008702973,0.00018656996,0.000028446406,0.0009184793,0.00018079705,0.000110926034,0.00002407339],"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.0002265686,0.002754616,0.024475474,0.00032952742,0.00016444644,0.0001405876,0.0008759322,0.022150606,0.33741933,0.029442275,0.06692789,0.51509273],"study_design_scores_gemma":[0.0010328908,0.00006644144,0.00059862935,0.00003433879,0.0000038164712,0.00000237918,0.000011370598,0.41291848,0.5707471,0.00020607107,0.014088261,0.0002902674],"about_ca_topic_score_codex":0.000008743132,"about_ca_topic_score_gemma":0.0000011548927,"teacher_disagreement_score":0.51480246,"about_ca_system_score_codex":0.000047271726,"about_ca_system_score_gemma":0.0000638647,"threshold_uncertainty_score":0.6598064},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0009849345,0.000028365244,0.9960295,0.0005037502,0.000047496487,0.00019132478,0.000025188692,0.00036863761,0.0018207774],"genre_scores_gemma":[0.2782724,0.000008167853,0.7212081,0.00033090846,0.000007968022,0.000019495197,0.000014762124,0.0000066161956,0.00013159993],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9989575,0.000054616125,0.00026397934,0.0002776674,0.00028081087,0.00016539983],"domain_scores_gemma":[0.99893725,0.00006449636,0.0001347813,0.00069661275,0.00011031712,0.0000565644],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.000088211586,0.00010645433,0.00013812992,0.00010336013,0.00005868286,0.00003952571,0.0006633824,0.000031643463,0.0013728671],"category_scores_gemma":[0.000012803889,0.00008730931,0.000042904965,0.00020792735,0.00003274411,0.0007669292,0.00029537585,0.00006732903,0.000031891333],"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.00000783563,0.00026211792,0.00042586433,0.000067794026,0.0000118683265,0.000016044325,0.00049090246,0.000017034878,0.32157764,0.018341454,0.17295375,0.48582768],"study_design_scores_gemma":[0.00053628336,0.00007551641,0.0010180239,0.00003840492,0.0000025220818,0.0000028593379,0.000037895123,0.15056852,0.8346794,0.0010152681,0.011860099,0.00016516354],"about_ca_topic_score_codex":0.000030729556,"about_ca_topic_score_gemma":0.000004052576,"teacher_disagreement_score":0.5131018,"about_ca_system_score_codex":0.000019473524,"about_ca_system_score_gemma":0.0000113259275,"threshold_uncertainty_score":0.99954003},"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":"codex-gemma-dda1882f352a","genre_candidate":"review","genre_consensus":"review","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[1.7799014e-11,0.57119656,0.42573377,0.00002192009,0.00013785205,0.0010740338,0.00012930369,0.0007095625,0.0009969659],"genre_scores_gemma":[1.2970667e-9,0.7443894,0.25470072,0.00014436626,0.00005928224,0.000044564487,0.00055248215,0.00003436338,0.000074801756],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99523896,0.0004893627,0.0017620152,0.0014749138,0.00066138053,0.00037334993],"domain_scores_gemma":[0.98785925,0.00032330322,0.0015223938,0.009955059,0.00018705834,0.00015292937],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":["open_science"],"category_scores_codex":[0.0007724368,0.00068596995,0.0029471896,0.00035227623,0.00007188621,0.00006174844,0.0131157795,0.0002349839,0.00020272956],"category_scores_gemma":[0.00023592472,0.0004633156,0.00038162826,0.0009942688,0.00009914435,0.0012128907,0.011491135,0.0007038157,0.00008142816],"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":[1.0152185e-7,0.00006107267,8.187364e-9,0.10500069,0.000009101432,0.0000020443586,8.3437436e-7,3.4113739e-9,2.3949613e-7,0.0016648636,0.21205826,0.68120277],"study_design_scores_gemma":[0.000017177785,0.00001895214,3.0997929e-9,0.371367,0.000076448305,0.000025811049,5.7505904e-8,0.00013075683,0.000037523216,0.0001575876,0.6278638,0.00030483774],"about_ca_topic_score_codex":0.000004190897,"about_ca_topic_score_gemma":1.1891798e-7,"teacher_disagreement_score":0.68089795,"about_ca_system_score_codex":0.00006844197,"about_ca_system_score_gemma":0.00018440542,"threshold_uncertainty_score":0.99978185},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0005126444,0.00003478068,0.96404207,0.00008351734,0.0002192394,0.00015591439,0.0000030574513,0.0010468765,0.033901904],"genre_scores_gemma":[0.09004869,0.000015445217,0.9068398,0.00080626213,0.000010077519,0.000015508622,0.0000014561265,0.000008936461,0.0022538106],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99881077,0.00006677269,0.0001958013,0.00041660492,0.0002418181,0.0002682418],"domain_scores_gemma":[0.99854434,0.000110461595,0.000059747632,0.0011079784,0.00006756071,0.00010989874],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001919108,0.0001357208,0.00013299262,0.00007986161,0.000084679035,0.00008824188,0.0010442948,0.000055677934,0.00016008256],"category_scores_gemma":[0.000067723624,0.000111535024,0.0000417514,0.00028620346,0.000030440393,0.00063595903,0.00028756395,0.00011863361,0.0003139814],"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.00000557893,0.00021993835,0.0002428227,0.000011055067,0.000011693959,0.00006870053,0.00013162728,0.00006470856,0.16842401,0.5796079,0.13501365,0.116198316],"study_design_scores_gemma":[0.0001722815,0.000023965573,0.000032325108,0.000006557678,8.399802e-7,0.000012470091,0.0000066497923,0.004825158,0.7957584,0.011069138,0.18791477,0.00017737926],"about_ca_topic_score_codex":0.000009061283,"about_ca_topic_score_gemma":0.0000026091,"teacher_disagreement_score":0.6273345,"about_ca_system_score_codex":0.000024133245,"about_ca_system_score_gemma":0.000035090932,"threshold_uncertainty_score":0.45482662},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.022775194,0.000053697055,0.97657543,0.00006639603,0.000061272025,0.00007629233,0.000006300944,0.00019594321,0.00018947877],"genre_scores_gemma":[0.41706195,0.000013067888,0.5828277,0.000047612055,0.000009008549,3.807855e-7,0.0000017077872,0.000003287803,0.000035318022],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99932814,0.000024956526,0.0001785766,0.00019974477,0.00015068409,0.0001178957],"domain_scores_gemma":[0.999355,0.00003180332,0.000096596574,0.000444183,0.000038541235,0.000033836368],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000030596562,0.00007904949,0.00011091259,0.000068216046,0.000030171253,0.00003077488,0.00042236687,0.000038109985,0.000100908444],"category_scores_gemma":[0.000023796527,0.00006454802,0.000029009068,0.0003174172,0.00002783092,0.0005600729,0.00011630779,0.000061487044,0.0000022231745],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014581258,0.0002735525,0.0015910969,0.0000644812,0.000037902075,0.000022402455,0.0009949642,0.046721436,0.34239224,0.26748472,0.004249942,0.33615267],"study_design_scores_gemma":[0.00007199415,0.00003695665,0.000034134144,0.0000131838,0.0000018634654,0.0000069675275,0.0000027553929,0.67793,0.31282884,0.0088376235,0.0001612789,0.00007444633],"about_ca_topic_score_codex":0.00002179914,"about_ca_topic_score_gemma":0.000002555407,"teacher_disagreement_score":0.63120854,"about_ca_system_score_codex":0.000014886349,"about_ca_system_score_gemma":0.000004703079,"threshold_uncertainty_score":0.26321918},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00021464299,0.0000431029,0.9931852,0.00020470818,0.00008037513,0.0002544156,0.0000030990595,0.0005161389,0.0054982747],"genre_scores_gemma":[0.04409633,0.00003363531,0.95496523,0.00016464606,0.000010929124,0.000040192648,0.0000034440443,0.000010475854,0.0006751056],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9990983,0.000034400702,0.00016446487,0.00034051194,0.00013499896,0.00022731315],"domain_scores_gemma":[0.9992283,0.000120701996,0.000045121626,0.00045370235,0.00006518456,0.00008699166],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021071981,0.00010977371,0.0001229939,0.00005936104,0.00014052089,0.000094860006,0.00055456883,0.000044648757,0.000046957495],"category_scores_gemma":[0.0000305727,0.0000878764,0.000047737398,0.0001595903,0.0000235646,0.0008002055,0.000060387425,0.00006768562,0.000006227245],"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.000010814661,0.00008391812,0.000025046793,0.000047667487,0.0000052854225,0.000007002908,0.00011626356,0.000045957113,0.17422335,0.62905556,0.02206108,0.17431806],"study_design_scores_gemma":[0.00037718267,0.000049526043,0.000013839375,0.000039069662,0.000002168907,0.000010735587,0.000010993623,0.05249239,0.8414257,0.020326205,0.085039325,0.00021286288],"about_ca_topic_score_codex":0.000002172119,"about_ca_topic_score_gemma":5.656273e-7,"teacher_disagreement_score":0.66720235,"about_ca_system_score_codex":0.000018916673,"about_ca_system_score_gemma":0.00002724715,"threshold_uncertainty_score":0.35834956},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00049167575,0.000010709387,0.99373364,0.0000667779,0.0001956196,0.00044682965,0.000016783191,0.00073546293,0.004302494],"genre_scores_gemma":[0.062448747,0.000008791393,0.9360696,0.0005897784,0.000020702444,0.000060530554,0.0000140409475,0.000018801387,0.00076899154],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985586,0.00010499266,0.00024330869,0.00057496724,0.00012628303,0.00039186908],"domain_scores_gemma":[0.99830127,0.00021663448,0.000093341936,0.001107287,0.0001340353,0.00014745163],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00063528924,0.0001753146,0.00018547478,0.00008004067,0.00018905086,0.00024833536,0.000992563,0.000074039635,0.000043090105],"category_scores_gemma":[0.00009681702,0.0001563765,0.000040001993,0.00020171439,0.000024770705,0.0018532057,0.00014055471,0.00010354715,0.000010098476],"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.000014436082,0.00009240802,0.000012630441,0.000018277702,0.0000085200045,0.0000024201706,0.00005136451,0.00055423944,0.36118013,0.6274576,0.0035717683,0.0070362114],"study_design_scores_gemma":[0.00038101853,0.00009402468,0.0000033356139,0.000010398749,0.000003468976,0.000007308116,0.000029811517,0.58979136,0.30009454,0.096508145,0.012820111,0.00025650876],"about_ca_topic_score_codex":0.000060088743,"about_ca_topic_score_gemma":0.000013878313,"teacher_disagreement_score":0.5892371,"about_ca_system_score_codex":0.00005444251,"about_ca_system_score_gemma":0.000084641135,"threshold_uncertainty_score":0.6376848},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0016312018,0.000066591936,0.98797685,0.0045561306,0.00009351223,0.00016675938,0.0000012324207,0.00043392502,0.0050737723],"genre_scores_gemma":[0.6443102,0.0000066948696,0.3515754,0.003287691,0.000020006306,0.000028621922,7.3725846e-7,0.000009091784,0.000761599],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99891645,0.00009986055,0.00019068067,0.00029835917,0.0002374553,0.00025716907],"domain_scores_gemma":[0.9986845,0.0003068794,0.000056043144,0.00087433634,0.000030240815,0.00004795436],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029952062,0.0001044399,0.000106191575,0.00010287267,0.00007260791,0.000094085284,0.001196947,0.00004031645,0.00017300884],"category_scores_gemma":[0.00013959326,0.00006682049,0.000030992287,0.00043007376,0.00003270898,0.0005487274,0.00036085403,0.00018644468,0.00013153722],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000027745076,0.0008399879,0.0071324115,0.000050848197,0.000022050732,0.00019644378,0.0025932712,0.00059601123,0.0048337867,0.58451426,0.10976536,0.28942785],"study_design_scores_gemma":[0.00051910616,0.000049833183,0.0057930015,0.000079633566,0.0000018643008,0.000008150747,0.000022094795,0.9206538,0.013078904,0.00906815,0.050419763,0.000305663],"about_ca_topic_score_codex":0.000031555188,"about_ca_topic_score_gemma":0.000019365396,"teacher_disagreement_score":0.92005783,"about_ca_system_score_codex":0.000031529686,"about_ca_system_score_gemma":0.000012086972,"threshold_uncertainty_score":0.27248603},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00053632876,0.000025208054,0.9963894,0.00040187172,0.00016448458,0.0008289837,0.000022411397,0.0012018468,0.00042946584],"genre_scores_gemma":[0.04458269,0.0000023526134,0.95440257,0.00052133744,0.00012623676,0.00023435328,0.0000113604165,0.000027386812,0.000091738315],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99842435,0.000062626146,0.0003108197,0.000552049,0.0002255987,0.0004245427],"domain_scores_gemma":[0.99871546,0.00014780466,0.00012508426,0.0007906299,0.000119619275,0.000101411846],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019213659,0.00023104751,0.00022848079,0.0002076298,0.00029060655,0.00020636093,0.000829338,0.0001055801,0.00019956697],"category_scores_gemma":[0.00010959226,0.00020635485,0.00008702928,0.0004690691,0.000050692473,0.0006805105,0.00034152644,0.00018549606,0.0000064602214],"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.00005030238,0.00016772916,0.000050191404,0.000098958706,0.000019501587,0.000021478721,0.00022514595,0.03653634,0.84806937,0.0062582116,0.004002661,0.10450013],"study_design_scores_gemma":[0.0005393757,0.00008993099,0.000008805639,0.0001337934,0.0000047795097,0.000030280315,0.000005004595,0.51387686,0.4707646,0.0030268407,0.011190456,0.00032926153],"about_ca_topic_score_codex":0.000016555086,"about_ca_topic_score_gemma":0.00000763669,"teacher_disagreement_score":0.47734052,"about_ca_system_score_codex":0.000048504473,"about_ca_system_score_gemma":0.000030274741,"threshold_uncertainty_score":0.8414906},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00654055,0.0000036964357,0.9914659,0.00060169515,0.000029814199,0.00029776216,0.000010185502,0.00009271306,0.0009576772],"genre_scores_gemma":[0.4344995,0.0000037543496,0.5649304,0.000244717,0.000011433183,0.000018977733,0.0000020557716,0.0000040461337,0.00028514507],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99934065,0.000031608342,0.00021339419,0.00015147892,0.000170127,0.00009271276],"domain_scores_gemma":[0.99821997,0.0010050518,0.00014503565,0.0004966504,0.00011475564,0.000018564886],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001745798,0.000064812,0.00010339974,0.000060451766,0.000041410993,0.000023735181,0.00047697,0.000027026741,0.000016483315],"category_scores_gemma":[0.00015875127,0.00004154662,0.00003826755,0.000083602084,0.000031576925,0.00038138893,0.00008420362,0.000042765998,0.0000017948735],"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.000021691729,0.000039949697,0.000008025199,0.000014659206,0.000005370782,1.8541552e-7,0.00014214154,0.00023374721,0.13501309,0.76121694,0.010983334,0.092320845],"study_design_scores_gemma":[0.00015174584,0.000080873266,0.000057061723,0.000043977383,0.0000017036365,5.3195663e-7,0.000006993737,0.082439594,0.89007163,0.018775387,0.008312836,0.000057681067],"about_ca_topic_score_codex":0.0000074570908,"about_ca_topic_score_gemma":0.000004983786,"teacher_disagreement_score":0.7550585,"about_ca_system_score_codex":0.0000136219405,"about_ca_system_score_gemma":0.00001546912,"threshold_uncertainty_score":0.1694222},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0007145147,0.000047559275,0.99482757,0.00038179063,0.0001718972,0.00025303158,5.3255604e-7,0.0007923117,0.0028108049],"genre_scores_gemma":[0.24057375,0.000014561184,0.758269,0.000364888,0.000038369177,0.000027614318,0.0000024731676,0.000012737413,0.00069662684],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987515,0.000049109512,0.0002591176,0.0004436129,0.0001945165,0.00030214473],"domain_scores_gemma":[0.99880576,0.000054674965,0.000104059545,0.00081830216,0.00012724227,0.00008996018],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022423487,0.00016129426,0.00014259631,0.00013436048,0.00011748773,0.00020600593,0.0008996752,0.00006246534,0.00013994226],"category_scores_gemma":[0.000048185717,0.00013374246,0.00004733816,0.00040815573,0.00004096408,0.0015628766,0.00049398636,0.00016396976,0.00012370809],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006407553,0.0003027798,0.00014439053,0.00003203253,0.00002538196,0.000036370435,0.00074597524,0.001708212,0.061127376,0.0491821,0.013533827,0.8731552],"study_design_scores_gemma":[0.000114642906,0.00004763286,0.00001848813,0.000054135784,0.0000027216313,0.000016511263,0.000018794188,0.93042207,0.0533828,0.0017815987,0.013913404,0.00022720727],"about_ca_topic_score_codex":0.00002274382,"about_ca_topic_score_gemma":0.0000014159571,"teacher_disagreement_score":0.92871386,"about_ca_system_score_codex":0.00006447751,"about_ca_system_score_gemma":0.000013874082,"threshold_uncertainty_score":0.54538596},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00003058898,0.00006497946,0.9964506,0.0009448868,0.00021713955,0.0002837291,0.00001297417,0.00089073816,0.0011043315],"genre_scores_gemma":[0.109313086,0.000008571153,0.8886741,0.0007196308,0.000052994077,0.000084767045,0.000002734457,0.000010809594,0.0011333119],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989052,0.000012692492,0.0002167982,0.00042770224,0.00016242119,0.00027521455],"domain_scores_gemma":[0.99856764,0.0004293639,0.00007115575,0.00075543113,0.00008094458,0.000095443436],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00008828087,0.00013233033,0.00013009379,0.000077117824,0.00007352028,0.00009977058,0.0011490514,0.0000853822,0.00017368582],"category_scores_gemma":[0.00034764697,0.000112836606,0.000062266576,0.0001764222,0.000041318744,0.0006402625,0.0004979094,0.00013186682,0.00011746016],"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.000003517558,0.0001501505,0.000019224553,0.0000071275526,0.0000063225357,0.0000012975169,0.00014918894,0.000018859657,0.0024381003,0.85677105,0.0342269,0.10620825],"study_design_scores_gemma":[0.00028449853,0.00006861794,0.00007341155,0.00005767662,0.0000020567793,0.000010898476,0.000006809999,0.86862904,0.019022549,0.027985303,0.08363576,0.000223387],"about_ca_topic_score_codex":0.000015578004,"about_ca_topic_score_gemma":0.0000027048513,"teacher_disagreement_score":0.86861014,"about_ca_system_score_codex":0.000034720262,"about_ca_system_score_gemma":0.0000047385442,"threshold_uncertainty_score":0.46013433},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03773621,0.000055849818,0.9586165,0.00073629705,0.000059613394,0.00043665286,0.0000037558361,0.00022996624,0.0021251605],"genre_scores_gemma":[0.29591694,0.00001213131,0.70354015,0.00014858486,0.00007278946,0.00011993185,7.131284e-7,0.000007333004,0.00018143393],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989594,0.000039116305,0.00029877454,0.00031804977,0.00021529109,0.00016934206],"domain_scores_gemma":[0.9989622,0.0001520854,0.00014883325,0.00060635025,0.00007629681,0.000054230746],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030504074,0.00009384441,0.00011656456,0.00009347112,0.00020890472,0.000078262536,0.00049275294,0.000029686227,0.00003003615],"category_scores_gemma":[0.000087545035,0.000067962166,0.000020103293,0.00040782368,0.00006739377,0.0002671379,0.000493006,0.0000964048,0.000006854601],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000021313087,0.00003944577,0.00007567246,0.000025059066,0.000005948957,7.203391e-7,0.0011642633,0.00047512617,0.024957797,0.055825442,0.0015927048,0.9158357],"study_design_scores_gemma":[0.0003079958,0.00012364355,0.00036551515,0.00023090685,0.000008524542,0.00018090718,0.00085735216,0.5163007,0.4593981,0.012561282,0.009208347,0.00045676346],"about_ca_topic_score_codex":0.000013354895,"about_ca_topic_score_gemma":0.0000013964924,"teacher_disagreement_score":0.9153789,"about_ca_system_score_codex":0.000020921354,"about_ca_system_score_gemma":0.0000062957806,"threshold_uncertainty_score":0.27714166},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017139295,0.000004800338,0.9768478,0.0002674194,0.00007940595,0.00048239622,0.0000013516301,0.00028775504,0.0048897467],"genre_scores_gemma":[0.50255364,2.3596921e-7,0.4972349,0.00011139391,0.000014285543,0.000013714099,3.5585305e-7,0.0000029767866,0.00006846612],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99838394,0.00055321207,0.0002511884,0.00033487237,0.0003268777,0.00014993377],"domain_scores_gemma":[0.99867046,0.00024094275,0.00016157002,0.0007983296,0.00008916166,0.000039543873],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030609863,0.00013405072,0.0002060197,0.00009527606,0.00014628438,0.000038819173,0.0010325718,0.000029824458,0.000053596472],"category_scores_gemma":[0.000025657935,0.00007929794,0.000049553866,0.00047113697,0.000042654763,0.00045983153,0.00032570143,0.00019998441,0.000007056624],"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.00021886462,0.008226894,0.0021935941,0.000022535678,0.000055753342,0.0000028199504,0.004118154,0.049941197,0.7051664,0.028593602,0.030853357,0.17060682],"study_design_scores_gemma":[0.00028966594,0.00027070937,0.004028094,0.000016256026,0.0000027331173,9.20281e-7,0.000050986804,0.41899395,0.5748113,0.00055058394,0.0009058279,0.00007896147],"about_ca_topic_score_codex":0.000020834377,"about_ca_topic_score_gemma":0.000020352769,"teacher_disagreement_score":0.48541436,"about_ca_system_score_codex":0.000050586455,"about_ca_system_score_gemma":0.000026585465,"threshold_uncertainty_score":0.3233676},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000051321225,0.00023844247,0.9987239,0.00023133025,0.00005662792,0.0003008669,0.0000040995346,0.00012011047,0.0002732949],"genre_scores_gemma":[0.027878758,0.00003976731,0.9718006,0.00016150466,0.000008048137,0.000034660385,0.000001763813,0.0000040899868,0.000070771835],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994154,0.000035016357,0.00016264882,0.00018036927,0.000104860825,0.000101702135],"domain_scores_gemma":[0.99924946,0.00030330906,0.00005425629,0.00028366048,0.00008222963,0.000027098438],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022929281,0.00006881028,0.00009712206,0.000034835248,0.00007122537,0.00003081264,0.00029593825,0.000023199902,0.000003364696],"category_scores_gemma":[0.000055889515,0.000042584652,0.000026283995,0.00012109438,0.000039384682,0.00024100306,0.000097985234,0.000036843903,8.296081e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000032567928,0.00003075707,0.00001636151,0.000008636165,0.000008656735,4.488301e-7,0.000082880855,0.00022610382,0.0006196395,0.122761294,0.0038807786,0.8723612],"study_design_scores_gemma":[0.0004086412,0.00008590964,0.00013013203,0.000012332262,0.0000042547254,0.000009358014,0.000025607942,0.9110096,0.02188206,0.054355823,0.011977802,0.00009848669],"about_ca_topic_score_codex":0.000007953624,"about_ca_topic_score_gemma":0.000001165521,"teacher_disagreement_score":0.91078347,"about_ca_system_score_codex":0.000005338446,"about_ca_system_score_gemma":0.00001891502,"threshold_uncertainty_score":0.17365517},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00039043828,0.00004703491,0.99418855,0.00063222245,0.00016425882,0.00037029976,0.000030480685,0.0011872204,0.0029894689],"genre_scores_gemma":[0.061518155,0.000004212029,0.93733704,0.00035072895,0.00008460391,0.00007996963,0.000037548187,0.000014284609,0.00057345507],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987299,0.000038348862,0.00025260064,0.00045836178,0.00021797698,0.00030284902],"domain_scores_gemma":[0.99835867,0.00033293568,0.00010946452,0.0010208683,0.00011192215,0.000066145476],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013805766,0.0001608483,0.00017862138,0.00008740149,0.00015833083,0.00016715692,0.0012626495,0.00010202037,0.000035987177],"category_scores_gemma":[0.000049847902,0.00012958075,0.00006401494,0.00024794677,0.000049972725,0.00076655997,0.0005528339,0.00014109546,0.000028464792],"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.000010866424,0.00006070397,0.000030800282,0.00001588382,0.0000022501144,0.000005088368,0.000019805952,0.000031713236,0.011115215,0.92146975,0.056228135,0.011009786],"study_design_scores_gemma":[0.0002534261,0.000044869328,0.00022285206,0.000071260845,0.0000022258744,0.000005431932,0.000008134247,0.027499676,0.1747048,0.7520447,0.044893976,0.00024863615],"about_ca_topic_score_codex":0.000031830747,"about_ca_topic_score_gemma":0.0000029380717,"teacher_disagreement_score":0.16942506,"about_ca_system_score_codex":0.000025200385,"about_ca_system_score_gemma":0.00002289383,"threshold_uncertainty_score":0.52841496},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0018864432,0.00003216029,0.99152666,0.00044941864,0.000040453553,0.0000815471,0.000004536641,0.00050039677,0.005478391],"genre_scores_gemma":[0.51916134,0.0000036503493,0.4803575,0.0003918695,0.000013147306,0.000005035354,0.0000013267716,0.0000030041408,0.00006310824],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9990939,0.000027624505,0.00021444581,0.0002623384,0.00023653309,0.00016516936],"domain_scores_gemma":[0.99894774,0.00013975978,0.00010288434,0.0006854105,0.00006733938,0.000056846347],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001433242,0.00009068988,0.00012338559,0.00009062477,0.000043763637,0.000030307694,0.00094569905,0.000036929065,0.00008552536],"category_scores_gemma":[0.000063510095,0.00007740787,0.000038419395,0.0002330647,0.000045818484,0.0008971254,0.00026476153,0.00009150718,0.00003152326],"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.000011544407,0.00015036757,0.00047563366,0.000029340212,0.000006984141,0.000013677734,0.00013435427,0.0010337244,0.42073885,0.17841996,0.010239616,0.38874596],"study_design_scores_gemma":[0.00012476504,0.000038480637,0.00013608039,0.000040171897,9.097932e-7,0.0000043901673,0.0000034621687,0.12985872,0.85891414,0.0020803947,0.0086782025,0.000120299854],"about_ca_topic_score_codex":0.000017013503,"about_ca_topic_score_gemma":0.000004272362,"teacher_disagreement_score":0.5172749,"about_ca_system_score_codex":0.000034168952,"about_ca_system_score_gemma":0.000059314854,"threshold_uncertainty_score":0.31566015},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02368652,0.00003291129,0.97030705,0.00004675648,0.00013184691,0.00076754054,0.00004695244,0.000444497,0.004535909],"genre_scores_gemma":[0.21105006,0.000017009053,0.78841466,0.000033477325,0.0000178502,0.00003546077,0.00002964733,0.000014820463,0.00038703132],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99837106,0.000117727686,0.00033836495,0.00064713036,0.00028253565,0.00024316309],"domain_scores_gemma":[0.99645245,0.00026928846,0.00015502355,0.0029329676,0.00011656784,0.000073712414],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040429842,0.00014961805,0.00027498553,0.00009941043,0.00009627024,0.000053170406,0.002479827,0.000040379906,0.00003461046],"category_scores_gemma":[0.00011859317,0.00011942142,0.000032043936,0.00023432025,0.000040582294,0.0011275436,0.001076663,0.00007742812,0.0000086584],"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.00014170774,0.007274001,0.0016782681,0.000118015174,0.00012927814,0.00007063108,0.0015756255,0.00018996114,0.5099143,0.2121582,0.21785673,0.04889327],"study_design_scores_gemma":[0.005504119,0.0022073216,0.0018119117,0.00020143825,0.00006728211,0.000072838026,0.0015325296,0.093503535,0.8378872,0.039304428,0.016315702,0.0015916479],"about_ca_topic_score_codex":0.000030018928,"about_ca_topic_score_gemma":0.0000025633751,"teacher_disagreement_score":0.32797295,"about_ca_system_score_codex":0.00001774149,"about_ca_system_score_gemma":0.000044740587,"threshold_uncertainty_score":0.4869864},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0010239223,0.00014591872,0.9964567,0.00013160055,0.00022723852,0.00015939474,0.000001116311,0.0008088778,0.00104527],"genre_scores_gemma":[0.6584719,0.000047498106,0.3408667,0.0004037274,0.00006417797,0.000006976432,0.0000064396836,0.0000110256815,0.00012158535],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989425,0.00005593799,0.00022208359,0.00033664735,0.00024040132,0.00020242229],"domain_scores_gemma":[0.99911255,0.000055677316,0.000115418465,0.000559292,0.00010184649,0.000055232056],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012746578,0.000119642995,0.00010939354,0.00008724136,0.00013262,0.00014648052,0.000567556,0.000060200604,0.00019955797],"category_scores_gemma":[0.000027656683,0.00010659547,0.000028801811,0.00039284275,0.000024336974,0.001316637,0.00022631168,0.00009552912,0.000044530152],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015692387,0.00034449284,0.00076967967,0.000038119513,0.00003282916,0.00003529568,0.0008400485,0.062277343,0.054925464,0.40047035,0.024120746,0.45612994],"study_design_scores_gemma":[0.000078156634,0.00002363272,0.00006653698,0.000028187607,0.0000018848385,0.00000798943,0.000003887655,0.99136835,0.0056552133,0.00081286894,0.0018113011,0.00014199356],"about_ca_topic_score_codex":0.000012105439,"about_ca_topic_score_gemma":0.0000033089543,"teacher_disagreement_score":0.929091,"about_ca_system_score_codex":0.00006033932,"about_ca_system_score_gemma":0.0000076636725,"threshold_uncertainty_score":0.4346837},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000048497914,0.00022427336,0.99645215,0.0007278345,0.000045087116,0.000508316,0.0000080793825,0.0013320714,0.0006537007],"genre_scores_gemma":[0.0024807383,0.000018993685,0.99567086,0.00035859214,0.000024644381,0.0002090276,0.0000044301755,0.000010732291,0.00122196],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99904823,0.000018533881,0.00016561904,0.00036779296,0.00016823728,0.00023160732],"domain_scores_gemma":[0.9991072,0.00010687345,0.000056349905,0.000571105,0.00008985415,0.00006864244],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00006985912,0.00011702179,0.000114733644,0.00005682326,0.00011602672,0.0000987317,0.00080813206,0.00004702956,0.00026068088],"category_scores_gemma":[0.00006292561,0.000088133755,0.00006298459,0.00015264447,0.00002888811,0.0010473882,0.00016164222,0.00006791511,0.000038336595],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000040878494,0.00007123621,0.0000072408056,0.000020439891,0.0000028133813,0.000009515241,0.00009457399,0.0000013624807,0.0039179404,0.0077021457,0.05906375,0.92910486],"study_design_scores_gemma":[0.0010154821,0.00037959698,0.000069412425,0.00014940552,0.000007005211,0.0000508164,0.000008162081,0.16156465,0.33869004,0.055653267,0.4417376,0.0006745725],"about_ca_topic_score_codex":5.361068e-7,"about_ca_topic_score_gemma":5.1116317e-8,"teacher_disagreement_score":0.9284303,"about_ca_system_score_codex":0.000015615895,"about_ca_system_score_gemma":0.000008241143,"threshold_uncertainty_score":0.35939902},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00013722901,0.000090666086,0.9947852,0.0014551007,0.00030045843,0.00035359658,0.000033233915,0.000879375,0.0019651467],"genre_scores_gemma":[0.010736779,0.00002966716,0.9814989,0.0026105435,0.00056685525,0.000039432707,0.000078475816,0.000016979307,0.0044223727],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983993,0.000025677262,0.00028550066,0.0006658501,0.00026260456,0.00036104117],"domain_scores_gemma":[0.9970894,0.00026377168,0.00009340091,0.002383473,0.00007413348,0.000095817086],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040050535,0.00015786398,0.0001779969,0.00006218376,0.00012790659,0.00012724419,0.0025752184,0.00006834367,0.000096698226],"category_scores_gemma":[0.00009600052,0.00012854343,0.000043879336,0.00025124717,0.000024215848,0.0012686958,0.0012431229,0.00013092901,0.00020230185],"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.000012873843,0.00006627594,0.000002721233,0.0000036797333,0.000006348303,0.0000025837123,0.00000831398,0.002282236,0.0004274186,0.06283912,0.5335154,0.400833],"study_design_scores_gemma":[0.00029687255,0.00010308264,0.000014468086,0.00003207167,0.000003654173,0.000007809581,0.0000010761709,0.45083767,0.046150267,0.077290446,0.42501688,0.00024571078],"about_ca_topic_score_codex":0.0000051307857,"about_ca_topic_score_gemma":0.000021942567,"teacher_disagreement_score":0.44855544,"about_ca_system_score_codex":0.00003042211,"about_ca_system_score_gemma":0.000025225037,"threshold_uncertainty_score":0.5241849},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.001647051,0.00036754995,0.9939939,0.000344819,0.0006631202,0.00097022223,0.00007908631,0.00061199063,0.0013222642],"genre_scores_gemma":[0.107632756,0.0005301848,0.88902557,0.00030616572,0.00010325598,0.000117960386,0.000052925116,0.00004355564,0.0021876409],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.997291,0.0000903168,0.00069973397,0.0011584935,0.00037601136,0.00038440063],"domain_scores_gemma":[0.9962519,0.00039079288,0.00056485325,0.0022643905,0.00040124246,0.00012686805],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006040087,0.00040406824,0.00068305957,0.0003030322,0.000117727446,0.00015533798,0.0020076837,0.00031762724,0.00007914822],"category_scores_gemma":[0.00023003414,0.0003394979,0.00020675444,0.00022163807,0.00008138424,0.0004881102,0.0026851078,0.00039449314,0.000008552682],"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.0001858703,0.00075415825,0.00020280584,0.0033005998,0.00017196307,0.00011609645,0.0007258447,0.0029479526,0.2668395,0.04298794,0.27128544,0.41048184],"study_design_scores_gemma":[0.0005468124,0.00013673774,0.00006698534,0.0012216159,0.000015787806,0.0000182481,0.0000061764285,0.16837262,0.7417082,0.0776505,0.009595583,0.000660733],"about_ca_topic_score_codex":0.000028232082,"about_ca_topic_score_gemma":0.000004395303,"teacher_disagreement_score":0.4748687,"about_ca_system_score_codex":0.00005491017,"about_ca_system_score_gemma":0.000070683316,"threshold_uncertainty_score":0.9999057},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0003090022,0.00015001574,0.99309725,0.00069636194,0.000080824655,0.00038905477,0.000012650278,0.00036668906,0.004898148],"genre_scores_gemma":[0.08162377,0.000031800966,0.91599405,0.00012670997,0.000021592208,0.000016191536,0.00000755365,0.000009669769,0.0021686773],"study_design_codex":"not_applicable","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9988459,0.00001726602,0.00035741366,0.00031617997,0.00023150402,0.00023173283],"domain_scores_gemma":[0.9988973,0.000109003326,0.0001299779,0.00067181187,0.00007938041,0.00011250704],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00009146506,0.00013385912,0.00029007968,0.00010293478,0.00007852072,0.000036972375,0.0010301495,0.000061224026,0.0002055845],"category_scores_gemma":[0.00002703433,0.00010346184,0.00009060403,0.00023855857,0.00003706559,0.000943987,0.00018572161,0.00009382708,0.00001823856],"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.000019672067,0.00026838112,0.00007126957,0.00007153413,0.000010202685,0.0000015032758,0.00082305336,0.000021468712,0.068164185,0.025579397,0.57515115,0.32981822],"study_design_scores_gemma":[0.00068245654,0.00021784354,0.000040580086,0.00007576575,0.0000046638243,0.000003790232,0.000031813033,0.20320481,0.6924501,0.010946314,0.092144996,0.00019683619],"about_ca_topic_score_codex":0.000018702638,"about_ca_topic_score_gemma":0.0000023919927,"teacher_disagreement_score":0.62428594,"about_ca_system_score_codex":0.000018100403,"about_ca_system_score_gemma":0.0000143439265,"threshold_uncertainty_score":0.42190513},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000063628526,0.000012209839,0.9762921,0.0007554609,0.00012470369,0.0006100278,0.00005186267,0.0009082261,0.021181816],"genre_scores_gemma":[0.117625155,0.000013899835,0.88038397,0.0014285031,0.000032715234,0.00017373389,0.000020285044,0.000016773121,0.00030496874],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986521,0.00002849527,0.00023094409,0.00046933533,0.0003018749,0.00031725393],"domain_scores_gemma":[0.99883825,0.00016652484,0.000060187045,0.0007600239,0.00006452911,0.000110513734],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00010855153,0.00018933218,0.0001810679,0.00018409884,0.00018293064,0.000097317694,0.0009798801,0.00007316176,0.00030327708],"category_scores_gemma":[0.000022929758,0.00014729043,0.00012944304,0.00025653097,0.00004760871,0.0006130073,0.0000832545,0.00012486897,0.00003711045],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006612552,0.0005154277,0.000010481109,0.00004355768,0.000007333229,0.000010903421,0.00017855663,0.00004357067,0.038301796,0.010921545,0.10849135,0.8414093],"study_design_scores_gemma":[0.00073365093,0.00024432084,0.000019026285,0.000036880716,0.0000020421096,0.0000015550822,0.0000043218474,0.7184118,0.20200792,0.0047904006,0.07351443,0.00023366617],"about_ca_topic_score_codex":0.000005618921,"about_ca_topic_score_gemma":0.000001727234,"teacher_disagreement_score":0.8411757,"about_ca_system_score_codex":0.000020841913,"about_ca_system_score_gemma":0.000008142617,"threshold_uncertainty_score":0.60063297},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0006680335,0.00019039953,0.9941661,0.0017836996,0.00028840685,0.0011822573,0.000102204576,0.0007464301,0.00087246334],"genre_scores_gemma":[0.7593718,0.00008592757,0.23808429,0.00013612906,0.00014754698,0.0019847616,0.00005365258,0.00003225278,0.00010360374],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99856526,0.00004578329,0.00037465474,0.0005790794,0.0002096445,0.0002255559],"domain_scores_gemma":[0.99864835,0.00014835708,0.00026980537,0.0006271919,0.00024517803,0.00006111948],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020903217,0.00019444874,0.00020756695,0.00036874734,0.00031266012,0.00018555218,0.0008304113,0.00016435406,0.000001745428],"category_scores_gemma":[0.00008818375,0.0001863182,0.00004588885,0.0004151383,0.000112911424,0.00028382178,0.000103597245,0.00017004374,0.000008302158],"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.0000027886092,0.00005431699,0.00005555079,0.00003561055,0.000019646543,7.428365e-7,0.000024213241,0.0003367877,0.161973,0.83553946,0.00020148535,0.0017564116],"study_design_scores_gemma":[0.0010546255,0.00018756495,0.0000444297,0.0005434355,0.000039311668,0.0006346955,0.00023740828,0.058989998,0.22764729,0.066149145,0.6435385,0.00093361986],"about_ca_topic_score_codex":0.000013149059,"about_ca_topic_score_gemma":0.000002341311,"teacher_disagreement_score":0.7693903,"about_ca_system_score_codex":0.00012262362,"about_ca_system_score_gemma":0.000034685367,"threshold_uncertainty_score":0.75978357},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0010306876,0.000028473427,0.9919667,0.0000877455,0.00014086478,0.00011741456,9.752771e-7,0.00057556166,0.006051575],"genre_scores_gemma":[0.47343308,0.000012394558,0.5263554,0.0001103218,0.0000070125016,0.0000030904625,0.0000012871776,0.0000057188604,0.00007169838],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99926275,0.000032395525,0.00015171967,0.00023107402,0.00015450997,0.00016752514],"domain_scores_gemma":[0.9994667,0.000034000073,0.00004118858,0.00036786313,0.000042205542,0.000048034828],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013519634,0.00008489795,0.000086551154,0.00007391376,0.00010651224,0.0000776681,0.000358833,0.000035602225,0.000044427943],"category_scores_gemma":[0.000038981707,0.00007433486,0.000025911375,0.00030265996,0.000018452538,0.0009804917,0.000045267283,0.0000614968,0.000010638533],"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":[8.831867e-7,0.000020563371,0.00006560346,0.0000059833683,0.0000021392507,0.0000023826806,0.000067956105,0.00014676753,0.033507187,0.9540389,0.00022465747,0.011916939],"study_design_scores_gemma":[0.0001649378,0.000029380775,0.000057336427,0.000031700016,0.000002353527,0.000020891326,0.000016016043,0.19871382,0.75888973,0.02714016,0.0147072105,0.00022642969],"about_ca_topic_score_codex":0.000008016048,"about_ca_topic_score_gemma":0.0000018488312,"teacher_disagreement_score":0.9268988,"about_ca_system_score_codex":0.0000370626,"about_ca_system_score_gemma":0.000030497908,"threshold_uncertainty_score":0.30312875},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000055236133,0.00020629766,0.90726465,0.00020668504,0.0011476921,0.00040619468,0.000037483154,0.000842871,0.08988261],"genre_scores_gemma":[0.0021827398,0.00011857406,0.98341477,0.00073794957,0.0003095931,0.000019892468,0.000011328885,0.00006168836,0.013143468],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9937106,0.00006074455,0.0008030736,0.0021124189,0.0025061693,0.0008070307],"domain_scores_gemma":[0.99473417,0.00024129562,0.0005141782,0.003588562,0.0005996813,0.0003221275],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.002027183,0.00065555004,0.0007461852,0.0011393247,0.00034773888,0.00069699134,0.008460713,0.00027863818,0.00010075018],"category_scores_gemma":[0.00007359474,0.0005975142,0.00013113892,0.0004468295,0.0011520211,0.0016507764,0.006798749,0.0009167711,0.00016459484],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006035044,0.000027355592,0.0000032326466,0.000045516506,0.0000037186824,0.000098361044,0.00011803834,0.000119703975,0.0004919838,0.32495272,0.0158651,0.6582682],"study_design_scores_gemma":[0.0005254483,0.00027195795,0.00008459888,0.0018625444,0.000005599814,0.00008838712,3.777766e-7,0.2917756,0.0027559965,0.25169638,0.44945952,0.0014735766],"about_ca_topic_score_codex":0.0000067296814,"about_ca_topic_score_gemma":0.0000049846067,"teacher_disagreement_score":0.65679467,"about_ca_system_score_codex":0.0005408809,"about_ca_system_score_gemma":0.0006764738,"threshold_uncertainty_score":0.9996476},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000061992623,0.000276903,0.9506055,0.00022273936,0.0016416948,0.000445886,0.0000108436925,0.0009167037,0.04587352],"genre_scores_gemma":[0.0029002342,0.00013330918,0.9672603,0.0010675141,0.0004885118,0.000025927131,0.0000137197485,0.000067429064,0.028043069],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99416137,0.000057853158,0.0008500752,0.0023525602,0.0017119765,0.00086614693],"domain_scores_gemma":[0.99476963,0.0002804111,0.00054591557,0.0037538654,0.0002995221,0.00035067077],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0012575899,0.00070148474,0.0007685971,0.0012371853,0.00035054385,0.0005725482,0.009512124,0.0003421853,0.00006573924],"category_scores_gemma":[0.000038083388,0.000643585,0.00013852715,0.0005149673,0.0010244414,0.0013964496,0.007089373,0.0009925503,0.00034936145],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000002485061,0.000026417138,0.0000047899,0.000024694564,0.000003204931,0.000075449505,0.00008405922,0.0003350264,0.0001326248,0.28431028,0.004465117,0.7105359],"study_design_scores_gemma":[0.0004322379,0.00023237152,0.00012248539,0.0015587461,0.0000051600177,0.00011930528,2.8946332e-7,0.47229505,0.0023448141,0.2617612,0.25969875,0.0014295916],"about_ca_topic_score_codex":0.0000096089,"about_ca_topic_score_gemma":0.000003999198,"teacher_disagreement_score":0.70910627,"about_ca_system_score_codex":0.00030993889,"about_ca_system_score_gemma":0.00035025142,"threshold_uncertainty_score":0.99960154},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000031418655,0.00004646689,0.99506927,0.0008761849,0.00005777222,0.00026643477,0.000003468912,0.00085586595,0.0027930979],"genre_scores_gemma":[0.006585438,0.000005482799,0.9888197,0.0005772968,0.00012738563,0.0000137727475,0.000012797767,0.00000804627,0.0038500596],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9991559,0.000014845555,0.00018301967,0.00030807604,0.00014904127,0.0001891397],"domain_scores_gemma":[0.99923044,0.000093987255,0.00006820956,0.00046801797,0.00005979156,0.000079557896],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000108683074,0.00009475634,0.00011099864,0.00006434305,0.000074709285,0.000110640816,0.00070776703,0.000040674284,0.00015780001],"category_scores_gemma":[0.00005722368,0.00008381472,0.00003638476,0.00016949473,0.00001144879,0.0010439724,0.0002243278,0.00004573545,0.000106522064],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000032641196,0.000019686928,0.000008759084,0.0000026624118,0.0000033436002,6.2639657e-7,0.0001196162,0.00014573908,0.018746132,0.31391343,0.08615069,0.58088607],"study_design_scores_gemma":[0.00036159437,0.00006700737,0.0000257133,0.00002667784,0.00000262036,0.000009945137,0.0000045208258,0.26385874,0.4127541,0.020055586,0.30258006,0.00025346843],"about_ca_topic_score_codex":0.000009890703,"about_ca_topic_score_gemma":0.0000026272187,"teacher_disagreement_score":0.58063257,"about_ca_system_score_codex":0.000034588764,"about_ca_system_score_gemma":0.00004220256,"threshold_uncertainty_score":0.3417865},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0018324438,0.000040514045,0.9906263,0.0001350622,0.00007160741,0.000049067276,9.3429367e-7,0.00024357515,0.0070005185],"genre_scores_gemma":[0.891696,0.00001964205,0.10706288,0.00004898131,0.000006042749,0.0000048409847,8.0420153e-7,0.0000021533433,0.001158692],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99943626,0.000017595454,0.0001946135,0.00016009147,0.00012003562,0.00007139627],"domain_scores_gemma":[0.9993316,0.000033333934,0.00009460452,0.00047862713,0.0000391125,0.00002270446],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00009209683,0.00004314682,0.000059742422,0.00006531324,0.0000135423315,0.000029152865,0.00064978783,0.00001836285,0.00012816643],"category_scores_gemma":[0.000037701117,0.000036933263,0.000018201012,0.00014318901,0.000017492897,0.00058615184,0.00023846337,0.000036020403,0.0000626395],"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":[8.9248744e-7,0.00009464875,0.00036167476,0.000018091285,0.0000055011046,0.000003163616,0.00056375633,0.000008286601,0.18326436,0.46558136,0.04124811,0.30885014],"study_design_scores_gemma":[0.00004734894,0.000017663644,0.0003092074,0.00001749245,5.8829573e-7,0.0000039150113,0.000005829777,0.097942226,0.887693,0.010736661,0.0031566648,0.00006940646],"about_ca_topic_score_codex":0.000002801371,"about_ca_topic_score_gemma":4.097865e-7,"teacher_disagreement_score":0.8898635,"about_ca_system_score_codex":0.0000093270955,"about_ca_system_score_gemma":0.0000015316296,"threshold_uncertainty_score":0.15060948},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017167352,0.000057306286,0.9803954,0.00024840777,0.00007330623,0.00018121813,0.000009849557,0.0003039276,0.001563269],"genre_scores_gemma":[0.63046,0.000025465806,0.36928013,0.000098491575,0.000009863329,0.000004601897,0.0000023000441,0.0000049805367,0.000114148424],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9986488,0.0000874287,0.00045694536,0.00029523353,0.0003256689,0.00018592509],"domain_scores_gemma":[0.9989117,0.00023034625,0.00019096513,0.0004885513,0.00011943599,0.000059019352],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033887784,0.0001206229,0.00024717994,0.00010957324,0.00008957383,0.00004616985,0.0005410001,0.000054659573,0.00018408902],"category_scores_gemma":[0.00006126711,0.00010552944,0.000054163596,0.00031798976,0.00004984161,0.0012027972,0.00009578742,0.000080850514,0.000005783416],"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.000014175523,0.00014393132,0.00008836382,0.000082733575,0.000020096002,0.0000043834275,0.00096976844,0.00078881107,0.7551142,0.17042312,0.0019304551,0.07041997],"study_design_scores_gemma":[0.00040427002,0.00006289434,0.0002514129,0.000093002025,0.000005366059,0.000004710905,0.000030974566,0.10672998,0.85101014,0.04079072,0.00038032525,0.00023621421],"about_ca_topic_score_codex":0.00011035807,"about_ca_topic_score_gemma":0.0000076457245,"teacher_disagreement_score":0.6132927,"about_ca_system_score_codex":0.000041073643,"about_ca_system_score_gemma":0.0000118634125,"threshold_uncertainty_score":0.43033656},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0010593063,0.00013663285,0.9954966,0.00027179715,0.000063776526,0.0003575075,0.0000039289444,0.00087073847,0.0017397496],"genre_scores_gemma":[0.21386436,0.00008884212,0.7858444,0.00008916031,0.000014328182,0.00002440809,0.000002703912,0.000011029107,0.000060797025],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99895936,0.000050277053,0.00021667537,0.00037333567,0.0001985329,0.00020182527],"domain_scores_gemma":[0.9992199,0.000050930692,0.00007257996,0.00051056594,0.000062888976,0.00008314002],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000119073426,0.0001465041,0.00014775596,0.00013759606,0.0001592593,0.00012514068,0.00046829617,0.00007397555,0.00007178493],"category_scores_gemma":[0.000021977035,0.000121936246,0.000027552247,0.00030114013,0.000056953413,0.001496206,0.00030292565,0.00011877124,0.000012110938],"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.000004487933,0.00011140055,0.000086709464,0.0000475245,0.000005589343,0.000015646076,0.00016573943,0.000014796568,0.8761641,0.03234941,0.003964263,0.08707038],"study_design_scores_gemma":[0.00016530264,0.000048169368,0.00013096016,0.000093198294,0.0000031900686,0.000060126862,0.0000074180184,0.5393727,0.4504149,0.005560775,0.003906494,0.00023681566],"about_ca_topic_score_codex":0.000018218898,"about_ca_topic_score_gemma":0.000002089743,"teacher_disagreement_score":0.53935784,"about_ca_system_score_codex":0.000027680177,"about_ca_system_score_gemma":0.0000063840694,"threshold_uncertainty_score":0.4972416},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03210266,0.00012422465,0.965886,0.00027546764,0.00011731021,0.00014321058,0.000003939858,0.0006448434,0.00070232415],"genre_scores_gemma":[0.54484683,0.000034041954,0.45465413,0.00027901857,0.000027530552,0.0000038635208,0.0000031573502,0.000010383834,0.00014105986],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99884385,0.00005930934,0.00021771112,0.0004323378,0.00021637228,0.00023040385],"domain_scores_gemma":[0.99909955,0.00005794513,0.00008989511,0.0006028861,0.000060368926,0.00008934054],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00010086109,0.0001453525,0.0001551681,0.000111016554,0.00016671557,0.00014535076,0.000503288,0.000053478692,0.00018132744],"category_scores_gemma":[0.000043283137,0.00012752473,0.000026847893,0.00033540768,0.000086491425,0.0011834918,0.00045378722,0.000096352705,0.000042437914],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000070439214,0.0002413081,0.0017282295,0.000072458766,0.000014538095,0.000021702741,0.0005490282,0.00022296747,0.097788386,0.7951298,0.006445288,0.09777926],"study_design_scores_gemma":[0.00023958016,0.000041097417,0.003113781,0.00005238299,0.0000035609114,0.000031892963,0.00001147626,0.9463039,0.030179195,0.018752689,0.00094608567,0.00032432668],"about_ca_topic_score_codex":0.000035508136,"about_ca_topic_score_gemma":0.000006763102,"teacher_disagreement_score":0.946081,"about_ca_system_score_codex":0.000024806452,"about_ca_system_score_gemma":0.000007950947,"threshold_uncertainty_score":0.52003074},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04963565,0.00033837793,0.9488395,0.00005539049,0.00004615989,0.00013516728,0.00001286503,0.00011379728,0.00082311087],"genre_scores_gemma":[0.5757804,0.000041847434,0.42403442,0.000034342145,0.0000048452293,0.0000013834419,9.0407207e-7,0.0000051546995,0.00009673561],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9989211,0.000047573292,0.00030220626,0.0002843179,0.00028538142,0.00015940638],"domain_scores_gemma":[0.9990009,0.00008424315,0.00016462928,0.0005859868,0.000106175605,0.000058072827],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00009110942,0.00011906176,0.00023227531,0.00012615522,0.000054048254,0.000022873597,0.0005426114,0.000048885508,0.00006472736],"category_scores_gemma":[0.00002801546,0.000093148126,0.000030739982,0.00022370918,0.00014283192,0.00048197692,0.00071718666,0.00007346871,0.000001239981],"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.000019417283,0.0007224226,0.0038728924,0.0001826805,0.000023383116,0.000012232021,0.00051607157,0.000512008,0.62975645,0.009399738,0.010637581,0.3443451],"study_design_scores_gemma":[0.00034568508,0.0000899269,0.0011018665,0.00022183494,0.0000041305534,0.000013314968,0.000010573912,0.2682202,0.7278037,0.0010666299,0.00096649205,0.00015564916],"about_ca_topic_score_codex":0.000035406974,"about_ca_topic_score_gemma":8.524529e-7,"teacher_disagreement_score":0.52614474,"about_ca_system_score_codex":0.000008738458,"about_ca_system_score_gemma":0.0000057867446,"threshold_uncertainty_score":0.37984702},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00026905804,0.00013699586,0.98058784,0.00030451693,0.000057535955,0.00006184884,0.000003556977,0.0003695106,0.018209148],"genre_scores_gemma":[0.48049188,0.0001186521,0.51817495,0.00008898803,0.000013050805,0.00000501545,0.0000021243732,0.000004885933,0.0011004432],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99941385,0.000023203329,0.00015040569,0.00017577129,0.00014411709,0.000092668146],"domain_scores_gemma":[0.9992936,0.000048402107,0.00007010327,0.0005034106,0.000055133893,0.000029318346],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000047712172,0.000060622093,0.00008717606,0.00007062768,0.000026564776,0.00002344922,0.0005287666,0.000024480778,0.00012356983],"category_scores_gemma":[0.000034389213,0.000049465736,0.000024379386,0.0002529941,0.000024697383,0.0006055997,0.00016432987,0.000036643072,0.000045411274],"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.0000024009992,0.00019694104,0.00038198737,0.00002409081,0.0000074684804,0.0000055109654,0.00023608873,0.000074953554,0.0890218,0.5396326,0.10979634,0.26061982],"study_design_scores_gemma":[0.00016964936,0.0000928218,0.00096169405,0.000029089999,0.0000023074294,0.0000051919587,0.0000073433594,0.041913807,0.92323524,0.01944562,0.0139446175,0.00019264367],"about_ca_topic_score_codex":0.000010192656,"about_ca_topic_score_gemma":7.000532e-7,"teacher_disagreement_score":0.83421344,"about_ca_system_score_codex":0.000007001386,"about_ca_system_score_gemma":0.000002966714,"threshold_uncertainty_score":0.20171542},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03406253,0.00060201966,0.9619545,0.0023682592,0.0005608747,0.000111913614,0.0000032215185,0.00012129292,0.0002154102],"genre_scores_gemma":[0.3068899,0.00011674727,0.69203424,0.0006324929,0.0002771521,0.0000033468425,0.0000037511566,0.000013959334,0.000028427805],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978582,0.00008081966,0.00069533207,0.00034484,0.0007939183,0.00022683443],"domain_scores_gemma":[0.9972286,0.000099478544,0.0006877617,0.00027768651,0.0015112724,0.00019518442],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00029554157,0.00023102514,0.0002996756,0.00042372104,0.00014668475,0.0014869854,0.0017522991,0.000048341244,0.000059286187],"category_scores_gemma":[0.000049070604,0.00017467077,0.00010001368,0.00013816179,0.00013670938,0.007153373,0.0013058629,0.00036739747,0.000028981074],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000039936305,0.00020581941,0.000085237436,0.000038009097,0.0000283385,0.00027875282,0.00015289329,0.0000166576,0.15945952,0.00043416367,0.016718654,0.822542],"study_design_scores_gemma":[0.001899773,0.0005236278,0.0044241273,0.0022484956,0.000010534056,0.002953955,0.000033148477,0.88087523,0.06780832,0.024112139,0.014511363,0.0005992534],"about_ca_topic_score_codex":0.00000415184,"about_ca_topic_score_gemma":4.1664418e-8,"teacher_disagreement_score":0.8808586,"about_ca_system_score_codex":0.000050172435,"about_ca_system_score_gemma":0.000082237224,"threshold_uncertainty_score":0.99954957},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.72682077,0.00024116586,0.26673093,0.001954334,0.00060556113,0.00041503072,0.000010682538,0.00004534302,0.003176167],"genre_scores_gemma":[0.3524081,0.000035165358,0.6473995,0.0000623971,0.00006201033,2.6308543e-8,0.0000031177742,0.000011022693,0.000018671502],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99793774,0.000079881785,0.00048094155,0.0003264843,0.0008305328,0.00034441383],"domain_scores_gemma":[0.99732727,0.0004590738,0.00037957533,0.0012391618,0.00032815832,0.00026673492],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019617598,0.0001439516,0.00024442188,0.00024324261,0.00084450067,0.00019455084,0.0015072816,0.000104693885,0.0000049977803],"category_scores_gemma":[0.00010832353,0.000094717805,0.000020529993,0.00028878203,0.00033112927,0.00024653916,0.0014497614,0.0009763989,0.00000570065],"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.000058224756,0.00001533731,0.00001317068,0.000015596239,0.000015544741,0.000048022954,0.0012411256,0.000044747547,0.18629092,0.00081615685,0.0017368558,0.8097043],"study_design_scores_gemma":[0.0005427926,0.00010767423,0.0021546783,0.0004861172,0.000008855656,0.000336178,0.00017080776,0.038649283,0.7883089,0.0112072965,0.15767056,0.0003568159],"about_ca_topic_score_codex":0.0010868327,"about_ca_topic_score_gemma":0.01158778,"teacher_disagreement_score":0.80934745,"about_ca_system_score_codex":0.000112799775,"about_ca_system_score_gemma":0.00064420246,"threshold_uncertainty_score":0.6495302},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009044511,0.00044829783,0.98826295,0.00034740046,0.00003543017,0.00035103437,0.0000042169686,0.00037726187,0.0011289215],"genre_scores_gemma":[0.58898413,0.000012207353,0.41077366,0.00009302534,0.000013808336,0.000052135965,0.0000045199345,0.000016627015,0.000049881255],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9983959,0.000061015595,0.0003198719,0.0004976785,0.00040731955,0.0003182139],"domain_scores_gemma":[0.9986175,0.000051569175,0.00027101248,0.0004491489,0.0005139138,0.000096912634],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015310937,0.00022052883,0.00023214653,0.00016011692,0.00017174434,0.0003000151,0.0007152909,0.000073175506,0.000067153414],"category_scores_gemma":[0.00003172413,0.00016879692,0.000037354723,0.00058138656,0.00016028792,0.0046391366,0.00011431744,0.00019703587,0.000012926147],"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.000018067194,0.0001399202,0.00010515506,0.00010734345,0.000010592098,0.0000073370793,0.0016563063,0.00008128004,0.73354834,0.0003988781,0.0011417798,0.26278502],"study_design_scores_gemma":[0.0004335796,0.00026103566,0.001567605,0.00053033675,0.0000092502,0.000017774646,0.00007357718,0.020067198,0.9593454,0.016951436,0.00032627373,0.00041655338],"about_ca_topic_score_codex":0.00007281703,"about_ca_topic_score_gemma":6.210343e-7,"teacher_disagreement_score":0.5799396,"about_ca_system_score_codex":0.000045289064,"about_ca_system_score_gemma":0.00017845891,"threshold_uncertainty_score":0.68833387},"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":"empirical","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9906175,0.0009870768,0.005027393,0.0007635163,0.00031553695,0.00057020586,0.00014711008,0.00010205959,0.0014695838],"genre_scores_gemma":[0.38011232,0.0013613703,0.618173,0.00005261697,0.0001522878,0.000037498405,0.000039414233,0.000042172524,0.000029331728],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9970673,2.5778522e-8,0.0008667823,0.0005616639,0.0007646078,0.00073966273],"domain_scores_gemma":[0.9977324,0.00018506739,0.00047789604,0.00024038734,0.0010450339,0.00031922298],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011809561,0.00027800366,0.00039552638,0.00029176835,0.000059067734,0.00007672462,0.0034795532,0.00014508332,0.0000050989347],"category_scores_gemma":[0.0006934061,0.00023966511,0.00021113417,0.00064353767,0.0001695767,0.0014101315,0.0009734049,0.00039160257,8.0663386e-7],"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.00004446455,0.00014998412,0.0031209036,0.0004029583,0.00007037025,3.4617543e-7,0.00033786966,0.00004071736,0.29625577,0.68134844,0.0021506997,0.016077455],"study_design_scores_gemma":[0.0022325744,0.00050586317,0.035480816,0.002875437,0.00009396869,0.000024650839,0.0008340426,0.15291283,0.6091976,0.014755687,0.17977959,0.0013069484],"about_ca_topic_score_codex":0.001276694,"about_ca_topic_score_gemma":0.000058794678,"teacher_disagreement_score":0.6665928,"about_ca_system_score_codex":0.0002936713,"about_ca_system_score_gemma":0.00013177567,"threshold_uncertainty_score":0.9773259},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008666429,0.00021387376,0.9894587,0.00016780462,0.00018431593,0.0003408097,0.000006273189,0.00047434025,0.00048747615],"genre_scores_gemma":[0.22147837,0.00002383621,0.7781946,0.00020194266,0.000037081612,0.000007367573,0.0000135853425,0.000015225964,0.000027982049],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984845,0.000103666236,0.0003309401,0.0005706744,0.00020730298,0.00030291817],"domain_scores_gemma":[0.99869514,0.00029973243,0.00018328424,0.0005219619,0.00019484725,0.000105017454],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047623873,0.00018530492,0.00021369709,0.00012651955,0.0004208778,0.00034755893,0.00043790528,0.00004303107,0.000007258297],"category_scores_gemma":[0.00027558132,0.00016613874,0.000055234013,0.00017722008,0.00005629453,0.0012248686,0.000447517,0.00012962423,0.000009077638],"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.00002742987,0.00022074905,0.00020439834,0.00017399657,0.000013834375,0.0000355758,0.00025179764,0.00004918853,0.48483673,0.08502638,0.02652519,0.40263474],"study_design_scores_gemma":[0.00080788153,0.0001455182,0.00018710263,0.00025606612,0.00000427293,0.00006677578,0.00001907661,0.7047395,0.24903224,0.016605835,0.027775098,0.0003605991],"about_ca_topic_score_codex":0.000002588336,"about_ca_topic_score_gemma":1.1114419e-7,"teacher_disagreement_score":0.70469034,"about_ca_system_score_codex":0.000016702541,"about_ca_system_score_gemma":0.00002483428,"threshold_uncertainty_score":0.6774941},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0006458997,0.000007681407,0.969481,0.0010983762,0.00034821115,0.00025502776,0.000027010423,0.0004978257,0.027638998],"genre_scores_gemma":[0.33934367,0.0000010922076,0.6599047,0.0005534667,0.000039220024,0.000041379997,0.00008295653,0.000002815333,0.00003072384],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99780875,0.00013567242,0.0005935592,0.00029672435,0.0009269359,0.00023833448],"domain_scores_gemma":[0.9983087,0.00048975815,0.00045646846,0.00043423357,0.00024412178,0.0000667119],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00088989735,0.0001627049,0.0001412161,0.0006703425,0.0008082283,0.0004329449,0.000781188,0.00008042487,0.000045186836],"category_scores_gemma":[0.00011909156,0.0001381016,0.000061047394,0.0011090941,0.00015933893,0.0079789795,0.0001476531,0.00016216766,0.00014299114],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009357372,0.000058966936,0.00075708725,0.000008970716,0.0000020621817,4.3110546e-7,0.000099074394,0.3098567,0.00086032914,0.45694628,0.0018142702,0.22958645],"study_design_scores_gemma":[0.00025196758,0.000054303044,0.0056640366,0.000055072203,0.000002207749,0.000013582531,0.000021608987,0.94034487,0.0055358494,0.043623183,0.004251814,0.0001814921],"about_ca_topic_score_codex":0.00006955701,"about_ca_topic_score_gemma":0.0000042207985,"teacher_disagreement_score":0.63048816,"about_ca_system_score_codex":0.00009563896,"about_ca_system_score_gemma":0.000111643756,"threshold_uncertainty_score":0.621632},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008189415,0.0001299524,0.98966986,0.00034261693,0.00020655368,0.00035441996,0.000027049997,0.00062436686,0.00045575967],"genre_scores_gemma":[0.49276537,0.00023842584,0.5063568,0.0003766321,0.00013012534,0.00003949573,0.000017838362,0.000031731746,0.000043585267],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99698675,0.000022792268,0.0004429778,0.0010776749,0.00045589166,0.0010139206],"domain_scores_gemma":[0.9978888,0.00008110564,0.00014095205,0.0004506531,0.0003639428,0.0010745203],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00015730219,0.0005346942,0.0005398469,0.0006860017,0.00042989114,0.00044603436,0.0013981073,0.00020137941,0.000031234682],"category_scores_gemma":[0.000049239025,0.00051927107,0.00006920197,0.00074658525,0.00010095439,0.0012463811,0.00048157462,0.00072973146,0.000013240839],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007962795,0.00032773052,0.00082675647,0.00021204895,0.0001478192,0.00083877693,0.0021752203,0.0026783478,0.025466362,0.45118782,0.0063348766,0.5097246],"study_design_scores_gemma":[0.00045752266,0.00017950355,0.0003536092,0.00026625264,0.000007784078,0.00029918284,0.0000066242947,0.9920519,0.0028093946,0.0008159964,0.0020908085,0.0006614237],"about_ca_topic_score_codex":0.0013520867,"about_ca_topic_score_gemma":0.000031657986,"teacher_disagreement_score":0.98937356,"about_ca_system_score_codex":0.0002109375,"about_ca_system_score_gemma":0.0005757697,"threshold_uncertainty_score":0.9997259},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002473042,0.00007698257,0.98992115,0.00009811309,0.0005879538,0.00033674738,0.00014695694,0.0023524584,0.0040066186],"genre_scores_gemma":[0.25069544,0.00012873455,0.74814206,0.00012651422,0.00020259309,0.000034796572,0.00022716576,0.000040067367,0.00040263456],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99726903,0.00015069847,0.0005270093,0.0009385843,0.0004934543,0.00062121707],"domain_scores_gemma":[0.99648625,0.00018858415,0.00044564312,0.0024579114,0.00018140487,0.00024018851],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0003958314,0.00045454453,0.0005263927,0.00010753631,0.00021043913,0.00041192138,0.0026831308,0.000373291,0.00013717142],"category_scores_gemma":[0.00007567219,0.0004137687,0.00014569607,0.00026338297,0.00009494258,0.00089451845,0.010451667,0.00076126365,0.00007832385],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000070283866,0.0011726014,0.0241893,0.001524118,0.00052194385,0.00019128983,0.0020689683,0.024841253,0.03987039,0.6111629,0.105987445,0.1883995],"study_design_scores_gemma":[0.000415573,0.000020449812,0.0013289382,0.0013644063,0.0000835904,0.00017269293,0.000050245337,0.78951526,0.08932543,0.06126323,0.05361672,0.0028434924],"about_ca_topic_score_codex":0.00043452973,"about_ca_topic_score_gemma":0.0000057129937,"teacher_disagreement_score":0.764674,"about_ca_system_score_codex":0.00024212596,"about_ca_system_score_gemma":0.00012542076,"threshold_uncertainty_score":0.99983144},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0020661773,0.00003733945,0.99677473,0.00002763848,0.00032609623,0.00035612308,0.000023146087,0.00027160012,0.00011716535],"genre_scores_gemma":[0.58827543,0.0000042170186,0.4115317,0.000031466694,0.000024770254,0.000072506846,9.955425e-7,0.000009992795,0.00004897291],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9989614,0.00005055519,0.00028074012,0.0002284848,0.00020123483,0.00027759187],"domain_scores_gemma":[0.99886423,0.00048028896,0.00017373699,0.00031190048,0.000091555055,0.00007830608],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025826527,0.00012972542,0.00015996693,0.00017342487,0.00020499963,0.000028365619,0.00030833215,0.000049274855,0.000007758612],"category_scores_gemma":[0.000020379166,0.00013115458,0.00007737748,0.00027433375,0.000033726843,0.00091210875,0.0000054633692,0.00013480813,0.0000053356102],"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.000038076898,0.00024150105,0.000024818788,0.000058663565,0.000031429478,4.044695e-7,0.0013683944,0.013305949,0.120340586,0.0022669053,0.0000950733,0.8622282],"study_design_scores_gemma":[0.0003261306,0.00016106856,0.00003389037,0.00015459993,0.000019295685,0.000013574316,0.00018585175,0.14141807,0.8568424,0.00041335553,0.00024864322,0.00018308751],"about_ca_topic_score_codex":0.000008714256,"about_ca_topic_score_gemma":6.239938e-7,"teacher_disagreement_score":0.8620451,"about_ca_system_score_codex":0.000057657024,"about_ca_system_score_gemma":0.000018748267,"threshold_uncertainty_score":0.53483284},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008875969,0.00008644449,0.98898274,0.00055604574,0.000011874807,0.0002847004,0.00015223377,0.000099640645,0.00095034955],"genre_scores_gemma":[0.5251052,0.00019572445,0.4742329,0.00010834194,0.000035538193,0.00018443342,0.000017637183,0.0000045813426,0.000115671624],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999324,0.000015082319,0.00018695685,0.00020809092,0.00015544807,0.00011038579],"domain_scores_gemma":[0.99901074,0.000106787425,0.0001073516,0.0006634687,0.000067985515,0.000043679218],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00010724558,0.000072057315,0.000135093,0.00007666402,0.00015751584,0.000052253265,0.00058820774,0.000025585598,0.00002213388],"category_scores_gemma":[0.000018335078,0.00005086371,0.000047364083,0.0007025987,0.00008881284,0.00046368988,0.00026806383,0.000075657306,0.0000054731026],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000021527694,0.0000351756,0.0017917628,0.000007784113,0.00003593276,5.7445323e-8,0.00023049624,0.0003388556,0.011844523,0.004371399,0.0006389766,0.9807029],"study_design_scores_gemma":[0.00022127127,0.000016869943,0.046701096,0.000023478042,0.00010131918,0.0000014573166,0.000018957275,0.72105485,0.09155701,0.00033646898,0.13976961,0.00019762246],"about_ca_topic_score_codex":0.0000037432944,"about_ca_topic_score_gemma":0.0000045183556,"teacher_disagreement_score":0.9805053,"about_ca_system_score_codex":0.000023797038,"about_ca_system_score_gemma":0.00002701177,"threshold_uncertainty_score":0.20741618},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013019228,0.0010341968,0.9331928,0.0020273314,0.0016957402,0.00530399,0.00056908955,0.007768265,0.03538934],"genre_scores_gemma":[0.03786002,0.0011164644,0.9332928,0.002440205,0.0010132005,0.002146285,0.0009807467,0.0006215873,0.020528689],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.97986037,0.0011916119,0.003838414,0.0057771867,0.0045692837,0.004763131],"domain_scores_gemma":[0.9802496,0.0024426715,0.0024172664,0.0097921435,0.0026366182,0.002461737],"candidate_categories":["metaepi_narrow","sts","scholarly_communication","open_science","research_integrity","insufficient_payload"],"consensus_categories":["metaepi_narrow","research_integrity","insufficient_payload"],"category_scores_codex":[0.0025958812,0.0035231686,0.003520951,0.0019118328,0.0023142905,0.0040310356,0.009588615,0.001393346,0.0035227921],"category_scores_gemma":[0.001629191,0.0030282731,0.0010404029,0.003772333,0.0020455194,0.012881112,0.006901834,0.0025841228,0.0043615424],"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.0015985698,0.0025775933,0.00082098955,0.00062885537,0.0014737108,0.00020264645,0.0048992014,0.0033381335,0.415401,0.059907474,0.48627806,0.022873744],"study_design_scores_gemma":[0.009463592,0.0015242397,0.0017746191,0.0017492471,0.0004548851,0.0008277931,0.00020305824,0.02404589,0.027308684,0.025977086,0.8990611,0.007609841],"about_ca_topic_score_codex":0.00041733764,"about_ca_topic_score_gemma":0.00081174175,"teacher_disagreement_score":0.412783,"about_ca_system_score_codex":0.0013468713,"about_ca_system_score_gemma":0.0012500596,"threshold_uncertainty_score":0.9999031},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0014776688,0.00003333687,0.9865616,0.00078219926,0.00002234397,0.000088863795,0.0000012233361,0.00095560687,0.010077155],"genre_scores_gemma":[0.17679973,0.000012058819,0.8218788,0.00043264197,0.000026248947,0.000008398266,0.0000020108225,0.000005492123,0.0008346176],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99922377,0.000017310305,0.00010964572,0.0002599134,0.00017877817,0.00021057784],"domain_scores_gemma":[0.999204,0.000033480308,0.000041798998,0.00061482814,0.000031419724,0.00007449495],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000050936636,0.00009148919,0.000088242945,0.000046116347,0.00005734459,0.000069897564,0.00069426704,0.000022083947,0.00009721453],"category_scores_gemma":[0.000008134546,0.00006245553,0.000016308053,0.00016425128,0.000020997795,0.0009552952,0.00024011062,0.0000678456,0.00004739918],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012026814,0.00010044943,0.00043418704,0.0000048703523,0.00000963173,0.000017705283,0.00016155445,0.00018180757,0.0062687066,0.20914592,0.014541579,0.7691216],"study_design_scores_gemma":[0.0011276724,0.00020260377,0.0011519432,0.00008808524,0.0000052611376,0.00006598414,0.000033856133,0.06528405,0.46203947,0.0064524226,0.46289867,0.00064997724],"about_ca_topic_score_codex":0.0000112914395,"about_ca_topic_score_gemma":0.0000124187545,"teacher_disagreement_score":0.7684716,"about_ca_system_score_codex":0.000025294177,"about_ca_system_score_gemma":0.000019734147,"threshold_uncertainty_score":0.2546863},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.022956012,0.00030952465,0.9749979,0.00035528844,0.00032369327,0.0006110597,0.000016826056,0.0004032196,0.000026473243],"genre_scores_gemma":[0.99477154,0.0001598751,0.0047782906,0.000029277144,0.000007429197,0.00021507307,5.4806503e-7,0.000012379282,0.000025580526],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99882656,0.00002834422,0.00043298583,0.00039796918,0.000084746294,0.00022939168],"domain_scores_gemma":[0.9990802,0.00011035741,0.0001513796,0.00054586324,0.00007087871,0.000041327614],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017110223,0.00014145138,0.0003327191,0.0007620942,0.000112125825,0.00003900167,0.00048594893,0.00018104988,4.637706e-7],"category_scores_gemma":[0.000018487008,0.00013589808,0.000049501905,0.00052289414,0.00013022355,0.00030735883,0.0000068960308,0.00021649261,0.0000011360725],"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.000055304627,0.00046584592,0.00008664811,0.00049038354,0.000051960662,0.00007700477,0.00055070454,0.0022708802,0.09770814,0.53258955,0.00008806579,0.36556548],"study_design_scores_gemma":[0.007320805,0.0018243417,0.00009683644,0.0038628017,0.000035161833,0.0012383382,0.0005310916,0.014048768,0.8018533,0.16130881,0.006815847,0.0010639073],"about_ca_topic_score_codex":0.000059710743,"about_ca_topic_score_gemma":0.000053964657,"teacher_disagreement_score":0.9718155,"about_ca_system_score_codex":0.00008937685,"about_ca_system_score_gemma":0.000046466128,"threshold_uncertainty_score":0.5541763},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002123043,0.00050714315,0.98749715,0.002185859,0.00024223953,0.0008345816,0.0001206978,0.0010617049,0.005427553],"genre_scores_gemma":[0.45060444,0.00010217015,0.546946,0.00042659504,0.00007154086,0.0007786807,0.00015682209,0.000018303583,0.0008954963],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99832666,0.00020558097,0.00050614454,0.000436286,0.00024494863,0.0002804098],"domain_scores_gemma":[0.9926073,0.00083609094,0.0002945342,0.0058732643,0.00032439912,0.000064413674],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043465398,0.00020080041,0.0002559048,0.00015236042,0.00040464624,0.00012434101,0.0043549705,0.000076146396,0.000012809075],"category_scores_gemma":[0.00008854072,0.00019007742,0.00007243642,0.000516673,0.00014538759,0.00062911725,0.00080817344,0.00021363731,0.00014530227],"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.000028586657,0.0011805026,0.00010957728,0.000044967175,0.00002188429,0.0000015057715,0.000058341997,0.00038996764,0.032821547,0.74557704,0.1198133,0.09995281],"study_design_scores_gemma":[0.0010525095,0.0003715959,0.016012276,0.00012801916,0.000019293444,0.000007834346,0.000012149587,0.009402582,0.077185266,0.17672595,0.71833146,0.00075104175],"about_ca_topic_score_codex":0.000054467415,"about_ca_topic_score_gemma":0.00011467371,"teacher_disagreement_score":0.5985182,"about_ca_system_score_codex":0.000083451574,"about_ca_system_score_gemma":0.00005266317,"threshold_uncertainty_score":0.80926913},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00021286317,0.000214707,0.99570936,0.00061524974,0.000109065826,0.00016481282,0.0000069447233,0.0010324898,0.0019344792],"genre_scores_gemma":[0.83387077,0.000058491674,0.16483021,0.0005010149,0.000029415869,0.00006079854,6.1833026e-7,0.00001978354,0.00062887464],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99855834,0.00004245314,0.00027911746,0.0004450966,0.00036330466,0.00031169446],"domain_scores_gemma":[0.9992977,0.000047864316,0.00007212919,0.00039015722,0.00007131203,0.000120858655],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001020971,0.00020002198,0.00017809069,0.00020270864,0.0004064597,0.00017864066,0.00071373687,0.00008144938,0.0003032635],"category_scores_gemma":[9.781935e-7,0.00018175595,0.000093348295,0.00052582734,0.000054101434,0.001510952,0.0000023472612,0.0002982206,0.00008921291],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008250196,0.000136761,1.9902465e-7,0.000016999504,0.000005972789,0.000009116154,0.0002557475,0.0021911075,0.008367511,0.00030905285,0.0004108754,0.9882884],"study_design_scores_gemma":[0.0005029255,0.00012453223,0.0000016167928,0.0001087215,0.000010971414,0.000045064626,0.000011583759,0.50618297,0.48017928,0.004222882,0.008239258,0.00037021545],"about_ca_topic_score_codex":0.0000034302736,"about_ca_topic_score_gemma":0.0000015457549,"teacher_disagreement_score":0.9879182,"about_ca_system_score_codex":0.000052375803,"about_ca_system_score_gemma":0.00002249109,"threshold_uncertainty_score":0.7411792},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98915744,0.00022067864,0.0049659526,0.0032943452,0.0002004685,0.0006128347,0.00001741732,0.00024629594,0.0012845913],"genre_scores_gemma":[0.5831268,0.00011076261,0.41610268,0.00019606901,0.00020828596,0.0001728182,0.000003893306,0.00004318448,0.000035528454],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99753946,2.3791452e-8,0.0006861186,0.000520228,0.0007650978,0.00048904587],"domain_scores_gemma":[0.9979814,0.00019380456,0.0003895217,0.0001295568,0.0012106702,0.00009504651],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006325849,0.00031601402,0.0003551652,0.00015083342,0.00018562589,0.00026830757,0.0027663254,0.00015879377,0.000002985865],"category_scores_gemma":[0.0006011419,0.0002329365,0.0003648016,0.0007922194,0.00019158072,0.0012787919,0.0006381465,0.00052696856,0.000001151658],"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.000019855986,0.00006184549,0.00023840718,0.00020194436,0.0000640609,2.2693011e-7,0.0010207115,0.00072184,0.28834543,0.70729184,0.0005996925,0.0014341449],"study_design_scores_gemma":[0.0020512918,0.00042391082,0.0011617001,0.0015083533,0.00006422384,0.00006219377,0.0036625324,0.042728547,0.919401,0.019570537,0.008513186,0.0008525274],"about_ca_topic_score_codex":0.000028732564,"about_ca_topic_score_gemma":9.053696e-7,"teacher_disagreement_score":0.6877213,"about_ca_system_score_codex":0.00035171284,"about_ca_system_score_gemma":0.00007496925,"threshold_uncertainty_score":0.94988745},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0018999792,0.0014662594,0.9958893,0.0004900368,0.0001471717,0.000047731864,8.8269854e-7,0.000025597545,0.00003302286],"genre_scores_gemma":[0.12407843,0.000018894552,0.8754557,0.0002856991,0.00014124427,0.0000017739259,2.2990027e-7,0.0000067774527,0.000011258259],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99908006,0.00002519691,0.0003264252,0.00015356576,0.00009878414,0.0003159622],"domain_scores_gemma":[0.99916524,0.00012900186,0.000073578405,0.00015089434,0.000051141476,0.0004301583],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025319937,0.00011538738,0.00020958307,0.00041854227,0.000032372296,0.000074901196,0.00050674507,0.000048201327,0.000004959973],"category_scores_gemma":[0.000037063888,0.000104764156,0.00003804821,0.00037514255,0.000013607081,0.00040766725,0.00005273829,0.00031397166,7.6586207e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000035548924,0.000032578908,0.00025724596,0.00000924284,0.000019126173,0.00012396075,0.00031176637,0.0331809,0.0039002465,0.017704917,0.0011144191,0.94334203],"study_design_scores_gemma":[0.00033364273,0.0001359287,0.0026137822,0.0000706978,0.0000026509274,0.00045697542,9.2506644e-7,0.928434,0.0030678362,0.0003149614,0.064382054,0.00018653179],"about_ca_topic_score_codex":0.00012689772,"about_ca_topic_score_gemma":0.00009864944,"teacher_disagreement_score":0.9431555,"about_ca_system_score_codex":0.00019977112,"about_ca_system_score_gemma":0.0002654461,"threshold_uncertainty_score":0.42721584},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0034865253,0.000014892326,0.9859732,0.00020160316,0.00013415536,0.00017757481,5.3685744e-7,0.0008414005,0.009170154],"genre_scores_gemma":[0.6545997,0.000008118531,0.34443188,0.0004710715,0.000010324596,0.000034075943,0.0000014164336,0.000003832767,0.00043951726],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99927026,0.000025497146,0.00011988311,0.00025104787,0.00017283154,0.0001604781],"domain_scores_gemma":[0.9991323,0.000174679,0.00004192968,0.0005341297,0.000054484593,0.00006250605],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00007268358,0.000078715486,0.000071606235,0.00019896796,0.000072908,0.00014897928,0.00060389657,0.000030906478,0.00010378638],"category_scores_gemma":[0.00015630118,0.00006130935,0.000022342063,0.00040297213,0.000011160491,0.0012987691,0.00025960975,0.00008134327,0.0006367498],"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.0000013926992,0.000066492146,0.0003211437,0.0000055166824,0.0000025263537,0.0000020473942,0.000028092954,0.000031821284,0.023218213,0.66697866,0.05384776,0.25549635],"study_design_scores_gemma":[0.00042711853,0.00020120271,0.0082772225,0.00007452392,0.0000014553746,0.000009597857,0.000016237518,0.6095584,0.20151688,0.17080535,0.008675007,0.00043701995],"about_ca_topic_score_codex":0.00004282384,"about_ca_topic_score_gemma":0.0000010216116,"teacher_disagreement_score":0.6511132,"about_ca_system_score_codex":0.00003528872,"about_ca_system_score_gemma":0.000005891849,"threshold_uncertainty_score":0.8184343},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20118222,0.004438601,0.7925416,0.0004803881,0.000032815846,0.00066349306,0.000032926317,0.00045242594,0.00017552938],"genre_scores_gemma":[0.7247316,0.0028909845,0.27199838,0.000058435013,0.000012749941,0.00019571549,0.000089282636,0.000013192104,0.000009647696],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99824065,0.00026586564,0.00056375674,0.00044791447,0.00014427521,0.0003375369],"domain_scores_gemma":[0.99551255,0.0008753854,0.0002374236,0.0031326788,0.00012306933,0.000118910946],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005377119,0.00021139107,0.00029099637,0.00021194013,0.0008996727,0.00029645636,0.0021972342,0.00009276475,0.0000017599409],"category_scores_gemma":[0.000057946676,0.00022957876,0.000033843942,0.00054120977,0.00029165865,0.0011255057,0.0050109257,0.0004299079,0.0000030520891],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000042804977,0.0003565588,0.011246898,0.00003539821,0.00001220578,0.00000104277,0.0017858986,0.0016982557,0.009957997,0.016837096,0.00011013242,0.9579542],"study_design_scores_gemma":[0.00045495472,0.000044158565,0.0032855275,0.00028900482,0.0000055567857,0.000018942395,0.00049615366,0.9742245,0.0008982065,0.00043295976,0.019581208,0.00026879297],"about_ca_topic_score_codex":0.0001754975,"about_ca_topic_score_gemma":0.00021345429,"teacher_disagreement_score":0.97252625,"about_ca_system_score_codex":0.00012374269,"about_ca_system_score_gemma":0.000035964797,"threshold_uncertainty_score":0.93619496},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02625994,0.000010732203,0.9724498,0.000018543133,0.00017573223,0.00053345057,0.000019550182,0.00041759032,0.00011466921],"genre_scores_gemma":[0.6439191,0.0000027700296,0.35587752,0.000010891377,0.00001606233,0.00013738322,0.000006838829,0.0000064461055,0.000022976423],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9991077,0.00003522158,0.00024512172,0.00028539958,0.00015388284,0.00017267816],"domain_scores_gemma":[0.9991565,0.00008080857,0.0001636547,0.00039958928,0.00015140744,0.00004805271],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019440117,0.00010714204,0.0001497149,0.000116345574,0.00007203796,0.000016982734,0.0004844494,0.00006422358,0.000006922259],"category_scores_gemma":[0.000108519955,0.00009111871,0.000042085976,0.00016057292,0.000039476214,0.0009000314,0.00018347475,0.0000629518,0.0000020373975],"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.00021925321,0.0006075237,0.00047395972,0.00021697304,0.000033292552,0.0000031364398,0.006551183,0.00008986787,0.45236647,0.07524118,0.0006721965,0.46352497],"study_design_scores_gemma":[0.00027262562,0.00015100472,0.00069965667,0.000055196684,0.0000029519742,0.0000015941728,0.0001540945,0.260224,0.72494084,0.013283795,0.00008325163,0.00013097996],"about_ca_topic_score_codex":0.00019606117,"about_ca_topic_score_gemma":0.00008092799,"teacher_disagreement_score":0.61765915,"about_ca_system_score_codex":0.000023949724,"about_ca_system_score_gemma":0.000019761499,"threshold_uncertainty_score":0.3715713},"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":"empirical","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8215601,0.00017622534,0.005554401,0.0044224625,0.0004985126,0.00084219506,0.000064326334,0.00067745073,0.16620435],"genre_scores_gemma":[0.3532346,0.0010619429,0.63126767,0.0015731556,0.0012538787,0.00040989337,0.000043219603,0.0002041822,0.010951495],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99875057,2.5465244e-8,0.0003008592,0.00026414296,0.0004807149,0.00020370506],"domain_scores_gemma":[0.99914867,0.00008944066,0.00014436805,0.00009342491,0.00047104544,0.000053064945],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026982813,0.00017078625,0.00016500085,0.000060003033,0.000068208465,0.000098397344,0.0011571794,0.00010239962,0.0002239625],"category_scores_gemma":[0.00019207313,0.000120824305,0.0001906438,0.0002981336,0.00009100847,0.00036791468,0.00014795964,0.0001679522,0.000045694564],"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.000010090891,0.000041616742,0.000004902879,0.000035955272,0.00004709229,5.27671e-8,0.000034241522,0.000026113332,0.08880269,0.8537043,0.0537759,0.003517059],"study_design_scores_gemma":[0.00056116836,0.00029132096,0.00014606476,0.0004350807,0.000050950926,0.000014576471,0.000052460895,0.28539565,0.14104931,0.012336008,0.55914617,0.0005212657],"about_ca_topic_score_codex":6.808334e-7,"about_ca_topic_score_gemma":1.9308658e-8,"teacher_disagreement_score":0.84136826,"about_ca_system_score_codex":0.0000712737,"about_ca_system_score_gemma":0.000020528567,"threshold_uncertainty_score":0.49270722},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17776228,0.000091421476,0.8209231,0.00007440592,0.00011837188,0.00016348078,0.0000063053567,0.00060788036,0.0002527471],"genre_scores_gemma":[0.47618642,0.000019876967,0.52359664,0.0000817848,0.00008054127,0.0000012929427,0.000007667851,0.00001437767,0.000011410641],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99818456,0.00010422888,0.00038973754,0.0006444069,0.00033271578,0.0003443212],"domain_scores_gemma":[0.9987065,0.00019675666,0.00025323912,0.0005620762,0.00014641105,0.0001349732],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025489068,0.00024336418,0.00026521142,0.00017629332,0.00073817454,0.00021048736,0.000511811,0.00006803151,0.0000052369255],"category_scores_gemma":[0.000047722144,0.00019460772,0.000036972106,0.0002939078,0.0001403183,0.0016212468,0.0011245024,0.00030683578,0.000006095886],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014822351,0.0003865129,0.0078454865,0.00021902764,0.000047204085,0.0009217085,0.0027783662,0.00091244816,0.65923625,0.0003435388,0.009617536,0.31754372],"study_design_scores_gemma":[0.0006797821,0.000268604,0.0029888279,0.00084541854,0.000006905461,0.0011694185,0.000051629046,0.95810217,0.03413402,0.00016898043,0.0012565051,0.00032774042],"about_ca_topic_score_codex":0.000026890084,"about_ca_topic_score_gemma":4.8768993e-7,"teacher_disagreement_score":0.95718974,"about_ca_system_score_codex":0.000033837285,"about_ca_system_score_gemma":0.000031026528,"threshold_uncertainty_score":0.79358727},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0004177232,0.000018710265,0.9978129,0.00005607102,0.000108915905,0.00039787946,0.000029703631,0.00022747915,0.00093058916],"genre_scores_gemma":[0.056796793,0.0000042733955,0.94298404,0.0000952546,0.000015456553,0.000068363464,0.00000916282,0.0000067692217,0.000019874247],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99875283,0.00004394397,0.0003211443,0.00029638823,0.00040026146,0.00018543165],"domain_scores_gemma":[0.9990415,0.000107172054,0.00015390717,0.00042986948,0.00016734356,0.000100198406],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028728804,0.00010227344,0.00015136585,0.00008731078,0.000059019,0.00001083397,0.00081260654,0.00004944443,0.00028429765],"category_scores_gemma":[0.000022388926,0.000078686404,0.000052286676,0.00013714522,0.000062477935,0.00022170568,0.0005264973,0.000064530774,0.000005817299],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010304229,0.0001453053,0.000015119487,0.000008556658,0.000008492061,0.0000032618805,0.0004282097,0.000002525336,0.0036394307,0.04390754,0.0034982865,0.94833297],"study_design_scores_gemma":[0.0005732524,0.00026131066,0.0004330605,0.00003938416,0.000003794778,0.000004769514,0.00016744851,0.48545521,0.50582236,0.0065424563,0.00056175137,0.00013522108],"about_ca_topic_score_codex":0.000086493754,"about_ca_topic_score_gemma":0.0000041403177,"teacher_disagreement_score":0.9481977,"about_ca_system_score_codex":0.000019196108,"about_ca_system_score_gemma":0.00005744335,"threshold_uncertainty_score":0.32087383},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00086086325,0.000128241,0.99611056,0.00046065976,0.0003363742,0.0006729319,0.000052546005,0.0012166798,0.00016114705],"genre_scores_gemma":[0.53816456,0.0000043523696,0.46108267,0.00018131475,0.000054011165,0.00030763994,0.0000030069139,0.000029146075,0.00017333256],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99801314,0.000048548125,0.00045809653,0.0006682355,0.00035762097,0.0004543746],"domain_scores_gemma":[0.9985231,0.00017658228,0.00020245458,0.0006965217,0.00026699845,0.00013434974],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00027943432,0.00027467572,0.00025131617,0.00030626854,0.00064149726,0.00049874146,0.0008347575,0.0000967504,0.000005907417],"category_scores_gemma":[0.000019875077,0.0002689636,0.00009822711,0.00034567397,0.00006338473,0.0018995648,0.0000092068485,0.000296781,0.000015120476],"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.00011716596,0.00033746386,8.0088955e-7,0.00049861876,0.00001553956,0.000007308774,0.0004566418,0.10463053,0.46507657,0.00012798184,0.0004451431,0.42828622],"study_design_scores_gemma":[0.0003530365,0.000093220304,0.000002616764,0.00035108076,0.000011264586,0.000016137405,0.000027968614,0.5077439,0.48935184,0.00003273804,0.0017843085,0.00023190517],"about_ca_topic_score_codex":0.000010613755,"about_ca_topic_score_gemma":0.0000072480516,"teacher_disagreement_score":0.5373037,"about_ca_system_score_codex":0.00017071266,"about_ca_system_score_gemma":0.00013564496,"threshold_uncertainty_score":0.9999763},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012786462,0.0007566419,0.97593427,0.0024432123,0.0009229304,0.0019098311,0.00053641887,0.003147376,0.0015628574],"genre_scores_gemma":[0.62018114,0.0012419792,0.37547362,0.00044888424,0.000092385926,0.0009478124,0.0003123651,0.00014379823,0.0011579749],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99278307,0.00085115916,0.0019056298,0.0016235291,0.0015329522,0.0013036663],"domain_scores_gemma":[0.98581916,0.0022510334,0.000965277,0.008780629,0.0015363496,0.0006475523],"candidate_categories":["metaepi_narrow","sts","open_science"],"consensus_categories":[],"category_scores_codex":[0.0013104235,0.001145944,0.0010566876,0.0019421191,0.0032410142,0.00083929434,0.0057508894,0.0005464908,0.00006131669],"category_scores_gemma":[0.0003539474,0.0010933437,0.0005173173,0.0048109,0.0006159079,0.004730111,0.00023719687,0.0016003362,0.000674467],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00039148857,0.008057734,0.00016095932,0.00036268894,0.00072458596,0.00001786728,0.0033457286,0.042412966,0.13607141,0.67240226,0.0046476177,0.13140465],"study_design_scores_gemma":[0.0028376335,0.0008479338,0.0016419583,0.00069409795,0.00038032324,0.00014271603,0.00009949595,0.8348776,0.022307087,0.0044453773,0.12984598,0.0018797914],"about_ca_topic_score_codex":0.00018401252,"about_ca_topic_score_gemma":0.0016233145,"teacher_disagreement_score":0.7924646,"about_ca_system_score_codex":0.00071931165,"about_ca_system_score_gemma":0.00046059414,"threshold_uncertainty_score":0.9996285},"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":"empirical","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.95624673,0.000056177163,0.03897708,0.0023326578,0.00021984798,0.0009305116,0.00003859864,0.00026343137,0.0009349625],"genre_scores_gemma":[0.282869,0.000048855316,0.7158539,0.00023511227,0.00022792406,0.0005518426,0.0000096477315,0.000057980298,0.00014573795],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99751306,3.434489e-8,0.0007980746,0.0006201937,0.0005662026,0.0005024476],"domain_scores_gemma":[0.9973748,0.00046473005,0.00048748156,0.00013002937,0.0014178404,0.00012517077],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0013151559,0.00033806852,0.00048650935,0.00017206008,0.00009962554,0.00018871148,0.002421752,0.00018128761,0.0000041079406],"category_scores_gemma":[0.0017123449,0.00028652474,0.00039865583,0.00049034785,0.00014551074,0.0014438704,0.00048258118,0.00030659317,0.0000010239933],"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.00006615128,0.00010089859,0.00019810007,0.0004559938,0.00007057598,4.75854e-8,0.00018948011,0.0002207995,0.3676429,0.6249658,0.003874636,0.0022146157],"study_design_scores_gemma":[0.0021355299,0.00051800295,0.0011756913,0.00093652535,0.000052562733,0.000010912509,0.00027637175,0.4476228,0.4970837,0.032351762,0.017135412,0.00070072484],"about_ca_topic_score_codex":0.0000059319655,"about_ca_topic_score_gemma":3.6492597e-7,"teacher_disagreement_score":0.67687684,"about_ca_system_score_codex":0.0001495179,"about_ca_system_score_gemma":0.00004128077,"threshold_uncertainty_score":0.9999587},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15368603,0.000011979047,0.8328515,0.00010872541,0.00008661917,0.00026756234,5.722722e-7,0.0004006661,0.012586298],"genre_scores_gemma":[0.86554843,0.0000040655405,0.13366123,0.00017575287,0.000009177377,0.000043227938,8.5373176e-7,0.000005362846,0.00055188563],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9992501,0.000057590823,0.00015179692,0.00020235054,0.00018982387,0.00014831248],"domain_scores_gemma":[0.9989882,0.0002132608,0.00006785779,0.000651407,0.00003705848,0.000042188814],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001903159,0.000093437025,0.00013078113,0.000071709044,0.0000372721,0.000025249892,0.000706244,0.000029728564,0.00015973127],"category_scores_gemma":[0.000041114527,0.000061486026,0.000028824645,0.0001363938,0.000023533208,0.00072943006,0.0003078132,0.00007289088,0.00024380577],"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.000014021419,0.000044590673,0.00051630073,0.00008599702,0.000005966867,0.0000012592186,0.00008939583,0.00013369965,0.026338007,0.022010705,0.012723271,0.9380368],"study_design_scores_gemma":[0.00015130712,0.00065604073,0.00050270377,0.000067733614,0.0000010399118,0.0000019236281,0.0000012570392,0.08151946,0.914868,0.00061159994,0.0015075573,0.00011135097],"about_ca_topic_score_codex":0.000012807639,"about_ca_topic_score_gemma":9.2316036e-8,"teacher_disagreement_score":0.93792546,"about_ca_system_score_codex":0.000011352714,"about_ca_system_score_gemma":0.0000061615574,"threshold_uncertainty_score":0.31337112},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.076828785,0.0011327182,0.92043793,0.00007189769,0.00005795917,0.00080996,0.0000010828679,0.00021689756,0.00044275098],"genre_scores_gemma":[0.77041227,0.00001758949,0.22934002,0.000056646433,0.000018478557,0.00009973452,0.000008445176,0.000008330425,0.000038510418],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985721,0.00013936605,0.0002799685,0.00038479193,0.0004391308,0.00018463508],"domain_scores_gemma":[0.9991344,0.00008298057,0.0001566672,0.000355844,0.00016294338,0.00010714823],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017130766,0.00015319539,0.00017719177,0.00007971504,0.00008523635,0.00008071731,0.00032549258,0.000074847514,0.00038402266],"category_scores_gemma":[0.00001322077,0.00011206786,0.000034002784,0.0001407704,0.00008425658,0.0013097402,0.00033372035,0.000099962446,0.000004336521],"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.00002890854,0.00035329675,0.00033460872,0.000024750721,0.000013013103,0.000004382014,0.00037629166,0.00064301933,0.49800465,0.0008301833,0.0064198985,0.492967],"study_design_scores_gemma":[0.00037065402,0.00012427758,0.0017621208,0.0000864475,0.0000031809072,0.000007739895,0.000036533605,0.62774044,0.3691244,0.00049275445,0.0001324967,0.00011896466],"about_ca_topic_score_codex":0.000024245104,"about_ca_topic_score_gemma":5.1383427e-8,"teacher_disagreement_score":0.6935835,"about_ca_system_score_codex":0.000023256129,"about_ca_system_score_gemma":0.000019063798,"threshold_uncertainty_score":0.45699945},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0095753865,0.000020780804,0.9884759,0.00019470857,0.00008329075,0.0006954524,0.0000030027259,0.000826568,0.0001248886],"genre_scores_gemma":[0.4158754,0.0000017356607,0.58372664,0.00006750873,0.000023525348,0.00017343846,0.000006591446,0.0000083620935,0.000116793584],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99903446,0.00002659462,0.00017274468,0.00035717,0.00015565904,0.00025338074],"domain_scores_gemma":[0.99911624,0.00010670344,0.00011028736,0.00039815478,0.00020623728,0.00006235012],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00011811164,0.00012496873,0.000117400974,0.00009001645,0.000190791,0.0001725799,0.00045713855,0.00004713011,0.000018715937],"category_scores_gemma":[0.00006791265,0.00009389908,0.000025374215,0.00020350917,0.000030310384,0.0016066377,0.0001864277,0.00006221845,0.000019425166],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010733798,0.00031412128,0.0008038194,0.00013440436,0.00005017247,0.000004931752,0.0012669733,0.059756666,0.16439308,0.060070388,0.009782799,0.7033153],"study_design_scores_gemma":[0.00024467966,0.00016567874,0.000130313,0.000035442994,0.0000018547101,0.000008446216,0.000046839923,0.88823354,0.109143764,0.00066727266,0.0011617265,0.0001604117],"about_ca_topic_score_codex":0.00007931028,"about_ca_topic_score_gemma":0.000006055812,"teacher_disagreement_score":0.8284769,"about_ca_system_score_codex":0.000027471797,"about_ca_system_score_gemma":0.000017948561,"threshold_uncertainty_score":0.38290933},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0029441514,0.0008585513,0.9934691,0.00005211743,0.0011530741,0.0007588957,0.00007333414,0.0005683976,0.00012238095],"genre_scores_gemma":[0.4692688,0.000154262,0.5291942,0.0002479985,0.0006560248,0.00007213216,0.00017975662,0.00006989365,0.00015693462],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9966134,0.00046162948,0.0007412745,0.000663241,0.00042019022,0.0011003105],"domain_scores_gemma":[0.99599415,0.0014490836,0.0005191217,0.0012458741,0.00046101736,0.00033072373],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0012412925,0.00041331956,0.00064157025,0.00014782218,0.00022071805,0.00010573107,0.0011782441,0.00031001138,0.000019489404],"category_scores_gemma":[0.00019033276,0.00036800606,0.00017219414,0.0006373914,0.00015747252,0.0011068559,0.0008483315,0.00043782525,0.000012116399],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008237972,0.002300319,0.032406278,0.00021557839,0.0003264998,0.000045626348,0.00066048256,0.13695377,0.01757925,0.0031675084,0.11698599,0.6885349],"study_design_scores_gemma":[0.00051596365,0.00014542611,0.014273849,0.00011786479,0.000015395533,0.00001993534,0.000013483934,0.97378176,0.0065521053,0.0000930433,0.003988668,0.00048251316],"about_ca_topic_score_codex":0.0000883405,"about_ca_topic_score_gemma":0.000012916807,"teacher_disagreement_score":0.836828,"about_ca_system_score_codex":0.000051655443,"about_ca_system_score_gemma":0.000029139137,"threshold_uncertainty_score":0.9998772},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00026184152,0.0000088345605,0.9893354,0.000067657485,0.00055754546,0.00018512405,0.000014500744,0.000710863,0.008858203],"genre_scores_gemma":[0.845234,0.000029688554,0.1534063,0.000889783,0.000008910831,0.00007735781,0.00000398799,0.000009649362,0.00034030923],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9989057,0.00013603721,0.000336554,0.00015264541,0.0002534632,0.00021558486],"domain_scores_gemma":[0.99889356,0.00018027368,0.00012187775,0.0006351965,0.00008086216,0.00008822953],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046751468,0.00014652722,0.00011337504,0.00018459086,0.00039416002,0.00021493569,0.00050173426,0.000074997544,0.00019271481],"category_scores_gemma":[0.000021516329,0.0001390906,0.0000689863,0.00031701272,0.000063584244,0.004268361,0.0000032153819,0.00024442555,0.0005493793],"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.000027621252,0.000073120806,0.0000010737799,0.000019053972,0.000016672751,0.0000011156222,0.0011795565,0.0320725,0.00034155278,0.63020134,0.0010289383,0.33503744],"study_design_scores_gemma":[0.0012381553,0.00027036332,0.000023994578,0.00011285104,0.000019029207,0.000091069815,0.00038909804,0.13424996,0.54384744,0.11335535,0.20545395,0.0009487254],"about_ca_topic_score_codex":0.0000019636657,"about_ca_topic_score_gemma":4.483513e-7,"teacher_disagreement_score":0.84497213,"about_ca_system_score_codex":0.000069496426,"about_ca_system_score_gemma":0.00006651738,"threshold_uncertainty_score":0.70613426},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00010007266,0.000049639966,0.9957868,0.0011273267,0.00021749735,0.00038499627,0.000036773283,0.0012799619,0.0010169209],"genre_scores_gemma":[0.31053114,0.000026211697,0.6886381,0.0004143298,0.000046037603,0.00011192486,0.0000040673194,0.000019047602,0.00020917701],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99841875,0.000024655621,0.0003257804,0.00054938986,0.00029760995,0.00038381224],"domain_scores_gemma":[0.99911463,0.00009765455,0.00010252074,0.0003808145,0.00019356662,0.000110781475],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020040439,0.00023604388,0.00021383821,0.00024906357,0.0006774635,0.00036172682,0.0006059027,0.000080519836,0.00001877311],"category_scores_gemma":[0.000011257425,0.00021888495,0.0001357983,0.000467063,0.00006584404,0.0030358753,0.000002069863,0.00028002277,0.000013004808],"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.000045316912,0.00019227207,1.4883503e-7,0.00004396915,0.0000063093116,0.000005115107,0.00020305942,0.00017043191,0.2294458,0.0004207883,0.0003301045,0.76913667],"study_design_scores_gemma":[0.00062451547,0.00018899987,0.000015717107,0.0001686002,0.000015104132,0.000046853995,0.0000249824,0.081963874,0.90284646,0.011943706,0.0017854377,0.00037573872],"about_ca_topic_score_codex":0.0000025174584,"about_ca_topic_score_gemma":0.0000017827961,"teacher_disagreement_score":0.768761,"about_ca_system_score_codex":0.00008303697,"about_ca_system_score_gemma":0.000086013446,"threshold_uncertainty_score":0.8925869},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.026499808,0.0000011034545,0.9696389,0.00024968907,0.00012419949,0.00042758769,0.000019274372,0.0011644019,0.0018750406],"genre_scores_gemma":[0.4488406,8.703519e-8,0.5509397,0.00013543807,0.000011627603,0.000029723044,0.0000040145806,0.0000067504375,0.000032073083],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984682,0.000057816986,0.00024716416,0.00059513457,0.00030473882,0.00032694192],"domain_scores_gemma":[0.9979692,0.00038265865,0.00011076506,0.0011673945,0.00019128497,0.00017871101],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037607457,0.00018677187,0.00018996057,0.00006440448,0.00011538424,0.00011885973,0.0010417455,0.000078045116,0.00015498736],"category_scores_gemma":[0.0003404265,0.00013173769,0.000029335984,0.0002143529,0.0003766677,0.0006203869,0.00031527772,0.000388241,0.00002842501],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000059968428,0.0007216992,0.012834513,0.00008901331,0.000019565323,0.00014860317,0.0003716816,0.0003561088,0.25642622,0.03227607,0.00079595554,0.6959006],"study_design_scores_gemma":[0.000856438,0.00007529211,0.0021691502,0.000045832603,0.0000033804674,0.000027327054,0.000015325535,0.67146546,0.32144892,0.0023712583,0.001120978,0.0004006234],"about_ca_topic_score_codex":0.000010016892,"about_ca_topic_score_gemma":0.000062804844,"teacher_disagreement_score":0.69549996,"about_ca_system_score_codex":0.000016689411,"about_ca_system_score_gemma":0.00011845783,"threshold_uncertainty_score":0.5372107},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.70354784,0.00016795195,0.29563576,0.0003213458,0.00019691022,0.00007882173,6.06762e-7,0.000019002448,0.00003175576],"genre_scores_gemma":[0.9574213,0.000040691473,0.042422626,0.00007079462,0.00003436798,0.0000010385243,3.732351e-7,0.00000502607,0.0000037990712],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99850744,0.0002012583,0.00056135387,0.00013417094,0.00043790933,0.00015784851],"domain_scores_gemma":[0.998861,0.00030033433,0.00041492505,0.00026475216,0.00011950422,0.000039470295],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011019987,0.00010080676,0.0002519751,0.00022649001,0.00008007475,0.0000687674,0.0009365146,0.000038679234,0.000003220171],"category_scores_gemma":[0.00027256092,0.00006267922,0.000086873886,0.00035729405,0.000044458873,0.0009233634,0.00022836064,0.0003116826,8.2020506e-7],"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.000059137943,0.00011728295,0.000587399,0.00005387841,0.000008905632,0.000061814084,0.0011673986,0.00031210767,0.9138405,0.0012656489,0.000096732445,0.08242922],"study_design_scores_gemma":[0.0045620794,0.002058845,0.17877324,0.0052460716,0.000031843076,0.001959296,0.0008005466,0.54731655,0.24983858,0.006555301,0.0021207873,0.0007368868],"about_ca_topic_score_codex":0.00000283762,"about_ca_topic_score_gemma":0.0000026227942,"teacher_disagreement_score":0.6640019,"about_ca_system_score_codex":0.00006398447,"about_ca_system_score_gemma":0.000036936985,"threshold_uncertainty_score":0.25559846},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000029790095,0.00005307905,0.9952415,0.00084406976,0.00008566669,0.00082444213,0.00006960185,0.0013445093,0.0015072973],"genre_scores_gemma":[0.22395425,0.000020703153,0.775091,0.00041400964,0.000030336038,0.00028808948,0.00001739048,0.000029625717,0.00015460061],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99776167,0.000050132345,0.00044334636,0.0008071583,0.00040047572,0.00053722237],"domain_scores_gemma":[0.99867827,0.00006702532,0.00015517931,0.00074483943,0.00018389453,0.00017080622],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00024090661,0.0003554753,0.00032801053,0.00027231858,0.0006399177,0.00036944245,0.0010037917,0.0001231107,0.000007287008],"category_scores_gemma":[0.0000067847022,0.00032134636,0.00019016511,0.0005873937,0.00009816859,0.0021200168,0.000002401019,0.00033803572,0.000004731963],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002111856,0.00054038723,2.4702973e-7,0.00016275064,0.000012470031,0.000005671421,0.00040365013,0.016561383,0.02908499,0.0005130258,0.00028724826,0.952217],"study_design_scores_gemma":[0.0011135382,0.00034108124,0.000010953709,0.00013600588,0.000028760514,0.000010721293,0.000044321274,0.76515615,0.22921276,0.0031424141,0.0003261318,0.00047716434],"about_ca_topic_score_codex":0.00000717982,"about_ca_topic_score_gemma":0.0000018242556,"teacher_disagreement_score":0.95173985,"about_ca_system_score_codex":0.00009480916,"about_ca_system_score_gemma":0.00016490392,"threshold_uncertainty_score":0.9999239},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0016371108,0.000015701402,0.9880428,0.000111693116,0.00006808323,0.00016659294,0.000002788387,0.0009281791,0.009027088],"genre_scores_gemma":[0.24554081,0.000011376193,0.7539599,0.00024038106,0.000011508794,0.0000131601355,0.0000065019317,0.0000073923356,0.00020899712],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9989792,0.000041353593,0.000174668,0.00036775926,0.00022540017,0.00021160209],"domain_scores_gemma":[0.99885803,0.000032799766,0.000085545784,0.00082858745,0.000101628924,0.00009338023],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00011299953,0.00012699478,0.00011993658,0.0000852053,0.000075336124,0.000056739165,0.00074133096,0.000043241118,0.00026041162],"category_scores_gemma":[0.000027468557,0.000089801266,0.00003014175,0.0002464781,0.00009669714,0.00079707196,0.00025395706,0.000090197216,0.000111062094],"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.000012039201,0.00009354916,0.00094533927,0.00000580719,0.000011385588,0.00001019988,0.00033830793,0.0000060416965,0.0072098444,0.9670933,0.0021495614,0.02212464],"study_design_scores_gemma":[0.0019219209,0.00096039637,0.009780696,0.0002899663,0.000034660974,0.00035301715,0.0002168531,0.022919362,0.6741113,0.17708234,0.11032797,0.0020014981],"about_ca_topic_score_codex":0.00002917756,"about_ca_topic_score_gemma":0.000010580438,"teacher_disagreement_score":0.7900109,"about_ca_system_score_codex":0.000019699355,"about_ca_system_score_gemma":0.000039873506,"threshold_uncertainty_score":0.36619893},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000050493795,0.000015448362,0.9212425,0.0014130858,0.000023705503,0.074884355,0.0000068054915,0.0009551617,0.0014538801],"genre_scores_gemma":[0.0049637603,0.0000020932696,0.7357637,0.00022611747,0.000040568033,0.25857306,0.000012292513,0.000014102982,0.0004042736],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987183,0.00011624535,0.00034526028,0.00035461676,0.0002407796,0.00022478649],"domain_scores_gemma":[0.99804336,0.00020683042,0.00014539532,0.0013609661,0.00015233348,0.000091143535],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034405233,0.00015713481,0.00017268653,0.00009432563,0.00020253679,0.00017435648,0.0016092579,0.000075160584,0.000023705297],"category_scores_gemma":[0.000014938677,0.0001222303,0.000058181893,0.00018013603,0.000037377355,0.0011414629,0.00017575834,0.00010796462,0.000014030029],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009032786,0.00045526258,0.00003181705,0.0002803792,0.000007946407,0.0000012089049,0.000098163626,0.0016453597,0.034477632,0.07984813,0.11306815,0.7699956],"study_design_scores_gemma":[0.00061788096,0.000056916117,0.000017326614,0.0001610936,0.0000012123814,0.0000019595948,0.00000439746,0.4521165,0.17251545,0.0005491479,0.37380803,0.0001500989],"about_ca_topic_score_codex":0.000017779752,"about_ca_topic_score_gemma":0.0000024219883,"teacher_disagreement_score":0.76984555,"about_ca_system_score_codex":0.000054211643,"about_ca_system_score_gemma":0.00005570036,"threshold_uncertainty_score":0.4984407},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.025325848,0.0009236053,0.9535687,0.0004449256,0.0006058196,0.0015651404,0.000144004,0.0025370915,0.01488488],"genre_scores_gemma":[0.5277405,0.00033963026,0.46853316,0.00060490984,0.00018007829,0.00022900086,0.00013697379,0.00014804829,0.0020876853],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99094766,0.0004857924,0.0023947605,0.0024686244,0.0020870948,0.0016160364],"domain_scores_gemma":[0.990482,0.00048329885,0.0014659549,0.0050900485,0.0017666606,0.00071204075],"candidate_categories":["metaepi_narrow"],"consensus_categories":["metaepi_narrow"],"category_scores_codex":[0.0015326452,0.0013702167,0.0015851443,0.000992683,0.0006651287,0.00052543625,0.0045097964,0.00060847146,0.0005267357],"category_scores_gemma":[0.00052154635,0.0011710796,0.0003854699,0.00156879,0.00059912575,0.0064480924,0.0022282402,0.0008539378,0.000361418],"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.0014881568,0.0021215256,0.0010727117,0.0005438326,0.00053668104,0.00019512822,0.007775847,0.01021067,0.5052826,0.28280547,0.08798115,0.099986255],"study_design_scores_gemma":[0.0064289,0.002676907,0.001066066,0.0018980002,0.0002956658,0.00031456802,0.00043137197,0.43529367,0.36450106,0.061476763,0.11953707,0.006079947],"about_ca_topic_score_codex":0.00032694865,"about_ca_topic_score_gemma":0.0009562796,"teacher_disagreement_score":0.50241464,"about_ca_system_score_codex":0.00033616705,"about_ca_system_score_gemma":0.0005294658,"threshold_uncertainty_score":0.9999049},"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":"empirical","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9611841,0.00007627507,0.035977546,0.0009731116,0.00014018574,0.000928307,0.00004583362,0.0001729345,0.00050172216],"genre_scores_gemma":[0.14990395,0.000057250545,0.84914523,0.00006533419,0.00017598891,0.0005597638,0.000009153444,0.00003166738,0.00005166446],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99831283,1.5213454e-8,0.0005268076,0.00046922915,0.00037583875,0.00031526142],"domain_scores_gemma":[0.9983155,0.00037784924,0.00031936116,0.0001065843,0.0007789459,0.00010176337],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00060219737,0.00023640147,0.00031886087,0.00013984567,0.00013230485,0.00015128731,0.0015319743,0.00016718356,0.0000026438042],"category_scores_gemma":[0.00040660103,0.00019558145,0.00018443844,0.00034485335,0.0001703261,0.0010907404,0.0005369887,0.00036009532,2.2067802e-7],"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.000014113543,0.00005680486,0.00022572096,0.0001650156,0.000025268973,1.2572059e-8,0.00006896022,0.000034671004,0.45337164,0.5448051,0.0006536921,0.0005789878],"study_design_scores_gemma":[0.001778102,0.00036846907,0.0016103849,0.0006942502,0.000067317065,0.000020346915,0.0007100176,0.3494832,0.545322,0.06267233,0.036544137,0.0007294224],"about_ca_topic_score_codex":0.000007126717,"about_ca_topic_score_gemma":1.5856804e-7,"teacher_disagreement_score":0.8131677,"about_ca_system_score_codex":0.00004946857,"about_ca_system_score_gemma":0.000025972673,"threshold_uncertainty_score":0.797558},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00400498,0.0026280757,0.9919028,0.00014466656,0.00004093537,0.0008460834,0.0000049271603,0.00033707774,0.000090427035],"genre_scores_gemma":[0.94451314,0.0024586434,0.049897272,0.00025982337,0.00018552002,0.0025751777,0.000036163623,0.0000159307,0.000058338108],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99870557,0.00004195086,0.0003104841,0.000515263,0.000110400935,0.00031635855],"domain_scores_gemma":[0.9988672,0.00015536958,0.000099387784,0.00071239524,0.00004777514,0.000117863245],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016325018,0.00016169567,0.00017291158,0.00008160007,0.00018773726,0.00012911756,0.0005347648,0.000112734015,0.000006696982],"category_scores_gemma":[0.0000055580554,0.00015798255,0.00003248524,0.00045993165,0.000070252296,0.0006235336,0.00034749255,0.00025540325,0.000008982167],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004591082,0.0001169269,0.00054062344,0.0000031586856,0.0000023007158,7.7071746e-7,0.000021139129,0.17438884,0.00025204904,0.004149619,0.00088143756,0.81963855],"study_design_scores_gemma":[0.00025771098,0.00002227588,0.0017067994,0.000029446746,0.0000023780015,0.0000051118086,0.000012457859,0.8668063,0.00013030114,0.0003791863,0.13047709,0.00017090894],"about_ca_topic_score_codex":0.000006576001,"about_ca_topic_score_gemma":0.000088646164,"teacher_disagreement_score":0.9420056,"about_ca_system_score_codex":0.00005219396,"about_ca_system_score_gemma":0.000010576456,"threshold_uncertainty_score":0.6442342},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0030064804,0.00004178267,0.9934556,0.00022944294,0.00029770052,0.0005120933,0.0000073208535,0.0010056817,0.0014438947],"genre_scores_gemma":[0.47131094,0.0000020218436,0.5268836,0.00015925153,0.000061463754,0.00017309687,0.00001802713,0.000008414184,0.0013831868],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.998865,0.00002120243,0.00023258288,0.00043042633,0.0001605693,0.00029023693],"domain_scores_gemma":[0.9990552,0.00009766262,0.00008538162,0.0005972499,0.000115741306,0.000048752656],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001335565,0.0001357343,0.00013757467,0.00008920823,0.00012339422,0.00010369649,0.0006569832,0.000063337,0.000023866805],"category_scores_gemma":[0.000049615188,0.00011801818,0.000053239175,0.00016692626,0.000024839937,0.0011507892,0.00023244231,0.000059645692,0.000028981985],"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.000040403167,0.00025371913,0.00010381211,0.0000364189,0.000009488818,0.0000026747828,0.00011685716,0.0016155487,0.6557058,0.17080408,0.05988351,0.11142767],"study_design_scores_gemma":[0.00041299974,0.00005868693,0.0002315457,0.00001675985,0.0000016825853,0.000002324938,0.000006355594,0.18595177,0.7405884,0.060826693,0.011692297,0.00021045718],"about_ca_topic_score_codex":0.00004865635,"about_ca_topic_score_gemma":0.000034348537,"teacher_disagreement_score":0.46830446,"about_ca_system_score_codex":0.000039831306,"about_ca_system_score_gemma":0.000017449465,"threshold_uncertainty_score":0.48126417},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00057717384,0.0000038750286,0.9974612,0.00015782789,0.00011927666,0.00037338244,0.00002485897,0.00058221724,0.0007001977],"genre_scores_gemma":[0.9710292,0.000024915586,0.028431455,0.0003209849,0.000008363627,0.000075569,0.000038032493,0.000005846141,0.00006560357],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988968,0.00025358313,0.0003353856,0.00014989304,0.0002212921,0.00014305976],"domain_scores_gemma":[0.99871945,0.0005582801,0.00020471703,0.00033112968,0.000118326505,0.00006808888],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009115414,0.00014257434,0.0002081146,0.00016102492,0.0002857236,0.00016835837,0.00021448024,0.0000625519,0.000010493091],"category_scores_gemma":[0.000057464687,0.00011145158,0.000042137,0.00021677233,0.00017977567,0.002525432,0.0000040505543,0.00014808676,0.000020935033],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.003342039,0.00003361927,0.0000010155566,0.000033070934,0.000027341115,1.7596435e-7,0.0008941306,0.010823334,0.00009348346,0.5641147,0.00008903404,0.42054805],"study_design_scores_gemma":[0.046184678,0.00023492082,0.0000176303,0.0002043489,0.000049904265,0.000059400452,0.00024069937,0.8697579,0.04431192,0.0317928,0.0066094296,0.0005363566],"about_ca_topic_score_codex":0.0000032769242,"about_ca_topic_score_gemma":5.277357e-7,"teacher_disagreement_score":0.9704521,"about_ca_system_score_codex":0.00003151078,"about_ca_system_score_gemma":0.000023129853,"threshold_uncertainty_score":0.45448634},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008366726,0.00005355021,0.9885623,0.00090107665,0.000080349266,0.00058084534,0.000012392174,0.0012568447,0.0001859434],"genre_scores_gemma":[0.5474519,0.000059229555,0.45194906,0.000073223964,0.000003922287,0.00040129366,0.000003507482,0.000018390256,0.00003944786],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982691,0.00027339745,0.0003626291,0.00043466288,0.00029684082,0.00036340993],"domain_scores_gemma":[0.9957903,0.0006217657,0.00019118209,0.0030264142,0.0002316525,0.00013868412],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001935858,0.00024718608,0.0002247246,0.0002793552,0.001207656,0.00021969831,0.0024337387,0.000098192875,0.000021620159],"category_scores_gemma":[0.000010865889,0.00022665507,0.00007816902,0.00067456835,0.00024387345,0.0016106359,0.000038661834,0.00058447494,0.000088123605],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000068629466,0.0013698062,0.000093261675,0.000046942463,0.00018565128,0.0000063287875,0.0027008413,0.13881375,0.25588733,0.007799645,0.0005432263,0.5924846],"study_design_scores_gemma":[0.00045283293,0.00019237687,0.00010400902,0.00021143518,0.00002087682,0.00002598988,0.00036682351,0.7448258,0.25269935,0.00029225898,0.00035933676,0.00044897167],"about_ca_topic_score_codex":0.00029487844,"about_ca_topic_score_gemma":0.00011715149,"teacher_disagreement_score":0.606012,"about_ca_system_score_codex":0.00011636989,"about_ca_system_score_gemma":0.00007039408,"threshold_uncertainty_score":0.92884356},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006103386,0.00004925341,0.99071926,0.00017373319,0.00015571949,0.000284267,0.00001173323,0.0010671068,0.0014355383],"genre_scores_gemma":[0.5115742,0.00001217257,0.48801687,0.00029048833,0.000029341938,0.000009820337,0.000006076623,0.000008427666,0.000052624662],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99853075,0.0000463166,0.0002862368,0.0005014975,0.00027192864,0.00036329514],"domain_scores_gemma":[0.99873006,0.0003757339,0.00011415985,0.0005105649,0.00011463924,0.00015483309],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005198113,0.0001752492,0.00016694854,0.00019881451,0.00019356002,0.00020049549,0.0005131687,0.00009359437,0.000026080606],"category_scores_gemma":[0.00021908879,0.00015944667,0.000031964635,0.00028698545,0.000103028106,0.0016662764,0.00036192616,0.00023340774,0.000011404105],"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.00015469307,0.00023773647,0.0068014986,0.00007767873,0.000024431614,0.000096503725,0.0011009988,0.00014060477,0.78112036,0.041105043,0.0072224448,0.161918],"study_design_scores_gemma":[0.0006629174,0.00014787572,0.0064154784,0.00013143122,0.0000057457905,0.000016258246,0.00009360619,0.5226759,0.4621715,0.0049388264,0.0023915258,0.0003489407],"about_ca_topic_score_codex":0.00004155347,"about_ca_topic_score_gemma":0.000015150343,"teacher_disagreement_score":0.5225353,"about_ca_system_score_codex":0.00011947736,"about_ca_system_score_gemma":0.0000388347,"threshold_uncertainty_score":0.65020466},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000014467022,0.000035478195,0.9969713,0.00042658037,0.000054594602,0.0007594277,0.000002411071,0.0008371741,0.0008985455],"genre_scores_gemma":[0.009346186,0.000024662095,0.9892166,0.0004608536,0.000022635344,0.0001824037,0.000012666741,0.0000099776835,0.00072401715],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991145,0.000043922522,0.0001977128,0.00031270157,0.0001242806,0.00020689836],"domain_scores_gemma":[0.9988193,0.0002375213,0.00008697943,0.0005588207,0.0002411495,0.000056262135],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023713101,0.000095602125,0.00011757914,0.000083310086,0.00012109762,0.00027098696,0.0006593053,0.000036478992,0.000109245724],"category_scores_gemma":[0.00021512076,0.000079262216,0.00002421285,0.0003127485,0.000015671358,0.0024375697,0.00022174013,0.000044638848,0.00009380046],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000044151343,0.000035458095,0.000028564233,0.000035208865,0.000005865239,0.0000010525688,0.00004160244,0.000105921,0.19522688,0.27500466,0.46194217,0.06756821],"study_design_scores_gemma":[0.00017772769,0.000055623354,0.000045811004,0.000046632493,0.0000021372723,0.0000036973802,0.000005949706,0.60350996,0.3296327,0.052462913,0.01387126,0.000185626],"about_ca_topic_score_codex":0.000018247114,"about_ca_topic_score_gemma":1.765014e-7,"teacher_disagreement_score":0.603404,"about_ca_system_score_codex":0.000021621441,"about_ca_system_score_gemma":0.000020155807,"threshold_uncertainty_score":0.32322192},"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":"empirical","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9869681,0.0005960831,0.0047219307,0.004812599,0.0005722271,0.0010595846,0.00018890853,0.00020211244,0.0008784532],"genre_scores_gemma":[0.3431911,0.0007475861,0.65465033,0.00030856696,0.0007390271,0.00012178375,0.00003175423,0.00007317879,0.00013664356],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9956845,3.2418082e-8,0.0015405781,0.0007507942,0.0013917701,0.0006323052],"domain_scores_gemma":[0.9951254,0.0001900974,0.0013274583,0.00018833116,0.002972291,0.00019642375],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00093947933,0.00053083466,0.00074101886,0.00022959747,0.0001235228,0.00020719579,0.0031066914,0.0002880717,0.000028542854],"category_scores_gemma":[0.00044176859,0.00047522577,0.0008787884,0.0007311231,0.0003002226,0.0017872363,0.0006036374,0.00048862415,0.0000033925699],"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.000057854482,0.0001849944,0.00013511631,0.00036768112,0.00027820986,1.2713494e-7,0.00036342378,0.000044467582,0.43240958,0.5509247,0.0086385,0.006595341],"study_design_scores_gemma":[0.0018109729,0.0015245094,0.0023127273,0.0011123457,0.0003108917,0.000015879416,0.0014555278,0.037722323,0.9223486,0.017161649,0.013422452,0.0008021061],"about_ca_topic_score_codex":0.0000173756,"about_ca_topic_score_gemma":1.2111948e-7,"teacher_disagreement_score":0.64992845,"about_ca_system_score_codex":0.0002325427,"about_ca_system_score_gemma":0.00009323694,"threshold_uncertainty_score":0.9997699},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00021875407,0.00028116058,0.99503255,0.0010682166,0.00023320779,0.0009388028,0.0000058929545,0.0011821118,0.0010393094],"genre_scores_gemma":[0.30921102,0.000014363441,0.68984073,0.00058200245,0.00011955433,0.000058427628,0.000010697154,0.000034078108,0.00012910953],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973947,0.00025897194,0.0004858574,0.00084549206,0.0003953357,0.00061963964],"domain_scores_gemma":[0.997519,0.0010048889,0.00032817246,0.00090064487,0.00010699813,0.00014026796],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004378784,0.00035702737,0.00036890153,0.0002087694,0.00052919326,0.00027976194,0.0012738502,0.00012260438,0.000017120454],"category_scores_gemma":[0.00021830738,0.00032931694,0.00012968923,0.00033087764,0.00005610792,0.00037650936,0.0002951544,0.00030512168,0.00004290431],"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.00014151754,0.00041734258,0.00007661615,0.0001446098,0.00006762214,0.00004843968,0.0027483623,0.5793704,0.0054619415,0.13003346,0.034390505,0.24709919],"study_design_scores_gemma":[0.000704589,0.00022292345,0.00007965916,0.00020516169,0.000007317268,0.000019308194,0.000008031398,0.9723363,0.0030150465,0.015760433,0.0071980124,0.0004432134],"about_ca_topic_score_codex":0.000003499308,"about_ca_topic_score_gemma":9.797142e-7,"teacher_disagreement_score":0.3929659,"about_ca_system_score_codex":0.00007883965,"about_ca_system_score_gemma":0.000024482708,"threshold_uncertainty_score":0.9999159},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00012958089,0.0063292086,0.9424846,0.008988128,0.030744538,0.0021861005,0.000059247956,0.0012843873,0.0077942177],"genre_scores_gemma":[0.03417062,0.0028111527,0.68425304,0.04092205,0.026804777,0.0012739721,0.0015188396,0.00057520135,0.20767033],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99564505,0.0001328663,0.0006705604,0.0019194649,0.00045262385,0.0011794426],"domain_scores_gemma":[0.99678665,0.000386803,0.00020853477,0.0017835309,0.00017617182,0.0006583346],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00034905362,0.0007951157,0.00094531797,0.0001938318,0.0004028599,0.00050135166,0.00211573,0.00065088354,0.000013652298],"category_scores_gemma":[0.00026559297,0.0006840174,0.00024030768,0.0004463712,0.00016600925,0.0007993824,0.0012922247,0.0019108712,0.000008384188],"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.00006509895,0.000050031478,0.0000013104393,0.00004567747,0.000012783304,0.000052149044,0.00001491262,0.0010535164,0.00007488092,0.0012063553,0.8062848,0.19113848],"study_design_scores_gemma":[0.0004804073,0.00093875476,0.00012549084,0.00033858692,0.00005981274,0.00017859045,0.000007176223,0.6702,0.0007099793,0.006662691,0.31872642,0.001572075],"about_ca_topic_score_codex":0.0000025291522,"about_ca_topic_score_gemma":0.0000065244662,"teacher_disagreement_score":0.6691465,"about_ca_system_score_codex":0.0000467596,"about_ca_system_score_gemma":0.000057973004,"threshold_uncertainty_score":0.9995611},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010630359,0.0017294438,0.9867502,0.00010217293,0.000028092438,0.00037466365,0.0000087498,0.00016014584,0.00021620574],"genre_scores_gemma":[0.60949355,0.000041031966,0.39031342,0.000033531283,0.000009737858,0.0000664072,0.000017126718,0.000009191556,0.000015990605],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99884003,0.0001239825,0.0003497775,0.00022613672,0.0002248156,0.00023527892],"domain_scores_gemma":[0.9984678,0.00016535772,0.00038888992,0.0006730628,0.00022944043,0.000075424185],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00056486164,0.0001358303,0.0001693248,0.0001218939,0.00031746077,0.00012997598,0.0007837271,0.000060636507,0.0000013783235],"category_scores_gemma":[0.000114739545,0.00012927184,0.000030556977,0.0002071656,0.00013343217,0.0029277455,0.00056457566,0.00014332774,9.731285e-7],"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.00005854005,0.00023954117,0.0029356063,0.00019574522,0.0000079096035,1.2760388e-7,0.0014860824,0.000019149542,0.6328527,0.0013441688,0.00044326953,0.36041722],"study_design_scores_gemma":[0.0017727616,0.00022931909,0.028990667,0.0016001407,0.000034040586,0.000014776084,0.0007753735,0.6342423,0.31252638,0.01647441,0.0026670923,0.0006727313],"about_ca_topic_score_codex":0.00001302264,"about_ca_topic_score_gemma":0.0000011547091,"teacher_disagreement_score":0.63422316,"about_ca_system_score_codex":0.000064042,"about_ca_system_score_gemma":0.000041150957,"threshold_uncertainty_score":0.5271553},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02552204,0.000019378662,0.9709117,0.00088838616,0.000018066758,0.00020639776,5.486843e-7,0.00008461032,0.002348914],"genre_scores_gemma":[0.9783257,0.000016967793,0.020936567,0.00046892493,0.000007017263,0.0000224863,8.1094646e-7,0.0000023891362,0.00021908878],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999473,0.00005003802,0.00011759999,0.00015224925,0.000121676756,0.000085445194],"domain_scores_gemma":[0.9992413,0.000295341,0.00005773584,0.00036548087,0.000024345361,0.00001583033],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015696812,0.0000561415,0.000068765694,0.00006598101,0.000035574303,0.00004353858,0.00038506172,0.000023670887,0.0000056489025],"category_scores_gemma":[0.000051083112,0.000035156878,0.000009277139,0.00013988662,0.000021669868,0.00040197442,0.0001497693,0.00007210308,0.000008801575],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002491971,0.00037130728,0.0004001022,0.000064978376,0.000013842615,0.000007104116,0.010735176,0.006049703,0.022034885,0.73050535,0.064914085,0.16487853],"study_design_scores_gemma":[0.00035973135,0.00026263585,0.0022522116,0.00012512818,0.0000017003576,0.00001099618,0.00019822143,0.8536146,0.059824333,0.07995351,0.0031682593,0.000228655],"about_ca_topic_score_codex":0.000039373615,"about_ca_topic_score_gemma":0.000003214762,"teacher_disagreement_score":0.95280373,"about_ca_system_score_codex":0.000005067386,"about_ca_system_score_gemma":0.0000045874513,"threshold_uncertainty_score":0.14336558},"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":"empirical","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.85242414,0.00010576847,0.14279069,0.0029550751,0.00007614143,0.0009132368,0.00037602457,0.00017383246,0.00018506295],"genre_scores_gemma":[0.05345551,0.00010102589,0.9456364,0.00013743137,0.00010679613,0.00035438014,0.00009313246,0.00003465454,0.00008069329],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979296,1.8794548e-8,0.00059587095,0.00056456204,0.00054489495,0.00036510816],"domain_scores_gemma":[0.9978689,0.00020742223,0.00035214625,0.00013560917,0.0012666386,0.00016928726],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00048619066,0.00029554212,0.00044499993,0.0001844266,0.00011369001,0.00030992232,0.0017891666,0.00014538722,0.000014480161],"category_scores_gemma":[0.0002865624,0.00023473905,0.0004553001,0.000531338,0.00017628427,0.00226906,0.00042468816,0.00021733927,0.0000011114813],"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.000029916631,0.000099887126,0.000096352436,0.00033158064,0.00046988548,6.219083e-8,0.00012846876,0.000058133955,0.67282945,0.30245835,0.020668829,0.0028291047],"study_design_scores_gemma":[0.0013590371,0.00046889746,0.0014906728,0.0002725855,0.000427475,0.000012822709,0.00040192515,0.5751942,0.37808678,0.013455435,0.02808434,0.00074585597],"about_ca_topic_score_codex":0.000012399277,"about_ca_topic_score_gemma":5.5412702e-8,"teacher_disagreement_score":0.8028457,"about_ca_system_score_codex":0.00007546004,"about_ca_system_score_gemma":0.000021192698,"threshold_uncertainty_score":0.9572381},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.023294706,0.000045960263,0.97405416,0.00008036499,0.000023903074,0.000099691846,0.000004318076,0.00012270217,0.002274167],"genre_scores_gemma":[0.55939627,0.000030763345,0.44052118,0.000019360423,0.000008107799,8.322268e-7,9.0647353e-7,0.0000017322293,0.000020870742],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9991189,0.000023849685,0.0003094452,0.00021059463,0.00021548946,0.00012167178],"domain_scores_gemma":[0.99925786,0.00009050602,0.00012835677,0.0004129724,0.000082879036,0.000027395225],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018203942,0.00007454354,0.00017808148,0.00016088426,0.000014197053,0.000006154689,0.00057251693,0.00004533599,0.0000048376814],"category_scores_gemma":[0.00003869808,0.00006548112,0.000027444055,0.00028450633,0.000026527116,0.0006145453,0.0001670934,0.00010915971,7.7306106e-7],"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.00030742586,0.0017029932,0.004902073,0.00014682664,0.000034361645,0.00009719612,0.0040366813,0.15258518,0.19523503,0.22849886,0.0020802263,0.41037315],"study_design_scores_gemma":[0.0001266946,0.00010482942,0.00029556427,0.00009501998,6.601017e-7,0.000001384107,0.000013146193,0.4639373,0.5136423,0.021704039,0.000025736608,0.00005329777],"about_ca_topic_score_codex":0.00004373194,"about_ca_topic_score_gemma":0.0000023476239,"teacher_disagreement_score":0.5361016,"about_ca_system_score_codex":0.000015285656,"about_ca_system_score_gemma":0.000023791166,"threshold_uncertainty_score":0.26702428},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.021907765,0.00015321077,0.9744808,0.000067875924,0.00014347852,0.00020983574,0.000010616155,0.00081900734,0.0022073924],"genre_scores_gemma":[0.58786654,0.0000458186,0.41157797,0.00037692572,0.000011171394,0.0000039120114,0.000008037864,0.000010891956,0.00009870125],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99864453,0.000083171166,0.0002492238,0.000520066,0.00021628624,0.00028673],"domain_scores_gemma":[0.9989602,0.00009839109,0.00014445682,0.0005821453,0.00007937969,0.00013544278],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016496424,0.00019394999,0.00019413535,0.00011025119,0.00021999782,0.00012667647,0.00047534882,0.000081327504,0.000011699584],"category_scores_gemma":[0.00006932299,0.00016986029,0.000031897205,0.00018314068,0.00008410263,0.0015508068,0.0005629734,0.00017557046,0.000008729215],"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.000038302504,0.00013462197,0.0044596763,0.000043127886,0.000034735727,0.000062240324,0.0027104262,0.00002860534,0.73868173,0.008157141,0.047857147,0.19779223],"study_design_scores_gemma":[0.0009168445,0.00012421016,0.003241209,0.00028846093,0.000010869791,0.00005396526,0.00026789162,0.3426705,0.6320744,0.0064588957,0.013021623,0.0008710991],"about_ca_topic_score_codex":0.000121910896,"about_ca_topic_score_gemma":0.000020578791,"teacher_disagreement_score":0.5659588,"about_ca_system_score_codex":0.000034977846,"about_ca_system_score_gemma":0.000015085499,"threshold_uncertainty_score":0.69267017},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017211767,0.00014729293,0.9755091,0.0055856677,0.00012470855,0.00035557244,0.00000415274,0.00057665823,0.0004850689],"genre_scores_gemma":[0.59345245,0.00008864012,0.39868012,0.007194604,0.00015241693,0.000099508645,0.000035636825,0.000038467995,0.00025815386],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99777067,0.00019355399,0.0002489987,0.0006463914,0.00042599862,0.00071438315],"domain_scores_gemma":[0.99876493,0.000057115216,0.00007174368,0.00091928226,0.00005050619,0.00013643914],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033124522,0.00019783994,0.00017475517,0.0002071795,0.00017146232,0.00020595329,0.0013238258,0.000060049748,0.00003077373],"category_scores_gemma":[0.000032931122,0.00019949499,0.000064082844,0.0005691359,0.000034174056,0.00071328814,0.0003737906,0.00036288312,0.00019004666],"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.000013452665,0.00014246206,0.000032199234,0.0000145801,0.000026304277,0.0000131307615,0.0006491131,0.0040136883,0.7892364,0.12310777,0.059776746,0.022974128],"study_design_scores_gemma":[0.000597921,0.00023286816,0.00012536788,0.000024289804,0.000009462632,0.000041428237,0.000009187766,0.44913644,0.47404772,0.0023048199,0.072731644,0.0007388383],"about_ca_topic_score_codex":0.0000121773055,"about_ca_topic_score_gemma":0.0000018320422,"teacher_disagreement_score":0.576829,"about_ca_system_score_codex":0.00024011581,"about_ca_system_score_gemma":0.000027880675,"threshold_uncertainty_score":0.8135169},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0008607632,0.00034000055,0.9817275,0.00017598395,0.0003529523,0.00039338975,0.000058584737,0.0007360063,0.015354826],"genre_scores_gemma":[0.15456225,0.000010829853,0.8434242,0.00039598305,0.0001403718,0.00015158016,0.000024271103,0.000015970605,0.0012745223],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99872625,0.00003225897,0.00020618108,0.0003052307,0.00017733166,0.0005527705],"domain_scores_gemma":[0.9987373,0.00012660911,0.00008146987,0.000802547,0.00007190327,0.00018022367],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022758196,0.00015940148,0.00019492375,0.000071080474,0.00016889257,0.00010948627,0.0010081665,0.000052657564,0.00008304034],"category_scores_gemma":[0.000029074947,0.00013045117,0.000054056756,0.00013067569,0.000036803474,0.0022562263,0.00031805536,0.00008711022,0.00007118865],"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.000012061839,0.00012229536,0.00009957501,0.00003931968,0.000008788559,0.0000012928205,0.00015730412,0.0000032303062,0.4773198,0.047766846,0.4705734,0.0038960613],"study_design_scores_gemma":[0.00028625567,0.000036727197,0.00005451827,0.000008903808,0.0000028126185,0.00002166259,0.000007842986,0.00148729,0.79815376,0.0035783753,0.19619267,0.00016916863],"about_ca_topic_score_codex":0.00003811767,"about_ca_topic_score_gemma":0.0000014352999,"teacher_disagreement_score":0.32083395,"about_ca_system_score_codex":0.000026813505,"about_ca_system_score_gemma":0.000020405492,"threshold_uncertainty_score":0.5319644},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.038959432,0.0006164544,0.9572706,0.001963934,0.000112322676,0.00017399185,0.0000056237086,0.000118593285,0.00077904377],"genre_scores_gemma":[0.511356,0.00009551185,0.48824665,0.00013472691,0.00005929484,0.0000069334324,0.00005122484,0.0000099691115,0.00003965529],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9980709,0.00043880762,0.0006554408,0.00020798242,0.0004903362,0.0001365274],"domain_scores_gemma":[0.9975017,0.00048633205,0.00073897373,0.0006329382,0.0005514849,0.000088595676],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044506736,0.00014162505,0.00021996027,0.0002709123,0.00028411642,0.00020741114,0.00065965066,0.000049227023,0.00002521993],"category_scores_gemma":[0.000098354896,0.00012310821,0.00009040316,0.00030540596,0.00015831404,0.0024376453,0.00035129912,0.0002839818,0.000005380829],"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.00022996488,0.0012411432,0.0019771438,0.000042308482,0.000029242956,0.000031664254,0.00018897232,0.002082036,0.9127284,0.007840938,0.027657783,0.04595035],"study_design_scores_gemma":[0.0046496233,0.0005796716,0.0363615,0.0004942965,0.00004705292,0.000395081,0.00013147219,0.38198295,0.5259344,0.042885378,0.005967766,0.0005708279],"about_ca_topic_score_codex":0.000056080444,"about_ca_topic_score_gemma":0.0000035850146,"teacher_disagreement_score":0.47239658,"about_ca_system_score_codex":0.000057239828,"about_ca_system_score_gemma":0.00007528026,"threshold_uncertainty_score":0.5020207},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00048335627,0.000008191886,0.9960047,0.000050120587,0.0004434992,0.00024342201,0.000020293313,0.00048532579,0.002261075],"genre_scores_gemma":[0.714458,0.00002176013,0.28517157,0.00025516903,0.00000958885,0.000014863944,0.000012974755,0.0000071894005,0.000048905687],"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99871486,0.0000773665,0.0005399984,0.00013756508,0.00033769957,0.00019253307],"domain_scores_gemma":[0.9987781,0.000157764,0.00026354828,0.0005339788,0.0001911483,0.00007545907],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009500045,0.00013497184,0.00013514634,0.0005828983,0.00016024997,0.00006499364,0.00046799023,0.00008232801,0.0000627726],"category_scores_gemma":[0.000015272482,0.00013056779,0.00008335171,0.00057906884,0.000071145296,0.0046676174,0.0000043953955,0.00016959744,0.000051122493],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016131629,0.0001348585,0.0000033896845,0.00004142452,0.000025047324,8.908647e-7,0.0013495331,0.46950617,0.0038138067,0.18553472,0.00018695022,0.3392419],"study_design_scores_gemma":[0.0013827125,0.00026307785,0.00007977224,0.00014922742,0.000025989324,0.00002374173,0.0004616477,0.29139885,0.6795707,0.024582177,0.0015830189,0.00047909757],"about_ca_topic_score_codex":0.000008779627,"about_ca_topic_score_gemma":0.0000020730733,"teacher_disagreement_score":0.71397465,"about_ca_system_score_codex":0.00006755807,"about_ca_system_score_gemma":0.000030204106,"threshold_uncertainty_score":0.53244},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0018324609,0.00026065184,0.99179894,0.0044613252,0.0012163096,0.00026078572,0.000008698232,0.000084338,0.0000765165],"genre_scores_gemma":[0.4863301,0.00035006815,0.51273644,0.00028671435,0.00024384302,0.000020171612,0.000012671357,0.000012406602,0.0000076001375],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984459,0.000096688265,0.00064810476,0.00024068145,0.0003694868,0.00019909783],"domain_scores_gemma":[0.99673116,0.00043849813,0.00064777094,0.000848556,0.0011858098,0.00014818374],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00061231456,0.00018490647,0.0002557491,0.00028503523,0.00021392832,0.00031159163,0.0030420308,0.00010647076,0.00000719905],"category_scores_gemma":[0.000033560842,0.0001708526,0.00013634199,0.00016214122,0.00013975108,0.0015320213,0.0010034869,0.0006168388,9.323405e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022592973,0.000924255,0.000072770286,0.000022782468,0.00048745092,0.000027789793,0.0024902928,0.0040149456,0.046948895,0.44503286,0.014497695,0.48525432],"study_design_scores_gemma":[0.00069391186,0.00013871847,0.00040351346,0.00024537227,0.000009872275,0.00017628224,0.000013762925,0.97261614,0.0016925265,0.011634579,0.012180391,0.00019493239],"about_ca_topic_score_codex":0.000004857593,"about_ca_topic_score_gemma":0.0000029721948,"teacher_disagreement_score":0.96860117,"about_ca_system_score_codex":0.00005098685,"about_ca_system_score_gemma":0.000072201816,"threshold_uncertainty_score":0.69671667},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00006339262,0.0002035144,0.99614567,0.0013813629,0.00013086386,0.0010851787,0.00033544833,0.0005109843,0.00014357992],"genre_scores_gemma":[0.182246,0.00012538531,0.81612283,0.00007692092,0.000017218219,0.0009535607,0.00012058325,0.000032286396,0.00030519822],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982142,0.00022752634,0.0005776508,0.0004357824,0.00027017825,0.00027467444],"domain_scores_gemma":[0.9962486,0.0005915846,0.0003169988,0.002358861,0.00039834582,0.00008561475],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00028555936,0.00025592803,0.00028499748,0.0003524936,0.0005600675,0.00009288709,0.0020179665,0.00013174677,0.000015789248],"category_scores_gemma":[0.0000064272012,0.0002502645,0.00019064553,0.0006923477,0.00022071505,0.00072330615,0.000014320188,0.00027790462,0.0000051138404],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000056414883,0.0023282103,0.0000021079247,0.00005995204,0.000043317505,8.7205956e-7,0.0001811681,0.11049149,0.04946047,0.0025419495,0.0013810425,0.833453],"study_design_scores_gemma":[0.0007827565,0.00019098131,0.000057128338,0.00015174971,0.000033408938,0.0000019826716,0.000012438769,0.68817025,0.30603015,0.0015792876,0.0027574007,0.00023242521],"about_ca_topic_score_codex":0.00009734363,"about_ca_topic_score_gemma":0.00002507374,"teacher_disagreement_score":0.8332206,"about_ca_system_score_codex":0.000081983846,"about_ca_system_score_gemma":0.00013285634,"threshold_uncertainty_score":0.99999493},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00047256122,0.000037126123,0.9970413,0.0006181578,0.00010787703,0.00041051648,0.000050906816,0.0009663437,0.00029524],"genre_scores_gemma":[0.019295748,5.336618e-7,0.9797183,0.0005640913,0.00008515291,0.000114922215,0.000049602593,0.000014682122,0.00015695475],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99861956,0.000041740477,0.00021167079,0.00052729086,0.00026741254,0.00033231275],"domain_scores_gemma":[0.9986014,0.0001248085,0.000075756754,0.0010064157,0.000096559714,0.00009509138],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001309277,0.00017082565,0.00015019561,0.00014418518,0.000140405,0.00012168685,0.0011004868,0.00005926218,0.000017603177],"category_scores_gemma":[0.000014581459,0.0001353594,0.00007866585,0.00023554932,0.00004151323,0.00017471793,0.0001270651,0.00009107937,0.000012803038],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015678206,0.0007330783,0.00003198655,0.000018055061,0.000005103399,0.00001061888,0.000030428417,0.053457417,0.015395214,0.08581831,0.012363299,0.83212084],"study_design_scores_gemma":[0.00033821227,0.00020068507,0.00003751874,0.000011342185,0.000003442714,0.0000035598325,0.0000027589797,0.7347405,0.2154561,0.01337292,0.035622723,0.00021024505],"about_ca_topic_score_codex":0.000060129085,"about_ca_topic_score_gemma":0.000006742873,"teacher_disagreement_score":0.83191055,"about_ca_system_score_codex":0.000036697373,"about_ca_system_score_gemma":0.00004693648,"threshold_uncertainty_score":0.5519796},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006321494,0.0000038255475,0.9854996,0.00046119464,0.0002451178,0.005627642,0.00014786623,0.00015900582,0.0015342105],"genre_scores_gemma":[0.16167797,6.4050306e-7,0.8362956,0.0005687481,0.00030629666,0.00088724087,0.000004528138,0.00005569403,0.0002032835],"study_design_codex":"bench_or_experimental","study_design_gemma":"not_applicable","domain_scores_codex":[0.9978112,0.000046857735,0.00069105247,0.00037085058,0.00051821256,0.0005618168],"domain_scores_gemma":[0.99762917,0.00014248256,0.000675853,0.0006494428,0.00057319587,0.0003298574],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0004363717,0.0002765712,0.00036349686,0.00042783268,0.00014481616,0.00154595,0.0014722479,0.000040892202,0.00008422061],"category_scores_gemma":[0.0004928181,0.0002078702,0.0001539317,0.00047730864,0.000050628703,0.013383806,0.0010233147,0.0007690426,0.000034947952],"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.0010495298,0.0027897153,0.004334797,0.00017501642,0.00015440656,0.005183521,0.0061266255,0.000024325107,0.7350363,0.001500465,0.045871507,0.1977538],"study_design_scores_gemma":[0.0070825783,0.0010395051,0.00090262527,0.002043274,0.000052049974,0.008858777,0.0011748131,0.08331991,0.39576378,0.015855713,0.48173127,0.0021757137],"about_ca_topic_score_codex":0.0000035678424,"about_ca_topic_score_gemma":0.000004428464,"teacher_disagreement_score":0.43585974,"about_ca_system_score_codex":0.00013322497,"about_ca_system_score_gemma":0.00033916012,"threshold_uncertainty_score":0.99949056},"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":"empirical","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.58227956,0.001086594,0.29292062,0.015412132,0.003044214,0.005098785,0.0006806937,0.0025930773,0.09688431],"genre_scores_gemma":[0.045420907,0.00009681588,0.9524635,0.00023305432,0.0003298704,0.00022793056,0.00001476504,0.000064322936,0.0011488062],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985581,2.2445299e-8,0.00040368072,0.00036569024,0.00037352892,0.00029895568],"domain_scores_gemma":[0.9985149,0.0001494567,0.00027345968,0.00010458767,0.0008646355,0.00009294386],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002689315,0.00022559802,0.00027560242,0.0000915816,0.00008888211,0.000121545985,0.0013108596,0.00014116665,0.000068618436],"category_scores_gemma":[0.000346342,0.00018825241,0.00033877234,0.0002192975,0.00012234991,0.00050503144,0.00025423677,0.00018529352,0.000013111907],"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.000016026308,0.00006394814,0.0000026178184,0.00014061805,0.0000437975,5.5991585e-8,0.00002214162,0.00001126838,0.5257399,0.39188355,0.08048288,0.0015932247],"study_design_scores_gemma":[0.000688981,0.00020460795,0.000016529599,0.00025119275,0.000035554145,0.000005285964,0.000020648762,0.5898201,0.2644916,0.0028799735,0.14127189,0.00031365026],"about_ca_topic_score_codex":6.070346e-7,"about_ca_topic_score_gemma":2.1719332e-8,"teacher_disagreement_score":0.6595429,"about_ca_system_score_codex":0.00010079358,"about_ca_system_score_gemma":0.000018602139,"threshold_uncertainty_score":0.76767105},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0031178333,0.00006698993,0.99575543,0.00011231033,0.000056393194,0.00032184066,0.000039763698,0.00042064008,0.00010882298],"genre_scores_gemma":[0.5255287,0.00009320724,0.47425398,0.000055064273,0.000006363064,0.000017148854,0.000009809834,0.00001559191,0.000020074953],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99818915,0.00010715497,0.0004992547,0.00057964405,0.00037452817,0.0002502533],"domain_scores_gemma":[0.99848217,0.00010058037,0.00034632126,0.0005183662,0.00045019513,0.00010238932],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003120127,0.00023918181,0.00033427266,0.00025257288,0.00061997486,0.00011122174,0.00031705297,0.00006494753,0.00002705704],"category_scores_gemma":[0.00002370977,0.000216019,0.000035692934,0.00062865776,0.0002664997,0.0019695603,0.000012185454,0.0002371926,0.0000016487173],"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.00039539175,0.0022445675,0.0007293348,0.0013904916,0.00009365884,0.000046482706,0.0039366805,0.70749515,0.13778742,0.0009772379,0.0006682211,0.14423536],"study_design_scores_gemma":[0.0005127185,0.00013153594,0.00013973407,0.00027093216,0.000016416207,0.000054142107,0.000032125303,0.8338275,0.16462693,0.00011443789,0.000045037068,0.00022850157],"about_ca_topic_score_codex":0.00004040977,"about_ca_topic_score_gemma":0.00001684696,"teacher_disagreement_score":0.5224109,"about_ca_system_score_codex":0.00005532842,"about_ca_system_score_gemma":0.00011482228,"threshold_uncertainty_score":0.88089997},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00044013938,0.000051124094,0.99574715,0.00048101763,0.00023492375,0.00020481145,0.000005489326,0.0012716932,0.0015636513],"genre_scores_gemma":[0.47227776,0.000005620182,0.52668333,0.0007402018,0.00006694697,0.000015711694,0.0000119443275,0.000013926842,0.00018457131],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99863,0.00008700536,0.00020532224,0.00035333255,0.00034076936,0.00038359122],"domain_scores_gemma":[0.99866694,0.000166175,0.00010931758,0.00082119805,0.000052855994,0.00018353977],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002576506,0.00018112332,0.00016098104,0.00012488323,0.00011803497,0.00007778655,0.00071581436,0.0000751213,0.00009124757],"category_scores_gemma":[0.000056206805,0.00015225419,0.000045852084,0.00034447762,0.00005642392,0.001061561,0.00028918224,0.00014274906,0.00017508709],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012087495,0.0003379185,0.00031235567,0.000012491922,0.000018102037,0.0000056269337,0.0012209747,0.000058077272,0.009390664,0.4272369,0.007676189,0.55371857],"study_design_scores_gemma":[0.0014389422,0.00056920137,0.004011564,0.0001516439,0.000019822543,0.00007877449,0.00007308848,0.53648895,0.33651754,0.034966026,0.08393231,0.0017521569],"about_ca_topic_score_codex":0.00002554767,"about_ca_topic_score_gemma":0.0000031677703,"teacher_disagreement_score":0.5519664,"about_ca_system_score_codex":0.00003723676,"about_ca_system_score_gemma":0.000019757195,"threshold_uncertainty_score":0.6208745},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00049918337,0.00007796596,0.99332494,0.00040645446,0.00017743043,0.0007428767,0.000020590089,0.0016854318,0.003065129],"genre_scores_gemma":[0.29543808,0.00004279715,0.7033988,0.00026189382,0.000035751043,0.00037429793,0.0000035685057,0.000053593503,0.00039122373],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9973187,0.000095907475,0.00045959448,0.0009314233,0.00057515025,0.0006192498],"domain_scores_gemma":[0.997959,0.00016988168,0.00026781613,0.00093855424,0.0004237029,0.00024100936],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00020332233,0.0004374815,0.00038187442,0.00034926774,0.0008436611,0.001220724,0.0011164284,0.00011682368,0.00013658316],"category_scores_gemma":[0.000015005659,0.00036875615,0.00009988176,0.00080646883,0.00031789285,0.007279086,0.00002122993,0.00064027176,0.0001400369],"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.00035556479,0.0010445598,0.000008226837,0.0003724162,0.00014178739,0.00012388053,0.0024646162,0.008451493,0.33638537,0.00022211339,0.003717834,0.6467121],"study_design_scores_gemma":[0.0012430701,0.00029364528,0.000027268832,0.00051923364,0.000042273754,0.00009491353,0.00017292981,0.3308002,0.6636739,0.0021202005,0.00032574343,0.0006866219],"about_ca_topic_score_codex":0.00004344847,"about_ca_topic_score_gemma":0.0000027648416,"teacher_disagreement_score":0.64602554,"about_ca_system_score_codex":0.00014964724,"about_ca_system_score_gemma":0.00018018585,"threshold_uncertainty_score":0.99987644},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00019614739,0.000014285926,0.9966618,0.000045650195,0.000074896285,0.00018319215,0.0000013512846,0.0010097774,0.0018129244],"genre_scores_gemma":[0.10925478,0.000008215691,0.8903795,0.00027124374,0.0000063939456,0.000018459574,0.000013655036,0.00001125797,0.000036475252],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99893606,0.000035681736,0.00019426539,0.00038317803,0.0002869134,0.0001638839],"domain_scores_gemma":[0.9988092,0.000067853296,0.00011144052,0.00077450136,0.00016565215,0.000071319824],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012513153,0.00012866755,0.000107332795,0.00019950142,0.00010479356,0.00006530772,0.000708493,0.00005336193,0.00011873215],"category_scores_gemma":[0.000039481492,0.00009303505,0.000025231006,0.0005945951,0.000038834085,0.001187156,0.00014595472,0.00006315956,0.000018058376],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00032554462,0.00078283227,0.005359889,0.00003473306,0.000025221581,0.0000469482,0.00048134767,0.27748415,0.0018208572,0.3277865,0.008337558,0.37751442],"study_design_scores_gemma":[0.0004045333,0.00023674671,0.0006370112,0.00007099697,0.00000424416,0.000006070416,0.000007030897,0.92660713,0.05826051,0.012849776,0.0006445871,0.000271378],"about_ca_topic_score_codex":0.000019303632,"about_ca_topic_score_gemma":0.000007729342,"teacher_disagreement_score":0.64912295,"about_ca_system_score_codex":0.0000168391,"about_ca_system_score_gemma":0.000039720784,"threshold_uncertainty_score":0.37938592},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01441178,0.009415234,0.97082883,0.0034544943,0.00021054281,0.00032948717,0.000045240282,0.00005774404,0.0012466179],"genre_scores_gemma":[0.88375,0.011047972,0.10500224,0.00006924123,0.000034171386,0.000019085921,0.000057919686,0.000011467419,0.000007907257],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980539,0.0004291175,0.0008567821,0.000205224,0.0003373689,0.00011757841],"domain_scores_gemma":[0.9948852,0.001139579,0.0010872191,0.0022445703,0.00057345646,0.000069972906],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001461182,0.0001431229,0.00022410369,0.000238952,0.00033200014,0.000095756164,0.005368784,0.000046392193,0.000004342413],"category_scores_gemma":[0.00004618541,0.000103306484,0.000042557742,0.00025333778,0.0002496585,0.00094467524,0.004053995,0.00043193187,6.967663e-7],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023611267,0.0005601323,0.0008669903,0.000016943923,0.00028577424,0.0000044250673,0.012936578,0.0003016595,0.0007672285,0.08998658,0.0023565812,0.891681],"study_design_scores_gemma":[0.0020903281,0.00080363645,0.018488092,0.00587843,0.00014124389,0.00094267674,0.004147466,0.6544876,0.0037858842,0.22467187,0.083574176,0.0009885617],"about_ca_topic_score_codex":0.000032804783,"about_ca_topic_score_gemma":0.000024208997,"teacher_disagreement_score":0.8906924,"about_ca_system_score_codex":0.000042546944,"about_ca_system_score_gemma":0.000043019787,"threshold_uncertainty_score":0.9976626},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00003836717,0.00006954741,0.9987182,0.00006405421,0.000028550037,0.00013014559,0.0000046377204,0.00017874349,0.0007677676],"genre_scores_gemma":[0.08500618,0.000028229962,0.9147668,0.000053309424,0.000009052011,0.000007454687,0.000017959315,0.00000549052,0.000105516694],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993424,0.000014385726,0.00020816592,0.0002093328,0.000112373746,0.00011333903],"domain_scores_gemma":[0.99936444,0.00014512704,0.00008619014,0.00024614768,0.00011261449,0.00004548079],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002001317,0.00007215153,0.00010527466,0.00010199843,0.000055908564,0.000024281613,0.0002249253,0.00004683593,0.000014107672],"category_scores_gemma":[0.000015631287,0.000061627135,0.000016027281,0.0001706148,0.000020907612,0.0006264102,0.000075637334,0.000021967076,5.5329522e-8],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000429599,0.00007683417,0.000025109272,0.000049262173,0.0000060106536,4.1020442e-7,0.000048311176,0.06458586,0.289054,0.27111542,0.0011194701,0.37387633],"study_design_scores_gemma":[0.00017383402,0.00003550455,0.000059605223,0.000016975006,0.000001441157,9.143828e-7,0.0000016470209,0.6544728,0.3279641,0.014673411,0.0025446028,0.000055146218],"about_ca_topic_score_codex":0.000023524046,"about_ca_topic_score_gemma":4.0645165e-7,"teacher_disagreement_score":0.58988696,"about_ca_system_score_codex":0.000007803332,"about_ca_system_score_gemma":0.000010693673,"threshold_uncertainty_score":0.25130817},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0022097104,0.000033715714,0.9950769,0.000223191,0.00027633936,0.0007753741,0.000009393811,0.0010922926,0.00030310085],"genre_scores_gemma":[0.19478947,0.0000044027574,0.8033584,0.00026424194,0.00007059063,0.000054889533,0.000012751215,0.000016786325,0.0014284746],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.998369,0.000051606596,0.0003188895,0.00051446067,0.00028194676,0.0004641279],"domain_scores_gemma":[0.99836963,0.00054896006,0.00012576766,0.0006487821,0.00016366945,0.00014321614],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00090071146,0.00019235177,0.00020373455,0.00017391719,0.00016580144,0.00012000071,0.00079998985,0.000084667336,0.000034193137],"category_scores_gemma":[0.00018480838,0.000166207,0.00007979026,0.0002866794,0.000039671337,0.00093865587,0.0002844619,0.00010098948,0.000078191406],"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.00039959347,0.00044195566,0.00030336808,0.000037708094,0.000045749333,0.000037737027,0.00029343562,0.002552138,0.699749,0.13951345,0.10034855,0.05627733],"study_design_scores_gemma":[0.0006209869,0.00018579201,0.00015519092,0.000027492055,0.000004387476,0.000023514162,0.000008987589,0.38582546,0.58524925,0.013439551,0.014139506,0.00031985756],"about_ca_topic_score_codex":0.000007861502,"about_ca_topic_score_gemma":0.000004741904,"teacher_disagreement_score":0.38327333,"about_ca_system_score_codex":0.0000463345,"about_ca_system_score_gemma":0.000038103623,"threshold_uncertainty_score":0.67777246},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.001409406,0.00010269601,0.987694,0.00009017041,0.00043250364,0.0005382094,0.0000068415275,0.0013223236,0.008403815],"genre_scores_gemma":[0.418595,0.000041282354,0.58083105,0.0001288159,0.000024333369,0.00018953829,0.000009422067,0.000016439693,0.00016416419],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980048,0.00014870308,0.00039421342,0.00090305076,0.00025580672,0.00029341638],"domain_scores_gemma":[0.99756163,0.000061838844,0.00020896937,0.0020316723,0.000054029446,0.000081864535],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00025807807,0.00028597016,0.00033810938,0.00033403438,0.000043646913,0.0001171407,0.0026465664,0.00029872014,0.000040031664],"category_scores_gemma":[0.000026255368,0.00026573686,0.000076425655,0.00024313206,0.000039912127,0.00044879926,0.0055983677,0.0007807335,0.000048076945],"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.000105025734,0.0009592695,0.00025866617,0.0004551995,0.00007097082,0.00024983194,0.004828382,0.0037947746,0.051193383,0.20453545,0.0068098684,0.72673917],"study_design_scores_gemma":[0.0003554137,0.000055243614,0.0009167136,0.00026847218,0.000002760566,0.000012497094,0.000029381998,0.06154749,0.28562313,0.6434427,0.0069991886,0.0007470218],"about_ca_topic_score_codex":0.0003182197,"about_ca_topic_score_gemma":0.00012649503,"teacher_disagreement_score":0.72599214,"about_ca_system_score_codex":0.00010051768,"about_ca_system_score_gemma":0.000056702414,"threshold_uncertainty_score":0.9999795},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0018209787,0.000008360971,0.996557,0.00013548828,0.00011735306,0.00057064195,0.00013656901,0.00047443915,0.0001791881],"genre_scores_gemma":[0.47774345,0.0000019215197,0.52194995,0.00004425712,0.000023119239,0.00019640225,0.0000029480657,0.000015177449,0.000022749446],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99835855,0.000039295857,0.00034477262,0.0005636114,0.00043867863,0.00025510084],"domain_scores_gemma":[0.99850005,0.00009704318,0.00019410955,0.0005555064,0.00050490774,0.00014840638],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018875749,0.0002102909,0.00020672359,0.0003059624,0.00040306215,0.00011428599,0.000521036,0.00007796757,0.000027757733],"category_scores_gemma":[0.000007074095,0.00018927896,0.0000551443,0.00067333994,0.00017883367,0.0017312018,0.000013829577,0.0004403011,0.000016245043],"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.000053459444,0.00019578727,0.0000017639571,0.000034370085,0.000011126282,0.0000036432334,0.00020831973,0.0014591422,0.9114452,0.0003308728,0.00003893411,0.08621741],"study_design_scores_gemma":[0.00030553955,0.00013566024,0.000029725943,0.00016703196,0.000019004492,0.000033956247,0.00004505265,0.072646454,0.9257907,0.00045526517,0.00018054739,0.00019104566],"about_ca_topic_score_codex":0.000012526783,"about_ca_topic_score_gemma":0.000009075344,"teacher_disagreement_score":0.47592247,"about_ca_system_score_codex":0.000043247193,"about_ca_system_score_gemma":0.00015432287,"threshold_uncertainty_score":0.7718572},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0004085839,0.000364936,0.9950721,0.00010441204,0.00002072389,0.00040326896,0.0000080179325,0.00055109384,0.0030668082],"genre_scores_gemma":[0.34740025,0.0000062716485,0.6520035,0.0003238589,0.000044563138,0.00014799486,0.00000331426,0.000016195321,0.00005399442],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9983976,0.000082667684,0.00030752164,0.00063549646,0.00024417773,0.0003325676],"domain_scores_gemma":[0.9988475,0.0000647707,0.00017518754,0.00047072614,0.00022908031,0.00021274599],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028958436,0.0002136363,0.00021033228,0.0001486244,0.00040738532,0.00026480338,0.0007544893,0.000056142468,0.00003356711],"category_scores_gemma":[0.000041602223,0.00018774965,0.000036732654,0.00041564953,0.0001220223,0.0021677786,0.0007400272,0.00019715111,0.000044795335],"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.000052094547,0.00013883911,0.000064356354,0.00009416903,0.000008310348,0.000025788804,0.002219179,0.000001887279,0.43984914,0.0037809236,0.0019678273,0.55179745],"study_design_scores_gemma":[0.0004271281,0.00026727002,0.001276029,0.0006711962,0.000022722883,0.00004556536,0.0003372277,0.0364623,0.9238453,0.032053184,0.0038001437,0.0007919185],"about_ca_topic_score_codex":0.000019699528,"about_ca_topic_score_gemma":0.000001100494,"teacher_disagreement_score":0.55100554,"about_ca_system_score_codex":0.00002616193,"about_ca_system_score_gemma":0.00005650875,"threshold_uncertainty_score":0.7656209},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0007122538,0.000038675844,0.99695426,0.00026019962,0.00021399268,0.00043844339,0.000060504488,0.0011861739,0.00013546828],"genre_scores_gemma":[0.79492027,0.0000062747526,0.20441903,0.00039248142,0.0000487063,0.00008188002,0.00001077088,0.000014619475,0.000105982515],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984214,0.000043842352,0.00036557254,0.0005408892,0.0002936572,0.00033469227],"domain_scores_gemma":[0.99907345,0.00014094995,0.00013545279,0.00034819762,0.00019656254,0.00010538373],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001944616,0.00021994511,0.00019691067,0.00025441998,0.00063195475,0.0002819097,0.00051042205,0.000111983645,0.000021436137],"category_scores_gemma":[0.000008110593,0.00021295504,0.00009965033,0.00041204444,0.000037039717,0.00208188,0.0000028198615,0.0002774982,0.000010177549],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009405719,0.00022398565,0.000006854593,0.000033447974,0.00000984087,0.0000031973657,0.00024271496,0.010004981,0.16615632,0.00021584223,0.00052664545,0.8224821],"study_design_scores_gemma":[0.0005795091,0.00026963404,0.00014078444,0.0002073779,0.000013343928,0.000017211341,0.000013427233,0.621186,0.3736481,0.0027934536,0.00089448295,0.00023664255],"about_ca_topic_score_codex":0.0000022294932,"about_ca_topic_score_gemma":0.0000015680253,"teacher_disagreement_score":0.8222455,"about_ca_system_score_codex":0.00009783716,"about_ca_system_score_gemma":0.000060197544,"threshold_uncertainty_score":0.8684054},"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":"empirical","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9813897,0.00020134012,0.012956923,0.0020945836,0.0004415785,0.0006361893,0.00038884784,0.00035046428,0.0015403987],"genre_scores_gemma":[0.092881575,0.000096609045,0.9059435,0.00022956751,0.00044100417,0.00016480638,0.00009045193,0.000055484852,0.000096973905],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99730945,2.3689468e-8,0.0007130414,0.0004855615,0.00089695514,0.0005949702],"domain_scores_gemma":[0.99779123,0.00019244612,0.000505694,0.00019788914,0.0010814293,0.00023133376],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007503282,0.0003630177,0.00042365596,0.0001264678,0.0001276913,0.00021092725,0.0030921686,0.00018072613,0.000016956988],"category_scores_gemma":[0.000485198,0.0002895678,0.00039291015,0.00040567556,0.00022618643,0.0035860965,0.001211111,0.00039340867,0.000006702676],"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.000022936334,0.00014094375,0.00012470473,0.0001608855,0.00008312159,6.212726e-8,0.00009402513,0.000008782982,0.52674544,0.4271021,0.044768207,0.0007488274],"study_design_scores_gemma":[0.0009883282,0.00024317297,0.0007869957,0.0004818479,0.000082678205,0.000037603215,0.00034697997,0.04113025,0.8702578,0.004718717,0.08023833,0.00068727974],"about_ca_topic_score_codex":0.0000065913905,"about_ca_topic_score_gemma":2.4052266e-8,"teacher_disagreement_score":0.8929866,"about_ca_system_score_codex":0.00013225013,"about_ca_system_score_gemma":0.0000267474,"threshold_uncertainty_score":0.99995565},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04528292,0.000036568083,0.9527884,0.000057911246,0.00034617577,0.00094792823,0.0001945926,0.00032445503,0.000021020813],"genre_scores_gemma":[0.5516017,0.000008335306,0.4482313,0.000019350773,0.000021008058,0.00006188556,0.000005305678,0.000015197361,0.000035910656],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9984611,0.00004153675,0.0003763051,0.0004804329,0.0003050596,0.0003355619],"domain_scores_gemma":[0.9986364,0.00042355078,0.00015419835,0.00047606434,0.00016894094,0.00014080822],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039636172,0.00020305761,0.00023275785,0.0002507451,0.00020128791,0.00003931948,0.00033055633,0.00012609422,0.000003850133],"category_scores_gemma":[0.000042077754,0.00019073497,0.00008217867,0.000312421,0.00012239137,0.00023129744,0.00000846991,0.00019136613,0.000003267882],"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.00012219166,0.00061382155,0.000008192247,0.000034859368,0.000022095375,0.00000257126,0.00036133104,0.08323637,0.22327714,0.000009603951,0.00006021299,0.6922516],"study_design_scores_gemma":[0.00057861337,0.00020679168,0.00005053606,0.0000468082,0.0000061285937,0.0000031585216,0.000030078972,0.49591023,0.50273526,0.000030980977,0.00027927736,0.00012212434],"about_ca_topic_score_codex":0.000041832835,"about_ca_topic_score_gemma":0.000038608585,"teacher_disagreement_score":0.6921295,"about_ca_system_score_codex":0.00007617024,"about_ca_system_score_gemma":0.000032855492,"threshold_uncertainty_score":0.7777946},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00012247404,0.00019698666,0.7084089,0.28626904,0.003950225,0.0006717482,0.00017499774,0.000025469051,0.00018017893],"genre_scores_gemma":[0.00995755,0.0000075194707,0.81838936,0.15102103,0.020001054,0.00008747776,0.00025968486,0.000070466725,0.00020586327],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9952168,0.00010868019,0.001587469,0.00033066247,0.0024734857,0.0002828898],"domain_scores_gemma":[0.99081403,0.0005166203,0.0021429004,0.0005788249,0.0058451174,0.000102525344],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016905474,0.00028549755,0.00050201226,0.0005511282,0.00017097098,0.00025919641,0.002112704,0.00023093668,0.000016896203],"category_scores_gemma":[0.0011906805,0.00019850329,0.00020515558,0.00027042066,0.000077243305,0.0020909563,0.0005224783,0.0011225005,0.0000029442863],"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.000011196642,0.000025526373,0.000027538648,0.000051066912,0.000031224892,0.0000033283814,0.00016427273,0.00026654528,0.0026635975,0.000012464051,0.95235157,0.04439168],"study_design_scores_gemma":[0.00040968874,0.00003358554,0.000041723793,0.000972407,0.000026162026,0.000023413262,0.000012796053,0.007855713,0.016584868,0.0019333446,0.9718827,0.0002235677],"about_ca_topic_score_codex":0.0000043834443,"about_ca_topic_score_gemma":0.0000062942277,"teacher_disagreement_score":0.13524799,"about_ca_system_score_codex":0.00019407128,"about_ca_system_score_gemma":0.0011646547,"threshold_uncertainty_score":0.8094729},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00036206114,0.00021265881,0.9965823,0.0012767504,0.00014463543,0.00016600935,0.000019534471,0.00077130535,0.000464715],"genre_scores_gemma":[0.7364971,0.000044014865,0.2621109,0.0006219824,0.000025951176,0.000051827963,0.000004204886,0.00002280062,0.0006212129],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99860126,0.00004464098,0.0002965467,0.00048673453,0.00028969214,0.00028114184],"domain_scores_gemma":[0.99914235,0.000044338933,0.00012472644,0.00047816563,0.000118456046,0.00009196621],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001138758,0.00019903519,0.00016081735,0.00013147012,0.00036912807,0.00033058607,0.0006163629,0.00006803988,0.00004508285],"category_scores_gemma":[0.000007662754,0.00018133564,0.000056308083,0.00034173613,0.0000772007,0.0033218453,0.0000064997853,0.00024463606,0.00006854141],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009712574,0.00018516368,0.0000012548384,0.000022448916,0.0000037346176,0.0000022676772,0.0003183977,0.00026892638,0.054911528,0.000100686295,0.003617984,0.9405579],"study_design_scores_gemma":[0.00033426684,0.000053759133,0.000011888241,0.00015381619,0.000011315467,0.000018326398,0.00006486696,0.1767356,0.80881923,0.0004858492,0.0129778795,0.00033320754],"about_ca_topic_score_codex":0.000015442258,"about_ca_topic_score_gemma":0.000011728799,"teacher_disagreement_score":0.9402247,"about_ca_system_score_codex":0.00007866707,"about_ca_system_score_gemma":0.00005074266,"threshold_uncertainty_score":0.73946524},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04755266,0.0011275642,0.94328576,0.007423614,0.00031714048,0.00012749067,0.0000043791474,0.000051815277,0.00010959858],"genre_scores_gemma":[0.76598084,0.0011643479,0.23273583,0.000013293579,0.00008801067,0.000007091848,7.221524e-7,0.0000069447847,0.0000029270254],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9974767,0.00013294657,0.00052976975,0.00016194057,0.0013965492,0.00030211938],"domain_scores_gemma":[0.99736357,0.00027367895,0.00031508162,0.00026876046,0.0016790788,0.00009983373],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002648537,0.00009791292,0.00025268923,0.0024078148,0.00005501152,0.000057319943,0.002264377,0.00019481182,0.000018096323],"category_scores_gemma":[0.0009164052,0.00007851257,0.000026603224,0.001143281,0.0004944678,0.0012845697,0.0019600748,0.0007258169,6.344074e-7],"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.00008548353,0.00063679717,0.025654798,0.00012794521,0.000049560054,0.0006879245,0.00010922862,0.000007858906,0.66726893,0.1536652,0.00079836877,0.1509079],"study_design_scores_gemma":[0.0018241234,0.00021486041,0.011804937,0.0055909636,0.000006433412,0.005754964,0.00021931372,0.010387822,0.80946034,0.14806524,0.00628657,0.00038441017],"about_ca_topic_score_codex":0.000043755856,"about_ca_topic_score_gemma":0.0000013832121,"teacher_disagreement_score":0.7184282,"about_ca_system_score_codex":0.00008630261,"about_ca_system_score_gemma":0.00015250251,"threshold_uncertainty_score":0.42078134},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08296502,0.00020520866,0.90803057,0.007569372,0.00027526828,0.0003544822,0.000127409,0.0004177944,0.000054902135],"genre_scores_gemma":[0.54277104,0.00022061837,0.45354545,0.0026844703,0.00043177593,0.000036566573,0.00021490583,0.000044411918,0.000050733892],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9959067,0.0002281225,0.0004378708,0.0007541315,0.0017182122,0.0009549479],"domain_scores_gemma":[0.9969029,0.0007516346,0.0001138156,0.0014474269,0.00045463644,0.0003295937],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00092564867,0.0002600502,0.00029251626,0.00051761046,0.00038477805,0.00024498889,0.0021831149,0.00012930295,0.000026546006],"category_scores_gemma":[0.000864843,0.00024043853,0.000067729605,0.0011427405,0.00038510223,0.0010448117,0.0012430893,0.0010084172,0.000104255145],"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.00008163613,0.00079179386,0.00022275299,0.00011967026,0.000038832124,0.00038921213,0.00065618806,0.026634686,0.83545494,0.0032008514,0.12207868,0.010330759],"study_design_scores_gemma":[0.01043912,0.0012478686,0.018301269,0.002055154,0.00005389227,0.00019276406,0.00027331608,0.5833763,0.23379232,0.08353291,0.06335947,0.0033756583],"about_ca_topic_score_codex":0.00016239856,"about_ca_topic_score_gemma":0.000059793972,"teacher_disagreement_score":0.60166264,"about_ca_system_score_codex":0.00033880828,"about_ca_system_score_gemma":0.00017744735,"threshold_uncertainty_score":0.98047984},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0013225131,0.0000042723527,0.9969243,0.000030399857,0.000118194264,0.00071310933,0.0000517144,0.00029548985,0.0005400273],"genre_scores_gemma":[0.49863708,0.0000013637646,0.50118417,0.00005559075,0.000009278577,0.000078059165,0.000010213152,0.000008047942,0.000016225262],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9987949,0.000056499317,0.00031253454,0.0004125368,0.00020797238,0.00021554281],"domain_scores_gemma":[0.9987994,0.00023968086,0.00024492072,0.00046937805,0.00018379731,0.00006283875],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027518588,0.00015626616,0.00020328481,0.0001684358,0.00009355772,0.000036171845,0.00053447246,0.0000609937,0.000022500863],"category_scores_gemma":[0.00007026032,0.00014072192,0.00006476034,0.00019189139,0.00004372261,0.0006411447,0.00013183888,0.00008563998,0.0000021283986],"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.0005173805,0.0006858798,0.00014284419,0.00015606488,0.000044323053,0.000006570696,0.0010503636,0.0020136589,0.52645993,0.3682685,0.00043382996,0.100220665],"study_design_scores_gemma":[0.00032999268,0.0003076642,0.00014361228,0.00005589446,0.0000050725953,6.745405e-7,0.000036887533,0.4983655,0.49963585,0.0010177225,0.0000040098794,0.00009712712],"about_ca_topic_score_codex":0.00001999697,"about_ca_topic_score_gemma":0.0000022707823,"teacher_disagreement_score":0.49731457,"about_ca_system_score_codex":0.000077264405,"about_ca_system_score_gemma":0.00003415088,"threshold_uncertainty_score":0.57384735},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013719852,0.000009458204,0.9698951,0.0005161585,0.00004526534,0.00046243606,0.000029554145,0.00045987067,0.014862289],"genre_scores_gemma":[0.84309024,0.000008987074,0.15596204,0.00023960954,0.000021436179,0.00007288782,0.000084806416,0.0000112066855,0.00050876726],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99887335,0.000028862529,0.0003313454,0.0003167726,0.00025318415,0.00019646698],"domain_scores_gemma":[0.9992338,0.000027445452,0.00012311061,0.00048182622,0.00009090925,0.000042949625],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001514246,0.000117344985,0.00013655932,0.000116775605,0.000060711733,0.000040110037,0.00056983536,0.000035083423,0.00018788484],"category_scores_gemma":[0.000003523899,0.00009685685,0.00003000923,0.00024279434,0.000018046714,0.0011102698,0.000026728943,0.00006317231,0.00000874543],"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.000027805,0.00034679935,0.00009692119,0.000047917976,0.00000910495,0.0000032207747,0.00019428531,0.00006041986,0.08202007,0.09885782,0.010039893,0.8082957],"study_design_scores_gemma":[0.00036503572,0.00030168478,0.0006590592,0.000019170277,0.0000020278544,0.0000024367077,0.000056114786,0.0023427152,0.9741914,0.017438015,0.004492432,0.00012991046],"about_ca_topic_score_codex":0.0002620594,"about_ca_topic_score_gemma":0.00011487514,"teacher_disagreement_score":0.8921713,"about_ca_system_score_codex":0.000031789863,"about_ca_system_score_gemma":0.000037955502,"threshold_uncertainty_score":0.39497077},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0011131485,0.000028389457,0.9966116,0.00042773172,0.000012894571,0.0006185086,3.4802954e-7,0.00034040833,0.000846981],"genre_scores_gemma":[0.17773229,0.000015592123,0.8219189,0.00014152355,0.0000041280514,0.00008895139,0.0000011112393,0.000003624043,0.000093896786],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992763,0.000114526694,0.00013253043,0.00022771911,0.00012487639,0.00012406189],"domain_scores_gemma":[0.9993197,0.00022905869,0.000059937876,0.00025441582,0.00007559421,0.000061347695],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024382252,0.00009031453,0.00017485548,0.000056278146,0.000051429823,0.00015509034,0.0002426706,0.00002396221,0.000079436206],"category_scores_gemma":[0.000040255385,0.00005554374,0.000013099263,0.00010046084,0.0001464081,0.0008635485,0.00013137147,0.000051102394,0.0000145369295],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0036307143,0.000073308554,0.0000702763,0.000016542635,0.000037917245,0.000016321826,0.00028293178,0.0008330651,0.006481279,0.8824148,0.005029712,0.10111309],"study_design_scores_gemma":[0.046562463,0.00015002457,0.00011460075,0.000047248304,0.000007139704,0.00011157411,0.000033069104,0.91321945,0.018560337,0.020612853,0.0002989894,0.00028227354],"about_ca_topic_score_codex":0.000021169171,"about_ca_topic_score_gemma":2.94709e-7,"teacher_disagreement_score":0.91238636,"about_ca_system_score_codex":0.0000062553436,"about_ca_system_score_gemma":0.00002497937,"threshold_uncertainty_score":0.2265008},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00014027182,0.00010690749,0.9939131,0.0018119117,0.00013936855,0.00007478219,0.0000027046826,0.00009945205,0.0037114832],"genre_scores_gemma":[0.04079587,0.000010161872,0.9585496,0.0005172951,0.00006387592,0.0000023488783,3.5735135e-7,0.000012687241,0.000047798065],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9983223,0.000046753685,0.00052213087,0.00022577916,0.00063224597,0.00025078023],"domain_scores_gemma":[0.99865144,0.00009642558,0.0002530047,0.00034125475,0.00020090182,0.00045698133],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00056515075,0.00013908852,0.00023845989,0.00021474765,0.000044542347,0.00022844641,0.001511766,0.000032900352,0.000040357238],"category_scores_gemma":[0.00019127068,0.00010296582,0.0001283484,0.0002225512,0.000047485195,0.004382177,0.0004213658,0.00029670328,0.000016148155],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000030790477,0.000106322725,0.00009073127,0.0000076986125,0.000010039761,0.00039277744,0.0005105779,0.0000017732675,0.008204032,0.0016093083,0.002560943,0.986475],"study_design_scores_gemma":[0.0035972812,0.001415041,0.00146987,0.0016066167,0.000052274987,0.007380259,0.000382345,0.06974425,0.48738557,0.30227536,0.12296962,0.0017215251],"about_ca_topic_score_codex":0.0000032928215,"about_ca_topic_score_gemma":6.146879e-8,"teacher_disagreement_score":0.9847535,"about_ca_system_score_codex":0.00003241157,"about_ca_system_score_gemma":0.00010587685,"threshold_uncertainty_score":0.41988245},"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":"empirical","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9641412,0.00031244892,0.031601608,0.0011262199,0.00029376463,0.0006013171,0.000048439335,0.00014507568,0.0017299607],"genre_scores_gemma":[0.38673463,0.0001069501,0.612608,0.0000811876,0.00016608654,0.00015532497,0.00000319496,0.000026731392,0.00011785965],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9975804,1.989545e-8,0.0007661975,0.0003703944,0.00083105714,0.00045189753],"domain_scores_gemma":[0.99711365,0.00017874705,0.00062605564,0.0001235912,0.0018101152,0.00014785447],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007117721,0.00029421362,0.00043734306,0.00011034191,0.00006215317,0.000063864965,0.001967741,0.00012410423,0.000009932842],"category_scores_gemma":[0.00044327066,0.0002351945,0.000464372,0.00031579312,0.00022841712,0.0017634565,0.0006907143,0.00025020837,0.0000016159313],"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.00003099417,0.00013491856,0.00013270369,0.00012411429,0.00013006246,2.0558943e-8,0.00014568046,0.000006679249,0.5256896,0.46993,0.0028119576,0.00086324924],"study_design_scores_gemma":[0.00049987715,0.00031776907,0.0005905846,0.00032219177,0.00004633607,0.0000074230948,0.0004350909,0.0078023,0.98447686,0.0026023372,0.0026323725,0.00026687796],"about_ca_topic_score_codex":0.000008094781,"about_ca_topic_score_gemma":2.2073916e-8,"teacher_disagreement_score":0.5810064,"about_ca_system_score_codex":0.00013980207,"about_ca_system_score_gemma":0.000026327865,"threshold_uncertainty_score":0.95909536},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0010665626,0.00006494352,0.9957779,0.00064407947,0.00037168674,0.0006555652,0.00005353002,0.0012455604,0.000120158424],"genre_scores_gemma":[0.45060197,0.0000053481463,0.54819655,0.0009174053,0.00002780237,0.00010075102,0.0000076026568,0.000041519415,0.000101023696],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9976858,0.00005909253,0.00048579602,0.0007727659,0.0003564643,0.0006400943],"domain_scores_gemma":[0.9981247,0.0004423525,0.00022406146,0.000742424,0.0002711701,0.0001952842],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005980478,0.00033577142,0.00027134348,0.00044339607,0.00086310436,0.0005209363,0.00091349974,0.00012350397,0.000011547549],"category_scores_gemma":[0.0000270385,0.00033682073,0.00015159097,0.00069895067,0.00022363367,0.0018203987,0.0000075642383,0.0003594235,0.000011404869],"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.00089354155,0.0009206444,0.0000061366186,0.0006630161,0.000066398,0.000046703546,0.0009156479,0.015510749,0.32906878,0.000113700546,0.0017657214,0.65002894],"study_design_scores_gemma":[0.0010530476,0.00023375681,0.00001865408,0.00028298673,0.000026577245,0.000013983861,0.000059058817,0.24112967,0.7533835,0.0017184559,0.0015978618,0.0004824464],"about_ca_topic_score_codex":0.00001547275,"about_ca_topic_score_gemma":0.000028781797,"teacher_disagreement_score":0.6495465,"about_ca_system_score_codex":0.00017366423,"about_ca_system_score_gemma":0.00032808364,"threshold_uncertainty_score":0.9999084},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07094914,0.0003793202,0.92584586,0.0022607544,0.000057643207,0.00019959369,0.0000011744683,0.0002464287,0.0000600909],"genre_scores_gemma":[0.9143962,0.0001043982,0.08472917,0.0006014605,0.000044644137,0.000030077126,0.0000016069575,0.00001860087,0.000073794385],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9988848,0.000051942658,0.0001994313,0.00033000816,0.00020756623,0.0003262388],"domain_scores_gemma":[0.99933535,0.000041656054,0.00013657122,0.00040867797,0.000027827327,0.00004992255],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016292972,0.00012678945,0.0001432083,0.00013499384,0.00010784717,0.000041447674,0.0004313812,0.000049432394,0.000009326463],"category_scores_gemma":[0.00003426567,0.00012632395,0.000034105295,0.00024725636,0.000046674748,0.00043386474,0.00020626532,0.00024025168,0.000006158728],"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.000014960647,0.00009315133,0.00007055448,0.000054059194,0.000027876078,0.000014058977,0.0009347403,0.0007527585,0.5768084,0.006207144,0.005470371,0.40955195],"study_design_scores_gemma":[0.00046148972,0.0003289767,0.00004817517,0.00007022954,0.000008650825,0.00008224268,0.000018836565,0.39901724,0.5799106,0.00487971,0.01473027,0.00044358347],"about_ca_topic_score_codex":0.000010063535,"about_ca_topic_score_gemma":0.000002923063,"teacher_disagreement_score":0.8434471,"about_ca_system_score_codex":0.00006462729,"about_ca_system_score_gemma":0.000008872898,"threshold_uncertainty_score":0.5151341},"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":"empirical","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.97845,0.000048856236,0.017382551,0.0018042142,0.00012931623,0.00052409334,0.000029433726,0.0005575798,0.0010739738],"genre_scores_gemma":[0.08950695,0.00007332963,0.9098943,0.00011809233,0.00013817768,0.00011879596,0.0000048864604,0.000056099354,0.00008939908],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9972626,2.062286e-8,0.00076896744,0.0006390267,0.0008046913,0.0005246887],"domain_scores_gemma":[0.99717385,0.00018605369,0.0005194576,0.00018460662,0.0017978768,0.00013818836],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004575526,0.0003794064,0.00050470815,0.00028616033,0.00017721191,0.00009236681,0.0027123722,0.00028289898,0.000008921917],"category_scores_gemma":[0.000612747,0.00032747223,0.00047732022,0.00081975054,0.00038839638,0.0011475605,0.00065163657,0.000375609,0.0000031297668],"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.00002914677,0.00010298417,0.00008823325,0.0001146356,0.000101498445,3.9906556e-7,0.000057401492,0.00013384581,0.7206095,0.27465206,0.0034949149,0.00061538484],"study_design_scores_gemma":[0.0008015694,0.00027857075,0.00015256081,0.0003202246,0.00004372839,0.000072229326,0.000088900175,0.42128253,0.56822824,0.0056831916,0.0025853051,0.00046295763],"about_ca_topic_score_codex":0.000010784445,"about_ca_topic_score_gemma":4.015719e-8,"teacher_disagreement_score":0.8925117,"about_ca_system_score_codex":0.00022615511,"about_ca_system_score_gemma":0.000093029186,"threshold_uncertainty_score":0.99991775},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.025430307,0.00007865767,0.97278523,0.00015097964,0.00032462683,0.00029599923,0.000028932176,0.00086623355,0.00003905571],"genre_scores_gemma":[0.37176996,0.000022307404,0.6280266,0.00006196161,0.000041056803,0.000029864492,0.000004511654,0.000028336146,0.000015404205],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99792427,0.00007855839,0.00035562372,0.00083768275,0.00035582113,0.00044802975],"domain_scores_gemma":[0.99836797,0.000075749274,0.00022293115,0.000815979,0.00026110082,0.00025626988],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0002911167,0.00032539782,0.00026334304,0.0006479317,0.0008366067,0.00064769643,0.0006355171,0.00016325743,0.000027524464],"category_scores_gemma":[0.000016999025,0.00031323807,0.000058481197,0.001060902,0.00021107215,0.0057296497,0.000024378116,0.00078837335,0.000007915627],"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.000008845286,0.00015995513,0.0000016229665,0.000032326425,0.0000029752878,0.000010286595,0.00006553492,0.00004085979,0.66168755,0.000007294631,0.000013640092,0.3379691],"study_design_scores_gemma":[0.00025918902,0.00008253594,0.000043418942,0.00008077435,0.000008921381,0.000060010534,0.000019399171,0.53925854,0.45953852,0.00032572754,0.00008105333,0.00024191676],"about_ca_topic_score_codex":0.000030195322,"about_ca_topic_score_gemma":0.000003073931,"teacher_disagreement_score":0.53921765,"about_ca_system_score_codex":0.00005246893,"about_ca_system_score_gemma":0.00009590716,"threshold_uncertainty_score":0.999932},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.001487008,0.0000373313,0.9816493,0.00015253294,0.00009053928,0.00020026277,0.0000071217537,0.0017529633,0.014622935],"genre_scores_gemma":[0.20548815,0.000007791491,0.79356843,0.0006256348,0.000010524528,0.000031422278,0.000007887786,0.000015030447,0.0002451165],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984487,0.000059643542,0.00028788322,0.00057389657,0.00029310092,0.0003367327],"domain_scores_gemma":[0.9980086,0.000050696814,0.00012972501,0.001520184,0.0001294123,0.00016139758],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016178293,0.00021783607,0.000189275,0.00017906868,0.00014538376,0.00008496821,0.0019768076,0.00008102949,0.00017474376],"category_scores_gemma":[0.000027315495,0.00017209459,0.00006743938,0.0003344476,0.00007791849,0.0020378083,0.0010890968,0.00019104301,0.00014652759],"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.00013862007,0.0010229235,0.00026618037,0.00007752888,0.000020374919,0.00016556111,0.00048265772,0.0014592174,0.6955576,0.1677134,0.078500584,0.05459535],"study_design_scores_gemma":[0.00019619736,0.000057627218,0.00013684192,0.000037548485,0.0000012383565,0.000002218897,0.0000031729817,0.7097221,0.27752072,0.01130322,0.0008144579,0.00020466476],"about_ca_topic_score_codex":0.000015122485,"about_ca_topic_score_gemma":6.134357e-7,"teacher_disagreement_score":0.70826286,"about_ca_system_score_codex":0.000026006668,"about_ca_system_score_gemma":0.00007162213,"threshold_uncertainty_score":0.70178133},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.001338098,0.000008339597,0.99459153,0.00018845116,0.000055350694,0.00042520178,0.0000066547623,0.0005939502,0.0027924234],"genre_scores_gemma":[0.2814136,0.0000019991508,0.7178198,0.00022879832,0.000011806185,0.000018124396,0.000018500545,0.000008414754,0.00047892498],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989498,0.000010466917,0.00022917094,0.0003482527,0.00024376354,0.00021851918],"domain_scores_gemma":[0.99898255,0.00016199269,0.0001137052,0.00055081275,0.00012015501,0.00007077605],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032678305,0.00010766561,0.000105270956,0.00012771427,0.00011013199,0.000053418644,0.00043044976,0.00005673849,0.000004234883],"category_scores_gemma":[0.000034014894,0.00008423785,0.000032087497,0.00028347754,0.00003168804,0.0016418188,0.000105787134,0.00008473159,0.0000047496674],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015937883,0.00010453678,0.0009955491,0.000022942002,0.000017786175,0.000008201642,0.00054199813,0.05204268,0.0056644557,0.82600814,0.004085224,0.11034908],"study_design_scores_gemma":[0.0002931432,0.000060452385,0.0005898824,0.000016947028,0.0000028241407,0.000006630059,0.000024246237,0.9152287,0.037882604,0.04549698,0.00026352823,0.00013401506],"about_ca_topic_score_codex":0.0000096686435,"about_ca_topic_score_gemma":0.000013285744,"teacher_disagreement_score":0.86318606,"about_ca_system_score_codex":0.00003703096,"about_ca_system_score_gemma":0.000043819062,"threshold_uncertainty_score":0.34351197},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003888085,0.00021278801,0.99419785,0.00022189063,0.00056075363,0.00007703902,0.00078392803,0.000038953232,0.000018725565],"genre_scores_gemma":[0.36493626,0.00020266423,0.63464105,0.000033998454,0.00008743707,0.0000024002443,0.00008660105,0.000004730734,0.000004852343],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999208,0.000013874741,0.00025666918,0.00011513674,0.0003100636,0.000096255426],"domain_scores_gemma":[0.99930316,0.00016465214,0.00013255823,0.0002496561,0.00007246847,0.00007747945],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002488431,0.00008127678,0.00010848636,0.00012833108,0.000015090127,0.0000333416,0.00072257174,0.000023210478,0.000024116327],"category_scores_gemma":[0.000111080146,0.0000708417,0.000018985895,0.000047391037,0.000019891631,0.0010918614,0.00036025152,0.000096284355,1.8940734e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00026055326,0.00060127693,0.00533712,0.00062835205,0.0014218426,0.0001419099,0.001840542,0.027893355,0.027979681,0.0073314463,0.033595603,0.8929683],"study_design_scores_gemma":[0.00078505836,0.00004270879,0.035661794,0.00019131009,0.000024784667,0.00003550485,0.000016571694,0.942297,0.0025313073,0.00007892373,0.018236961,0.000098121214],"about_ca_topic_score_codex":0.000004227786,"about_ca_topic_score_gemma":3.3661993e-7,"teacher_disagreement_score":0.9144036,"about_ca_system_score_codex":0.000018473665,"about_ca_system_score_gemma":0.0000066000125,"threshold_uncertainty_score":0.28888407},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0017063532,0.000025535968,0.9879305,0.000020053949,0.00005240999,0.00007304304,0.000004999566,0.00026608078,0.009921029],"genre_scores_gemma":[0.42737266,0.0000045155457,0.57253456,0.000043115422,0.0000031684888,0.0000038179405,7.9930425e-7,0.0000031548843,0.000034236684],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991064,0.000029315734,0.0002552874,0.00025613134,0.0001848892,0.00016798475],"domain_scores_gemma":[0.9991717,0.00005464106,0.000053729764,0.00058715354,0.0000618192,0.000070999544],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014397902,0.0000779769,0.00012007874,0.000077805285,0.00004895789,0.000016887205,0.0007149982,0.000029787585,0.000154968],"category_scores_gemma":[0.000053774314,0.000064090316,0.000021444577,0.00012033734,0.000039631333,0.0003977164,0.00043359524,0.00007103267,0.000016789067],"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.00001478919,0.00010142492,0.00015001115,0.000014006891,0.0000054347865,0.000012191581,0.0005304354,0.0006079649,0.0018743684,0.9370962,0.0011943424,0.058398828],"study_design_scores_gemma":[0.0000735122,0.00005096289,0.00011176487,0.00002401136,0.000001679861,0.0000041060107,0.000019957526,0.9073002,0.030393805,0.061636727,0.00027683083,0.00010645824],"about_ca_topic_score_codex":0.000063294996,"about_ca_topic_score_gemma":0.0000039717124,"teacher_disagreement_score":0.9066922,"about_ca_system_score_codex":0.00001434672,"about_ca_system_score_gemma":0.000032809294,"threshold_uncertainty_score":0.26135272},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0052338582,0.0012623988,0.99111843,0.0015111963,0.0002790635,0.00015295054,0.000014551174,0.00023375101,0.00019380766],"genre_scores_gemma":[0.5803465,0.0026098345,0.4159051,0.00051973155,0.0003858477,0.00001833376,0.0000926036,0.000030474881,0.00009155164],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988121,0.000031468855,0.0003014196,0.00047767325,0.000089447276,0.00028789634],"domain_scores_gemma":[0.9989189,0.00013195524,0.000049692077,0.00079540466,0.000018184786,0.00008584375],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026481142,0.00018527258,0.00030983283,0.00022696969,0.000040469513,0.000011716236,0.0008851399,0.000097577795,0.0000228485],"category_scores_gemma":[0.00006513398,0.00013351512,0.000012589654,0.0002963052,0.0000929692,0.00042962297,0.00030781934,0.00026717683,0.0000039025813],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000043068543,0.00020844533,0.0015285722,0.00037996308,0.00007580378,0.00028449998,0.0015405334,0.0045338087,0.60696524,0.007256154,0.056785837,0.32039806],"study_design_scores_gemma":[0.000682945,0.00013944639,0.00028893823,0.00028554138,0.0000058707133,0.000073031726,0.0000035791866,0.96195126,0.0013941994,0.00042034773,0.03456187,0.00019295748],"about_ca_topic_score_codex":0.000015864056,"about_ca_topic_score_gemma":0.0000032923315,"teacher_disagreement_score":0.9574175,"about_ca_system_score_codex":0.000017224986,"about_ca_system_score_gemma":0.000004605415,"threshold_uncertainty_score":0.54445887},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09695639,0.0006223513,0.90028876,0.00008974736,0.00007423582,0.00072368537,0.00000380272,0.0011793148,0.00006171439],"genre_scores_gemma":[0.56943554,0.000069613816,0.43018833,0.000014232331,0.000012515602,0.00016365152,0.000008093828,0.000024191499,0.00008387023],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9982128,0.000022882567,0.00041282733,0.0006341082,0.00013769393,0.0005796725],"domain_scores_gemma":[0.9980151,0.0008682293,0.00041291822,0.000426747,0.00021466058,0.00006233839],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00056235516,0.00022777026,0.000395767,0.0004960431,0.0004597012,0.000029383442,0.00065056374,0.0002646014,0.0000016267244],"category_scores_gemma":[0.0007400871,0.00023386108,0.00006910114,0.0006098998,0.00017196618,0.00058629276,0.0004522083,0.0005405891,5.688224e-7],"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.000035878013,0.000019441355,0.0010830587,0.00008368919,0.000013641456,0.0000020967484,0.000106989886,0.0026073891,0.25214508,0.02582874,0.000008599719,0.7180654],"study_design_scores_gemma":[0.0011817453,0.0011326316,0.00009620163,0.00030913771,0.000016494461,0.00003376527,0.00058233953,0.052632343,0.8658927,0.030295467,0.047382798,0.00044434972],"about_ca_topic_score_codex":0.000002314944,"about_ca_topic_score_gemma":0.0000039114093,"teacher_disagreement_score":0.717621,"about_ca_system_score_codex":0.00005172123,"about_ca_system_score_gemma":0.000026170575,"threshold_uncertainty_score":0.9536578},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19796744,0.0003328087,0.80099183,0.00014104645,0.000116430245,0.00016702978,0.0000034123063,0.00012290245,0.00015710898],"genre_scores_gemma":[0.5169848,0.0000758749,0.4825972,0.00022163246,0.000059916933,0.0000020287757,0.0000020088032,0.000019315214,0.000037235503],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9974827,0.00012628983,0.00063454814,0.0005038545,0.00082701835,0.00042559666],"domain_scores_gemma":[0.9983683,0.000065253436,0.0006481602,0.00037733768,0.00024341547,0.00029753603],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004956078,0.00031427518,0.00038856713,0.00042480114,0.00064512243,0.00018716812,0.0006835662,0.0001365479,0.000015262489],"category_scores_gemma":[0.00009016763,0.00026581774,0.00009876462,0.00046323764,0.00012225384,0.0018373391,0.00014176522,0.000512944,0.0000010945587],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014051388,0.00016354582,0.0016651023,0.00007736423,0.000010768688,0.000202538,0.0002686838,0.0043524303,0.1379089,0.000008144472,0.00057761156,0.8546244],"study_design_scores_gemma":[0.0013456395,0.00017792635,0.0015138822,0.0011191396,0.000014962544,0.0009557986,0.000021952195,0.8237353,0.16925262,0.0011315312,0.00036527083,0.00036596035],"about_ca_topic_score_codex":0.000005549066,"about_ca_topic_score_gemma":0.000001047778,"teacher_disagreement_score":0.8542584,"about_ca_system_score_codex":0.00015447375,"about_ca_system_score_gemma":0.00034581052,"threshold_uncertainty_score":0.9999794},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0007879615,0.00009069952,0.9975375,0.000048196955,0.000026968919,0.0009039738,0.000031264095,0.00042099284,0.00015242862],"genre_scores_gemma":[0.35620216,0.000008153812,0.64355206,0.000039845534,0.000024575753,0.00011797786,0.000006065178,0.000018933692,0.000030208754],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99862003,0.000058520433,0.00026426642,0.00039309153,0.00026774398,0.00039633634],"domain_scores_gemma":[0.9986584,0.00006691972,0.00017477343,0.0006992268,0.00022114586,0.00017949249],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028738866,0.00022096914,0.00028178951,0.00016547037,0.00014242732,0.00003602509,0.0008059448,0.00010007236,0.000014081315],"category_scores_gemma":[0.0000061780415,0.00016148704,0.000054989203,0.0003254215,0.000103863706,0.0023867087,0.0001806079,0.00012297893,5.5473055e-7],"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.00044402358,0.0010009373,0.000091261136,0.00019336843,0.000039357514,0.0000056124654,0.0010695345,0.00025224345,0.8904431,0.022149231,0.0006312937,0.08368006],"study_design_scores_gemma":[0.00024932311,0.0004072696,0.000025033149,0.00020928745,0.0000066879493,0.000024511719,0.0000663011,0.07868046,0.91771996,0.0016196984,0.00072889903,0.00026257674],"about_ca_topic_score_codex":0.00004221337,"about_ca_topic_score_gemma":0.0000014248968,"teacher_disagreement_score":0.3554142,"about_ca_system_score_codex":0.000040293966,"about_ca_system_score_gemma":0.000086628694,"threshold_uncertainty_score":0.65852505},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00081913476,0.000103396036,0.9967042,0.0006194557,0.00026042457,0.00023784848,0.000004193655,0.0010029819,0.00024835693],"genre_scores_gemma":[0.09222561,0.000016385166,0.90725183,0.00029303724,0.00008106483,0.000037283957,0.0000062667323,0.000016450733,0.00007204859],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9984987,0.00007319764,0.00024498053,0.0005116653,0.00032292237,0.00034855452],"domain_scores_gemma":[0.9987736,0.000054465683,0.000090530564,0.0008747367,0.00008456442,0.00012211654],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025360516,0.00017980805,0.00017160508,0.00012613196,0.00014770193,0.00015547707,0.0011517223,0.00006848576,0.000017101665],"category_scores_gemma":[0.000041308078,0.00016650477,0.00006025315,0.00035188187,0.0000647987,0.001373714,0.00042298398,0.00019094122,0.00021192024],"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.000050455594,0.0005869237,0.000021396738,0.000019477877,0.00005567637,0.00028941905,0.000603723,0.033531055,0.1247459,0.32563505,0.01236999,0.50209093],"study_design_scores_gemma":[0.0016850093,0.00036623474,0.00020977914,0.00011450232,0.000013109216,0.0001814603,0.000020091327,0.16290578,0.6589972,0.1624317,0.01227507,0.0008000712],"about_ca_topic_score_codex":0.000030227133,"about_ca_topic_score_gemma":4.799289e-7,"teacher_disagreement_score":0.5342513,"about_ca_system_score_codex":0.00009176896,"about_ca_system_score_gemma":0.0000706409,"threshold_uncertainty_score":0.6789867},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00033462292,0.000054154327,0.9905791,0.0015739471,0.000064980624,0.00009512609,5.907737e-7,0.0011751174,0.0061223614],"genre_scores_gemma":[0.2506943,0.000024840143,0.748158,0.0007337411,0.00001584317,0.000009949316,0.0000013066231,0.000005962691,0.00035611],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991483,0.000014012671,0.00014012276,0.00029774287,0.00021619788,0.00018363634],"domain_scores_gemma":[0.9991683,0.00002068792,0.00003334555,0.00064604013,0.000030619805,0.00010100055],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00007420385,0.00009655153,0.000092400995,0.0000732005,0.00007154934,0.00005702789,0.0009569629,0.000056266927,0.000057260753],"category_scores_gemma":[0.000010722251,0.000074256175,0.000035781108,0.00024187488,0.000023688603,0.0007955392,0.00022953317,0.00012483483,0.00007645863],"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.000006021275,0.000118129494,0.00007485977,0.000008809752,0.000004434458,0.000027167911,0.00020450032,0.0006478004,0.021536065,0.44883192,0.0040827636,0.5244575],"study_design_scores_gemma":[0.0006325552,0.00010696246,0.00089543493,0.00007828271,0.000001447911,0.000035307112,0.00000686952,0.0060330895,0.36393854,0.45889208,0.1690228,0.00035663164],"about_ca_topic_score_codex":0.000020545705,"about_ca_topic_score_gemma":0.0000010993883,"teacher_disagreement_score":0.5241009,"about_ca_system_score_codex":0.00003519878,"about_ca_system_score_gemma":0.000043820288,"threshold_uncertainty_score":0.3028079},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0021984312,0.00045938167,0.99255997,0.0027832908,0.000053252184,0.0008357332,0.0000072013277,0.0007287981,0.00037391612],"genre_scores_gemma":[0.44079465,0.00017426195,0.558478,0.00014552995,0.000018099101,0.00032938278,0.0000042975703,0.00001950482,0.000036241316],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99864876,0.000017487599,0.00030538594,0.00047150452,0.0001959106,0.0003609382],"domain_scores_gemma":[0.9979322,0.00032839304,0.00023824269,0.0010281103,0.00034155752,0.00013150927],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043556615,0.00022440805,0.000236284,0.00020870478,0.0008367153,0.0004094783,0.0025792124,0.000080646925,9.933148e-7],"category_scores_gemma":[0.00017695478,0.00020242293,0.000039898016,0.00044143258,0.00017403308,0.0018808941,0.0010778005,0.000238654,0.0000051248194],"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.00006284563,0.00032550225,0.0005691528,0.0001418162,0.00008376352,0.0000021598116,0.007239745,0.0010073897,0.021513496,0.91854024,0.003403964,0.047109902],"study_design_scores_gemma":[0.004547897,0.0012160506,0.00047242607,0.002058402,0.00012155279,0.0003148776,0.0011667964,0.23448777,0.18955292,0.5041704,0.059535023,0.0023558869],"about_ca_topic_score_codex":0.00001364869,"about_ca_topic_score_gemma":0.0000031812208,"teacher_disagreement_score":0.43859622,"about_ca_system_score_codex":0.00008123109,"about_ca_system_score_gemma":0.00007341246,"threshold_uncertainty_score":0.8254568},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0034332892,0.00002949904,0.9806351,0.002846966,0.0003461622,0.0004670693,0.000018145302,0.0011132173,0.011110564],"genre_scores_gemma":[0.029493514,0.0000104728715,0.9612622,0.0033278991,0.00008441417,0.0001580883,0.000015654558,0.000022455803,0.005625303],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.998779,0.000022840297,0.0002384897,0.00048613228,0.00014354808,0.00032996555],"domain_scores_gemma":[0.9985901,0.0002141371,0.000058355807,0.0009803552,0.0000316006,0.00012542901],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014091769,0.00014157468,0.00016568546,0.0001476899,0.00006124407,0.00016455536,0.0014467823,0.00010265993,0.00059626444],"category_scores_gemma":[0.000073681935,0.00011711383,0.000046974234,0.00024487058,0.000041634914,0.0027130174,0.0008876509,0.0002534386,0.00014410388],"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.000029329123,0.00021722574,0.0029935543,0.0000418717,0.000007372105,0.00002088684,0.0002523156,0.000010933748,0.034636572,0.25755858,0.57067734,0.13355403],"study_design_scores_gemma":[0.00044782454,0.00008869438,0.0009408728,0.000045199995,0.0000015804934,0.000011970618,0.000013088559,0.025084838,0.2968299,0.1523178,0.5238436,0.00037464863],"about_ca_topic_score_codex":0.000018120416,"about_ca_topic_score_gemma":0.000018361148,"teacher_disagreement_score":0.26219332,"about_ca_system_score_codex":0.000008760434,"about_ca_system_score_gemma":0.000054046915,"threshold_uncertainty_score":0.6528678},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008278368,0.0000145122385,0.9885236,0.00044696155,0.0000704265,0.00033145174,0.0000011929274,0.00084854173,0.0014849185],"genre_scores_gemma":[0.565364,0.000008074405,0.4339977,0.00022647878,0.0000085272995,0.000053493448,0.000004118767,0.0000052547325,0.00033237974],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991192,0.000038781014,0.00015345616,0.00029013728,0.0002018804,0.00019651327],"domain_scores_gemma":[0.99911296,0.00010569233,0.00006881474,0.00054526306,0.00009179234,0.00007544561],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00010722228,0.000108276145,0.00012566241,0.00008127452,0.00009903097,0.00018712616,0.00057518616,0.000031968197,0.000072056064],"category_scores_gemma":[0.000043119868,0.00007286783,0.000023838482,0.00019919076,0.000035511635,0.002104474,0.00020041293,0.00008483452,0.00013607086],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001707257,0.0002670907,0.011457263,0.000049389633,0.00004955098,0.000025613539,0.00064991444,0.00030809152,0.30172247,0.19893293,0.24120098,0.24516596],"study_design_scores_gemma":[0.0050443946,0.0003149313,0.0069196234,0.00017266077,0.000007868489,0.00006412366,0.00015557694,0.69340193,0.253481,0.016889483,0.022678966,0.0008694483],"about_ca_topic_score_codex":0.00013483553,"about_ca_topic_score_gemma":0.000012651311,"teacher_disagreement_score":0.69309384,"about_ca_system_score_codex":0.000021855147,"about_ca_system_score_gemma":0.000015221766,"threshold_uncertainty_score":0.29714638},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00092226313,0.0000097486145,0.9981541,0.00005706952,0.00009174761,0.00015395858,0.000007000096,0.0002659113,0.00033819256],"genre_scores_gemma":[0.14643799,8.693624e-7,0.8532377,0.0002610013,0.000005630872,0.00001701734,0.0000015237943,0.0000045206884,0.000033788456],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99927896,0.00004251745,0.00019157832,0.00018738295,0.00017363881,0.0001259361],"domain_scores_gemma":[0.9990607,0.00003861019,0.00012331015,0.00068000925,0.000069766145,0.00002763347],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000109425804,0.0000747696,0.00007762787,0.000050361905,0.000057418933,0.000015664844,0.0009547895,0.000020833806,0.0001384906],"category_scores_gemma":[0.000015263468,0.00004823455,0.00004782317,0.0002180706,0.000030448313,0.0003865712,0.00056802906,0.00005647554,0.000004605282],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000014127255,0.000029417273,0.0014178057,0.000006922084,0.000004356418,0.000001102514,0.00043535104,0.0000021663307,0.0014975965,0.006307772,0.0009100846,0.989386],"study_design_scores_gemma":[0.0002073378,0.000067330155,0.0059236814,0.000035051773,0.0000032524752,0.000002985017,0.00008283919,0.0078790225,0.9722489,0.012692991,0.0007462263,0.00011038751],"about_ca_topic_score_codex":0.00014862577,"about_ca_topic_score_gemma":0.000020376581,"teacher_disagreement_score":0.98927563,"about_ca_system_score_codex":0.000019293666,"about_ca_system_score_gemma":0.00004274444,"threshold_uncertainty_score":0.19669478},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0011254821,0.000016183418,0.9966014,0.000062342784,0.00010389961,0.00016592401,0.000002667769,0.0004124637,0.0015096215],"genre_scores_gemma":[0.15417723,0.000007071609,0.8452204,0.00023431555,0.000026975837,0.000003539058,0.0000012997868,0.000005842802,0.00032333465],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9990311,0.000031264215,0.00023514974,0.0002420134,0.00027343052,0.00018703441],"domain_scores_gemma":[0.99871594,0.0003633904,0.000087890614,0.00069365854,0.00006342098,0.00007567729],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003290441,0.00008998853,0.00011561005,0.00011154345,0.0000342655,0.0000110439805,0.00083484064,0.000044773304,0.000045895173],"category_scores_gemma":[0.00010041962,0.00006911841,0.000028718932,0.00020353224,0.000033432294,0.0002711593,0.00021746733,0.000079525256,0.000030027848],"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.00015211168,0.0004123226,0.00014929834,0.000018598437,0.000017831275,0.000040043724,0.00021117214,0.00074415695,0.12827955,0.76749736,0.049538873,0.052938685],"study_design_scores_gemma":[0.00027557884,0.00046904435,0.00024015146,0.00003757727,0.0000016597046,0.000003785796,0.0000056830827,0.06520515,0.9014078,0.028966106,0.0032469803,0.0001405025],"about_ca_topic_score_codex":0.0000026787793,"about_ca_topic_score_gemma":1.9523374e-7,"teacher_disagreement_score":0.7731282,"about_ca_system_score_codex":0.000017427186,"about_ca_system_score_gemma":0.0000217041,"threshold_uncertainty_score":0.2818567},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0037619472,0.0005622072,0.96244854,0.0020751853,0.000036531714,0.00037444007,0.000024253673,0.00089389965,0.029822972],"genre_scores_gemma":[0.5103977,0.00007004844,0.48931733,0.00004864775,0.000012557481,0.000052280568,0.000008425892,0.000008084528,0.00008494261],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99885607,0.000020044596,0.00041697634,0.00026396112,0.00023824362,0.00020472753],"domain_scores_gemma":[0.99761575,0.0001541023,0.00030522456,0.0015224856,0.0003523214,0.00005013719],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023196285,0.00013450284,0.00019539583,0.00016289165,0.00020108967,0.00008258032,0.004189755,0.000059255144,0.000010032586],"category_scores_gemma":[0.00007066767,0.00013398762,0.000060021506,0.00054612354,0.00017515548,0.0009262497,0.0012355567,0.00020737363,0.00001602729],"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.000003858932,0.00034095676,0.0006412266,0.0000230329,0.0000100660645,3.177942e-7,0.0003178503,0.000040315284,0.28648043,0.69631183,0.010359691,0.0054704333],"study_design_scores_gemma":[0.00042624562,0.0000812406,0.0024088887,0.00016505666,0.00001487731,0.000016100948,0.0000684576,0.10657514,0.62383735,0.23419039,0.03177915,0.00043708025],"about_ca_topic_score_codex":0.000118736745,"about_ca_topic_score_gemma":0.000010844987,"teacher_disagreement_score":0.5066357,"about_ca_system_score_codex":0.00003868641,"about_ca_system_score_gemma":0.000036256784,"threshold_uncertainty_score":0.7785677},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00015249883,0.000007104348,0.9870017,0.0004654383,0.00009328417,0.00013420591,0.0000031021732,0.0010798181,0.011062852],"genre_scores_gemma":[0.30974442,0.0000012723091,0.68938625,0.00063684705,0.000027340764,0.000018399947,0.0000049887867,0.000007218707,0.00017330005],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99889183,0.00009507247,0.00018172836,0.0003853559,0.00023085692,0.00021514251],"domain_scores_gemma":[0.9986843,0.00020629723,0.00008557866,0.000823182,0.00011470322,0.00008597604],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020875018,0.00013194799,0.00014375709,0.00009745336,0.00012209677,0.00012653363,0.000985443,0.000042582156,0.00007022466],"category_scores_gemma":[0.00004876066,0.00010740381,0.000037356793,0.00024795908,0.000053908796,0.00090229907,0.00031779773,0.0001110144,0.00009682675],"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.000010640588,0.000060313956,0.00003446904,0.000008116174,0.0000047621033,0.000007814031,0.000044458113,0.000038296974,0.03523258,0.8861115,0.01123197,0.06721508],"study_design_scores_gemma":[0.00019995685,0.000054931083,0.00006772328,0.000022803586,0.0000012285386,0.0000015389547,0.0000035984872,0.62175894,0.3557315,0.015730293,0.0062669134,0.00016061393],"about_ca_topic_score_codex":0.00000993759,"about_ca_topic_score_gemma":0.0000025588538,"teacher_disagreement_score":0.87038124,"about_ca_system_score_codex":0.000029659552,"about_ca_system_score_gemma":0.000031889256,"threshold_uncertainty_score":0.43798003},"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":"codex-gemma-dda1882f352a","genre_candidate":"review","genre_consensus":"review","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[1.4806481e-8,0.5407891,0.4523295,0.0000068239874,0.00058344955,0.005618299,0.00015546945,0.0004913674,0.000025958609],"genre_scores_gemma":[7.62244e-7,0.6537296,0.340116,0.000041385214,0.00013822866,0.005620779,0.00020690668,0.000055362823,0.00009096457],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99515706,0.0005113629,0.0021784925,0.0010717886,0.0005593595,0.00052195136],"domain_scores_gemma":[0.9935055,0.0012875975,0.0021855356,0.0021794136,0.0006479136,0.00019408311],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011691076,0.0007191152,0.0030164,0.0004977349,0.000113700175,0.00013148645,0.0026099267,0.0004447773,0.000008439029],"category_scores_gemma":[0.00089110574,0.00056111737,0.00070194394,0.0005532749,0.000087767454,0.0009482232,0.0008303779,0.00036712384,0.000054275566],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000011068784,0.000040730705,4.193751e-7,0.17360806,0.00003525019,0.0000017291296,0.000018447225,2.38781e-7,0.000058083053,0.00007613653,0.032613643,0.79354614],"study_design_scores_gemma":[0.00008777892,0.000056853925,7.983837e-8,0.28027165,0.000106076666,0.000024526153,0.0000036269341,0.017599812,0.00019083415,0.000016763832,0.70124966,0.00039230328],"about_ca_topic_score_codex":0.00014241858,"about_ca_topic_score_gemma":0.0000021117098,"teacher_disagreement_score":0.7931538,"about_ca_system_score_codex":0.00032570199,"about_ca_system_score_gemma":0.00023090279,"threshold_uncertainty_score":0.99968404},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0025432394,0.000056448305,0.996193,0.00019392047,0.000028981862,0.00059033284,0.00025512968,0.000063001105,0.00007593574],"genre_scores_gemma":[0.27989396,0.000074028256,0.7193822,0.000056985413,0.000030240866,0.00048160524,0.00005002322,0.0000063974717,0.000024553452],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992185,0.000025002488,0.00029968223,0.00024720342,0.00010365945,0.00010593975],"domain_scores_gemma":[0.9981947,0.0010122412,0.00015605902,0.0005010259,0.00009126242,0.000044689605],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000119184595,0.00008163181,0.00017603769,0.00009362679,0.000047961545,0.000024796445,0.0003414903,0.000060853235,0.0000028248207],"category_scores_gemma":[0.00012813152,0.000072040864,0.000025787802,0.00017603258,0.00006202991,0.0004341021,0.00018886423,0.00007171585,5.782793e-7],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018544793,0.0002698086,0.005327747,0.00014219934,0.000007822809,1.1816083e-7,0.00014033666,0.00028793135,0.053186283,0.018630551,0.0029772262,0.9190114],"study_design_scores_gemma":[0.00085802027,0.0001609605,0.023284595,0.00024739787,0.0000132551495,0.00000192444,0.000025302774,0.5122518,0.40736228,0.008464084,0.047086257,0.00024416432],"about_ca_topic_score_codex":0.000024736888,"about_ca_topic_score_gemma":0.0000028711527,"teacher_disagreement_score":0.9187673,"about_ca_system_score_codex":0.0000059215026,"about_ca_system_score_gemma":0.000011314275,"threshold_uncertainty_score":0.2937741},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003870336,0.00011254031,0.9909402,0.0045917453,0.00014899655,0.00018105545,0.0000051080083,0.00001708841,0.0001329103],"genre_scores_gemma":[0.27340055,0.00018438295,0.7244888,0.0017452141,0.000040906056,0.0000038640696,1.2045727e-7,0.000010196084,0.00012598689],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99785215,0.00016022979,0.00060257275,0.00011240826,0.0010333812,0.00023926387],"domain_scores_gemma":[0.9974168,0.00042867646,0.0009127883,0.00087202573,0.0002931609,0.000076541844],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007806354,0.00013789175,0.00028823997,0.0000120185205,0.00030037903,0.000009730695,0.0035191334,0.00004997095,0.000022869865],"category_scores_gemma":[0.00021928082,0.000060815673,0.00021463163,0.00045782866,0.0004357921,0.00012487841,0.0017900293,0.00041939705,5.388827e-7],"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.00011717242,0.00031835024,0.0004474459,0.00008054455,0.000273368,0.0000056612735,0.0020489767,0.0064064655,0.46783504,0.00015286863,0.39394265,0.12837143],"study_design_scores_gemma":[0.00056223007,0.00023267049,0.005845362,0.0006985567,0.00015111265,0.00062855514,0.00096158276,0.056530982,0.6906633,0.00835762,0.23485531,0.00051272486],"about_ca_topic_score_codex":0.0014824555,"about_ca_topic_score_gemma":0.0003219364,"teacher_disagreement_score":0.2695302,"about_ca_system_score_codex":0.00034028315,"about_ca_system_score_gemma":0.000756201,"threshold_uncertainty_score":0.65394837},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0006054447,0.0003536788,0.99786335,0.00071510376,0.0001277706,0.00023389548,0.000014074164,0.000080669335,0.000006039066],"genre_scores_gemma":[0.079053245,0.000031962914,0.91991305,0.00033208236,0.0006033818,0.000035095407,0.0000032378703,0.000016270598,0.000011689395],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988639,0.000023409133,0.0003546897,0.00024010446,0.00013186509,0.00038604054],"domain_scores_gemma":[0.99810886,0.00063391286,0.00013267521,0.00020950875,0.0002185492,0.0006964728],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020935529,0.00015760957,0.00023515265,0.00029164867,0.00010683873,0.00013945137,0.0004724222,0.00007998804,0.0000023345508],"category_scores_gemma":[0.0002057677,0.00014612984,0.000067032626,0.00029904046,0.00003067361,0.0007012561,0.000059185466,0.0003500405,0.0000021691935],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005042903,0.00014385424,0.00043623857,0.00007565383,0.00015047073,0.00016817862,0.00034170906,0.023298008,0.00095354795,0.032936636,0.023290385,0.9181549],"study_design_scores_gemma":[0.00038097508,0.00028855738,0.00076405855,0.000054727978,0.00001376348,0.00046357882,7.4084863e-7,0.9323123,0.0011096672,0.0007688371,0.063644506,0.00019830199],"about_ca_topic_score_codex":0.000018556808,"about_ca_topic_score_gemma":0.00004074969,"teacher_disagreement_score":0.9179566,"about_ca_system_score_codex":0.00013309858,"about_ca_system_score_gemma":0.0005487002,"threshold_uncertainty_score":0.5959002},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00037841286,0.00009382672,0.9916236,0.0042340034,0.00009946482,0.00117564,0.000088355606,0.0007606508,0.001546087],"genre_scores_gemma":[0.56191325,0.00029024848,0.43677837,0.00046650687,0.000015379028,0.00025788412,0.000063852785,0.000034568675,0.00017994159],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9981867,0.00028599813,0.0005374003,0.00048531228,0.00017671516,0.0003278814],"domain_scores_gemma":[0.9941814,0.001332767,0.00019248005,0.0038585963,0.00022792623,0.00020683618],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011013848,0.00021860209,0.00018313868,0.0004346995,0.0010809052,0.0001689935,0.0026217264,0.00004755036,0.000005322879],"category_scores_gemma":[0.00007721979,0.00024304059,0.00007491468,0.0007940754,0.00012159115,0.00055469334,0.00016778773,0.00032606567,0.0000767684],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000342192,0.00039068147,0.000008870266,0.000016780694,0.000027386019,8.1644555e-7,0.0011922088,0.0011688864,0.006025285,0.02729849,0.0004610088,0.9633754],"study_design_scores_gemma":[0.0023477909,0.0011668595,0.008861292,0.00037577542,0.000092196045,0.00007720331,0.00048612242,0.35161582,0.07033648,0.012964721,0.5493101,0.002365668],"about_ca_topic_score_codex":0.0000226441,"about_ca_topic_score_gemma":0.000103054066,"teacher_disagreement_score":0.9610097,"about_ca_system_score_codex":0.0000879344,"about_ca_system_score_gemma":0.00003056717,"threshold_uncertainty_score":0.9910908},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014191939,0.0008923229,0.9845329,0.00011383002,0.00013170012,0.000053172866,7.527829e-7,0.000056071338,0.000027305468],"genre_scores_gemma":[0.58788073,0.0000055045775,0.4117737,0.000058598536,0.0002674474,0.0000012223869,9.675621e-7,0.000007713158,0.0000040689433],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99914336,0.00002163218,0.00022473221,0.00014705272,0.00012808957,0.00033511707],"domain_scores_gemma":[0.9992986,0.00007598346,0.000094478426,0.00014464828,0.000090476206,0.00029582588],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00008202579,0.00012445386,0.00017291906,0.00019117452,0.000095223666,0.00013642645,0.00036087286,0.000039834405,0.0000013493833],"category_scores_gemma":[0.00000875446,0.00009646316,0.000033508128,0.0003346926,0.000022432521,0.00047583357,0.000046441393,0.0002528019,4.031947e-7],"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.000063881,0.00009655281,0.008236233,0.000071720104,0.00007565781,0.002374142,0.00014251981,0.61235476,0.0069321925,0.06678225,0.030279236,0.27259088],"study_design_scores_gemma":[0.00024362389,0.00020542523,0.01373154,0.00008883963,0.000003999114,0.00053975737,1.9559558e-7,0.97969127,0.0003417329,0.00050300715,0.0045051416,0.00014548202],"about_ca_topic_score_codex":0.00024157889,"about_ca_topic_score_gemma":0.000079591475,"teacher_disagreement_score":0.5736888,"about_ca_system_score_codex":0.00005312698,"about_ca_system_score_gemma":0.00008440874,"threshold_uncertainty_score":0.39336535},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0015918604,0.000028392711,0.99751306,0.000059293685,0.000034908568,0.00021078123,0.000012507847,0.0001924989,0.00035667457],"genre_scores_gemma":[0.2983603,0.0000030671436,0.7014938,0.000119959994,0.000008475481,0.0000053215053,0.0000012791113,0.000004118578,0.0000036764636],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980852,0.00002375761,0.00028468648,0.0006964871,0.00055955263,0.00035031588],"domain_scores_gemma":[0.99876976,0.00007462516,0.00020596462,0.0006887941,0.00012133726,0.00013952887],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007110028,0.00015932794,0.0002242757,0.00020483062,0.0003540052,0.00015617254,0.0010936109,0.000045015087,0.0000019088454],"category_scores_gemma":[0.000035888115,0.00014382317,0.000023206334,0.00062941085,0.00031267933,0.0011734399,0.0007153986,0.00014424772,0.0000010599698],"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.000001920476,0.000029011628,0.000001606146,0.0000029728274,5.516306e-7,0.0000010339949,0.00025999217,0.00026334915,0.7351603,0.0034895914,0.000006313522,0.26078334],"study_design_scores_gemma":[0.00015512221,0.000016989115,0.00022065718,0.000032214455,0.0000015906891,0.000026538304,0.0000096659705,0.6360411,0.34763393,0.015724013,0.000025935657,0.00011225357],"about_ca_topic_score_codex":0.000013417228,"about_ca_topic_score_gemma":2.680327e-7,"teacher_disagreement_score":0.6357778,"about_ca_system_score_codex":0.00004186416,"about_ca_system_score_gemma":0.00007485078,"threshold_uncertainty_score":0.58649385},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0005849004,0.00008359354,0.99235433,0.000023745944,0.00014418075,0.00021464074,0.0000034100801,0.0011420562,0.0054491246],"genre_scores_gemma":[0.48508322,0.0000012733465,0.5147275,0.00006910656,0.000029270659,0.000013241494,0.0000026383063,0.0000075146245,0.00006629174],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99870443,0.00016489734,0.0002782819,0.00026204519,0.00028024195,0.0003100917],"domain_scores_gemma":[0.99840283,0.00009866266,0.00014515205,0.0011306087,0.00007208203,0.00015064156],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00052602787,0.00012969751,0.00019483113,0.00011492391,0.00006461783,0.000047377995,0.0011310226,0.000034817916,0.000029963969],"category_scores_gemma":[0.000025360641,0.00010597901,0.000030835,0.00019997425,0.00003652451,0.0022257615,0.0003037971,0.00008017606,0.00003970596],"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.00003858225,0.00056551903,0.0015547784,0.00019855198,0.00003115016,0.000021391783,0.0019841634,0.00037414025,0.27540126,0.5173499,0.027217489,0.17526305],"study_design_scores_gemma":[0.00027870171,0.000064300504,0.00035742144,0.00009407978,0.000005299965,0.000059064325,0.00023440756,0.24196048,0.7529997,0.0012991196,0.002325138,0.00032224564],"about_ca_topic_score_codex":0.00001313028,"about_ca_topic_score_gemma":1.2301385e-7,"teacher_disagreement_score":0.5160508,"about_ca_system_score_codex":0.000038627903,"about_ca_system_score_gemma":0.000025905854,"threshold_uncertainty_score":0.43216985},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0010171008,0.00005171203,0.99459666,0.0007484014,0.00017312888,0.0003544643,0.000024283754,0.001266331,0.0017679242],"genre_scores_gemma":[0.36853212,0.000003261157,0.63039196,0.0005227923,0.000027950806,0.000055680634,0.0000044248013,0.000036703856,0.0004251349],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.997632,0.000057479345,0.00048287923,0.00069646415,0.00054238975,0.00058876205],"domain_scores_gemma":[0.9985904,0.00013387349,0.00014050367,0.00078144233,0.000153405,0.00020035404],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005461492,0.00031274793,0.00025134385,0.00042668515,0.0005247127,0.00022674733,0.0009301633,0.000120344994,0.0000859343],"category_scores_gemma":[0.0000074248246,0.0002905756,0.00013000352,0.0008161545,0.0001459618,0.0017763918,0.0000055000437,0.0004251498,0.00009237374],"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.00016701869,0.0005517281,0.0000010557256,0.0000960664,0.000011611687,0.000068523965,0.0005083954,0.0019022514,0.24595465,0.000073967916,0.000597936,0.7500668],"study_design_scores_gemma":[0.00067273725,0.00014867393,0.000013553296,0.00023117365,0.000011956453,0.000022943297,0.000037464186,0.07369346,0.9193866,0.0017310194,0.0036259855,0.00042438795],"about_ca_topic_score_codex":0.0000068187333,"about_ca_topic_score_gemma":0.000011539352,"teacher_disagreement_score":0.74964243,"about_ca_system_score_codex":0.00013863001,"about_ca_system_score_gemma":0.0001435632,"threshold_uncertainty_score":0.99995464},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0008225866,0.00016982111,0.9973825,0.000039810486,0.00007461515,0.00032329134,0.0000061204028,0.0006956154,0.0004856305],"genre_scores_gemma":[0.4649498,0.0000015041892,0.534823,0.00008073394,0.000041982166,0.00007099355,0.0000035768796,0.000013509052,0.000014911867],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987011,0.00001632152,0.00025375583,0.000474806,0.0002031755,0.00035083672],"domain_scores_gemma":[0.99913925,0.00005619872,0.00017507462,0.00032389557,0.00021791876,0.00008765473],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028026185,0.00017184445,0.00015994406,0.000119444965,0.00031758787,0.00019392758,0.00075381977,0.00006938736,0.00001423568],"category_scores_gemma":[0.0000665533,0.00015807699,0.000056486006,0.00023393115,0.000054942768,0.0027609954,0.000307988,0.00014119125,0.000011966866],"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.00009054459,0.00016243897,0.00026190077,0.0002263738,0.000011952472,0.00001403523,0.0014374752,0.000010079215,0.7130385,0.0068386975,0.001743643,0.27616432],"study_design_scores_gemma":[0.00036432326,0.00008328603,0.00013952533,0.00020893346,0.000005089756,0.00001126513,0.00004139829,0.56262314,0.34457046,0.09123997,0.00042609652,0.00028650215],"about_ca_topic_score_codex":0.0000141884,"about_ca_topic_score_gemma":0.0000047737567,"teacher_disagreement_score":0.56261307,"about_ca_system_score_codex":0.000040946317,"about_ca_system_score_gemma":0.000057003122,"threshold_uncertainty_score":0.6446192},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0023159352,0.0000061549617,0.99134517,0.00023360467,0.00013510721,0.0003958366,0.000028336375,0.0024775758,0.0030622703],"genre_scores_gemma":[0.5552072,1.5999262e-7,0.44416395,0.00052670663,0.000012855816,0.000035684705,0.000029009545,0.000015479158,0.000008988685],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973188,0.00029693535,0.00040950585,0.00085727766,0.00071847683,0.00039900513],"domain_scores_gemma":[0.99704117,0.00018514888,0.00014943085,0.0022117668,0.000121394696,0.00029110454],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003975171,0.000322293,0.0003377824,0.00022593663,0.00025611307,0.00018845024,0.0018605083,0.00008978848,0.000011457272],"category_scores_gemma":[0.000009094996,0.00025035403,0.00009899549,0.00024123013,0.00006187736,0.00035933277,0.00013083925,0.0002057443,0.00004270857],"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.00004666793,0.00040212608,0.000014241185,0.00005749277,0.0000016319666,0.0000047732597,0.000025634996,0.9135013,0.063077524,0.018017126,0.00044945034,0.0044020177],"study_design_scores_gemma":[0.0005946044,0.00020272085,0.00006760385,0.00023509488,0.0000040873592,0.0000010735098,0.0000030493404,0.78624845,0.21206525,0.00011269781,0.00020142253,0.00026394209],"about_ca_topic_score_codex":0.000014148414,"about_ca_topic_score_gemma":0.0000012081961,"teacher_disagreement_score":0.55289125,"about_ca_system_score_codex":0.000110925,"about_ca_system_score_gemma":0.000048794187,"threshold_uncertainty_score":0.9999949},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00017018928,0.000037599628,0.9931867,0.00037766274,0.0002668859,0.00039321926,0.000009811395,0.000647126,0.004910823],"genre_scores_gemma":[0.22118822,0.0000048912316,0.7724046,0.00090015866,0.00019135956,0.00023174456,0.000017465896,0.000018916116,0.005042635],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99866873,0.000020830414,0.00023689483,0.00046578774,0.00028632014,0.00032145117],"domain_scores_gemma":[0.99895865,0.00009945114,0.00008779099,0.000725441,0.00006485133,0.00006379406],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001537556,0.00015724088,0.00014917004,0.00009483698,0.00010420945,0.00013089525,0.00089264795,0.000072456736,0.000099921956],"category_scores_gemma":[0.000015436706,0.00012790199,0.000060713774,0.0001711322,0.000026503145,0.0007889996,0.00045921092,0.000080050704,0.000018724004],"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.00001984047,0.00037852422,0.0006758564,0.000029148763,0.00001656986,0.000012181075,0.00006188543,0.018144654,0.010222561,0.4335373,0.48894542,0.04795605],"study_design_scores_gemma":[0.00080019265,0.00013891543,0.0011316289,0.000040133673,0.0000043496802,0.000008059995,0.000007972304,0.5066415,0.1466759,0.12899877,0.21496615,0.00058640435],"about_ca_topic_score_codex":0.000057135003,"about_ca_topic_score_gemma":0.0000083615905,"teacher_disagreement_score":0.48849687,"about_ca_system_score_codex":0.000059532034,"about_ca_system_score_gemma":0.00002737347,"threshold_uncertainty_score":0.5215692},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00033688248,0.000112108355,0.9963297,0.00018876352,0.00045339542,0.0005841298,0.00006868529,0.0011213953,0.0008049174],"genre_scores_gemma":[0.032111827,0.0000040578598,0.96658325,0.00072854385,0.00008320923,0.00022565585,0.000045996363,0.000025818528,0.00019166483],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9982321,0.0000657696,0.00029484023,0.00044875167,0.00031952324,0.00063898385],"domain_scores_gemma":[0.9980843,0.00023377077,0.00013008589,0.0011476573,0.00014587987,0.0002583228],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030291575,0.00023732628,0.0002407699,0.00013137874,0.00018515287,0.00011580274,0.0011929806,0.000086652646,0.0001734633],"category_scores_gemma":[0.000058968955,0.00019072376,0.000103421604,0.00023333625,0.00006226738,0.0017841054,0.00046130765,0.00013514944,0.00006839388],"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.0000321424,0.0011736996,0.00013917097,0.00006847784,0.000023063216,0.000008293794,0.0002963518,0.00001369381,0.5807712,0.03462408,0.10539911,0.2774507],"study_design_scores_gemma":[0.00066531595,0.000085572574,0.00009804389,0.000043801683,0.00000327453,0.0000041028948,0.000008485946,0.063548625,0.8953815,0.0016768179,0.03820143,0.00028302922],"about_ca_topic_score_codex":0.000016099038,"about_ca_topic_score_gemma":5.7374604e-7,"teacher_disagreement_score":0.3146103,"about_ca_system_score_codex":0.000050952345,"about_ca_system_score_gemma":0.000048224054,"threshold_uncertainty_score":0.77774894},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0013088121,0.00012648673,0.9958669,0.00039254685,0.00021886583,0.00053762237,0.000019604553,0.00079007173,0.00073909794],"genre_scores_gemma":[0.6101267,0.00006938975,0.38907465,0.0002388024,0.00004388457,0.00018173677,0.00001958301,0.000016697595,0.00022855832],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998384,0.00017179549,0.00034243288,0.00038509272,0.00026005547,0.00045661686],"domain_scores_gemma":[0.9970917,0.0005135478,0.00021866351,0.001802808,0.00018079339,0.00019245716],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000505255,0.00021498642,0.00023317256,0.000137181,0.00041396994,0.00009354802,0.002097634,0.000098228964,0.000013567567],"category_scores_gemma":[0.0000456735,0.00017067025,0.00007456466,0.0002480129,0.000080901955,0.002218078,0.0019997363,0.00020546807,0.00003793689],"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.000081284255,0.0008277556,0.00017744768,0.00004214373,0.000039221384,0.00000210861,0.0009334789,0.00010201366,0.20364124,0.44479355,0.008230389,0.34112936],"study_design_scores_gemma":[0.00029359155,0.000088734945,0.000070535025,0.00013028024,0.0000063755915,0.000007245181,0.000048690148,0.59418917,0.3951408,0.0066625425,0.003059675,0.00030233356],"about_ca_topic_score_codex":0.000024533285,"about_ca_topic_score_gemma":0.000010012005,"teacher_disagreement_score":0.6088179,"about_ca_system_score_codex":0.00009512789,"about_ca_system_score_gemma":0.00003704215,"threshold_uncertainty_score":0.6959731},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00821768,0.001052524,0.9889398,0.00016964665,0.00030569866,0.00041253935,0.00006208472,0.000602761,0.0002372712],"genre_scores_gemma":[0.44840917,0.00004906616,0.54969996,0.0007785944,0.000076224,0.000081637045,0.000004279583,0.00003232047,0.00086871884],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99818784,0.000033509135,0.00033007492,0.0006412619,0.00031748143,0.0004898252],"domain_scores_gemma":[0.9988656,0.00018191527,0.00013015975,0.0005192489,0.00012219514,0.0001808764],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004902492,0.0002769473,0.0002617055,0.00028928043,0.00030821573,0.00026599626,0.00042948575,0.00016992971,0.000038638096],"category_scores_gemma":[0.00001855317,0.0002528455,0.0001024481,0.00042551072,0.00006895148,0.0010024651,0.000010810419,0.00038264273,0.000010567027],"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.00014544025,0.000100693105,0.0000058075857,0.00009243131,0.000012638421,0.0000783174,0.00082294457,0.000033853557,0.014458153,0.0000073822653,0.00018751722,0.9840548],"study_design_scores_gemma":[0.0013777249,0.00048251546,0.00013853096,0.0007299443,0.000057743837,0.00041281094,0.0006259406,0.0138692735,0.9709454,0.0017028973,0.008595472,0.0010617158],"about_ca_topic_score_codex":0.00001985284,"about_ca_topic_score_gemma":0.000105673884,"teacher_disagreement_score":0.9829931,"about_ca_system_score_codex":0.00006794858,"about_ca_system_score_gemma":0.00007333632,"threshold_uncertainty_score":0.9999924},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00051684305,0.00012987913,0.9909369,0.0011648359,0.00003180903,0.00037217056,0.00014122139,0.0004620445,0.006244331],"genre_scores_gemma":[0.461415,0.0009503128,0.5355265,0.00023150982,0.000011754153,0.00011084574,0.000114706425,0.000037618607,0.001601727],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9981695,0.00044464596,0.00054308726,0.00042390183,0.00016600374,0.0002529056],"domain_scores_gemma":[0.99675244,0.00031716248,0.00015516953,0.0025264246,0.00011909583,0.00012971301],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046860432,0.00019946546,0.00030026454,0.0006159669,0.00050832995,0.000075556476,0.0017332514,0.000046069756,0.00046372777],"category_scores_gemma":[0.000012929178,0.00019507429,0.00031330585,0.0018802402,0.00008773669,0.00051105925,0.00002228148,0.00026357148,0.000051001818],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003895557,0.00072787143,0.000003263655,0.000015139545,0.00035378177,0.0000015478136,0.0008421604,0.020426646,0.005085138,0.0022759726,0.00039292738,0.9698366],"study_design_scores_gemma":[0.00135338,0.0005887965,0.0019058246,0.00022578271,0.00061332237,0.000012830597,0.00008238129,0.46489117,0.050771076,0.0012397582,0.47735843,0.0009572523],"about_ca_topic_score_codex":0.00001261872,"about_ca_topic_score_gemma":0.0000053661706,"teacher_disagreement_score":0.96887934,"about_ca_system_score_codex":0.00003241894,"about_ca_system_score_gemma":0.000033567045,"threshold_uncertainty_score":0.79548985},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0053530913,0.00022873447,0.9908181,0.00060117134,0.00033942805,0.00061264116,0.000016257765,0.0009206708,0.0011099045],"genre_scores_gemma":[0.33559346,0.0000015641475,0.6636626,0.00030865605,0.000049017293,0.00014348573,0.000007987945,0.00001027241,0.00022295098],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99864894,0.000048534388,0.00021123925,0.00034762596,0.00026126447,0.00048240778],"domain_scores_gemma":[0.9984661,0.00031519166,0.00010962484,0.0008325739,0.00009555163,0.0001809901],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025379902,0.00017573668,0.00018733277,0.0001135678,0.0001700977,0.00007203319,0.00086123764,0.00006322399,0.00004990435],"category_scores_gemma":[0.00008806229,0.00013529448,0.000067323395,0.0001969285,0.000050845574,0.00035641517,0.00044949717,0.00009594847,0.00004536052],"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.00007598663,0.0013312126,0.0033524747,0.00017424443,0.000021247555,0.0000040218747,0.0001751164,0.0019186182,0.5820805,0.25948763,0.11804197,0.033337023],"study_design_scores_gemma":[0.0005760665,0.00008353197,0.00061693887,0.000054931694,0.0000029633081,0.0000013889802,0.0000065506947,0.22529234,0.732376,0.00048606822,0.040308513,0.00019471087],"about_ca_topic_score_codex":0.000005461243,"about_ca_topic_score_gemma":2.671543e-7,"teacher_disagreement_score":0.33024037,"about_ca_system_score_codex":0.000049212937,"about_ca_system_score_gemma":0.00004056035,"threshold_uncertainty_score":0.55171484},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0012125635,0.00002412464,0.96659267,0.00029835285,0.00047471828,0.0003096841,0.0000036728975,0.0010469207,0.030037286],"genre_scores_gemma":[0.6329677,9.707124e-7,0.3665459,0.00022319348,0.000062940635,0.000007649888,0.000012872941,0.0000128871125,0.00016587568],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99786663,0.00008484655,0.00055212114,0.00058657926,0.0004989308,0.00041091288],"domain_scores_gemma":[0.9979942,0.00020801133,0.00024761228,0.0011878331,0.00015063742,0.00021174904],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006035451,0.00019865105,0.00019416425,0.00017480517,0.00020832598,0.00015015532,0.00089836435,0.00015530511,0.000034742596],"category_scores_gemma":[0.000048154274,0.00016874203,0.00007015208,0.0005561585,0.000061427745,0.00075043936,0.00022209957,0.00023156713,0.00006980237],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003541631,0.00016114634,0.004819591,0.00004247224,0.00001324353,0.000038861974,0.00005928482,0.0015123729,0.016715484,0.93244666,0.0030410043,0.04111446],"study_design_scores_gemma":[0.00039160292,0.000036846894,0.016254717,0.00012854692,0.000009787755,0.000030298512,0.000097769785,0.95124775,0.019592635,0.00073055434,0.011086315,0.00039317316],"about_ca_topic_score_codex":0.000055362532,"about_ca_topic_score_gemma":0.00003104079,"teacher_disagreement_score":0.9497354,"about_ca_system_score_codex":0.0005064193,"about_ca_system_score_gemma":0.00021567845,"threshold_uncertainty_score":0.68811},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00006663126,0.000040843388,0.99390996,0.003170244,0.00022717289,0.0007650062,0.0002853946,0.0009946565,0.0005401087],"genre_scores_gemma":[0.3092398,0.000048076727,0.6897493,0.00018881098,0.000020586287,0.00047535528,0.00007310969,0.000019702462,0.00018527595],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982336,0.00036598823,0.00047722386,0.00044088968,0.00018350805,0.00029878158],"domain_scores_gemma":[0.9953487,0.0010178147,0.00020053666,0.0031063878,0.0002462504,0.0000803026],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039243192,0.0002222479,0.00023441338,0.00024691515,0.0008658934,0.00014885433,0.0022312296,0.000100124875,0.00003055489],"category_scores_gemma":[0.00002436723,0.0002316142,0.00016255233,0.0006219757,0.0001825071,0.00070364773,0.00002545393,0.00029346737,0.000031273543],"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.000041674906,0.0016375614,0.0000048206684,0.000047619902,0.000049210015,0.0000011039865,0.00020556443,0.0113638565,0.10739473,0.7856089,0.002735806,0.09090917],"study_design_scores_gemma":[0.0008438413,0.00013142257,0.00017056453,0.00008101224,0.000038805985,0.000011928498,0.000023450031,0.61021423,0.29089522,0.082777135,0.014334561,0.00047785987],"about_ca_topic_score_codex":0.00013021461,"about_ca_topic_score_gemma":0.00020661269,"teacher_disagreement_score":0.70283175,"about_ca_system_score_codex":0.00010481237,"about_ca_system_score_gemma":0.00009465216,"threshold_uncertainty_score":0.9444953},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.054161787,0.000049333215,0.9435674,0.00014739794,0.00003198556,0.00018627092,0.000014261841,0.0005140696,0.0013275152],"genre_scores_gemma":[0.364719,0.000048760423,0.63510317,0.000047111076,0.00002513453,0.000008182877,0.000015623558,0.000018586883,0.000014433651],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9984511,0.000059818125,0.00030094883,0.0005391842,0.000287939,0.00036098543],"domain_scores_gemma":[0.99877346,0.000077217424,0.00020607658,0.0007029689,0.00010168198,0.00013860916],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002446066,0.00022049581,0.00028757247,0.00019123653,0.000155184,0.00018994555,0.0006323484,0.000035338126,0.00001767054],"category_scores_gemma":[0.000022721966,0.00019012141,0.000030328529,0.00022652696,0.00015385229,0.0020788047,0.00029290258,0.00013333886,0.0000071882682],"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.000031739793,0.000073307885,0.00049799785,0.000055056735,0.000018020282,0.00018898214,0.0008955888,0.0005349983,0.97293574,0.005377187,0.00014664477,0.01924475],"study_design_scores_gemma":[0.0021166932,0.0002123318,0.0009606805,0.00075244205,0.000036622154,0.00087251386,0.00021459183,0.21737938,0.76183516,0.014433732,0.00019206444,0.0009937949],"about_ca_topic_score_codex":0.00012557635,"about_ca_topic_score_gemma":0.0000036932718,"teacher_disagreement_score":0.31055722,"about_ca_system_score_codex":0.00004639433,"about_ca_system_score_gemma":0.00007531473,"threshold_uncertainty_score":0.77529263},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0005534272,0.000014292883,0.9974312,0.00013819542,0.00015687752,0.00032364766,0.000005371306,0.0006671262,0.0007098705],"genre_scores_gemma":[0.40709388,0.000012344098,0.5921048,0.00016202837,0.000024847292,0.0000748386,0.000005857649,0.00000593347,0.00051548093],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99906206,0.000020227422,0.00017904757,0.00032648948,0.00019681401,0.00021537312],"domain_scores_gemma":[0.9992257,0.00009808006,0.00006967705,0.00047085743,0.00006615433,0.000069544316],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00011077545,0.00010486033,0.00010881077,0.00007843495,0.0002199144,0.000052293846,0.00058278313,0.000045297846,0.000015228711],"category_scores_gemma":[0.00005616425,0.00009047798,0.000040907707,0.00013071629,0.00002956483,0.00097656046,0.00029719397,0.00006896236,0.000011424976],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010157179,0.00076091225,0.02199866,0.00007951068,0.000048391248,0.00005281755,0.0012906112,0.018195804,0.14543484,0.12780853,0.23947327,0.44475508],"study_design_scores_gemma":[0.00056616083,0.000091005095,0.0024369922,0.000027992692,0.0000014788011,0.000027693364,0.000026914573,0.89441675,0.08470698,0.0027818305,0.0146560585,0.00026012782],"about_ca_topic_score_codex":0.000013357132,"about_ca_topic_score_gemma":0.0000047438257,"teacher_disagreement_score":0.87622094,"about_ca_system_score_codex":0.00006876507,"about_ca_system_score_gemma":0.00002330634,"threshold_uncertainty_score":0.3689585},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008369714,0.00069850613,0.9896652,0.000031410993,0.0000660535,0.00014369664,0.000014055256,0.0002842427,0.0007270916],"genre_scores_gemma":[0.7224028,0.00001430019,0.27738494,0.00012945912,0.0000070793258,0.000016224627,5.203274e-7,0.000009186708,0.000035462293],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.998938,0.00005575758,0.00023843732,0.00034637298,0.00021639881,0.00020501067],"domain_scores_gemma":[0.9992618,0.00008850892,0.00017902869,0.00030932203,0.00007359932,0.00008772005],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019234772,0.0001627651,0.00020806059,0.00026772075,0.00016807606,0.00004980733,0.0003927724,0.000069926704,0.000038028193],"category_scores_gemma":[0.000010710765,0.00014333363,0.000048178244,0.0003463306,0.00011345484,0.0006441644,0.000006402364,0.00022308363,0.000003451699],"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.000039703937,0.00012842637,0.00001475633,0.00006281628,0.00001084567,0.000029875737,0.0031286238,0.000027118349,0.013800069,0.00009924457,0.000008951153,0.98264956],"study_design_scores_gemma":[0.0003362218,0.0001912147,0.000058981484,0.00032942055,0.000016700347,0.000023020759,0.00066989835,0.018033572,0.97971743,0.0003904756,0.00003415407,0.00019889486],"about_ca_topic_score_codex":0.00008740797,"about_ca_topic_score_gemma":0.000032001037,"teacher_disagreement_score":0.98245066,"about_ca_system_score_codex":0.000022280488,"about_ca_system_score_gemma":0.00006792507,"threshold_uncertainty_score":0.5844976},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008001082,0.0000045335855,0.98458105,0.0005737731,0.0003642834,0.0001225339,0.0000051026964,0.0012199954,0.005127657],"genre_scores_gemma":[0.1631678,0.0000027438305,0.8343983,0.0010686045,0.00004799011,0.000020909807,0.000006867894,0.000011905527,0.0012748612],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9989627,0.00003442865,0.00016942529,0.00040496822,0.00017078896,0.00025766954],"domain_scores_gemma":[0.99840754,0.00014898495,0.00007445712,0.0011731556,0.00007848981,0.0001173484],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023376281,0.00013191985,0.00011855274,0.000095513795,0.00015230931,0.00014008435,0.0012187033,0.00005929351,0.0003563303],"category_scores_gemma":[0.00008745785,0.00010676101,0.00004342557,0.00022390037,0.00006983975,0.00080082996,0.0007562138,0.00020784613,0.00032562236],"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.0000030586718,0.000027736565,0.00007344366,0.000006761696,0.0000011644939,0.000014274849,0.000013366375,0.000003698779,0.95231956,0.022571312,0.016949046,0.008016587],"study_design_scores_gemma":[0.00015743673,0.00001801074,0.00025367245,0.000014138375,7.803797e-7,0.0000048290117,9.594511e-7,0.039285652,0.9351489,0.0028688894,0.022075795,0.00017092732],"about_ca_topic_score_codex":0.00000810536,"about_ca_topic_score_gemma":0.00001281315,"teacher_disagreement_score":0.15516673,"about_ca_system_score_codex":0.000024118704,"about_ca_system_score_gemma":0.00003808039,"threshold_uncertainty_score":0.43535876},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0007572174,0.000117269956,0.997579,0.00014892861,0.00008801537,0.00035372586,0.0002672169,0.00041853392,0.00027012447],"genre_scores_gemma":[0.129048,0.000006868544,0.8700846,0.00022053011,0.00017364783,0.00012829306,0.00027984803,0.000011174165,0.000047027665],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99869204,0.000054676584,0.00023173541,0.00027354725,0.00038254706,0.00036545098],"domain_scores_gemma":[0.9985298,0.0006560727,0.00009848587,0.00042846543,0.00013149418,0.00015569311],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002760747,0.00011700082,0.00017819468,0.000070200236,0.00020133198,0.000055105695,0.0004520516,0.00006681879,0.000083058425],"category_scores_gemma":[0.00030028768,0.00011184306,0.00002236016,0.00011865424,0.0000428811,0.0010440181,0.00031653128,0.00012937846,0.000034984445],"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.00003108325,0.0012963398,0.00055606413,0.000089505564,0.00003941266,4.584402e-7,0.00004888141,0.000079273006,0.10731461,0.88017094,0.0077013527,0.0026720846],"study_design_scores_gemma":[0.0013997827,0.0003080187,0.007923336,0.00074924855,0.00009549401,0.00001304538,0.000010899362,0.2944609,0.24139814,0.4241443,0.028618762,0.0008780542],"about_ca_topic_score_codex":0.0000034191874,"about_ca_topic_score_gemma":1.3084946e-7,"teacher_disagreement_score":0.4560266,"about_ca_system_score_codex":0.00005609352,"about_ca_system_score_gemma":0.000029855544,"threshold_uncertainty_score":0.45608276},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.001996761,0.0001651667,0.9847726,0.0004219474,0.00006920507,0.00017611223,0.000016676486,0.0007446315,0.011636869],"genre_scores_gemma":[0.33202013,0.00040385252,0.6658197,0.00012389963,0.000050860945,0.000022182756,0.00002094652,0.000035491754,0.0015029028],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987207,0.000067934314,0.0003214519,0.00037376827,0.00026527393,0.00025087633],"domain_scores_gemma":[0.99872166,0.00012084433,0.00022090333,0.0007450831,0.0001265866,0.00006491665],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015215692,0.00014868671,0.00021968248,0.00017644551,0.000086051674,0.00008316349,0.00077939633,0.00002958922,0.00012428747],"category_scores_gemma":[0.000065392334,0.00014237044,0.00005433497,0.00041563401,0.000077942015,0.0011966955,0.0003100966,0.00008474849,0.00012025385],"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.000005703548,0.00014402921,0.0005086276,0.00003614945,0.000009949378,0.00002710675,0.00039214327,0.00028037536,0.7726155,0.0055298116,0.02294813,0.19750246],"study_design_scores_gemma":[0.00023170348,0.000026937858,0.00034139046,0.00009785743,0.000006270313,0.000021412297,0.000013843308,0.58651906,0.40941465,0.0013843996,0.0017243415,0.00021812122],"about_ca_topic_score_codex":0.000033931134,"about_ca_topic_score_gemma":2.8320514e-7,"teacher_disagreement_score":0.5862387,"about_ca_system_score_codex":0.000032781405,"about_ca_system_score_gemma":0.0000121562425,"threshold_uncertainty_score":0.5805698},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0034718956,0.00007276508,0.99325466,0.0015841557,0.0001215898,0.00050654385,0.000006500296,0.0006917318,0.00029016612],"genre_scores_gemma":[0.42241207,0.000034784232,0.5763815,0.0004548797,0.00007419646,0.0001944505,0.000043485703,0.000011971709,0.00039262377],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99890417,0.00006322895,0.00026332348,0.0003589601,0.00014842076,0.00026191352],"domain_scores_gemma":[0.99842435,0.00024534782,0.00014373871,0.00096609833,0.00014097372,0.000079497826],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040866985,0.00014778502,0.00014699397,0.00011549098,0.0001910021,0.00012370342,0.0012576019,0.00007449067,0.000020044448],"category_scores_gemma":[0.000053040203,0.00013816559,0.00004705637,0.00018661667,0.000035773213,0.0018528991,0.00047605537,0.000104621264,0.000026510348],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000553351,0.0003517602,0.000017824346,0.000046350957,0.00003779176,0.0000011526533,0.0027044297,0.03891052,0.048171952,0.13217905,0.03291545,0.7446084],"study_design_scores_gemma":[0.00031041994,0.000033363496,0.000042050866,0.000030380817,0.0000021272022,0.0000015835408,0.000016362166,0.8687783,0.11896094,0.0015849324,0.010069288,0.00017024299],"about_ca_topic_score_codex":0.000014065048,"about_ca_topic_score_gemma":0.000005697993,"teacher_disagreement_score":0.8298678,"about_ca_system_score_codex":0.0000670442,"about_ca_system_score_gemma":0.000023108645,"threshold_uncertainty_score":0.5634229},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06554343,0.0008215077,0.92944044,0.00018834334,0.0007756469,0.00027067045,0.000013890157,0.0010902162,0.0018558395],"genre_scores_gemma":[0.871793,0.00036865726,0.12705831,0.0004350723,0.00013675739,0.00004113771,0.000013624871,0.000016566926,0.00013689366],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982874,0.00005908342,0.0002530407,0.00034817515,0.00045196686,0.0006003817],"domain_scores_gemma":[0.9984236,0.0000680779,0.0001450063,0.0010410668,0.00011525384,0.00020701438],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002915109,0.00023377509,0.0002141955,0.00021057429,0.00035697524,0.00006446029,0.0011838742,0.00014769571,0.000032885153],"category_scores_gemma":[0.0000144665255,0.00019119693,0.000052668605,0.00075023546,0.000108649605,0.0033369218,0.00068928907,0.00042367209,0.000102316255],"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.00007398825,0.0006138153,0.037470523,0.000120361685,0.00004096837,0.000008697235,0.0008167598,0.00030553623,0.005446171,0.7249197,0.048965186,0.1812183],"study_design_scores_gemma":[0.0015271145,0.0007017807,0.20564927,0.0007685005,0.00003413009,0.00015100345,0.000063509426,0.31573287,0.19290976,0.021839092,0.25828847,0.002334505],"about_ca_topic_score_codex":0.000011700967,"about_ca_topic_score_gemma":6.440211e-7,"teacher_disagreement_score":0.80624956,"about_ca_system_score_codex":0.00003298412,"about_ca_system_score_gemma":0.000026596817,"threshold_uncertainty_score":0.77967846},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000011631074,0.000053905253,0.99771726,0.00026706344,0.00015711023,0.0004931814,0.000013358913,0.0010811306,0.00020534538],"genre_scores_gemma":[0.13836169,0.000027612368,0.86095583,0.00027460774,0.00003979708,0.00016514225,0.0000055556975,0.000033804055,0.00013598571],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99832505,0.00011418423,0.00035888783,0.00059532665,0.00025695335,0.000349626],"domain_scores_gemma":[0.9984546,0.00031597368,0.00020147442,0.0005745655,0.0003622139,0.00009120636],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00057853234,0.00021975914,0.00023318215,0.0002621863,0.0006780565,0.0005635589,0.0006597801,0.000076983524,0.000013278531],"category_scores_gemma":[0.000088729816,0.00021661088,0.000066253626,0.00069881213,0.00006251308,0.0032038414,0.000006684905,0.00020038516,0.000020037922],"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.000053951855,0.00014324518,6.7801534e-7,0.00026409884,0.0000102397635,0.000002361572,0.0001948701,0.003941973,0.3449442,0.0010615576,0.0020405243,0.6473423],"study_design_scores_gemma":[0.00026158275,0.00006901905,0.000001209309,0.00021634085,0.000011823589,0.000008431526,0.000007163134,0.51301116,0.48187867,0.0030886314,0.0012538471,0.00019216302],"about_ca_topic_score_codex":0.0000034770003,"about_ca_topic_score_gemma":5.1053627e-7,"teacher_disagreement_score":0.64715016,"about_ca_system_score_codex":0.00006472093,"about_ca_system_score_gemma":0.00007296661,"threshold_uncertainty_score":0.88331354},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0017685408,0.000033702487,0.9970549,0.00006990281,0.00015922957,0.00044011508,0.000010003339,0.00031060152,0.00015305131],"genre_scores_gemma":[0.085950606,0.0000138258365,0.91326445,0.00008040117,0.000044515018,0.000038130056,0.0000435883,0.000011607492,0.0005528875],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9987976,0.000028127983,0.00036882266,0.00035716526,0.00021414793,0.00023413505],"domain_scores_gemma":[0.9990248,0.00011474672,0.00017051873,0.00044944178,0.00014771531,0.000092785194],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005396064,0.00013596803,0.00016585676,0.0001449826,0.00006781211,0.000037298978,0.00047448388,0.00008188698,0.000015286001],"category_scores_gemma":[0.000021275366,0.0001137103,0.00007394535,0.00027247937,0.000030813317,0.001160612,0.00008787382,0.00006295647,0.0000016574852],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000024826444,0.000101450394,0.0000031375282,0.00001620878,0.0000056994572,0.0000012223137,0.00016706718,0.00017776726,0.06263449,0.0075703436,0.0005116571,0.92878616],"study_design_scores_gemma":[0.00035549043,0.0001823318,0.00014258912,0.000039043953,0.0000041221765,0.0000022652537,0.000013030219,0.3393613,0.65427756,0.0025142683,0.0029692191,0.00013875832],"about_ca_topic_score_codex":0.000015371706,"about_ca_topic_score_gemma":0.0000011098238,"teacher_disagreement_score":0.9286474,"about_ca_system_score_codex":0.000038717193,"about_ca_system_score_gemma":0.000028972176,"threshold_uncertainty_score":0.46369714},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011166726,0.006314889,0.9790827,0.0023429298,0.0000804424,0.0006988875,0.000028594808,0.0002736268,0.000011197081],"genre_scores_gemma":[0.7732522,0.000028284703,0.22612268,0.00018625922,0.00028822818,0.0000633364,0.0000027987026,0.00002890807,0.000027289409],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99774045,0.0001535392,0.0008739789,0.00037567518,0.00037097686,0.0004853728],"domain_scores_gemma":[0.997147,0.00044691793,0.001016381,0.000446876,0.000798545,0.00014423383],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001853788,0.0003044818,0.0005268974,0.00061613665,0.0005096262,0.0002744497,0.0017952675,0.00021771275,0.0000019675954],"category_scores_gemma":[0.000105100975,0.0001946539,0.000121953904,0.0005069722,0.00031840548,0.00082682597,0.00020564326,0.0004920116,9.597749e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00039130868,0.000246828,0.000020555475,0.00027908388,0.00006550742,0.000015069129,0.00054161565,0.005675417,0.44084963,0.0035506347,0.0016004061,0.54676396],"study_design_scores_gemma":[0.0022375942,0.003572087,0.000018965244,0.0010331229,0.00015902742,0.003531943,0.00051798485,0.71652275,0.22138412,0.031928286,0.018403763,0.00069034443],"about_ca_topic_score_codex":0.0000028809231,"about_ca_topic_score_gemma":0.0000013560209,"teacher_disagreement_score":0.7620855,"about_ca_system_score_codex":0.00005268728,"about_ca_system_score_gemma":0.0001757674,"threshold_uncertainty_score":0.79377556},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003203992,0.00016453398,0.9945079,0.000050563496,0.00018239055,0.0006904611,0.000029293775,0.0005194311,0.0006514409],"genre_scores_gemma":[0.20524219,0.00003845022,0.7941617,0.00018429782,0.000022571929,0.00019760926,0.000003973824,0.000026093634,0.00012313902],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9985032,0.00009654823,0.0002540011,0.0005758223,0.00018776025,0.00038265527],"domain_scores_gemma":[0.9985451,0.00017434378,0.0001293824,0.00088093354,0.00012301728,0.00014721495],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027849525,0.00022078298,0.00025763572,0.00010832168,0.00016249526,0.0001175826,0.0011289042,0.0000837402,0.00003274277],"category_scores_gemma":[0.000041198866,0.00019749066,0.000047627527,0.000159115,0.00013460036,0.0009857089,0.00043084737,0.00012075943,0.000023973183],"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.00016233335,0.0005179066,0.00008083195,0.00020116848,0.000057561672,0.00010194359,0.002640349,0.0000105127765,0.814108,0.07429448,0.042030968,0.06579393],"study_design_scores_gemma":[0.0006554067,0.0002168964,0.0001657829,0.000072925635,0.000007125613,0.000015841126,0.000018889454,0.017945735,0.9608002,0.017398736,0.0023555234,0.00034695864],"about_ca_topic_score_codex":0.00001531775,"about_ca_topic_score_gemma":5.5879536e-7,"teacher_disagreement_score":0.2020382,"about_ca_system_score_codex":0.000021328111,"about_ca_system_score_gemma":0.00003935351,"threshold_uncertainty_score":0.8053435},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002876564,0.00007797633,0.9905961,0.00032303194,0.00013083071,0.00054718147,0.000017561379,0.0010370511,0.004393714],"genre_scores_gemma":[0.5263557,0.0000028339748,0.4733239,0.00019692727,0.000010359431,0.000045986486,0.000011956494,0.0000062089753,0.000046090892],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981639,0.00013925524,0.0005486805,0.0005040606,0.00036063968,0.00028346508],"domain_scores_gemma":[0.99717605,0.00030926708,0.00023725547,0.0017451325,0.00038845467,0.00014385191],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001546493,0.00019285358,0.00032176086,0.00023177534,0.00014434668,0.00015207703,0.0018761504,0.00007992011,0.0003887439],"category_scores_gemma":[0.000035341676,0.00016316048,0.000108102846,0.00080828293,0.00017046349,0.001368771,0.00083221484,0.00015569206,0.00005760839],"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.000013222987,0.0015277837,0.0055207885,0.00011422295,0.00011323586,0.0000032760822,0.0005918259,0.0010325294,0.10795907,0.69695544,0.06404264,0.12212597],"study_design_scores_gemma":[0.00079926406,0.00015206005,0.10357821,0.00008782635,0.000010502149,0.000007882902,0.000015965688,0.58913916,0.15673342,0.13923466,0.009629792,0.0006112746],"about_ca_topic_score_codex":0.00030693295,"about_ca_topic_score_gemma":0.0000034298414,"teacher_disagreement_score":0.58810663,"about_ca_system_score_codex":0.000016988271,"about_ca_system_score_gemma":0.00004794509,"threshold_uncertainty_score":0.6653491},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0021842953,0.00028876512,0.995329,0.00019114977,0.0001415177,0.00026275983,0.000015782121,0.00026252147,0.0013241571],"genre_scores_gemma":[0.019901443,0.000043472508,0.9796473,0.00013240539,0.00012284139,0.000018416631,0.0000062212534,0.00004113423,0.00008676826],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99772775,0.000106196676,0.00082079455,0.00038196344,0.00050907617,0.00045421792],"domain_scores_gemma":[0.9966641,0.00017227876,0.0013259928,0.00058314815,0.0010166162,0.00023784616],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00076596974,0.00028140598,0.0004927146,0.0003507517,0.00027244686,0.0003000569,0.0016962107,0.00009282538,0.000072667586],"category_scores_gemma":[0.00025948952,0.00022605713,0.00018822271,0.0003454265,0.0001344133,0.0037621667,0.00025567252,0.0003016125,0.000013545819],"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.00013100066,0.0001874321,0.000026474283,0.00014676007,0.000010689957,0.00006801731,0.00026894454,0.0000057339544,0.94793266,0.00009500039,0.0067761214,0.044351183],"study_design_scores_gemma":[0.0011793871,0.000325466,0.00014154556,0.0006879469,0.000027043505,0.00011910944,0.00002245478,0.031966385,0.9561564,0.007441442,0.0016351009,0.00029775559],"about_ca_topic_score_codex":0.000010368767,"about_ca_topic_score_gemma":2.1209193e-7,"teacher_disagreement_score":0.044053424,"about_ca_system_score_codex":0.00008221685,"about_ca_system_score_gemma":0.0003390805,"threshold_uncertainty_score":0.92183423},"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":"empirical","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9648732,0.0000825273,0.026392316,0.004355197,0.000125103,0.0005816173,0.00002591977,0.0004101274,0.0031539688],"genre_scores_gemma":[0.10032943,0.000059010512,0.89900964,0.00023644349,0.00016365743,0.00007221648,0.0000057280845,0.00003166365,0.00009222005],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9975984,1.2568818e-8,0.0005811079,0.0005333812,0.0008723234,0.00041476687],"domain_scores_gemma":[0.99759024,0.00011451397,0.00044497868,0.00014822379,0.0015570845,0.00014494313],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040631037,0.00033769663,0.000402759,0.00011886771,0.000110889894,0.00020659514,0.0025598127,0.00014391623,0.000005688167],"category_scores_gemma":[0.00023611898,0.00024451702,0.00034656675,0.00044368452,0.0001903236,0.0018043794,0.00038375225,0.00035789053,0.0000016233156],"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.00004915311,0.00010637943,0.000040742558,0.00008865648,0.00006181342,1.8430516e-7,0.000077820165,0.000026654017,0.55746406,0.43349627,0.0070683304,0.001519934],"study_design_scores_gemma":[0.0018120573,0.0013097984,0.0017747423,0.0010691541,0.00008747987,0.00006644172,0.00036212397,0.124414034,0.8351263,0.018609188,0.0145019,0.0008668247],"about_ca_topic_score_codex":0.0000028889906,"about_ca_topic_score_gemma":2.3733302e-8,"teacher_disagreement_score":0.8726173,"about_ca_system_score_codex":0.00010291424,"about_ca_system_score_gemma":0.000030604846,"threshold_uncertainty_score":0.9971115},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0007237371,0.000025529966,0.99202174,0.0003340215,0.00012543137,0.00043256086,0.00000731566,0.0019064399,0.0044232463],"genre_scores_gemma":[0.03560849,0.000010081738,0.9629357,0.0005673212,0.00010981677,0.0001920792,0.000011285196,0.000017735378,0.0005475173],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99851054,0.000097907745,0.00028515473,0.00052117446,0.00028164987,0.00030359635],"domain_scores_gemma":[0.9980625,0.0005352573,0.00015117221,0.0010050946,0.00017421907,0.000071762835],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010604438,0.0001683456,0.00020169484,0.00011441829,0.00017215342,0.00014382893,0.0009972391,0.000082672326,0.000018242163],"category_scores_gemma":[0.00061462045,0.00014199178,0.00007579741,0.00018778688,0.000023969598,0.0010026984,0.0004510844,0.00011596282,0.000009574593],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000053048525,0.0000192722,0.000030058562,0.000016540285,0.000004660527,3.1362538e-7,0.000023454377,0.000017539065,0.02054244,0.028814845,0.010087693,0.94043785],"study_design_scores_gemma":[0.00026354325,0.00067981466,0.00012523099,0.00015523125,0.000007359182,0.000009882605,0.000011299108,0.16039683,0.59097075,0.19434243,0.05256354,0.0004740736],"about_ca_topic_score_codex":0.000008212447,"about_ca_topic_score_gemma":0.000004076465,"teacher_disagreement_score":0.9399638,"about_ca_system_score_codex":0.000045845325,"about_ca_system_score_gemma":0.0000382632,"threshold_uncertainty_score":0.5790257},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0012565986,0.00001608129,0.9947388,0.000248965,0.00023483302,0.00047744415,0.00007966286,0.0023575046,0.00059008814],"genre_scores_gemma":[0.58941674,6.2432974e-7,0.41006675,0.00034214614,0.00001761583,0.00009475671,0.0000123192285,0.000040619005,0.000008405521],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99651825,0.00031706973,0.0005831726,0.0011321297,0.0008765257,0.0005728483],"domain_scores_gemma":[0.9974742,0.00016828589,0.00026275992,0.001507858,0.00024949055,0.0003374245],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00043476446,0.0005096305,0.00045074656,0.00051733915,0.0009778946,0.00056376716,0.0014096615,0.00014635189,0.000008863059],"category_scores_gemma":[0.0000051357215,0.00046413628,0.00016243216,0.00055384333,0.00015231266,0.0011344219,0.0000064845613,0.00056793366,0.000034024277],"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.0001258973,0.00073752523,8.556909e-7,0.0002350964,0.0000035021917,0.000008971471,0.00012138247,0.8062146,0.13890119,0.000078158744,0.00002789114,0.053544946],"study_design_scores_gemma":[0.0006830062,0.00017825958,0.000006676659,0.00077162706,0.000016582628,0.0000037779012,0.000012119574,0.6230258,0.37490317,0.00003899857,0.00003303823,0.0003270016],"about_ca_topic_score_codex":0.000009797104,"about_ca_topic_score_gemma":0.000002791318,"teacher_disagreement_score":0.58816016,"about_ca_system_score_codex":0.0002333819,"about_ca_system_score_gemma":0.00015001747,"threshold_uncertainty_score":0.999781},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00018684151,0.000021779915,0.99359393,0.0020008308,0.00046923434,0.00020821003,0.000025016454,0.0010516964,0.0024424468],"genre_scores_gemma":[0.55719626,0.00011807385,0.4422786,0.00012153539,0.000009833157,0.000104757724,0.0000044600083,0.000009371157,0.00015711637],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99898535,0.000094416246,0.00024514765,0.0002862024,0.0001871252,0.0002017485],"domain_scores_gemma":[0.9951652,0.00033954016,0.000087173816,0.004195638,0.000112227106,0.00010016469],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019705767,0.0001346491,0.000111503934,0.0002035383,0.00081615616,0.000102452694,0.002896268,0.00009480392,0.000042887616],"category_scores_gemma":[0.00001738899,0.00013905924,0.00007454326,0.00044719802,0.0001509749,0.00080835907,0.000032681164,0.0008023594,0.00011733652],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014333765,0.0013986591,0.00001536182,0.000012841977,0.000042885,0.0000028518878,0.0006680467,0.0070647295,0.20445985,0.21929713,0.003288377,0.56373495],"study_design_scores_gemma":[0.0005068876,0.00008566668,0.00023180153,0.00006812887,0.000018614195,0.000044930868,0.000038149687,0.7420004,0.18663536,0.0070263227,0.06279151,0.0005522531],"about_ca_topic_score_codex":0.000038207214,"about_ca_topic_score_gemma":0.00018498563,"teacher_disagreement_score":0.73493564,"about_ca_system_score_codex":0.000040278665,"about_ca_system_score_gemma":0.000045961548,"threshold_uncertainty_score":0.6277296},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0014109822,0.000022701512,0.996083,0.00029212676,0.00012724906,0.00025270635,0.000009603409,0.0013671804,0.00043444548],"genre_scores_gemma":[0.644635,0.000010341002,0.3551065,0.00015467605,0.000018462177,0.000024264218,0.0000040507807,0.000009195185,0.000037521382],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99867713,0.00004646157,0.00024993872,0.00045012397,0.0003374101,0.00023894242],"domain_scores_gemma":[0.9991688,0.000042697808,0.00013651185,0.0003955822,0.00017756992,0.000078848396],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013889885,0.00018434644,0.00014254628,0.000240053,0.0005126116,0.00035467857,0.00034898764,0.00006203943,0.000008987421],"category_scores_gemma":[0.000007194775,0.00016484251,0.000036731075,0.00050297944,0.000049351165,0.003925525,0.000002131766,0.00027053966,0.000012378748],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006977562,0.0002214502,0.000014799934,0.000026262864,0.000005486102,0.000008093783,0.00038327495,0.003930338,0.17116725,0.0001604991,0.00010632789,0.8239064],"study_design_scores_gemma":[0.00066880265,0.00034369767,0.0008577025,0.0002683225,0.000015870217,0.000063101426,0.000048519043,0.49347776,0.5022716,0.0014930121,0.00020239224,0.00028922004],"about_ca_topic_score_codex":0.000005391855,"about_ca_topic_score_gemma":0.0000047371245,"teacher_disagreement_score":0.8236172,"about_ca_system_score_codex":0.00011287867,"about_ca_system_score_gemma":0.00005071082,"threshold_uncertainty_score":0.67220825},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006589805,0.000016919914,0.99108267,0.00010022803,0.00036453438,0.00039865414,0.000012502068,0.0010005547,0.00043413445],"genre_scores_gemma":[0.42725343,0.0000041043086,0.5721998,0.00020492978,0.00003216831,0.00009557798,0.000006369713,0.0000065449776,0.00019707222],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.998747,0.00004975373,0.00030085264,0.00045280295,0.00017288026,0.000276713],"domain_scores_gemma":[0.9987258,0.00014449483,0.00013356005,0.0007663731,0.00014054902,0.00008926124],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004281239,0.00013642022,0.00017610853,0.00008631997,0.00013597157,0.000082400285,0.00087042537,0.000067805246,0.0000498147],"category_scores_gemma":[0.00022733564,0.0001187207,0.0000618837,0.00016534029,0.000034268618,0.0015484768,0.00044338987,0.00008184206,0.000025572625],"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.000061448365,0.00018746644,0.0010148739,0.000055511817,0.000015193073,0.0000029664018,0.00060546194,0.0000058414103,0.09321653,0.86535907,0.008408774,0.031066883],"study_design_scores_gemma":[0.0007417776,0.00014490307,0.0018154241,0.0000612678,0.0000030940444,0.000004872428,0.000040591287,0.050430737,0.80523574,0.13472821,0.006362199,0.0004311579],"about_ca_topic_score_codex":0.0001944929,"about_ca_topic_score_gemma":0.000011880509,"teacher_disagreement_score":0.7306308,"about_ca_system_score_codex":0.000040771327,"about_ca_system_score_gemma":0.000018404875,"threshold_uncertainty_score":0.48412895},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0023577826,0.000046771227,0.99490213,0.000011068107,0.000008762841,0.000044170698,0.0000030175588,0.00022068735,0.0024056016],"genre_scores_gemma":[0.35225192,0.000041663705,0.6475082,0.000040458206,0.0000013125521,0.0000038085545,0.000004519067,0.0000016477416,0.00014646549],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.9994253,0.000023515737,0.00014955513,0.00021345347,0.00010970575,0.00007847034],"domain_scores_gemma":[0.99927723,0.000028982302,0.000079697114,0.0005012491,0.00007470136,0.000038163475],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000069174144,0.000059142545,0.0001194165,0.00015226332,0.000026303887,0.000012388925,0.00041235954,0.00003109174,0.00010568349],"category_scores_gemma":[0.000028635226,0.000047321995,0.000020235062,0.0005086425,0.000030213718,0.00046128692,0.00026812556,0.00003396466,0.0000032414316],"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.000023978666,0.00020729963,0.14058127,0.00004416372,0.00019650928,0.000008281055,0.0022322594,0.00007329131,0.0025313946,0.28175947,0.0011974864,0.5711446],"study_design_scores_gemma":[0.00054897176,0.0003927989,0.44886515,0.00007403911,0.000203152,0.000011327936,0.000070212096,0.06502888,0.31763744,0.16030383,0.0059008687,0.0009633364],"about_ca_topic_score_codex":0.00009117746,"about_ca_topic_score_gemma":0.00001894619,"teacher_disagreement_score":0.57018125,"about_ca_system_score_codex":0.0000061069504,"about_ca_system_score_gemma":0.00001596414,"threshold_uncertainty_score":0.1929735},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000011886278,0.00017450814,0.98204774,0.0004904988,0.000053674816,0.00008181119,0.0000033087688,0.0009036714,0.01623293],"genre_scores_gemma":[0.010487223,0.00008924834,0.98471326,0.00095159985,0.000015196239,0.000014386072,0.000008195451,0.0000074641944,0.0037134367],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99931556,0.000022032662,0.00012921428,0.00024453958,0.00014396313,0.00014471973],"domain_scores_gemma":[0.9993471,0.000033976412,0.00004458946,0.00047829427,0.000039033843,0.000057007244],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000052432933,0.0000762625,0.000070717615,0.000044665416,0.00007947778,0.000077852,0.0005800585,0.000033910164,0.000316488],"category_scores_gemma":[0.000018353323,0.00006689502,0.000016737948,0.00014623368,0.000015864882,0.0007757631,0.0002101863,0.000057606314,0.00005501469],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000011472082,0.00006896251,0.000034436925,0.0000058033093,0.000005147323,0.0000073969395,0.00015954264,0.019882973,0.003414552,0.031071283,0.82852525,0.116823524],"study_design_scores_gemma":[0.00006848757,0.000015992906,9.011934e-7,0.00000660737,5.3215217e-7,0.000004092871,0.0000019132851,0.92940754,0.024749177,0.00077524077,0.044866543,0.00010295812],"about_ca_topic_score_codex":0.0000068667346,"about_ca_topic_score_gemma":3.34544e-7,"teacher_disagreement_score":0.90952456,"about_ca_system_score_codex":0.000018474222,"about_ca_system_score_gemma":0.00000296098,"threshold_uncertainty_score":0.34653217},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0002623649,0.00007373194,0.9949436,0.0013324384,0.00033826267,0.0006067632,0.000010595096,0.0014721971,0.00096000877],"genre_scores_gemma":[0.21732506,0.000023575261,0.7808236,0.00070724986,0.00012401109,0.00016987315,0.000009777424,0.0000180936,0.00079874165],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99840957,0.000033536588,0.00032317432,0.0005707716,0.00021458165,0.00044839454],"domain_scores_gemma":[0.9983813,0.00045939226,0.00012099321,0.00079505006,0.000105845415,0.00013739134],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029080224,0.0002089168,0.00025928268,0.00017053379,0.00018804337,0.00013460101,0.0013097614,0.00008218247,0.000033832937],"category_scores_gemma":[0.00019406392,0.00017875162,0.000118838,0.00022230424,0.00003370362,0.0013920373,0.0004777719,0.000099324745,0.000041727857],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00033190427,0.0006005813,0.000043358235,0.00009711167,0.00011720097,0.000017912686,0.0019489629,0.13723744,0.06075912,0.31452993,0.15775532,0.32656115],"study_design_scores_gemma":[0.0011662917,0.000056970537,0.000003682628,0.000027472728,0.000002915245,0.0000067875376,0.000019310984,0.7865325,0.17087379,0.0054971785,0.035517305,0.00029575406],"about_ca_topic_score_codex":0.000008480181,"about_ca_topic_score_gemma":0.0000018612445,"teacher_disagreement_score":0.6492951,"about_ca_system_score_codex":0.000049389135,"about_ca_system_score_gemma":0.000023795496,"threshold_uncertainty_score":0.72892797},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0014303162,0.000034401877,0.99001825,0.0015755455,0.00014451207,0.00021342575,0.000011362486,0.0021387336,0.004433443],"genre_scores_gemma":[0.20956308,0.000008736437,0.78867733,0.0015481487,0.00005131452,0.000013961581,0.000026102502,0.000008087808,0.00010322718],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9983587,0.00006449408,0.00030907837,0.0005474517,0.00039877923,0.0003214909],"domain_scores_gemma":[0.9983835,0.000064130254,0.000109601766,0.0011715264,0.0001236468,0.00014754695],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017587704,0.00020036567,0.0001908644,0.00016525462,0.00015933646,0.00016012724,0.0012096239,0.000094593546,0.00008398583],"category_scores_gemma":[0.000045294102,0.00016536246,0.000061126084,0.00038727644,0.000053179192,0.001337164,0.00024703253,0.00023023377,0.000066070206],"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.000032322496,0.0003552339,0.00006088457,0.000015922657,0.0000052429386,0.000045592886,0.000050180195,0.000029522282,0.45383734,0.05579231,0.053686835,0.43608862],"study_design_scores_gemma":[0.00064792787,0.00020969982,0.0021420666,0.000115942756,0.0000026533494,0.00001511798,0.0000060712987,0.41115502,0.55597407,0.017127478,0.012263426,0.00034055035],"about_ca_topic_score_codex":0.0000059756026,"about_ca_topic_score_gemma":4.74005e-7,"teacher_disagreement_score":0.43574807,"about_ca_system_score_codex":0.000056563542,"about_ca_system_score_gemma":0.000044978602,"threshold_uncertainty_score":0.67432857},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00014455938,0.00005599334,0.98941463,0.0002535859,0.00006809308,0.00012563381,0.000010045082,0.0006272012,0.009300261],"genre_scores_gemma":[0.092508934,0.000028103412,0.9061625,0.00034953534,0.00001485746,0.000016731383,0.000008573206,0.000006489354,0.0009042828],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99920136,0.000033064127,0.00013681506,0.0002877957,0.0001851841,0.00015578128],"domain_scores_gemma":[0.9994099,0.000043047516,0.000067000816,0.00038693403,0.000037010555,0.00005611689],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00004356952,0.00009992695,0.00008602689,0.000052601164,0.00008289164,0.00008451804,0.00053814804,0.000031078667,0.00027190585],"category_scores_gemma":[0.000014331158,0.00008460613,0.00002324094,0.00017995745,0.000027619011,0.0012325617,0.0002094701,0.000076334465,0.00005976212],"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.0000028304282,0.000034339893,0.000016843998,0.0000030413812,0.0000062272666,0.000007042288,0.0002581939,0.0000030732785,0.38704506,0.016760292,0.24562792,0.35023513],"study_design_scores_gemma":[0.000291575,0.00007281842,0.000069621376,0.000012018772,0.0000022395955,0.000009863089,0.000043810713,0.24719083,0.7393161,0.0067828787,0.005968833,0.00023938894],"about_ca_topic_score_codex":0.0000070756946,"about_ca_topic_score_gemma":0.0000019124025,"teacher_disagreement_score":0.35227108,"about_ca_system_score_codex":0.00003734274,"about_ca_system_score_gemma":0.0000028129577,"threshold_uncertainty_score":0.3450138},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0013173736,0.000023992183,0.98591554,0.0002583238,0.000053898573,0.0002557839,0.0000056947792,0.0010769325,0.0110924365],"genre_scores_gemma":[0.32712945,0.000004585519,0.6714182,0.001257814,0.0000063270622,0.000029107674,0.000005870926,0.0000137962925,0.0001348541],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985343,0.00007675843,0.00019956478,0.00052227976,0.00032323005,0.00034382896],"domain_scores_gemma":[0.9985302,0.00022601543,0.00008393898,0.0009567602,0.00006523117,0.00013782774],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001730699,0.00019710163,0.00017757097,0.00011697915,0.00014220196,0.00010623274,0.0008686771,0.000055256955,0.00011910745],"category_scores_gemma":[0.00008380906,0.00014977624,0.000039319908,0.000360707,0.00006108732,0.00086411374,0.00014977639,0.00018095254,0.00002878915],"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.00013874653,0.0008130879,0.010751781,0.000098439945,0.000078090285,0.00043239072,0.0003489273,0.0014309502,0.048503242,0.7212206,0.049199816,0.16698392],"study_design_scores_gemma":[0.0010792362,0.00016735953,0.00041387868,0.00007204008,0.0000042774313,0.000032146218,0.000027684211,0.5893526,0.37102196,0.0046956833,0.032593783,0.0005393645],"about_ca_topic_score_codex":0.0000122487845,"about_ca_topic_score_gemma":0.00001129861,"teacher_disagreement_score":0.71652496,"about_ca_system_score_codex":0.000033659242,"about_ca_system_score_gemma":0.00008986806,"threshold_uncertainty_score":0.6107698},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00028989904,0.000048348917,0.97116154,0.001596641,0.00007077351,0.00010658743,7.853513e-7,0.0011882253,0.025537169],"genre_scores_gemma":[0.4361165,0.000041892974,0.55853885,0.0045172083,0.000025753603,0.000009467933,0.0000040641366,0.0000053025087,0.0007409624],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99913174,0.000014144055,0.00016613216,0.00028996586,0.0001815554,0.00021645731],"domain_scores_gemma":[0.9991998,0.000022460667,0.000026702477,0.0006356374,0.0000269805,0.000088427456],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00009951327,0.00010834436,0.00010905619,0.000089329995,0.000057726615,0.0000752784,0.0010334238,0.000045524634,0.000075575794],"category_scores_gemma":[0.000011331803,0.000076991695,0.00004293798,0.00028386962,0.000018976454,0.0014034436,0.00010226093,0.00012131388,0.00008573021],"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.0000032100188,0.00006257869,0.000015018197,0.0000018784441,0.0000016321767,0.0000062397185,0.00007767506,0.0000026783807,0.010932997,0.525656,0.015564312,0.4476758],"study_design_scores_gemma":[0.00034844794,0.0004074568,0.0007480858,0.000044251872,0.0000020727177,0.000024682457,0.000013142663,0.020279165,0.27959284,0.55038214,0.14771985,0.00043788797],"about_ca_topic_score_codex":0.0000076157753,"about_ca_topic_score_gemma":0.0000030029626,"teacher_disagreement_score":0.4472379,"about_ca_system_score_codex":0.000021019772,"about_ca_system_score_gemma":0.000012621524,"threshold_uncertainty_score":0.313963},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010044595,0.000022386379,0.9882825,0.00006749949,0.00004774899,0.001207635,0.0000015017899,0.00020765977,0.00011847448],"genre_scores_gemma":[0.48850846,0.00000407658,0.5113443,0.0000527252,0.000005174963,0.0000685721,9.587795e-7,0.000004685738,0.000011018138],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99901307,0.000053746542,0.00027693756,0.000309272,0.00015065739,0.00019633865],"domain_scores_gemma":[0.99902904,0.00020090287,0.00009056366,0.0005782717,0.00006052219,0.000040723975],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028347305,0.000106899795,0.000205813,0.000110082256,0.00003532038,0.000027858043,0.0008287316,0.000038323196,0.0000030347082],"category_scores_gemma":[0.00003933987,0.00008986572,0.000025219286,0.00031663457,0.000026649699,0.00036502953,0.0002609199,0.00007695714,9.968431e-7],"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.00051201554,0.0097504845,0.004368289,0.00009135466,0.000096732714,0.00017501466,0.0047273347,0.59194934,0.006632319,0.10949549,0.014416677,0.25778496],"study_design_scores_gemma":[0.015296214,0.0060549146,0.0037560964,0.00033355594,0.000020149515,0.000033618184,0.0016815662,0.4697881,0.27386454,0.22713733,0.0007872651,0.0012466626],"about_ca_topic_score_codex":0.000066756096,"about_ca_topic_score_gemma":0.000070105525,"teacher_disagreement_score":0.47846386,"about_ca_system_score_codex":0.000033742785,"about_ca_system_score_gemma":0.000036525955,"threshold_uncertainty_score":0.36646178},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19157246,0.0005667942,0.80728775,0.000064629436,0.000048162943,0.0001593665,0.000008338033,0.00022886862,0.000063609536],"genre_scores_gemma":[0.5506613,0.000008904573,0.4492318,0.000049809474,0.000011573884,0.0000045762945,0.000002207348,0.000011656213,0.000018146922],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99875355,0.000041914587,0.00029898167,0.00041199574,0.0002535559,0.00024001318],"domain_scores_gemma":[0.99925256,0.000094383766,0.00020200278,0.00029702368,0.00008579779,0.00006821745],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019652025,0.000188299,0.00022831155,0.0002722177,0.00023791447,0.0001995072,0.00020415535,0.00009738403,0.0000073446467],"category_scores_gemma":[0.000009731503,0.00018318124,0.00003955844,0.0004744464,0.000107431304,0.00079015136,0.000008011112,0.00019335977,7.68729e-7],"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.00006135501,0.00017436582,0.000078969155,0.00024739894,0.000010155339,0.0000245328,0.00035022545,0.0020414372,0.54521435,0.00012969335,0.000007708657,0.45165977],"study_design_scores_gemma":[0.00050850504,0.00006160892,0.00001706388,0.00033926938,0.000016986785,0.000035638575,0.00006585391,0.21080543,0.78764427,0.00029076677,0.000027082859,0.00018749932],"about_ca_topic_score_codex":0.00015181361,"about_ca_topic_score_gemma":0.000030680338,"teacher_disagreement_score":0.45147228,"about_ca_system_score_codex":0.00004369709,"about_ca_system_score_gemma":0.000054057957,"threshold_uncertainty_score":0.74699146},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0011578385,0.00022714125,0.99596536,0.0010225059,0.00014911746,0.00079610763,0.00004957598,0.00047292872,0.00015945188],"genre_scores_gemma":[0.9374932,0.00024664903,0.061169352,0.0002937773,0.000028488184,0.00010652154,0.0000076423985,0.000026231664,0.0006281092],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982976,0.000059594306,0.0003984619,0.0004943597,0.00039797925,0.00035202457],"domain_scores_gemma":[0.99753386,0.0010958934,0.00022314514,0.0008927259,0.00014689332,0.000107493994],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030429068,0.00022834116,0.00028608163,0.00013422618,0.00026911008,0.00015152164,0.002177228,0.00008322149,0.00007364879],"category_scores_gemma":[0.00014922245,0.00014473643,0.00013576551,0.00031838135,0.000087428765,0.0012246842,0.000805695,0.00015109064,0.00000347842],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00038194514,0.0018062431,0.0005346078,0.0005499243,0.00014876014,0.0000126607665,0.0075744013,0.018235201,0.14728211,0.009782943,0.1556957,0.6579955],"study_design_scores_gemma":[0.00091166934,0.00013442594,0.00047469794,0.00012532786,0.000007662296,0.0000015598414,0.000034210272,0.84410065,0.14459571,0.003523926,0.005887232,0.00020291124],"about_ca_topic_score_codex":0.00003514638,"about_ca_topic_score_gemma":0.0000034308875,"teacher_disagreement_score":0.9363354,"about_ca_system_score_codex":0.000022085103,"about_ca_system_score_gemma":0.000009033231,"threshold_uncertainty_score":0.59021807},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.001538558,0.00007621915,0.9963074,0.00033726005,0.000113906164,0.00015382588,0.0000023672635,0.0010573189,0.0004131867],"genre_scores_gemma":[0.2023924,0.000027151042,0.79569745,0.00014484787,0.000013838968,0.000021337744,0.000011969459,0.000005923447,0.0016850589],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990784,0.000041805233,0.0001818078,0.00032454985,0.00019657201,0.00017684522],"domain_scores_gemma":[0.9991895,0.000041034968,0.00008298961,0.000568939,0.0000585173,0.000059042883],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00009218158,0.00010647582,0.000083961364,0.00010248953,0.00015173593,0.000071593946,0.0004496775,0.00005559782,0.00017393094],"category_scores_gemma":[0.00006249291,0.000091944334,0.000028728535,0.00024422555,0.000026566504,0.0013660201,0.0003413117,0.00006547167,0.0005325098],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007438381,0.00060075393,0.0007827616,0.00004733067,0.000011960803,0.000015411924,0.00054383837,0.023285238,0.094857775,0.029402524,0.07653996,0.773905],"study_design_scores_gemma":[0.00013494116,0.000020270121,0.00093403534,0.000016784947,8.8323077e-7,0.0000069637244,0.0000014720883,0.93484783,0.061944373,0.0007766849,0.0012043259,0.00011140895],"about_ca_topic_score_codex":0.0000122667625,"about_ca_topic_score_gemma":0.000004878801,"teacher_disagreement_score":0.9115626,"about_ca_system_score_codex":0.00009023142,"about_ca_system_score_gemma":0.000002777191,"threshold_uncertainty_score":0.6844514},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.96760106,0.00006982653,0.03017801,0.0006231797,0.00031117527,0.00063052616,0.00006725086,0.00010020829,0.00041877697],"genre_scores_gemma":[0.39187756,0.00009813434,0.6077634,0.00006165629,0.00007637702,0.00004191366,0.0000065937415,0.000026467582,0.00004787197],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9970544,5.7055214e-8,0.0008902207,0.00064032525,0.0010449566,0.00037004336],"domain_scores_gemma":[0.997262,0.00018271343,0.0006693084,0.00028562313,0.0014666122,0.0001337651],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00051291665,0.00030157762,0.00052166625,0.00020768568,0.000090764406,0.000038806233,0.0032091127,0.000121850506,0.000004313169],"category_scores_gemma":[0.0006131381,0.00026151174,0.00030428445,0.0006438299,0.00027860308,0.0010832108,0.00090931845,0.00025790467,7.332017e-7],"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.00014367832,0.00022003612,0.0001850265,0.0002166509,0.00012874819,1.6055903e-7,0.00039087379,0.001018312,0.9033386,0.09157092,0.0020204736,0.0007664943],"study_design_scores_gemma":[0.00042491095,0.00052184827,0.00043695464,0.0005352529,0.000036353755,0.000013320126,0.00032714588,0.17816092,0.81787145,0.00050476,0.00091618707,0.00025088512],"about_ca_topic_score_codex":0.000027692693,"about_ca_topic_score_gemma":1.9469485e-7,"teacher_disagreement_score":0.5775854,"about_ca_system_score_codex":0.00015925651,"about_ca_system_score_gemma":0.000062083374,"threshold_uncertainty_score":0.9999837},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010974639,0.00017213673,0.9707024,0.00027623886,0.00007390495,0.000109882705,0.0000056320973,0.00042851034,0.01725665],"genre_scores_gemma":[0.7819551,0.000059423335,0.21386436,0.0002550541,0.00002022032,0.000007736846,0.0000013984644,0.000007210905,0.0038294771],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9989495,0.000040888208,0.00023797489,0.00030269084,0.00027281168,0.0001961127],"domain_scores_gemma":[0.99901223,0.00011048975,0.000095164265,0.00064865546,0.000058827438,0.00007463958],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00011539532,0.00010807198,0.00017634028,0.000083761726,0.00008848655,0.000026697382,0.00086720043,0.000045785244,0.0017899014],"category_scores_gemma":[0.000040928622,0.00008934109,0.000049357684,0.00019848639,0.0000651663,0.0005604241,0.0006789791,0.00007307602,0.00012025272],"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.0000093811495,0.00020373019,0.0008246334,0.00004182028,0.000022035161,0.000027996623,0.0024898986,0.00011975539,0.5608715,0.051558435,0.2979921,0.08583873],"study_design_scores_gemma":[0.00038651677,0.00018574267,0.00036876297,0.000089941466,0.000004418664,0.000041015686,0.00006074989,0.068323486,0.9005591,0.0041554077,0.025419187,0.00040561656],"about_ca_topic_score_codex":0.0000057601655,"about_ca_topic_score_gemma":0.0000020534665,"teacher_disagreement_score":0.7709805,"about_ca_system_score_codex":0.000034774348,"about_ca_system_score_gemma":0.0000053359668,"threshold_uncertainty_score":0.9991226},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000020079378,0.00011845883,0.98715436,0.0005818915,0.000081648024,0.0006708918,0.000005476177,0.0015025456,0.009864616],"genre_scores_gemma":[0.018812763,0.000039096998,0.97893184,0.0008222561,0.000014463305,0.00028144332,0.000005958188,0.000013944817,0.0010782394],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.998732,0.00006070511,0.00026532524,0.0004539216,0.00020548917,0.00028261563],"domain_scores_gemma":[0.9988896,0.00013354483,0.00007371159,0.0007066692,0.00007835912,0.000118076794],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032023794,0.0001598176,0.00017072594,0.000083041865,0.0001306574,0.000062233055,0.00076913,0.000084544714,0.00007573885],"category_scores_gemma":[0.000047431975,0.00012459898,0.00006541857,0.00017029686,0.00003407002,0.00062568445,0.000089556124,0.00009557079,0.000009235601],"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.000009008028,0.000088153465,0.000010743128,0.000022541815,0.000005523559,0.0000028568122,0.000082636936,0.0000035489936,0.030381806,0.58914447,0.040153712,0.340095],"study_design_scores_gemma":[0.00011750239,0.00009171197,0.0000030975907,0.000021122825,0.0000013976675,0.000005342651,0.000005927926,0.0017490396,0.45894742,0.030348772,0.50858283,0.00012585832],"about_ca_topic_score_codex":0.000004800966,"about_ca_topic_score_gemma":5.832157e-7,"teacher_disagreement_score":0.5587957,"about_ca_system_score_codex":0.000041226398,"about_ca_system_score_gemma":0.000052296164,"threshold_uncertainty_score":0.5080999},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0038873102,0.00016472398,0.9887203,0.000270366,0.000083627834,0.00011369675,0.00001031278,0.00044277476,0.0063068965],"genre_scores_gemma":[0.29475948,0.000094928335,0.70113295,0.00014662866,0.000014796011,0.0000075777584,0.0000023850705,0.00000825219,0.0038330243],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99896044,0.00003790736,0.00024396957,0.0003138537,0.00024795087,0.00019589295],"domain_scores_gemma":[0.9988533,0.00012054871,0.00010669151,0.0007872632,0.00006229265,0.0000698832],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00011530194,0.00010644756,0.00015450468,0.00007799168,0.00008729104,0.000028675277,0.0008926875,0.00004973951,0.00024950207],"category_scores_gemma":[0.000043456763,0.00008896576,0.000032625194,0.00018831594,0.000058094305,0.0004623983,0.000619677,0.00008043634,0.000060283917],"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.000018726858,0.0004902073,0.0030676934,0.000070091184,0.000027356353,0.00006267467,0.0011710866,0.00014833921,0.47902182,0.04671267,0.35283065,0.11637868],"study_design_scores_gemma":[0.00035736267,0.000052146854,0.00037032441,0.000039596616,0.000001889272,0.000017838574,0.000008008459,0.049340736,0.93453395,0.0006293177,0.01447083,0.00017801503],"about_ca_topic_score_codex":0.0000114143895,"about_ca_topic_score_gemma":0.0000072225484,"teacher_disagreement_score":0.4555121,"about_ca_system_score_codex":0.000030997362,"about_ca_system_score_gemma":0.0000057325324,"threshold_uncertainty_score":0.36279184},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0001986273,0.00012257262,0.9910702,0.0067533804,0.0004625348,0.00017695913,0.0000582187,0.0006337278,0.000523779],"genre_scores_gemma":[0.6099861,0.00011130201,0.38619483,0.003538529,0.0000696915,0.000013751739,0.000033588844,0.000023165452,0.00002904581],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99544984,0.00021017958,0.00065516477,0.0008311215,0.0023937996,0.00045991185],"domain_scores_gemma":[0.996225,0.00053169666,0.00016876409,0.0023584173,0.00014247537,0.00057364546],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010292823,0.00026440565,0.00041937325,0.00033222602,0.00021864717,0.0000826732,0.0042830557,0.00016346002,0.0005332751],"category_scores_gemma":[0.00021326018,0.00022583302,0.00008197567,0.0007077838,0.00034569844,0.0013381925,0.000057653044,0.00090282055,0.00003507773],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000030377043,0.0008259892,0.000013780114,0.000041847143,0.000011232518,0.00016213869,0.000026785803,0.00018297131,0.0050346814,0.00038955823,0.00648509,0.98679554],"study_design_scores_gemma":[0.00094676006,0.00006485257,0.000044541976,0.000876681,0.00001580614,0.00005538845,0.000009191766,0.869487,0.12492656,0.0009478764,0.0023485199,0.0002768194],"about_ca_topic_score_codex":0.00003673555,"about_ca_topic_score_gemma":0.0000034087616,"teacher_disagreement_score":0.98651874,"about_ca_system_score_codex":0.000049123057,"about_ca_system_score_gemma":0.0003464887,"threshold_uncertainty_score":0.9209203},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014525436,0.000023311826,0.97101176,0.012966424,0.00029678186,0.00041580538,0.000023198685,0.00056062336,0.0001766309],"genre_scores_gemma":[0.9626073,0.000111367364,0.036287446,0.00082827406,0.0000070376564,0.00013809963,0.000006680198,0.0000071293716,0.000006623881],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976618,0.00006079663,0.00075327914,0.00024351433,0.0010112345,0.0002693504],"domain_scores_gemma":[0.998083,0.00041018147,0.00030783247,0.0009765859,0.00014796865,0.00007443523],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00052859506,0.0002048822,0.00029633698,0.0017426172,0.00025580323,0.000011862982,0.0014771168,0.00027946068,0.00006223936],"category_scores_gemma":[0.00011490854,0.00013984718,0.000054111988,0.0019882212,0.0006772423,0.00039488857,0.000025257907,0.0006879413,0.00002589203],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006574245,0.0026927784,0.0002567138,0.0003769033,0.00007472065,0.00011863044,0.002004739,0.12797193,0.081307665,0.057563826,0.0064854464,0.7204892],"study_design_scores_gemma":[0.001572123,0.00033255861,0.00012495296,0.0007474829,0.0000031258912,0.00004387219,0.00015551448,0.5444734,0.4508941,0.0005109084,0.00096693536,0.00017503274],"about_ca_topic_score_codex":0.000009727819,"about_ca_topic_score_gemma":7.3594856e-7,"teacher_disagreement_score":0.9480819,"about_ca_system_score_codex":0.00009588662,"about_ca_system_score_gemma":0.00010106611,"threshold_uncertainty_score":0.57028025},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0007166043,0.00009515934,0.99105585,0.00073207635,0.00018572445,0.00018014501,0.0000025706347,0.001132245,0.0058996296],"genre_scores_gemma":[0.44629985,0.00002472373,0.55167603,0.0004456806,0.00003991064,0.000024378383,0.0000036639192,0.000011058716,0.0014746905],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99869865,0.000037098293,0.00023631843,0.0004265615,0.00032178313,0.00027956106],"domain_scores_gemma":[0.99884295,0.00014982757,0.00008985951,0.00074102415,0.000078798366,0.000097541466],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013516058,0.00014524271,0.00013761324,0.00014262272,0.00014703226,0.00013679432,0.00095843844,0.00005426521,0.00032219724],"category_scores_gemma":[0.000107409775,0.00013166651,0.00004159062,0.00037053082,0.00003362444,0.0012350158,0.00039796802,0.00014477393,0.000423024],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000047664407,0.00018406149,0.00003122236,0.000023508557,0.000015631285,0.000053360585,0.00063304295,0.000210666,0.029797435,0.24430022,0.082952775,0.6417933],"study_design_scores_gemma":[0.00049796916,0.00012816717,0.0004011067,0.00010316322,0.0000064556225,0.00007630662,0.000032539145,0.8683037,0.053846605,0.06720902,0.008776863,0.00061808474],"about_ca_topic_score_codex":0.0000088005745,"about_ca_topic_score_gemma":0.0000023325968,"teacher_disagreement_score":0.8680931,"about_ca_system_score_codex":0.000052076713,"about_ca_system_score_gemma":0.00000891399,"threshold_uncertainty_score":0.5437259},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0032860178,0.00003882469,0.9876742,0.0009994812,0.000085381136,0.0005046494,0.000023867151,0.0009162212,0.0064713713],"genre_scores_gemma":[0.01097645,0.0000033732833,0.9822547,0.00034216227,0.00007059284,0.00018323545,0.000038602226,0.000018442508,0.0061124847],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99865144,0.000028375409,0.0003026907,0.000448529,0.00021327619,0.0003556802],"domain_scores_gemma":[0.9990693,0.0000616134,0.000063727704,0.00068887876,0.000051093586,0.00006542992],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019266647,0.00016788996,0.0001907439,0.00009849461,0.00013159642,0.00008584304,0.0008484958,0.000060507264,0.00008449563],"category_scores_gemma":[0.000008149636,0.00013571509,0.00009067901,0.00018157503,0.000030921736,0.00064177095,0.0001847822,0.000059447488,0.000031569343],"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.00007311423,0.00016453897,0.000008265313,0.000038256505,0.000012147684,0.000012116225,0.00011095825,0.00079009763,0.506188,0.33170998,0.12389753,0.03699498],"study_design_scores_gemma":[0.0010382013,0.00010953686,0.000057922007,0.00003061775,0.000004753354,0.000011347974,0.000004313937,0.073738195,0.5054349,0.15321355,0.2659443,0.0004123967],"about_ca_topic_score_codex":0.000037468228,"about_ca_topic_score_gemma":0.000015633084,"teacher_disagreement_score":0.17849645,"about_ca_system_score_codex":0.000042619336,"about_ca_system_score_gemma":0.000022301741,"threshold_uncertainty_score":0.55343},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0011435968,0.000032002252,0.9956501,0.0008703963,0.00021555772,0.0008950821,0.00003246678,0.0007650208,0.0003957484],"genre_scores_gemma":[0.6456863,0.000001084237,0.3523476,0.001783644,0.000010195591,0.00011800831,0.000026318301,0.000005184343,0.000021640417],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99878,0.00002907246,0.0003484963,0.00027665767,0.00028501503,0.00028077143],"domain_scores_gemma":[0.9988215,0.00011888318,0.00018782927,0.00049257925,0.0002803235,0.00009890513],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019293833,0.00016771998,0.00016896689,0.00015363024,0.00016537089,0.00015260572,0.0005658429,0.0000664978,0.000009869368],"category_scores_gemma":[0.000093663155,0.00014458771,0.000083787214,0.00018481076,0.000059169255,0.0011509135,0.00011107308,0.00008855664,0.00006108905],"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.00012482629,0.00011202334,0.0000045558722,0.000016026872,0.000009908713,0.0000014584426,0.0004988628,0.034731723,0.003680502,0.8412526,0.002629816,0.11693769],"study_design_scores_gemma":[0.0026762404,0.00042681416,0.00004334478,0.00007590903,0.0000065355725,0.00000421123,0.000439512,0.74851626,0.21583964,0.018549215,0.013090109,0.00033221513],"about_ca_topic_score_codex":0.000081606304,"about_ca_topic_score_gemma":0.000021045174,"teacher_disagreement_score":0.82270336,"about_ca_system_score_codex":0.00023432345,"about_ca_system_score_gemma":0.00012420319,"threshold_uncertainty_score":0.5896116},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000058680933,0.000027088177,0.99592465,0.0017268604,0.00004581504,0.0009851055,0.00014368814,0.0009764579,0.000111627356],"genre_scores_gemma":[0.06844002,5.507968e-7,0.9301905,0.00040528737,0.000026365406,0.0007959212,0.00011282323,0.000009244807,0.000019301664],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989226,0.000014899649,0.00018898865,0.00043010272,0.00019022336,0.00025321686],"domain_scores_gemma":[0.99863964,0.00019843681,0.0000666266,0.0008820444,0.00009666249,0.00011659237],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000099159566,0.00013523137,0.00012490463,0.00010154323,0.00013953295,0.000058462345,0.0009298587,0.000052460226,0.000007782583],"category_scores_gemma":[0.000066763634,0.0001090905,0.00006503339,0.0003843798,0.000052063624,0.000058448495,0.00019231287,0.0001045228,0.000019549649],"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.000022725426,0.0009268741,0.00001697669,0.000069439135,0.000016508382,0.00000550958,0.00012100605,0.40586218,0.014656661,0.21478225,0.002696154,0.36082372],"study_design_scores_gemma":[0.0012314162,0.00009599094,0.00015431618,0.0000351098,0.000007355817,0.000006802408,0.0000056343174,0.7539954,0.1187723,0.063270405,0.062065218,0.00036005556],"about_ca_topic_score_codex":0.000007384373,"about_ca_topic_score_gemma":0.0000036135987,"teacher_disagreement_score":0.36046368,"about_ca_system_score_codex":0.00006150057,"about_ca_system_score_gemma":0.00007092518,"threshold_uncertainty_score":0.44485813},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00041929254,0.0000811919,0.96636236,0.00008171474,0.000059206464,0.00012216199,0.0000014206674,0.0003845009,0.03248814],"genre_scores_gemma":[0.70301765,0.000021322545,0.2963639,0.00016321843,0.000008826808,0.000037315836,3.7592775e-7,0.0000036077915,0.00038375493],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99926114,0.00003139538,0.00012561736,0.00027085427,0.00015033432,0.00016063818],"domain_scores_gemma":[0.99948525,0.000046029312,0.000034098524,0.00037060503,0.00002041583,0.00004357224],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00005300024,0.00007625606,0.000083738174,0.00009603514,0.000033338652,0.000027654589,0.0005726076,0.00002773512,0.00011770536],"category_scores_gemma":[0.000017731325,0.00006679481,0.000014668161,0.00022125657,0.000019878045,0.00089026854,0.00039388085,0.000084416555,0.00005148089],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002965525,0.00077274337,0.0017383045,0.000007603891,0.00002335352,0.0002185627,0.0066058463,0.00029831973,0.01798561,0.649426,0.05743194,0.26546207],"study_design_scores_gemma":[0.00046755996,0.00018911279,0.00077939103,0.00007118069,6.9574423e-7,0.000009714094,0.00014286608,0.7836678,0.19808398,0.012591727,0.003713443,0.000282504],"about_ca_topic_score_codex":0.000010481686,"about_ca_topic_score_gemma":0.0000012403318,"teacher_disagreement_score":0.7833695,"about_ca_system_score_codex":0.000051479456,"about_ca_system_score_gemma":0.0000034732307,"threshold_uncertainty_score":0.27238134},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002102709,0.000025094947,0.99129343,0.0013203367,0.000047275887,0.0004054969,0.0000020470202,0.0010131843,0.0037904207],"genre_scores_gemma":[0.47688496,0.000009012525,0.5217051,0.00074306416,0.000022590708,0.000064255575,0.0000026720736,0.0000121022285,0.0005562849],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99867177,0.000026919366,0.00019052543,0.00053244317,0.00031231303,0.00026603288],"domain_scores_gemma":[0.9986084,0.00008271747,0.000076006,0.0010112472,0.00007418026,0.00014742368],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00010675795,0.00015571603,0.00015761005,0.00012942926,0.00010881779,0.00011953007,0.00093816174,0.000042208467,0.000096870164],"category_scores_gemma":[0.000033370008,0.00012084816,0.000024187293,0.00059904315,0.00002793318,0.000674339,0.00026895193,0.000099666395,0.00025396954],"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.000034823795,0.00021222616,0.0004220661,0.000031472504,0.00002721492,0.000037433663,0.0008722419,0.00022035884,0.1870474,0.23549157,0.08543584,0.49016735],"study_design_scores_gemma":[0.00069668243,0.00039092917,0.0006475546,0.00011080076,0.0000088526385,0.00008170715,0.000046260873,0.1339116,0.81160057,0.005746026,0.045875613,0.0008834256],"about_ca_topic_score_codex":0.00002042946,"about_ca_topic_score_gemma":0.000013332215,"teacher_disagreement_score":0.62455314,"about_ca_system_score_codex":0.000042243755,"about_ca_system_score_gemma":0.000009674664,"threshold_uncertainty_score":0.49280453},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000038702347,0.000045651424,0.9986388,0.00015406372,0.000025013822,0.00020670434,0.0000114927425,0.00016211967,0.00071743847],"genre_scores_gemma":[0.16787085,0.000098976896,0.83189386,0.000027137196,0.0000025193747,0.000044893757,0.000017701244,0.0000037765944,0.000040302726],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995774,0.000017658438,0.00016099014,0.00013005109,0.000049480583,0.00006440586],"domain_scores_gemma":[0.9990103,0.000024297875,0.00010239203,0.0007155151,0.00012043738,0.000027010874],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000087733104,0.000049581584,0.000075645105,0.00005376979,0.00006856994,0.0000106731695,0.00043483113,0.000023686962,0.000008298009],"category_scores_gemma":[0.00002689241,0.000042963922,0.000017767015,0.00008000688,0.000051597555,0.000618835,0.00039212898,0.00002815829,5.394604e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007088521,0.0016249421,0.00044448816,0.00044869006,0.000068416295,0.0000028549819,0.009537786,0.0018927432,0.020825341,0.77119035,0.013826551,0.18006694],"study_design_scores_gemma":[0.00020098542,0.000115853196,0.00077193056,0.000041009855,0.0000055112937,0.0000035199173,0.000043973385,0.8852078,0.0751375,0.038041532,0.00028747722,0.00014291024],"about_ca_topic_score_codex":0.000023186958,"about_ca_topic_score_gemma":0.0000029314813,"teacher_disagreement_score":0.883315,"about_ca_system_score_codex":0.000008666563,"about_ca_system_score_gemma":0.000008805396,"threshold_uncertainty_score":0.1752018},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018135384,0.00007727847,0.98000175,0.00021317243,0.00011214131,0.00029758876,0.00006983333,0.00077328755,0.00031957286],"genre_scores_gemma":[0.61086446,0.000035398552,0.38890865,0.000067965,0.000020500505,0.000015035736,0.000031564483,0.0000080441305,0.000048391383],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99854153,0.00008384372,0.00031308155,0.0004802788,0.00032277944,0.00025845744],"domain_scores_gemma":[0.9990519,0.00013602141,0.00013617084,0.00042160603,0.00013753811,0.000116730946],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018794816,0.00018247092,0.00019701428,0.00010963925,0.00042652866,0.00017265558,0.00035428145,0.00006327659,0.000026802323],"category_scores_gemma":[0.00019072945,0.00016884823,0.000030332274,0.00014206592,0.00019305322,0.001962874,0.0002787802,0.00014440704,0.000007360032],"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.000076956756,0.00006225218,0.00269385,0.00002338239,0.0000084217045,0.00003929864,0.00059573085,0.000045317607,0.9291404,0.005673762,0.011535847,0.050104816],"study_design_scores_gemma":[0.0018477886,0.00027514328,0.0034088588,0.0001175074,0.000004325544,0.00016290807,0.00014761706,0.49773633,0.4865294,0.002225203,0.006920219,0.0006246758],"about_ca_topic_score_codex":0.0002376344,"about_ca_topic_score_gemma":0.000048801707,"teacher_disagreement_score":0.5927291,"about_ca_system_score_codex":0.000074050186,"about_ca_system_score_gemma":0.000044446784,"threshold_uncertainty_score":0.6885431},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0048710057,0.000041378724,0.9930196,0.00024794936,0.00022746652,0.00052261,0.000010336263,0.0008364768,0.00022319453],"genre_scores_gemma":[0.28926665,0.000035206747,0.7095284,0.00032114144,0.000033088247,0.00014038922,0.000017595692,0.000012348805,0.0006452187],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99854714,0.00005222366,0.0002847137,0.0004905198,0.0003079548,0.00031746065],"domain_scores_gemma":[0.99886745,0.00008733643,0.00010754021,0.00072106987,0.000100635225,0.00011598298],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016690904,0.00017014441,0.0001917159,0.000119268625,0.00026102405,0.00007102076,0.0008124025,0.00007822447,0.000025098112],"category_scores_gemma":[0.00006598469,0.00014448525,0.00008487467,0.00020300316,0.000057002144,0.0010287464,0.00032695266,0.00008820028,0.000016894626],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00030672338,0.0011753434,0.021376599,0.00008655347,0.00010802644,0.00007128751,0.000978528,0.034837008,0.27269465,0.13567367,0.33432996,0.19836165],"study_design_scores_gemma":[0.0013391159,0.00011621216,0.0020354716,0.000022133212,0.0000033126555,0.000027120715,0.000021024183,0.8783579,0.09355363,0.002749958,0.021408616,0.00036550572],"about_ca_topic_score_codex":0.00004667455,"about_ca_topic_score_gemma":0.000009469669,"teacher_disagreement_score":0.8435209,"about_ca_system_score_codex":0.00008143257,"about_ca_system_score_gemma":0.000039454284,"threshold_uncertainty_score":0.58919376},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.001701801,0.000043967873,0.9960476,0.0001224815,0.00007540571,0.0006585291,0.00009286564,0.0005584481,0.00069891056],"genre_scores_gemma":[0.03881352,0.0000020129012,0.96068925,0.000036600086,0.000029594215,0.000068654495,0.000058257996,0.000011606982,0.00029052867],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99856347,0.000041510008,0.00035385572,0.00040892384,0.0003657579,0.00026650488],"domain_scores_gemma":[0.9987509,0.000075826974,0.00017983255,0.0005993213,0.0003433308,0.000050791215],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023055775,0.00014923744,0.00019701013,0.00008908087,0.00008758327,0.00006374405,0.0008135638,0.000077657896,0.00001463005],"category_scores_gemma":[0.000040303687,0.00012874325,0.000057391244,0.00046972334,0.000046596637,0.00020149811,0.00028437615,0.00005898408,0.000004518682],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000034978948,0.000731144,0.00011957377,0.00005512645,0.000023715964,0.0000045359034,0.000040790143,0.15528312,0.044630744,0.077914536,0.016649794,0.70451194],"study_design_scores_gemma":[0.0003404089,0.000098877026,0.00022939603,0.000029973502,0.0000034291934,0.000002688254,0.0000036873178,0.81708646,0.17642295,0.0038537972,0.0017877101,0.0001405908],"about_ca_topic_score_codex":0.000099895384,"about_ca_topic_score_gemma":0.000009863748,"teacher_disagreement_score":0.70437133,"about_ca_system_score_codex":0.000053945503,"about_ca_system_score_gemma":0.00006142259,"threshold_uncertainty_score":0.52499974},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0070884353,0.000017993183,0.98903036,0.001295436,0.00008187076,0.00038928556,0.000006848519,0.00068677746,0.0014030172],"genre_scores_gemma":[0.13176739,0.0000019527133,0.8667877,0.0003290128,0.000045501154,0.000035959532,0.000022787983,0.000012260776,0.0009974464],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9987779,0.000014273538,0.00030573312,0.00048285528,0.00014606291,0.00027317807],"domain_scores_gemma":[0.99893165,0.000088399,0.00007801217,0.0007750098,0.0000703001,0.000056638743],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001522536,0.0001240486,0.00015616315,0.00014581889,0.000049137838,0.000113153284,0.00076064724,0.00005646927,0.000019391442],"category_scores_gemma":[0.00004575544,0.000113690054,0.000034128803,0.00030592314,0.000015359785,0.00052685855,0.00019488837,0.00007699142,0.00001245514],"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.000039476243,0.00007579813,0.00015159551,0.000012557628,0.000003461214,0.000021992526,0.000036213973,0.00029907763,0.67125183,0.12380198,0.031148221,0.1731578],"study_design_scores_gemma":[0.00034468414,0.00007023171,0.001251374,0.000022985809,0.0000011998458,0.000008468432,0.00000377869,0.0047167093,0.9187279,0.06718644,0.007463116,0.0002031197],"about_ca_topic_score_codex":0.001286806,"about_ca_topic_score_gemma":0.0005554329,"teacher_disagreement_score":0.24747606,"about_ca_system_score_codex":0.000045642704,"about_ca_system_score_gemma":0.0000634712,"threshold_uncertainty_score":0.46361458},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0014012428,0.000021105303,0.9948716,0.00024102036,0.00009197651,0.0002143726,0.000008394896,0.000202206,0.002948065],"genre_scores_gemma":[0.3890908,0.0000014707089,0.61040235,0.00008439501,0.000016082138,0.000034815293,0.0000032984294,0.0000038189223,0.00036293527],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9990862,0.000019359331,0.0002212771,0.0002758569,0.00022187083,0.00017545452],"domain_scores_gemma":[0.9991922,0.00021347422,0.00011064514,0.00040768084,0.000045538014,0.000030464285],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017083727,0.000095719675,0.00012348004,0.00008666338,0.00005519525,0.00003893005,0.0006834672,0.000037626978,0.000030827057],"category_scores_gemma":[0.000019373478,0.000075564574,0.00004266795,0.000096520256,0.000031891734,0.00035956068,0.00021527064,0.000047538924,0.000003593905],"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.000036202393,0.00016809131,0.00042352176,0.00003873697,0.000009127383,0.000006774848,0.000025311505,0.004669177,0.016916271,0.83973265,0.05067312,0.08730103],"study_design_scores_gemma":[0.0004073305,0.000345031,0.00038138835,0.000095597214,0.0000027645035,0.0000041611283,0.000014057996,0.19598727,0.63638884,0.15737921,0.008705249,0.0002890686],"about_ca_topic_score_codex":0.00002581881,"about_ca_topic_score_gemma":0.0000027422316,"teacher_disagreement_score":0.68235344,"about_ca_system_score_codex":0.000037679813,"about_ca_system_score_gemma":0.000023636974,"threshold_uncertainty_score":0.3081434},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000027603981,0.000054876815,0.8904192,0.00023872983,0.00006370944,0.000048283833,5.279811e-7,0.00080719043,0.108339876],"genre_scores_gemma":[0.057556048,0.000014408917,0.9393936,0.00033003304,0.000020028348,0.000009206495,8.2196016e-7,0.0000034760387,0.002672411],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993627,0.00002164744,0.00011240625,0.00022260881,0.000116528805,0.00016408529],"domain_scores_gemma":[0.9992912,0.000036603997,0.000032686094,0.0005565885,0.000037563095,0.000045377452],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000085403255,0.000060930925,0.00006354914,0.00005862174,0.00007807775,0.000066477456,0.0005896237,0.000031156127,0.0005657958],"category_scores_gemma":[0.000038029277,0.00005242701,0.0000128674465,0.00022175878,0.000010227271,0.00080030155,0.000266109,0.000073643285,0.0001757551],"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":[2.5181606e-7,0.000021000908,0.000013383934,0.0000019284205,0.0000012849798,0.0000018685364,0.000028683353,0.000037774,0.0038882962,0.88386184,0.044303764,0.06783992],"study_design_scores_gemma":[0.00011447745,0.00004026825,0.0000598995,0.000018695633,9.093354e-7,0.000017646124,0.000003819757,0.6792757,0.029813934,0.09346591,0.19700406,0.00018469123],"about_ca_topic_score_codex":0.000013611076,"about_ca_topic_score_gemma":9.3736423e-7,"teacher_disagreement_score":0.7903959,"about_ca_system_score_codex":0.000024498428,"about_ca_system_score_gemma":0.0000066512084,"threshold_uncertainty_score":0.6195068},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.020906718,0.000097071585,0.97649825,0.00018598745,0.00054717105,0.00014613249,0.0000027157391,0.0008528813,0.00076309725],"genre_scores_gemma":[0.36071596,0.00006198407,0.6383909,0.000424912,0.00018738928,0.000019456416,0.000008620022,0.000010156219,0.00018065365],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989051,0.00007953229,0.00022234202,0.00037406632,0.00019067703,0.00022825485],"domain_scores_gemma":[0.9984068,0.0005002956,0.00011437237,0.00085646485,0.000058349706,0.00006369893],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001155508,0.00012964153,0.00012922818,0.00003841675,0.0003394564,0.000056198645,0.0007708287,0.00006636726,0.000076862096],"category_scores_gemma":[0.00004410211,0.00008476502,0.000041685777,0.00022672405,0.00009935937,0.0006086311,0.00038178178,0.00024379269,0.00005204879],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000025508229,0.000059198705,0.004672109,0.0000032493206,0.00004374288,0.00004663754,0.0006118279,0.002050839,0.0051770275,0.009716225,0.013678121,0.9639155],"study_design_scores_gemma":[0.00016435102,0.000027116383,0.0013039367,0.000019319377,0.000004081545,0.00005880923,0.00006044028,0.9862652,0.007578872,0.0016343701,0.0027024806,0.00018103406],"about_ca_topic_score_codex":0.000079679354,"about_ca_topic_score_gemma":0.0000054967068,"teacher_disagreement_score":0.98421437,"about_ca_system_score_codex":0.00002233277,"about_ca_system_score_gemma":0.00002151338,"threshold_uncertainty_score":0.34566176},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00017259824,0.00002953525,0.94893014,0.00029426307,0.0000619484,0.0004218576,0.000011059885,0.0015767983,0.04850177],"genre_scores_gemma":[0.10947846,4.2341875e-7,0.888099,0.0008709326,0.000030688214,0.0001016482,0.00001845899,0.00001272722,0.0013876492],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99839395,0.00006561122,0.00025912834,0.0005968351,0.0003530003,0.00033150104],"domain_scores_gemma":[0.99857354,0.0000746381,0.00008183347,0.000992559,0.00014620021,0.00013119867],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001349444,0.00019156137,0.00020412749,0.00017358373,0.00012598095,0.0001384406,0.0012759335,0.000054540422,0.000020853826],"category_scores_gemma":[0.000018592853,0.0001503303,0.000059669248,0.00043234526,0.000046749552,0.00075872353,0.00062050775,0.00012435546,0.00009576622],"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.00008221663,0.0008747794,0.0000958794,0.000020463905,0.0000073274987,0.000015982296,0.000051371746,0.0023268615,0.2831476,0.5390964,0.14328063,0.031000484],"study_design_scores_gemma":[0.00054983434,0.00013767935,0.0005301754,0.000054457087,0.0000024780854,0.000005695375,0.000029174309,0.15093906,0.8252376,0.00647018,0.015648773,0.00039494515],"about_ca_topic_score_codex":0.00019210609,"about_ca_topic_score_gemma":0.0000026036762,"teacher_disagreement_score":0.54208994,"about_ca_system_score_codex":0.00004989564,"about_ca_system_score_gemma":0.000037376114,"threshold_uncertainty_score":0.6130292},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006459496,0.00008287896,0.9910004,0.0005283377,0.0000847597,0.00077958975,0.0000517091,0.0004168733,0.00059595925],"genre_scores_gemma":[0.5140962,0.00008242927,0.48483646,0.00027074522,0.000019814732,0.0003001267,0.000013394419,0.000022196868,0.00035864115],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978419,0.000066590226,0.0004271171,0.00077419885,0.0005013503,0.00038885017],"domain_scores_gemma":[0.9986292,0.00009969742,0.00010169822,0.0006076507,0.0003855353,0.00017623567],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005407458,0.0002907363,0.00034930115,0.0005675147,0.00065937534,0.00036319077,0.0006171628,0.00009312382,0.0002330244],"category_scores_gemma":[0.000011303346,0.00025378124,0.0001449931,0.0013928243,0.000097293916,0.00318607,0.0000065986565,0.00029257074,0.000025620839],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000095731644,0.00010395697,0.0000023401385,0.00007616668,0.00004163548,0.0000015102081,0.0005990792,0.0031514391,0.011344257,0.0000075294893,0.00021426842,0.98436207],"study_design_scores_gemma":[0.00056117395,0.00015264579,0.00006733804,0.000223951,0.00017541966,0.000014059891,0.000042939726,0.7659596,0.2307843,0.00040746963,0.0012697893,0.00034131174],"about_ca_topic_score_codex":0.0000085978045,"about_ca_topic_score_gemma":0.00000537217,"teacher_disagreement_score":0.98402077,"about_ca_system_score_codex":0.000108523316,"about_ca_system_score_gemma":0.00009257681,"threshold_uncertainty_score":0.9999914},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.057046812,0.000040707233,0.9309053,0.00013215978,0.00007947675,0.0001590921,5.1171105e-7,0.00017682827,0.011459126],"genre_scores_gemma":[0.5202568,0.000005026763,0.4794427,0.0002590051,0.000010090386,0.0000065189297,6.012135e-7,0.0000044404856,0.000014829842],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987032,0.0002704858,0.00022867022,0.00030306473,0.00025840252,0.00023622332],"domain_scores_gemma":[0.9989853,0.00021005975,0.000083640436,0.00065850106,0.000032078624,0.000030449217],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00081481464,0.000112293754,0.00010745523,0.00009481514,0.00015029234,0.00015375622,0.0007435065,0.000043678006,0.000012144737],"category_scores_gemma":[0.000021488047,0.000079090896,0.000030051993,0.00042680654,0.000027036942,0.0013386424,0.00013108594,0.00019670291,0.00000662563],"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.0000031404843,0.00011282046,0.00015276948,0.0000067698106,0.0000031361326,0.00002446286,0.00060742476,0.010240647,0.0144147845,0.9704739,0.00032289152,0.0036372577],"study_design_scores_gemma":[0.00041403834,0.000041438652,0.00023443879,0.00007336944,0.000003123089,0.00027943228,0.0011986131,0.5984367,0.02188184,0.3674234,0.00958541,0.00042817273],"about_ca_topic_score_codex":0.00006092899,"about_ca_topic_score_gemma":0.000018306147,"teacher_disagreement_score":0.6030505,"about_ca_system_score_codex":0.000060896484,"about_ca_system_score_gemma":0.000031208067,"threshold_uncertainty_score":0.32252333},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010922756,0.000012725762,0.97411275,0.00011999188,0.000047707603,0.0002099812,0.0000067133674,0.00030455968,0.014262825],"genre_scores_gemma":[0.11704138,0.000037069505,0.8819318,0.00010931131,0.000006511476,0.000014714234,0.000007154923,0.0000083086525,0.0008437797],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99902403,0.00006389438,0.00025341127,0.00026120135,0.0002289963,0.00016844839],"domain_scores_gemma":[0.999058,0.00006808794,0.00011781262,0.0006192236,0.00008483509,0.000052030526],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021191576,0.000094958275,0.00013563703,0.00007952732,0.000040938055,0.000029850402,0.00045468463,0.00003237156,0.00056891347],"category_scores_gemma":[0.00002485978,0.000080513266,0.000030429495,0.00023677845,0.000025432719,0.00060141506,0.00016250741,0.000045254594,0.00003947198],"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.0000075285484,0.00012081222,0.0020795627,0.000023356411,0.000021832051,0.000013341628,0.00037795622,0.000013133724,0.58935523,0.23641932,0.06498924,0.106578685],"study_design_scores_gemma":[0.0002601378,0.000059931535,0.00032139022,0.000009843264,0.000002347514,0.0000073810766,0.00004521952,0.00062607153,0.9751033,0.016294612,0.007148908,0.00012084188],"about_ca_topic_score_codex":0.000099698824,"about_ca_topic_score_gemma":0.000014100402,"teacher_disagreement_score":0.3857481,"about_ca_system_score_codex":0.00002264808,"about_ca_system_score_gemma":0.00005059402,"threshold_uncertainty_score":0.6229204},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0148814265,0.00003574443,0.98338807,0.00025051975,0.00013619046,0.00052734435,0.000026584745,0.00055533205,0.000198801],"genre_scores_gemma":[0.25107887,0.0000138061305,0.7483078,0.00015489645,0.000026867152,0.0001422789,0.0000047252615,0.000009377711,0.000261369],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9988656,0.000025644262,0.00030837243,0.00041156908,0.00020471973,0.00018407084],"domain_scores_gemma":[0.998745,0.00005559102,0.00015243528,0.00082602375,0.000115833136,0.00010508477],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012353786,0.00012954995,0.00019368941,0.00017150404,0.000091828224,0.000051110856,0.0008037884,0.000057411868,0.00004975914],"category_scores_gemma":[0.000040342213,0.00011434001,0.000052857627,0.00045879977,0.0000539634,0.0005735204,0.0003480405,0.00008201295,0.000041271207],"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.000040074465,0.0005089046,0.00031031316,0.000070534945,0.000039736886,0.0000036353326,0.0015838338,0.006588037,0.4728209,0.39115006,0.00081065454,0.12607332],"study_design_scores_gemma":[0.00086912717,0.00010279011,0.00055312284,0.000074703516,0.0000047987314,0.000012503314,0.00008262163,0.012399362,0.9603645,0.006517947,0.018673403,0.00034511698],"about_ca_topic_score_codex":0.00013790613,"about_ca_topic_score_gemma":0.000027860517,"teacher_disagreement_score":0.4875436,"about_ca_system_score_codex":0.00004591623,"about_ca_system_score_gemma":0.00004031662,"threshold_uncertainty_score":0.466265},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.059890766,0.00013228471,0.93874645,0.00024296874,0.00012491974,0.0002466061,0.0000030601186,0.0002908342,0.0003220971],"genre_scores_gemma":[0.60704094,0.000028381099,0.39263383,0.00011235385,0.00003205695,0.000005267797,0.0000016894726,0.0000071978134,0.00013827973],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9986867,0.00007861997,0.00034180973,0.00035711,0.00029033222,0.0002454538],"domain_scores_gemma":[0.9985156,0.00012451109,0.00018490413,0.0009624679,0.00015656117,0.000055952874],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003556719,0.00013268982,0.0001707482,0.000093054274,0.00022609376,0.00009707579,0.000769277,0.00005840033,0.000030494057],"category_scores_gemma":[0.00011571835,0.00009087398,0.0000517934,0.00033322445,0.00006928453,0.0014601327,0.00048101676,0.00012674785,0.000008564017],"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.000017251572,0.000100786296,0.0004284752,0.0000181887,0.0000053691474,0.0000022128313,0.00020499312,0.002773554,0.93195784,0.005878095,0.0025942256,0.056018997],"study_design_scores_gemma":[0.00018798254,0.000021480106,0.0003746116,0.00010230589,0.0000023514065,0.000012560798,0.00002254534,0.43891478,0.5572866,0.0012241921,0.0017481486,0.00010239345],"about_ca_topic_score_codex":0.000068997644,"about_ca_topic_score_gemma":0.00002179513,"teacher_disagreement_score":0.5471502,"about_ca_system_score_codex":0.000063075335,"about_ca_system_score_gemma":0.000034514655,"threshold_uncertainty_score":0.37057334},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000607307,0.00003679789,0.9973185,0.00032654285,0.0001798033,0.0003363218,0.00022057557,0.0006296841,0.00034443176],"genre_scores_gemma":[0.12528631,0.000015042814,0.8737301,0.0005105536,0.000051689072,0.000012732781,0.00014012698,0.000010119934,0.00024329066],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986719,0.00001961126,0.00019883258,0.0005985098,0.0002447667,0.00026641903],"domain_scores_gemma":[0.9973152,0.00013228711,0.00007628961,0.0023186333,0.000077016855,0.00008055101],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000112296206,0.00013269245,0.00014870652,0.0000695449,0.00030572983,0.00007852094,0.0030664431,0.0000510203,0.00003471849],"category_scores_gemma":[0.000103530794,0.00010465982,0.00002506669,0.00019984618,0.00006679492,0.00082333764,0.0019630757,0.000097045944,0.0000054606207],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019396717,0.00011846363,0.000111022266,0.000037459027,0.000020138883,0.000038426777,0.00027473146,0.00033990227,0.017269192,0.3660028,0.45861056,0.1571579],"study_design_scores_gemma":[0.00044621777,0.000085707936,0.00013099171,0.000027348475,0.0000034036725,0.000102873884,0.000009966746,0.6831831,0.11472489,0.009132375,0.19178796,0.00036518596],"about_ca_topic_score_codex":0.000009587849,"about_ca_topic_score_gemma":0.000005562944,"teacher_disagreement_score":0.68284315,"about_ca_system_score_codex":0.0000225386,"about_ca_system_score_gemma":0.000059190246,"threshold_uncertainty_score":0.56982654},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0013740208,0.000087753935,0.9954117,0.00014344284,0.00009839897,0.00010967063,0.0000034307643,0.0007360854,0.0020354895],"genre_scores_gemma":[0.3827131,0.000025986965,0.6168524,0.00013598085,0.000018327963,0.000004280912,0.0000040807004,0.000009241504,0.00023659856],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99906653,0.000040001563,0.00019506297,0.000310606,0.0001895188,0.0001982495],"domain_scores_gemma":[0.9992856,0.00006114007,0.000086129185,0.00046332658,0.00004874087,0.000055087236],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00009836772,0.00010549167,0.00011248878,0.00008604487,0.00014258827,0.00015274942,0.000560012,0.000040167724,0.000070437294],"category_scores_gemma":[0.00005573589,0.000097613694,0.000026999089,0.0003064519,0.000021260626,0.0014760118,0.0002453641,0.00007890735,0.000026389633],"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.0000018714969,0.00006401899,0.000018872443,0.000011326999,0.0000044489916,0.0000066264815,0.00014342317,0.00010700045,0.90306973,0.036034327,0.019025095,0.04151324],"study_design_scores_gemma":[0.00011106597,0.00001123526,0.0000049406294,0.000017585775,0.0000013120505,0.000004781048,0.0000049075106,0.8340478,0.16376637,0.00049331016,0.0014085668,0.00012812132],"about_ca_topic_score_codex":0.000019591651,"about_ca_topic_score_gemma":2.955243e-7,"teacher_disagreement_score":0.8339408,"about_ca_system_score_codex":0.000043253356,"about_ca_system_score_gemma":0.0000054606385,"threshold_uncertainty_score":0.3980571},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019216448,0.000008131456,0.9779646,0.0008195603,0.00005929479,0.000630769,0.000008101076,0.00092328736,0.0003698102],"genre_scores_gemma":[0.38290498,0.000005425529,0.61628914,0.0005514671,0.000020582356,0.000048595375,0.000021070065,0.00001405898,0.00014469304],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9984484,0.000047220983,0.00026253384,0.00066080166,0.000292947,0.00028814437],"domain_scores_gemma":[0.9985155,0.00007241023,0.00014005022,0.000947787,0.00017089925,0.00015336396],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021497399,0.00019762528,0.00018235159,0.000116640746,0.00023755862,0.00012764763,0.0007940361,0.000058058697,0.000017494844],"category_scores_gemma":[0.00005873337,0.00016199367,0.000024331037,0.0006260805,0.000052844898,0.000932455,0.00048573702,0.00010634354,0.00017693565],"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.00015161955,0.0005573815,0.0014317994,0.00011390262,0.000023131344,0.00003280801,0.0008136365,0.008142305,0.54442596,0.40761515,0.0012104232,0.035481863],"study_design_scores_gemma":[0.0008549938,0.00013835475,0.004978946,0.00012462547,0.000006459384,0.000023430113,0.000012841536,0.04081492,0.943527,0.007064334,0.0019872207,0.000466896],"about_ca_topic_score_codex":0.00014523636,"about_ca_topic_score_gemma":0.00036962458,"teacher_disagreement_score":0.40055084,"about_ca_system_score_codex":0.00020853219,"about_ca_system_score_gemma":0.00004289485,"threshold_uncertainty_score":0.660591},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0031265633,0.0000073282026,0.9844774,0.010451897,0.00026033426,0.00054026395,0.000025714038,0.0009832614,0.0001272169],"genre_scores_gemma":[0.87642694,0.00004749707,0.122388706,0.0010208541,0.000010423347,0.00005613654,0.00003719995,0.000006063826,0.0000061880255],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99843067,0.00004390221,0.00057332637,0.0003075688,0.00037569454,0.00026883083],"domain_scores_gemma":[0.99875915,0.00013030601,0.000284388,0.0006300667,0.000121413526,0.00007470492],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030713103,0.0002406148,0.00030535998,0.002571054,0.00022076211,0.000064311396,0.00050000014,0.00026121273,0.000013340312],"category_scores_gemma":[0.00002985857,0.00021350804,0.00003590395,0.0011555761,0.00019030526,0.0017281887,0.0000083594905,0.0004928759,0.000023341352],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00035353526,0.00062783394,0.000023932726,0.00005723711,0.000011117326,0.0000080129375,0.00028215558,0.007203044,0.19719805,0.019540815,0.00054968055,0.7741446],"study_design_scores_gemma":[0.0048211655,0.00058572344,0.0005270541,0.0004037221,0.000008997613,0.00003256086,0.00008727551,0.7318217,0.25790745,0.0028159136,0.0007129608,0.0002754734],"about_ca_topic_score_codex":0.000007504805,"about_ca_topic_score_gemma":8.8278813e-7,"teacher_disagreement_score":0.8733004,"about_ca_system_score_codex":0.00017393618,"about_ca_system_score_gemma":0.00002701846,"threshold_uncertainty_score":0.8706605},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005517274,0.0000929053,0.9824126,0.00054002,0.00003173145,0.00012780745,0.0000021880762,0.00016136297,0.011114133],"genre_scores_gemma":[0.5261926,0.000031018968,0.4732029,0.00042631212,0.000006491458,0.000011097605,3.0430178e-7,0.0000053962394,0.00012382506],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9992965,0.000053183438,0.00012629744,0.00023313898,0.00014681602,0.00014406892],"domain_scores_gemma":[0.9990148,0.00025532668,0.000057182035,0.0006190186,0.000019478673,0.000034192857],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017574673,0.00009908788,0.00010290348,0.00004945573,0.000082893755,0.000055825723,0.0005404988,0.000025048512,0.000024023175],"category_scores_gemma":[0.00009180539,0.00005697767,0.000023587623,0.00011703665,0.000058715697,0.00019046714,0.00029553473,0.00012925078,0.0000019161596],"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.000009671393,0.00005586304,0.00021130782,0.000027330221,0.000013226443,0.000007215598,0.00037010692,0.0019097844,0.079547405,0.83256656,0.00819285,0.07708868],"study_design_scores_gemma":[0.00022407166,0.00017805971,0.00057319633,0.0001309789,0.00000283133,0.000032065942,0.000056291516,0.006622573,0.7904871,0.18109496,0.020307008,0.0002908682],"about_ca_topic_score_codex":0.0000044339918,"about_ca_topic_score_gemma":8.2013486e-7,"teacher_disagreement_score":0.7109397,"about_ca_system_score_codex":0.0000052179807,"about_ca_system_score_gemma":0.000007979508,"threshold_uncertainty_score":0.2323482},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0032122987,0.0003378269,0.9910046,0.0005465988,0.0010524633,0.0022054554,0.00030119187,0.0012729364,0.00006663044],"genre_scores_gemma":[0.9828612,0.000050741506,0.015631292,0.00019376307,0.00003080986,0.00090432743,0.0000175007,0.00003246288,0.0002778627],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99756086,0.00004136714,0.0006749236,0.0008311164,0.00024076318,0.0006509598],"domain_scores_gemma":[0.99792457,0.0005194218,0.00025287032,0.00086557685,0.00028948224,0.0001481105],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00075694104,0.00030899595,0.0005045986,0.00069541874,0.0005578672,0.0001089926,0.0007165079,0.00036668958,0.0000043577647],"category_scores_gemma":[0.000032900927,0.00029243354,0.00010766242,0.00056761916,0.00018960456,0.00043379393,0.0000094183,0.00028811113,0.000007957635],"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.00026845423,0.001018921,0.00010168225,0.0009441054,0.0004447599,0.000042013577,0.00057750137,0.0038756335,0.18336165,0.17474347,0.010545262,0.62407655],"study_design_scores_gemma":[0.0054694153,0.0021871196,0.000045627887,0.0004946405,0.00010482975,0.00041610916,0.0006946611,0.1285717,0.73325336,0.017761055,0.109539695,0.0014617963],"about_ca_topic_score_codex":0.00004677819,"about_ca_topic_score_gemma":0.00004175706,"teacher_disagreement_score":0.97964895,"about_ca_system_score_codex":0.00014842584,"about_ca_system_score_gemma":0.000058071357,"threshold_uncertainty_score":0.9999528},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00025216746,0.0002972115,0.9960247,0.00076508836,0.000025482246,0.0004028364,0.0000017824788,0.0005992359,0.0016314745],"genre_scores_gemma":[0.0015842923,0.000044381657,0.99689466,0.00007766211,0.000023685117,0.000049097052,0.0000015165825,0.000008394729,0.0013162862],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99921316,0.000012733096,0.00012054593,0.00035322714,0.00011452004,0.00018579082],"domain_scores_gemma":[0.9994158,0.00003579678,0.000063464904,0.000311004,0.000059033136,0.000114913986],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000056799363,0.00010935445,0.00010899897,0.00006811907,0.00011340287,0.00010505519,0.00026047538,0.000039318085,0.000112416295],"category_scores_gemma":[0.000009005605,0.00007569559,0.000019538355,0.00016368598,0.000040190178,0.001259678,0.000077359335,0.00006553292,0.0000040058185],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015393796,0.000016078604,0.000023163813,0.000015055072,0.0000038736252,0.000002503948,0.00006271827,4.96659e-7,0.008903999,0.0069613764,0.0074287835,0.97656655],"study_design_scores_gemma":[0.00206247,0.00091001944,0.000090018264,0.00037473266,0.000010845824,0.00052819157,0.000037755213,0.18264645,0.70565253,0.036885254,0.07020519,0.0005965667],"about_ca_topic_score_codex":0.000003962546,"about_ca_topic_score_gemma":4.0845308e-7,"teacher_disagreement_score":0.97597,"about_ca_system_score_codex":0.000011782312,"about_ca_system_score_gemma":0.000017252996,"threshold_uncertainty_score":0.30867767},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00062394433,0.000062218045,0.99215376,0.00038208487,0.00025371238,0.00032068577,0.000035528985,0.0008610331,0.0053070206],"genre_scores_gemma":[0.053686146,0.000010931231,0.94561976,0.0001574756,0.00009386516,0.00004708526,0.0000045591178,0.000013549477,0.00036664025],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99859035,0.000024098821,0.00023184255,0.0004196005,0.000286894,0.00044719395],"domain_scores_gemma":[0.9988823,0.00027511414,0.000089861845,0.00059363333,0.00007791744,0.00008117507],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024089942,0.0001466833,0.00015685274,0.00011692655,0.0002458068,0.00014923711,0.0009196586,0.000036692792,0.00016986704],"category_scores_gemma":[0.000087867615,0.00012472946,0.00006640711,0.00019505258,0.000026124137,0.0002106265,0.00060468906,0.00011096796,0.000013248541],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002523302,0.00001679087,0.000015345755,0.000010980979,0.000012147901,0.0000063514167,0.00014244247,0.000023495551,0.0010148212,0.022947216,0.021566669,0.9542185],"study_design_scores_gemma":[0.0021075278,0.0005485831,0.000016589898,0.000044542998,0.000009651284,0.000020692441,0.00006841111,0.27351242,0.30790702,0.019296834,0.39589795,0.0005697586],"about_ca_topic_score_codex":0.0000075725993,"about_ca_topic_score_gemma":0.000009466398,"teacher_disagreement_score":0.95364875,"about_ca_system_score_codex":0.00004958407,"about_ca_system_score_gemma":0.000010280071,"threshold_uncertainty_score":0.508632},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002712153,0.000015057047,0.992215,0.003070819,0.00071425276,0.00017980942,0.000010054947,0.0005671844,0.0005157077],"genre_scores_gemma":[0.64044875,0.00003838458,0.35886317,0.00046251604,0.00004389628,0.00003507099,0.0000028883937,0.00002432958,0.000081019694],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99721026,0.00012020598,0.00051417056,0.00055262016,0.0012096793,0.00039303213],"domain_scores_gemma":[0.9977742,0.00039990802,0.00016289837,0.00092194264,0.00016888451,0.00057218043],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00069196295,0.00023946098,0.00037407567,0.0002586574,0.00021557036,0.00008797797,0.0017348811,0.000153337,0.0014257387],"category_scores_gemma":[0.0001486813,0.00018249426,0.00009260034,0.00041876535,0.0005943593,0.0010116686,0.00004227994,0.0015062313,0.000033894124],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021160163,0.0012329719,0.000109894245,0.00012642203,0.000062183615,0.00046574062,0.0002952609,0.00038360336,0.13324375,0.0023414192,0.006329705,0.8551974],"study_design_scores_gemma":[0.001521663,0.000078670455,0.000033204495,0.00092041545,0.000015862654,0.00027717327,0.000031250675,0.7108032,0.28363308,0.00045534657,0.0019134593,0.00031665634],"about_ca_topic_score_codex":0.000048363505,"about_ca_topic_score_gemma":0.000024418245,"teacher_disagreement_score":0.8548808,"about_ca_system_score_codex":0.000027582262,"about_ca_system_score_gemma":0.00021233658,"threshold_uncertainty_score":0.9994871},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00086669973,0.000049893784,0.97807884,0.00052041345,0.0001937038,0.00020806873,0.000006655381,0.0016951044,0.018380592],"genre_scores_gemma":[0.31942198,0.00003775512,0.6741225,0.0010808546,0.00006700349,0.000028731543,0.0000051743477,0.0000186318,0.005217349],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99838424,0.000059874972,0.00025445575,0.00061701203,0.00033118943,0.00035321107],"domain_scores_gemma":[0.9978443,0.00004623994,0.00008421975,0.0017528834,0.000085447864,0.0001869583],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015269588,0.00018047351,0.00016386245,0.00010101674,0.000111321955,0.00020363201,0.0018762157,0.000088273,0.00089010573],"category_scores_gemma":[0.000021456337,0.00014943292,0.00004352692,0.0002190711,0.0000374213,0.001626861,0.000550591,0.00019948358,0.00029353585],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000056281883,0.00055170775,0.00015901678,0.0000113406795,0.000013728961,0.000103602215,0.0002533702,0.000043603202,0.1313803,0.048932366,0.056747075,0.76179826],"study_design_scores_gemma":[0.00039829302,0.00022830974,0.00013904998,0.000011002892,0.0000033478384,0.00005738876,0.000019426896,0.60707283,0.32965437,0.0100425165,0.05192043,0.00045304204],"about_ca_topic_score_codex":0.000030003099,"about_ca_topic_score_gemma":0.000014871569,"teacher_disagreement_score":0.7613452,"about_ca_system_score_codex":0.00004299173,"about_ca_system_score_gemma":0.000011774589,"threshold_uncertainty_score":0.97460335},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0006393208,0.000023522543,0.99570584,0.00008969579,0.00012156994,0.00011842976,0.0000010420442,0.0006589867,0.0026415852],"genre_scores_gemma":[0.15774265,0.000008455376,0.8416221,0.00026398373,0.0000051920274,0.000010837199,0.0000037421985,0.000005586603,0.0003374563],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99915075,0.000073393465,0.00013405755,0.0002982256,0.00018219775,0.00016136946],"domain_scores_gemma":[0.9992598,0.00004882187,0.000047872512,0.0005393131,0.00005094424,0.00005319167],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000151978,0.00008942968,0.00007201036,0.00008742747,0.00009513998,0.00005669571,0.00039303285,0.000045445093,0.00004224365],"category_scores_gemma":[0.00014524304,0.000075532116,0.000024307086,0.00023292002,0.000018778024,0.0006028469,0.00009466897,0.00007621908,0.00011625709],"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.0000021237058,0.00008717883,0.00003175836,0.0000016622512,0.0000014241596,0.0000029292848,0.000018517414,0.0045223506,0.0018308598,0.9843946,0.0032971485,0.0058094426],"study_design_scores_gemma":[0.00038051396,0.00011990834,0.00033827193,0.00002655365,0.0000013907487,0.000011359658,0.000006254385,0.8147209,0.1556814,0.011345833,0.017115327,0.0002522813],"about_ca_topic_score_codex":0.000003666407,"about_ca_topic_score_gemma":9.603785e-7,"teacher_disagreement_score":0.97304875,"about_ca_system_score_codex":0.000029125955,"about_ca_system_score_gemma":0.00001723818,"threshold_uncertainty_score":0.30801103},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0090365615,0.0005639511,0.98608696,0.00015957138,0.0007998203,0.0018276317,0.00040000165,0.0010298125,0.0000957101],"genre_scores_gemma":[0.9681139,0.000073389056,0.030238258,0.00015910581,0.000018856512,0.0012621444,0.0000037983848,0.000037549915,0.00009298876],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9978959,0.000053782664,0.0005097701,0.0008620532,0.00017096601,0.0005075342],"domain_scores_gemma":[0.9982176,0.0002131737,0.00022584318,0.0009893967,0.00020736358,0.00014661062],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00026883362,0.00032496382,0.00054487714,0.0004974358,0.0005028653,0.00010025796,0.0007898473,0.00025783572,0.000008063726],"category_scores_gemma":[0.00002549355,0.00030199837,0.00009790507,0.00030375554,0.00036399643,0.0005349632,0.000020997517,0.0002726825,0.000004532942],"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.0003275604,0.0022809808,0.00012405997,0.0032197004,0.0005133637,0.00006018076,0.002194508,0.00025042164,0.30834395,0.43973395,0.0060412306,0.23691012],"study_design_scores_gemma":[0.003661145,0.0023351994,0.000080417674,0.0006631221,0.00007268547,0.0003953741,0.00029923633,0.036990397,0.8708753,0.06971718,0.013753978,0.0011559378],"about_ca_topic_score_codex":0.00006385238,"about_ca_topic_score_gemma":0.00002341826,"teacher_disagreement_score":0.95907736,"about_ca_system_score_codex":0.000049979433,"about_ca_system_score_gemma":0.000042656713,"threshold_uncertainty_score":0.9999432},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00094212196,0.002318274,0.9950105,0.0003654327,0.00024836516,0.00027632125,0.000032081174,0.00048696616,0.00031993003],"genre_scores_gemma":[0.9034556,0.005346471,0.08952565,0.00029949687,0.000021587406,0.00008345854,0.0000031306122,0.000049835573,0.0012147665],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9980266,0.0000922298,0.00041101436,0.0005475993,0.00041409256,0.0005084504],"domain_scores_gemma":[0.9985029,0.000162738,0.00013837412,0.00095296424,0.00010548383,0.00013753216],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00013168406,0.0002784195,0.00030601042,0.00028965776,0.0002414508,0.00007425931,0.0008993311,0.00014128357,0.00044138014],"category_scores_gemma":[0.0000038763515,0.00026505563,0.0001633648,0.0005975459,0.00012800157,0.00074071134,0.000005410552,0.0005074514,0.000052188854],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000045741133,0.00081837893,0.0000033738509,0.000046803198,0.00008649236,0.000012597782,0.0003145619,0.015031754,0.061742533,0.0013228871,0.0051432773,0.9154316],"study_design_scores_gemma":[0.0006848906,0.00033773604,0.000008738651,0.00009517635,0.00003514598,0.00003427979,0.0000038293015,0.110770345,0.8263251,0.0010024416,0.060270265,0.00043201572],"about_ca_topic_score_codex":0.000016750573,"about_ca_topic_score_gemma":0.0000058559663,"teacher_disagreement_score":0.9149996,"about_ca_system_score_codex":0.000094039155,"about_ca_system_score_gemma":0.00007627737,"threshold_uncertainty_score":0.99998015},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0027372092,0.00091201346,0.96162814,0.003048472,0.00037026178,0.00046713094,0.000012327031,0.0010214348,0.02980301],"genre_scores_gemma":[0.65116143,0.0003825771,0.346756,0.0007742385,0.00020186913,0.00021162306,0.000017219749,0.00004164544,0.0004533999],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9968933,0.00001198292,0.0005306294,0.0010440242,0.001038453,0.00048164293],"domain_scores_gemma":[0.9981305,0.00005294096,0.00035978266,0.00026436467,0.0010271315,0.00016525561],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.000239044,0.00040519473,0.00029983555,0.00025665818,0.00035397557,0.0011671396,0.0018576069,0.00013292815,0.0005619133],"category_scores_gemma":[0.00007955798,0.0003598358,0.000094701216,0.00043434213,0.00015538643,0.005250691,0.00040769926,0.00046520977,0.00013647956],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000089829155,0.00048593027,0.00015249499,0.00015167335,0.00003526073,0.00003532988,0.0019227772,0.000030339183,0.093638316,0.06438643,0.0054418584,0.8336298],"study_design_scores_gemma":[0.0008366507,0.00025925456,0.000088421264,0.0012919137,0.000012194043,0.00011384573,0.00007070435,0.6869441,0.16652845,0.11212669,0.030842237,0.00088548666],"about_ca_topic_score_codex":0.0000085717475,"about_ca_topic_score_gemma":4.6513813e-7,"teacher_disagreement_score":0.8327443,"about_ca_system_score_codex":0.000111149486,"about_ca_system_score_gemma":0.00005297701,"threshold_uncertainty_score":0.9998854},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014343769,0.00027767592,0.98431695,0.0001993543,0.000025805142,0.0002867328,0.0000019637628,0.0005244561,0.00002330391],"genre_scores_gemma":[0.97283196,0.00015232885,0.026772298,0.000037780024,0.000012788326,0.00013613219,0.0000021075182,0.000020332332,0.000034265166],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986483,0.000033363325,0.00022555595,0.00038409073,0.0002496713,0.00045903213],"domain_scores_gemma":[0.999284,0.0001320152,0.00007124401,0.00030444367,0.00009239552,0.00011586364],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00005915243,0.00021267984,0.00022235939,0.00040172492,0.00011653238,0.000050941104,0.00031288026,0.00008895821,0.00001069055],"category_scores_gemma":[0.000006295839,0.00017051537,0.00005576317,0.0010257943,0.000040133986,0.00053595915,0.0000069257667,0.00046867627,0.0000015939136],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003466373,0.0014586921,0.001012991,0.00036183823,0.00029982478,0.000017245673,0.00012117881,0.22079712,0.28969088,0.020153826,0.0008954747,0.4648443],"study_design_scores_gemma":[0.00065203593,0.0011644112,0.0017153618,0.0001483938,0.000021492764,0.000065775195,0.000001708112,0.7409383,0.2534505,0.0010990658,0.0004068897,0.00033607287],"about_ca_topic_score_codex":0.00002770363,"about_ca_topic_score_gemma":0.000002150242,"teacher_disagreement_score":0.9584882,"about_ca_system_score_codex":0.000068572524,"about_ca_system_score_gemma":0.00005829668,"threshold_uncertainty_score":0.69534147},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00025400752,0.0000090639805,0.9823819,0.0008461506,0.0002299271,0.0007036856,0.000031000644,0.0007489395,0.014795329],"genre_scores_gemma":[0.054754134,0.000009559331,0.94233334,0.0013396572,0.000023587085,0.00009997563,0.000010318441,0.000020561762,0.0014088582],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99821734,0.000046276233,0.00034453886,0.000633435,0.00025134257,0.00050704455],"domain_scores_gemma":[0.9984473,0.0001630469,0.00006823288,0.0009370609,0.0001766427,0.00020773789],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046131772,0.00023338302,0.00027561907,0.00018473533,0.00019729338,0.00015474742,0.0012518681,0.00007233306,0.00018060376],"category_scores_gemma":[0.0002059575,0.00018760182,0.00012525477,0.00044761263,0.00006714829,0.0013587296,0.00020580267,0.00018097725,0.00009964497],"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.000022660832,0.000118057935,0.0000071724526,0.00007008647,0.000009772811,0.000009113444,0.00029759208,0.000008153774,0.038272306,0.88407344,0.0520199,0.025091775],"study_design_scores_gemma":[0.00043352065,0.0001393083,0.000012755578,0.00008477335,0.000003728025,0.000020572357,0.000064168424,0.007534071,0.8038251,0.10877292,0.07869194,0.00041716942],"about_ca_topic_score_codex":0.000013869155,"about_ca_topic_score_gemma":0.000010779559,"teacher_disagreement_score":0.7753005,"about_ca_system_score_codex":0.0000942891,"about_ca_system_score_gemma":0.000060095233,"threshold_uncertainty_score":0.76501805},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00063628796,0.000017448256,0.9954779,0.0011375773,0.00070390623,0.0006479976,0.0001557223,0.0011078399,0.00011531302],"genre_scores_gemma":[0.77923316,0.00009655923,0.21993099,0.00026638663,0.000016289963,0.00030183402,0.00012332416,0.000010950848,0.000020482727],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984156,0.000020506492,0.0006366222,0.0003525878,0.0002448486,0.000329856],"domain_scores_gemma":[0.9979863,0.00007714892,0.0002428825,0.0015126889,0.00011178548,0.00006915566],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023629575,0.00021097214,0.00027270734,0.0019119387,0.00019674787,0.00002728408,0.0020607375,0.00027470072,0.00003524945],"category_scores_gemma":[0.00003081666,0.00018316734,0.00003452252,0.0010834319,0.00018996031,0.002547774,0.000059849383,0.0003815492,0.000027386843],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005088215,0.0012662968,0.000045489156,0.00034842646,0.00011876841,0.000014190868,0.0028637531,0.00015549506,0.043321807,0.038107615,0.009542712,0.9037066],"study_design_scores_gemma":[0.004461546,0.000969252,0.00020566415,0.0007011235,0.00002651789,0.000069430935,0.000469407,0.54486823,0.41539094,0.022582376,0.009581045,0.00067448185],"about_ca_topic_score_codex":0.000017301709,"about_ca_topic_score_gemma":0.0000037622767,"teacher_disagreement_score":0.9030321,"about_ca_system_score_codex":0.00006736522,"about_ca_system_score_gemma":0.00003675222,"threshold_uncertainty_score":0.7469347},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00010538231,0.000031603377,0.99710226,0.0007627003,0.00013997001,0.0005670609,0.0000629703,0.0006871096,0.0005409678],"genre_scores_gemma":[0.0044393265,0.00001745526,0.99451935,0.00029621235,0.00010364685,0.00039696568,0.000045964192,0.000010931989,0.00017014326],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9988673,0.000016651125,0.000211062,0.00048772548,0.00019506043,0.0002222391],"domain_scores_gemma":[0.99860674,0.00022433011,0.00007279822,0.0008147044,0.00009246341,0.00018897599],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018686558,0.00012876593,0.00014387684,0.00010101422,0.00019839572,0.00012093575,0.000882253,0.000057787427,0.00003502633],"category_scores_gemma":[0.000037995353,0.00010082649,0.00003513845,0.00012385934,0.00016132284,0.00064389774,0.00070819195,0.00018977294,0.000017167216],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000011111608,0.00006228885,0.0000034374054,0.0000073067513,0.0000023851048,0.0000015162838,0.000008101837,4.6691856e-8,0.07867518,0.022608256,0.021707317,0.8769231],"study_design_scores_gemma":[0.0003793129,0.0000606395,0.00007024376,0.0000143854995,0.0000037783957,0.00005653997,0.000003662602,0.21423912,0.14760578,0.065161765,0.5721729,0.00023189773],"about_ca_topic_score_codex":0.0000076181973,"about_ca_topic_score_gemma":8.8046585e-7,"teacher_disagreement_score":0.87669116,"about_ca_system_score_codex":0.0000072887615,"about_ca_system_score_gemma":0.000027265938,"threshold_uncertainty_score":0.4111585},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.023656404,0.00032454066,0.9739535,0.00047385937,0.000053865515,0.00037414944,0.000013107774,0.0003150504,0.00083550985],"genre_scores_gemma":[0.406351,0.000011637142,0.59315044,0.00015051462,0.000039143408,0.00001859001,0.000003943764,0.000008675504,0.0002660405],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99875176,0.000035497098,0.00034596436,0.00041387198,0.0002092625,0.00024363687],"domain_scores_gemma":[0.9987162,0.00025762466,0.0001500042,0.0006652217,0.00012077972,0.00009019575],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025741683,0.00014860503,0.0002476218,0.00011274343,0.00007890545,0.00005529247,0.0008008824,0.000065155065,0.000031676078],"category_scores_gemma":[0.000047767844,0.00012845937,0.000052070154,0.00016297819,0.00005881255,0.00066491973,0.00043294256,0.000083281295,0.0000043901814],"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.000009795082,0.000059905364,0.000016126362,0.000028289458,0.0000086127175,0.0000025219765,0.00009616326,0.00017716528,0.89931166,0.006247529,0.007750091,0.086292125],"study_design_scores_gemma":[0.00026379185,0.00006716155,0.000021272486,0.000040113635,0.0000037230825,0.000008088807,0.000008920916,0.042035714,0.93097883,0.006027827,0.02038715,0.00015738107],"about_ca_topic_score_codex":0.000013460079,"about_ca_topic_score_gemma":0.000002069545,"teacher_disagreement_score":0.3826946,"about_ca_system_score_codex":0.00001598498,"about_ca_system_score_gemma":0.000024968958,"threshold_uncertainty_score":0.52384216},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0012609648,0.0000731792,0.9867439,0.0019797145,0.00016579675,0.00009782422,0.0000025970567,0.001055633,0.008620358],"genre_scores_gemma":[0.29337168,0.0000101606,0.7028196,0.002013266,0.00005324521,0.000015394788,0.000001672116,0.000009433204,0.0017055891],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9990536,0.000029589177,0.00015333729,0.00034223162,0.00020434696,0.0002169112],"domain_scores_gemma":[0.99891335,0.000045025707,0.000046040168,0.00089235394,0.000030016296,0.00007323203],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000040906885,0.00011866531,0.00011870874,0.00007440292,0.000060421688,0.000083565,0.000987468,0.000048195456,0.00078528497],"category_scores_gemma":[0.000022999424,0.00008927393,0.000044075263,0.00022368373,0.0000280789,0.0006414798,0.00034704694,0.00010591975,0.00026128758],"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.0000029324876,0.000069173,0.00028826745,0.0000069675752,0.000012318926,0.000039109782,0.00021029664,0.0000036119166,0.04699679,0.10461823,0.3176741,0.5300782],"study_design_scores_gemma":[0.0007537743,0.00015471858,0.0061315447,0.00003530146,0.000006041043,0.00007324245,0.0000075918238,0.14260337,0.3516664,0.04833603,0.44934538,0.0008866519],"about_ca_topic_score_codex":0.000005208806,"about_ca_topic_score_gemma":0.0000041220774,"teacher_disagreement_score":0.52919155,"about_ca_system_score_codex":0.000014910332,"about_ca_system_score_gemma":0.000003302929,"threshold_uncertainty_score":0.859832},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013777085,0.000020351054,0.98190737,0.00019117988,0.000066245004,0.00017376362,0.0000035505361,0.0002469173,0.0036135402],"genre_scores_gemma":[0.83197033,0.000053806987,0.16770203,0.0001691298,0.000008323501,0.00001126522,0.000009240498,0.0000037431419,0.00007210728],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99911195,0.000040389183,0.00036104562,0.00014950329,0.00017027213,0.00016686434],"domain_scores_gemma":[0.99927074,0.00004114979,0.00014661092,0.0004388477,0.00006762672,0.000035006025],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013876321,0.00009273732,0.00012785838,0.0002087385,0.000027549278,0.000050593422,0.00048076006,0.00004774966,0.00013439357],"category_scores_gemma":[0.000042460186,0.00008345094,0.000023163431,0.00042724275,0.000026049642,0.0027783795,0.00016239045,0.00008288594,0.00007101954],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003843986,0.000909603,0.003659468,0.00024395496,0.000019045478,0.00002095279,0.006395499,0.014349206,0.034695055,0.44687793,0.0201756,0.47261524],"study_design_scores_gemma":[0.00040716855,0.00009638565,0.0033946666,0.00006313313,0.0000011661085,0.0000051732673,0.000029545301,0.8136578,0.17487489,0.005430928,0.0018389088,0.0002002271],"about_ca_topic_score_codex":0.000032841665,"about_ca_topic_score_gemma":0.000014519959,"teacher_disagreement_score":0.81819326,"about_ca_system_score_codex":0.000041092808,"about_ca_system_score_gemma":0.000014160427,"threshold_uncertainty_score":0.34030306},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0005912982,0.00006241891,0.98986256,0.00019086266,0.000070725204,0.00014852147,0.000007654279,0.00034625287,0.008719707],"genre_scores_gemma":[0.13504446,0.00003644565,0.8644825,0.00010571443,0.000013939896,0.000014736594,0.000008943395,0.000005370369,0.0002878495],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99904174,0.000054968095,0.00026356356,0.00024347135,0.0002352702,0.00016096859],"domain_scores_gemma":[0.9990766,0.00004586735,0.00013677128,0.00060275744,0.000093824034,0.000044177712],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013551186,0.00008306622,0.00010960164,0.000094336785,0.00007240633,0.000032696804,0.00057299755,0.00003354851,0.00075626443],"category_scores_gemma":[0.000014659786,0.00007150401,0.000024325556,0.00028695285,0.000028142904,0.0012159814,0.00039281347,0.000063432955,0.000031031923],"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.0000044423864,0.00016178661,0.00025022065,0.000038961727,0.000008420832,0.0000031854227,0.00025688583,0.000073870855,0.45373258,0.2489537,0.1270183,0.16949762],"study_design_scores_gemma":[0.0005603969,0.00013822202,0.0011356865,0.000055121964,0.000005748878,0.000009189379,0.00005992235,0.18456727,0.77029514,0.020333555,0.022598475,0.00024125847],"about_ca_topic_score_codex":0.000085906744,"about_ca_topic_score_gemma":0.0000021671253,"teacher_disagreement_score":0.31656256,"about_ca_system_score_codex":0.000025020347,"about_ca_system_score_gemma":0.000007958286,"threshold_uncertainty_score":0.8280565},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0006414913,0.00009403201,0.9960815,0.00028020516,0.000043511343,0.00013319968,0.0000020140906,0.00009687548,0.002627211],"genre_scores_gemma":[0.85599905,0.000032359505,0.14347112,0.00032798655,0.000019311692,0.000029150478,8.376588e-7,0.0000027464948,0.00011743332],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996052,0.00002020532,0.00007945209,0.00010419431,0.00010185232,0.00008911387],"domain_scores_gemma":[0.9992254,0.00015671978,0.00003996623,0.00050987385,0.000028315293,0.00003976426],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013938679,0.000044779892,0.00004815253,0.000022413837,0.000048445654,0.000010288359,0.0004577738,0.000015792513,0.000049817347],"category_scores_gemma":[0.00001695359,0.000026413696,0.000008181443,0.00016280898,0.000047384845,0.00023700543,0.0002410276,0.000046481673,0.00002478405],"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":[5.5841144e-7,0.000020780955,0.00015133768,0.0000016855942,0.0000014464456,2.9141502e-8,0.00010447181,5.877492e-7,0.00037174087,0.972472,0.0015041694,0.025371164],"study_design_scores_gemma":[0.00020599859,0.00021333035,0.008986061,0.000045683373,0.000009037573,0.0000107134,0.00011480294,0.015585303,0.37338066,0.4612064,0.13976549,0.00047652007],"about_ca_topic_score_codex":0.000008384271,"about_ca_topic_score_gemma":6.1352944e-7,"teacher_disagreement_score":0.8553575,"about_ca_system_score_codex":0.0000036864521,"about_ca_system_score_gemma":0.000006540202,"threshold_uncertainty_score":0.107711926},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00043611228,0.000022262011,0.98901343,0.00013296402,0.00035528833,0.0003385671,0.000011411866,0.0009068003,0.008783182],"genre_scores_gemma":[0.072905384,0.000023189556,0.9255104,0.00030561595,0.000041236388,0.000069702095,0.000008272312,0.000011691815,0.0011244778],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9989309,0.00003456574,0.00021246808,0.0003879812,0.00018975108,0.00024435093],"domain_scores_gemma":[0.9990056,0.00011573316,0.00006363693,0.0006394862,0.00009891222,0.000076634184],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028857915,0.00011427769,0.00011896505,0.00007899587,0.00012214374,0.00008468381,0.00056284625,0.000060693303,0.00005573269],"category_scores_gemma":[0.00011952823,0.00009910158,0.000048727874,0.00020913876,0.00001821447,0.000837092,0.00014254588,0.000085087544,0.000032598473],"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.000010518568,0.00011716449,0.0002779864,0.0000410769,0.000013689599,0.000008750689,0.00009733468,0.00009046305,0.024227053,0.7638758,0.103965394,0.107274815],"study_design_scores_gemma":[0.00051520014,0.00014334725,0.00007847353,0.000056038432,0.0000044399944,0.000049980797,0.000018574014,0.05914788,0.6357534,0.06515212,0.23877901,0.00030156798],"about_ca_topic_score_codex":0.0000024819792,"about_ca_topic_score_gemma":9.97041e-7,"teacher_disagreement_score":0.6987236,"about_ca_system_score_codex":0.000042599182,"about_ca_system_score_gemma":0.00003299752,"threshold_uncertainty_score":0.4041245},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0042618844,0.000057392645,0.986246,0.0013728957,0.00015318528,0.00020580232,0.0000018911664,0.0011555128,0.0065454496],"genre_scores_gemma":[0.20577,0.000044901288,0.78784835,0.0034297884,0.000042905234,0.000030232934,0.0000030948536,0.0000122696,0.0028184585],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9985932,0.000033282176,0.00021380042,0.00055013143,0.0003224321,0.00028714823],"domain_scores_gemma":[0.9982766,0.00007344278,0.00004635027,0.0012980253,0.0001027446,0.00020284305],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00011236992,0.00014911666,0.00016869254,0.00013776653,0.00018075592,0.000043307224,0.0010916274,0.00005015672,0.00007215038],"category_scores_gemma":[0.00008854626,0.000118725286,0.000043298754,0.00039436738,0.00003596177,0.00080382463,0.00094300485,0.00010768722,0.00034885152],"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.000030480183,0.00021971443,0.00046196577,0.000010244525,0.00000974459,0.0003718269,0.00072583044,0.00013134033,0.087257415,0.057194207,0.6795608,0.17402647],"study_design_scores_gemma":[0.0005262223,0.00035901688,0.0054559335,0.00009104876,0.0000029798402,0.00048113737,0.000016897213,0.009976581,0.41221452,0.020558035,0.5494709,0.0008467498],"about_ca_topic_score_codex":0.000031485793,"about_ca_topic_score_gemma":0.0000044565,"teacher_disagreement_score":0.3249571,"about_ca_system_score_codex":0.00002762453,"about_ca_system_score_gemma":0.000036179194,"threshold_uncertainty_score":0.48414767},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00086856884,0.000045470508,0.9833128,0.00024744144,0.00015442942,0.000062749314,4.9446925e-7,0.00071354257,0.014594537],"genre_scores_gemma":[0.43475515,0.0000032490461,0.5639256,0.00055754575,0.0000074078757,0.000009141224,4.1202554e-7,0.000004193329,0.00073724764],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99936396,0.000042022213,0.00009617353,0.00022123533,0.00012281684,0.00015380306],"domain_scores_gemma":[0.99925303,0.00004386892,0.000025627762,0.000597613,0.000025592119,0.000054271837],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000077089535,0.000068806105,0.000068775305,0.00003960203,0.00004478765,0.000054363285,0.0005415944,0.000021338836,0.000112648326],"category_scores_gemma":[0.00006064737,0.000052827123,0.000024984265,0.0001807254,0.000014805758,0.0005215744,0.00013981461,0.000062886866,0.00008631794],"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":[5.996181e-7,0.000020225028,0.00009023279,0.0000012562034,0.0000012268404,0.0000069516486,0.00001793904,0.0000051554093,0.006394724,0.9725776,0.011203298,0.009680829],"study_design_scores_gemma":[0.00040991377,0.00012829533,0.0016656889,0.000014637124,0.0000020968812,0.000085102314,0.000012780546,0.041120876,0.42979598,0.08388639,0.44233242,0.00054580445],"about_ca_topic_score_codex":0.000003571891,"about_ca_topic_score_gemma":8.108555e-7,"teacher_disagreement_score":0.8886912,"about_ca_system_score_codex":0.000008414004,"about_ca_system_score_gemma":0.000013717837,"threshold_uncertainty_score":0.21542275},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0017280384,0.000014087384,0.9932065,0.00039422154,0.00018085283,0.0018635491,0.00006260486,0.00078254996,0.0017676039],"genre_scores_gemma":[0.07751602,0.0000091440315,0.9208561,0.00048318334,0.000045650886,0.0004617197,0.000008473494,0.00002300079,0.0005967205],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975349,0.00016862336,0.0005275396,0.0008561488,0.0004570224,0.00045580533],"domain_scores_gemma":[0.9974393,0.00069542497,0.00016822739,0.0012952912,0.00020318125,0.00019857996],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003024056,0.00031187144,0.00037926808,0.00015165037,0.00032036516,0.00034936846,0.0010548955,0.000068480396,0.00025699462],"category_scores_gemma":[0.00032518094,0.00024434892,0.000087039676,0.00022823978,0.00007257692,0.0011396725,0.00076392887,0.00022131499,0.0000787969],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005913128,0.008299205,0.00002773403,0.00012190743,0.00007396675,0.017676823,0.0024246853,0.0002852269,0.015360444,0.09696944,0.59398687,0.26418236],"study_design_scores_gemma":[0.018299341,0.010867792,0.00020034533,0.0003147931,0.00008962393,0.0016182853,0.0011490327,0.8397436,0.045819916,0.04573148,0.033454146,0.0027116588],"about_ca_topic_score_codex":0.000041683565,"about_ca_topic_score_gemma":0.000007712294,"teacher_disagreement_score":0.83945835,"about_ca_system_score_codex":0.00008053479,"about_ca_system_score_gemma":0.000031585616,"threshold_uncertainty_score":0.996426},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0052784174,0.00025212514,0.99221987,0.00042049465,0.0000326845,0.00013937995,0.00000431653,0.00047042486,0.0011822928],"genre_scores_gemma":[0.60835946,0.00009861865,0.3910517,0.000273665,0.000012871229,0.000003767382,0.0000013755223,0.00000498367,0.00019359314],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9989588,0.00003196361,0.00028308798,0.00036197188,0.00014371664,0.0002204415],"domain_scores_gemma":[0.9990661,0.000067409856,0.00013829271,0.0005738471,0.000069536305,0.00008478324],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020464548,0.00013288736,0.00022584168,0.00012265403,0.00009556255,0.000090510206,0.0004992214,0.000053816373,0.000008546778],"category_scores_gemma":[0.0000678138,0.0001136971,0.000037734746,0.00015489511,0.000074798416,0.0006636807,0.00038260676,0.00010103677,0.0000018115088],"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.000012441311,0.00007338275,0.00005152218,0.000016899437,0.000006746694,0.000005111371,0.00035615265,0.00002826322,0.49829096,0.008020108,0.0022345972,0.49090382],"study_design_scores_gemma":[0.00022356179,0.00024989457,0.0007271165,0.00006262837,0.000003345466,0.000025836804,0.00004030469,0.07069373,0.9053722,0.021883054,0.00049884396,0.0002194769],"about_ca_topic_score_codex":0.00004402494,"about_ca_topic_score_gemma":0.0000030848566,"teacher_disagreement_score":0.603081,"about_ca_system_score_codex":0.000014241148,"about_ca_system_score_gemma":0.0000177651,"threshold_uncertainty_score":0.4636433},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00031031098,0.000064372856,0.99643266,0.0005889418,0.00034095917,0.00027319495,0.0000051030547,0.00069885957,0.0012855836],"genre_scores_gemma":[0.13497828,0.00003464203,0.8624832,0.00075045135,0.00009369933,0.00007698192,0.000008547912,0.000015000933,0.0015591861],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990944,0.000017650456,0.0001747837,0.0003377016,0.00015377012,0.00022168817],"domain_scores_gemma":[0.9991541,0.00012613817,0.00007070374,0.000495593,0.000097601776,0.000055902176],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00009155632,0.00010983481,0.000111134956,0.00009155178,0.00011866921,0.00011624519,0.0005862708,0.000050537794,0.0002644393],"category_scores_gemma":[0.000113920054,0.00009557679,0.00003739935,0.0002964658,0.000013495302,0.0010053533,0.00022174366,0.00005113827,0.000044965745],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000064988058,0.00014698412,0.00016012591,0.00003607972,0.000013774329,0.000003522196,0.0003154299,0.00044871235,0.013848163,0.6414096,0.16002421,0.18358694],"study_design_scores_gemma":[0.00023458678,0.000054409502,0.0000740015,0.000022542352,0.0000018083881,0.0000028485795,0.000003354674,0.89608335,0.05119703,0.0056209783,0.046503965,0.00020109721],"about_ca_topic_score_codex":0.0000048915545,"about_ca_topic_score_gemma":0.0000020593518,"teacher_disagreement_score":0.89563465,"about_ca_system_score_codex":0.000023923447,"about_ca_system_score_gemma":0.000006014181,"threshold_uncertainty_score":0.38975084},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.001016545,0.00030747819,0.9971433,0.00015095636,0.00008868468,0.0008112049,0.000051754745,0.00010525475,0.0003248051],"genre_scores_gemma":[0.7623032,0.00003086908,0.23739523,0.00010392922,0.000007876056,0.000037744743,0.000014752408,0.000009433808,0.00009697098],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99878764,0.00011277264,0.00030594287,0.00037169587,0.0002864024,0.00013554483],"domain_scores_gemma":[0.9954149,0.0014593542,0.00018555686,0.002836764,0.000072557545,0.000030866755],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036551428,0.00011667128,0.00022691888,0.00005701198,0.00009329385,0.000020601448,0.002858085,0.00003694947,0.000018589353],"category_scores_gemma":[0.00029930827,0.000062939005,0.000027142916,0.0001917289,0.000056257733,0.0003546773,0.0009099169,0.000076289456,0.0000010021002],"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.00039195069,0.008555361,0.0017216284,0.0004883089,0.00037750098,0.00002873442,0.005374091,0.00087329623,0.22845218,0.31741357,0.18816319,0.2481602],"study_design_scores_gemma":[0.0031452158,0.0015990566,0.00050856057,0.00039060632,0.00009444583,0.00006034638,0.0024087094,0.1064193,0.63571876,0.011274914,0.23766637,0.00071372],"about_ca_topic_score_codex":0.00002357507,"about_ca_topic_score_gemma":0.000009712496,"teacher_disagreement_score":0.7612866,"about_ca_system_score_codex":0.000004398272,"about_ca_system_score_gemma":0.00002769219,"threshold_uncertainty_score":0.5311081},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00041225125,0.000064624255,0.9762178,0.0006982948,0.000048254922,0.00012509104,0.0000015263112,0.0010194514,0.021412697],"genre_scores_gemma":[0.3069838,0.00006700899,0.69179344,0.00020688878,0.000016167214,0.000010316851,0.0000023661053,0.000008663569,0.000911343],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990719,0.000028887955,0.00013665676,0.00032084287,0.00024619396,0.00019553343],"domain_scores_gemma":[0.9990381,0.000043659442,0.00007605222,0.000701561,0.00007489796,0.000065713066],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00007026297,0.00011025888,0.000100186444,0.00008993751,0.00010631399,0.00010504763,0.0006362781,0.00003319138,0.00020219975],"category_scores_gemma":[0.000026588934,0.00008153037,0.000015584494,0.00039673253,0.000031647178,0.0013215744,0.00018274142,0.00008502258,0.000088674286],"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.0000016758138,0.000054645305,0.0010187262,0.000008789473,0.0000050681733,0.000021197227,0.00016172884,0.000058343372,0.005542656,0.95462555,0.012292512,0.026209116],"study_design_scores_gemma":[0.0012700476,0.0007501281,0.0016207974,0.0003136528,0.000013033299,0.0001443266,0.00010261561,0.6261379,0.25361955,0.060922083,0.053489145,0.0016166992],"about_ca_topic_score_codex":0.000013668425,"about_ca_topic_score_gemma":0.000005893549,"teacher_disagreement_score":0.89370346,"about_ca_system_score_codex":0.000028179073,"about_ca_system_score_gemma":0.000009085365,"threshold_uncertainty_score":0.33247122},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0024995536,0.00008242754,0.99487007,0.00033215646,0.00004209983,0.00029599998,0.000013706258,0.00079175585,0.0010722214],"genre_scores_gemma":[0.18328011,0.000018544772,0.81622535,0.0001408294,0.000019983821,0.000020073241,0.00001370944,0.000008481711,0.00027293645],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986236,0.00007761337,0.00033231563,0.00037757392,0.00035382985,0.0002350591],"domain_scores_gemma":[0.99879384,0.000048620157,0.0001556653,0.0007215281,0.00020249664,0.000077832396],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025619898,0.00014632047,0.00019423649,0.00009330211,0.00007275566,0.00006770456,0.0011219222,0.000082877836,0.000063509375],"category_scores_gemma":[0.00009063718,0.00012599646,0.00004223024,0.00048652774,0.000055137185,0.0011124522,0.00049422926,0.000099880424,0.000030751584],"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.00006567846,0.0010079537,0.0013918532,0.00006576881,0.000048877853,0.000007809776,0.000282664,0.013014771,0.38456246,0.14549811,0.015355522,0.43869853],"study_design_scores_gemma":[0.0007375243,0.00014486453,0.002965749,0.000085786334,0.0000052188243,0.000009807612,0.000013181894,0.528097,0.4489751,0.0015241404,0.0170814,0.0003602523],"about_ca_topic_score_codex":0.00004222091,"about_ca_topic_score_gemma":0.000031781696,"teacher_disagreement_score":0.51508224,"about_ca_system_score_codex":0.000050143546,"about_ca_system_score_gemma":0.0000377467,"threshold_uncertainty_score":0.51379865},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13928367,0.00021424376,0.8590767,0.00043901455,0.000017448778,0.00023889958,0.000068987676,0.0002467431,0.00041428726],"genre_scores_gemma":[0.8506816,0.00026424543,0.14888467,0.00005504632,0.000006479361,4.014201e-7,0.000029439945,0.0000048627467,0.000073260846],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.99909294,0.000043497796,0.0001242656,0.0003331865,0.00022223551,0.00018386474],"domain_scores_gemma":[0.999393,0.00002521054,0.00010952845,0.00025648953,0.0001019606,0.00011382632],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00011752992,0.000047747682,0.00017790568,0.00004260539,0.0002281061,0.000116451345,0.00050896,0.00007741485,0.000014848091],"category_scores_gemma":[0.000008080797,0.00014304818,0.00004761542,0.00021602225,0.00011092375,0.0018828049,0.00007326642,0.0001230838,0.000002249852],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004737596,0.000059436083,0.00001738819,0.00002656627,0.0000034564036,0.000050537536,0.0002882743,5.1298673e-7,0.008633637,0.000024510407,0.0030926906,0.9877983],"study_design_scores_gemma":[0.007516817,0.0019010437,0.8024879,0.0027004264,0.00008928933,0.000896699,0.0016262989,0.13521533,0.0062801186,0.020958683,0.018101878,0.0022255264],"about_ca_topic_score_codex":0.001233496,"about_ca_topic_score_gemma":0.0003699323,"teacher_disagreement_score":0.98557276,"about_ca_system_score_codex":0.000026442489,"about_ca_system_score_gemma":0.0000237436,"threshold_uncertainty_score":0.58333355},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00088053773,0.00004243375,0.99590045,0.0016756178,0.00012538915,0.00031031828,0.000007812495,0.000626482,0.00043093436],"genre_scores_gemma":[0.5558692,0.0000013275065,0.438872,0.005004839,0.00014134264,0.000068864254,0.000013093312,0.000019202871,0.000010070641],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9987167,0.000030723513,0.00026614006,0.00043676345,0.0002503642,0.0002993007],"domain_scores_gemma":[0.9992683,0.00009375758,0.00019540297,0.00023812302,0.00013882754,0.000065621316],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001929106,0.00016515542,0.00015847497,0.00011704225,0.00029739083,0.00023299646,0.00065222854,0.000048521564,0.0000024712813],"category_scores_gemma":[0.000026236328,0.00016378106,0.00004952338,0.00022148978,0.00008523061,0.0012057357,0.00008804383,0.0001248575,0.000007798672],"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.000048324848,0.00015748278,0.000019965079,0.0002450556,0.000019369869,0.000040989962,0.001599732,0.013436096,0.65753496,0.10683762,0.002323294,0.21773714],"study_design_scores_gemma":[0.0014398034,0.00019875911,0.000039210558,0.0009530728,0.000015397878,0.000040211627,0.000052753287,0.04704998,0.8802497,0.056712948,0.012489293,0.00075889594],"about_ca_topic_score_codex":0.0000044920007,"about_ca_topic_score_gemma":8.3714815e-7,"teacher_disagreement_score":0.5570285,"about_ca_system_score_codex":0.00009539297,"about_ca_system_score_gemma":0.00009558343,"threshold_uncertainty_score":0.66787976},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.050186228,0.00013082326,0.9485444,0.00006395674,0.0002773097,0.0002378308,0.0000073629158,0.00047697782,0.000075156284],"genre_scores_gemma":[0.7947347,0.000009767965,0.20505266,0.000039833023,0.000028403745,0.00004681792,0.0000048335046,0.00002288663,0.000060093287],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.998188,0.00012702776,0.00045083335,0.00041720129,0.00045045328,0.00036644828],"domain_scores_gemma":[0.998666,0.000069754125,0.0003206147,0.0005537744,0.00023335722,0.00015648805],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041320475,0.00023620231,0.0002240727,0.00032027627,0.00032276777,0.0001500766,0.00048063594,0.000107148284,0.00002040149],"category_scores_gemma":[0.000022394523,0.00022525199,0.00008324369,0.0006535545,0.00010983886,0.0018267173,0.000014248391,0.0002710896,0.000019358382],"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.00006800116,0.0010107706,0.000029840328,0.00017962989,0.000018252555,0.0000026506789,0.004594857,0.054282974,0.25744632,0.000116338364,0.00006607403,0.6821843],"study_design_scores_gemma":[0.00029309638,0.0000707347,0.000104369654,0.0001726621,0.000019051125,0.000014353336,0.00016954693,0.15892188,0.83974195,0.00015242757,0.000084831365,0.00025508343],"about_ca_topic_score_codex":0.000009089929,"about_ca_topic_score_gemma":0.0000014496422,"teacher_disagreement_score":0.7445485,"about_ca_system_score_codex":0.00014667073,"about_ca_system_score_gemma":0.00008270196,"threshold_uncertainty_score":0.91855097},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003972233,0.0004922808,0.9912737,0.00045215944,0.00008123383,0.0002180804,0.0000033631177,0.0010790641,0.0024278725],"genre_scores_gemma":[0.013778414,0.00061819307,0.9842663,0.0007862663,0.00003693564,0.0000184307,0.000012091412,0.000012792775,0.00047058484],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984892,0.00009835282,0.00027769268,0.0005563287,0.00029723207,0.00028118194],"domain_scores_gemma":[0.99872565,0.000190105,0.000107567656,0.00073201786,0.00013050213,0.00011415818],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00010789228,0.00020081595,0.00027278197,0.0001399933,0.0002996106,0.000092814014,0.00077688514,0.000098506236,0.000028280007],"category_scores_gemma":[0.00012641553,0.00015077129,0.00004348669,0.0006460841,0.00012312508,0.0011662944,0.00094321044,0.00023599241,0.000015426052],"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.0001757034,0.00073611125,0.0005872069,0.00009056434,0.00010430487,0.00084351253,0.0026381172,0.0016723037,0.51656634,0.03202921,0.34609172,0.098464906],"study_design_scores_gemma":[0.002290247,0.00018473677,0.0031581335,0.00012527598,0.000007208497,0.00058569445,0.000041256615,0.55356354,0.38947737,0.007819976,0.04169173,0.0010548295],"about_ca_topic_score_codex":0.000032608175,"about_ca_topic_score_gemma":2.0983941e-7,"teacher_disagreement_score":0.55189127,"about_ca_system_score_codex":0.000018889194,"about_ca_system_score_gemma":0.000030066192,"threshold_uncertainty_score":0.6148275},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000673286,0.00008277229,0.97411484,0.00085441244,0.000091819216,0.0003325004,0.000007825007,0.0009214906,0.023527019],"genre_scores_gemma":[0.016983822,0.000021913816,0.9710179,0.0008650872,0.00004933643,0.00006386498,0.0000033479434,0.0000142779645,0.010980442],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998855,0.0000317535,0.00017565906,0.00038841148,0.00023464233,0.00031451933],"domain_scores_gemma":[0.99878794,0.00021422312,0.000047202364,0.00078014453,0.000072227675,0.00009824173],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017963513,0.000116859046,0.0001279097,0.00008576882,0.00015014646,0.00012527814,0.0011287363,0.000043715903,0.00021350398],"category_scores_gemma":[0.000057109453,0.000097178425,0.000051755265,0.00012771257,0.000032051823,0.0006952684,0.0004953786,0.00011878235,0.00012778956],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000036458423,0.00007640375,0.000029003095,0.00001833365,0.0000073009282,0.000011617405,0.0002054268,0.000026106356,0.0054853433,0.20988841,0.19166769,0.59258074],"study_design_scores_gemma":[0.00033524982,0.00008853613,0.000020361129,0.000028071201,0.000001988171,0.00002461895,0.0000097131915,0.43557087,0.17507441,0.046830196,0.34172302,0.00029295366],"about_ca_topic_score_codex":0.0000076221486,"about_ca_topic_score_gemma":0.0000032316475,"teacher_disagreement_score":0.5922878,"about_ca_system_score_codex":0.000025977592,"about_ca_system_score_gemma":0.000009899706,"threshold_uncertainty_score":0.3962821},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019845162,0.000037899877,0.97862685,0.00037040527,0.00013453641,0.00039670544,0.0000051712004,0.0005119349,0.00007134795],"genre_scores_gemma":[0.7273758,0.00001827137,0.27220184,0.00020467334,0.000028533941,0.00008131371,0.000010960523,0.000010189189,0.00006842223],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989388,0.00008483853,0.00017230521,0.00041625754,0.00020875718,0.000179064],"domain_scores_gemma":[0.99911904,0.0000733807,0.00013870977,0.00050072063,0.00011038605,0.0000577484],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014627803,0.00013287367,0.0001234847,0.00013241915,0.00030665923,0.000078195255,0.00029411324,0.0001218264,0.000004386699],"category_scores_gemma":[0.00029218834,0.00012187838,0.000023507768,0.00036726,0.000040107618,0.0009182897,0.00010206935,0.00021613618,0.000006607632],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007869113,0.0012998239,0.02643812,0.0003457729,0.0000396946,0.000118297074,0.0020069804,0.009564211,0.56065863,0.05186152,0.006921521,0.33995852],"study_design_scores_gemma":[0.0004814557,0.0003135466,0.015305137,0.00017006684,0.0000029164542,0.000014532798,0.00000765552,0.8862596,0.08614817,0.0066134487,0.0043938598,0.00028957913],"about_ca_topic_score_codex":0.000078640995,"about_ca_topic_score_gemma":0.000005361096,"teacher_disagreement_score":0.8766954,"about_ca_system_score_codex":0.00005382475,"about_ca_system_score_gemma":0.00003965612,"threshold_uncertainty_score":0.4970056},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015184451,0.000013253751,0.9829541,0.0006798936,0.000088540495,0.00053552364,0.000013068697,0.00029366158,0.00023753708],"genre_scores_gemma":[0.5004526,0.0000017572659,0.49920306,0.00029371856,0.000019355568,0.0000060540197,0.000006416048,0.0000043335085,0.000012719825],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9986001,0.00007544729,0.0003486232,0.0004305848,0.00033392664,0.00021130119],"domain_scores_gemma":[0.9984122,0.00009332757,0.00019900598,0.0010984833,0.0001233609,0.00007363688],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020482077,0.00015647129,0.00019665621,0.00010398162,0.00015575926,0.000081537604,0.0011813638,0.000053401534,0.000013011138],"category_scores_gemma":[0.00007576489,0.00011326274,0.00004937065,0.0006103762,0.00005584261,0.00046799844,0.00022971652,0.00010389183,0.0000057385614],"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.000027581116,0.00008004439,0.00014369881,0.000021909604,0.0000095154855,0.0000035375951,0.00074952946,0.008591902,0.55857015,0.09556045,0.000661976,0.33557972],"study_design_scores_gemma":[0.00014580187,0.00004977873,0.0020978171,0.000031836164,0.000004779494,0.000008261536,0.000032434582,0.31463253,0.67167664,0.010455846,0.0006658328,0.0001984303],"about_ca_topic_score_codex":0.00007951789,"about_ca_topic_score_gemma":0.00005173235,"teacher_disagreement_score":0.48526815,"about_ca_system_score_codex":0.000058136477,"about_ca_system_score_gemma":0.000026041753,"threshold_uncertainty_score":0.46187204},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00050889305,0.000018239914,0.99715275,0.0005128318,0.00018321296,0.00024221934,0.00005149638,0.0009784262,0.0003519161],"genre_scores_gemma":[0.7086099,0.0000043158952,0.2909441,0.00017869087,0.00005234523,0.000069798545,0.00002748025,0.00002607219,0.000087310196],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981554,0.00010778956,0.0002959265,0.00057311077,0.0005285883,0.00033919557],"domain_scores_gemma":[0.9989823,0.000093260394,0.000102639926,0.00053789874,0.0002032781,0.00008061124],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019924046,0.00021734128,0.00015699782,0.00031888796,0.0005553444,0.00046184545,0.00046838142,0.00008370086,0.00003351283],"category_scores_gemma":[0.0000070116434,0.00021384424,0.00006376211,0.00078249356,0.00008479251,0.0016308514,0.000004692368,0.0003274406,0.0000666079],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008474347,0.0009153065,0.000018309154,0.0001578259,0.000006923006,0.000040331746,0.00022581156,0.21914898,0.09057153,0.00045574736,0.0007706651,0.68760383],"study_design_scores_gemma":[0.00023157115,0.00009019293,0.00008692602,0.00014176637,0.000004552776,0.000004647694,0.000010213673,0.6299066,0.36878335,0.00033247395,0.00022800973,0.00017972129],"about_ca_topic_score_codex":0.000045328467,"about_ca_topic_score_gemma":0.000010650458,"teacher_disagreement_score":0.708101,"about_ca_system_score_codex":0.00011187762,"about_ca_system_score_gemma":0.00011415078,"threshold_uncertainty_score":0.8720315},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00057127315,0.000022036322,0.98943394,0.00077418995,0.00004224708,0.00020850965,0.000003917575,0.00046137592,0.008482501],"genre_scores_gemma":[0.49538186,0.000016314349,0.5039273,0.00045911747,0.000010166478,0.000026723132,0.0000051610773,0.000005228796,0.00016812836],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99909145,0.00006687201,0.00014303837,0.00035550192,0.00022476463,0.00011836642],"domain_scores_gemma":[0.9992107,0.00011149373,0.000084022264,0.00048174814,0.00004786034,0.000064172935],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000073115894,0.000106449756,0.00008280146,0.000103242186,0.00011348389,0.000081741426,0.00030167558,0.000038639268,0.00006202575],"category_scores_gemma":[0.000016165319,0.0000866996,0.000016309394,0.00014077403,0.000037844336,0.00069183565,0.00012220826,0.0000877714,0.00004567924],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000041066018,0.00053079636,0.00025618705,0.000021787811,0.000007619807,0.00001300463,0.00030611968,0.000433653,0.2672375,0.05169148,0.059887867,0.6195729],"study_design_scores_gemma":[0.00024913723,0.00011533339,0.0011221503,0.00003063426,0.0000014026898,0.0000020725358,0.000016649261,0.9225039,0.07370866,0.001084879,0.0010492062,0.000115972354],"about_ca_topic_score_codex":0.0000033063525,"about_ca_topic_score_gemma":4.3765834e-7,"teacher_disagreement_score":0.92207026,"about_ca_system_score_codex":0.000030477908,"about_ca_system_score_gemma":0.0000041105386,"threshold_uncertainty_score":0.3535507},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.052752733,0.00032842517,0.93815434,0.0019460756,0.00022947203,0.000547605,0.000008365063,0.0004498347,0.0055831214],"genre_scores_gemma":[0.9592129,0.00010428655,0.04020208,0.00012684219,0.000010827426,0.000019147354,0.0000013052178,0.000010031023,0.00031259467],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9986617,0.00011429197,0.00031005577,0.00037935647,0.00026935674,0.00026521945],"domain_scores_gemma":[0.9988867,0.00010631407,0.00018000774,0.0007393892,0.000049767492,0.00003780433],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001438297,0.00013535343,0.00016770388,0.0001273952,0.00011104913,0.000032734642,0.0011130398,0.000058195754,0.0001647061],"category_scores_gemma":[0.000081162034,0.00009898002,0.000053945998,0.00096034346,0.000055637032,0.00063748856,0.00055074313,0.00018737475,0.00003045146],"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.000013374427,0.00035239212,0.021943692,0.00005203013,0.000027098215,0.000014642546,0.0016797628,0.00013417592,0.42565992,0.5291723,0.01175945,0.009191182],"study_design_scores_gemma":[0.00028899187,0.0000706141,0.021291394,0.000108247856,0.000003094549,0.000012202782,0.000009325476,0.057519566,0.89231396,0.027873868,0.00028824617,0.00022048775],"about_ca_topic_score_codex":0.00009937534,"about_ca_topic_score_gemma":0.00014120198,"teacher_disagreement_score":0.90646017,"about_ca_system_score_codex":0.00023196956,"about_ca_system_score_gemma":0.000026576354,"threshold_uncertainty_score":0.4036288},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08472532,0.000082941704,0.9140314,0.00007973069,0.000060368984,0.000105981955,0.0000013086404,0.00019721882,0.00071574876],"genre_scores_gemma":[0.5073835,0.000023165241,0.49247926,0.00006094358,0.000003931861,0.0000012976715,7.167715e-7,0.0000044635367,0.000042706473],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992237,0.000022549912,0.00020335738,0.00025354183,0.0001553567,0.00014151324],"domain_scores_gemma":[0.9993078,0.00006978667,0.00011983265,0.00039812239,0.000054602653,0.000049873375],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00008018381,0.00008953195,0.00013316137,0.00009975316,0.000064019456,0.000077647426,0.00031374692,0.000045762634,0.000021720884],"category_scores_gemma":[0.000026715585,0.00008136907,0.000020149502,0.0002673139,0.00005374285,0.00090935733,0.00027364914,0.000058572976,0.000003990782],"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.000023545132,0.00034606806,0.0023361647,0.00010104175,0.000022227126,0.000008226726,0.0010296303,0.002872354,0.791436,0.09364308,0.0022005227,0.10598114],"study_design_scores_gemma":[0.00030929048,0.000061614446,0.00008714616,0.00008097015,0.000003926499,0.000010700846,0.000021852584,0.53144747,0.4642841,0.0030432479,0.00048428588,0.00016541821],"about_ca_topic_score_codex":0.00003538402,"about_ca_topic_score_gemma":0.0000012919671,"teacher_disagreement_score":0.5285751,"about_ca_system_score_codex":0.000019699128,"about_ca_system_score_gemma":0.000004116276,"threshold_uncertainty_score":0.33181345},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00038855986,0.000026048614,0.9907177,0.000060807542,0.00007521552,0.00007474796,0.000001859766,0.00089242915,0.007762596],"genre_scores_gemma":[0.06324559,0.000017210057,0.93501085,0.0006815105,0.000008847007,0.00000598396,0.000017722754,0.000006538324,0.0010057616],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9993708,0.000045947967,0.00012391261,0.00021212215,0.00012923726,0.000117989206],"domain_scores_gemma":[0.99936795,0.000027587745,0.00003885895,0.0004633172,0.00005939859,0.00004286239],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00007448699,0.000067593086,0.00006484231,0.00006108833,0.000044837656,0.00004074288,0.00037393073,0.000029799998,0.00009866402],"category_scores_gemma":[0.000079122,0.000055795383,0.0000135577675,0.00032429534,0.000010570719,0.0005426685,0.00011198843,0.00004038307,0.000031968204],"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":[7.550525e-7,0.000098749064,0.00014455648,0.0000025703732,0.0000023245616,0.0000031263694,0.000026431118,0.000034146735,0.00597609,0.95569307,0.0067747585,0.031243445],"study_design_scores_gemma":[0.00044437897,0.00011881754,0.0006154637,0.0000323124,0.0000028387344,0.000025530051,0.000014986953,0.15438001,0.3745621,0.062267747,0.40708375,0.00045204174],"about_ca_topic_score_codex":0.0000035137473,"about_ca_topic_score_gemma":0.0000018907037,"teacher_disagreement_score":0.8934253,"about_ca_system_score_codex":0.000014782668,"about_ca_system_score_gemma":0.000017849003,"threshold_uncertainty_score":0.22752696},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2260233,0.00007046779,0.77200085,0.00045765482,0.00026929384,0.00022836693,0.000070209804,0.000121993406,0.00075786613],"genre_scores_gemma":[0.9227473,0.00010732926,0.076941065,0.00007245711,0.000050631945,0.000004358606,0.000015005642,0.000014674362,0.00004718608],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9968903,0.000024235334,0.00065426744,0.0006310336,0.0015595908,0.000240571],"domain_scores_gemma":[0.9971562,0.00012218366,0.000793458,0.0003543833,0.0014508388,0.00012291614],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00053344376,0.00024487267,0.0003548926,0.00032603065,0.00028902656,0.00015810248,0.0035826662,0.00013280855,0.000034181783],"category_scores_gemma":[0.00040076757,0.00018455832,0.000052132873,0.00045175644,0.0006469336,0.00063898886,0.0013779707,0.00042984536,0.0000018559114],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021004594,0.0009341109,0.0011280996,0.00055594416,0.00006497978,0.000022227325,0.0005740214,0.00073491724,0.77431875,0.009877738,0.0011075063,0.21047166],"study_design_scores_gemma":[0.0004014719,0.00006761175,0.0011269163,0.00095062185,0.000014303624,0.00008732492,0.00008324876,0.9459829,0.048360646,0.0027221157,0.0000138516225,0.00018903411],"about_ca_topic_score_codex":0.00002113939,"about_ca_topic_score_gemma":6.60074e-7,"teacher_disagreement_score":0.94524795,"about_ca_system_score_codex":0.00006300708,"about_ca_system_score_gemma":0.00019212307,"threshold_uncertainty_score":0.7526069},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03283088,0.00020483405,0.9635871,0.0005429654,0.00010922991,0.00024157844,0.00001859746,0.0006816773,0.001783155],"genre_scores_gemma":[0.4797451,0.00011232943,0.51976436,0.00018309618,0.000019701136,0.000004463881,0.0000032438716,0.000009703218,0.0001579811],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9980791,0.00010536235,0.00041342044,0.00058272475,0.00044764925,0.0003717468],"domain_scores_gemma":[0.99869066,0.00013325328,0.00012209226,0.00079944514,0.00008450337,0.00017002442],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024324501,0.00024043565,0.00030109126,0.000121704856,0.00027039862,0.00021722593,0.0008138058,0.00008550448,0.00030830802],"category_scores_gemma":[0.00003377185,0.00018906921,0.00005532324,0.00016445295,0.000111312285,0.0018063298,0.0005818676,0.00020466374,0.000016883614],"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.000030240772,0.00048880064,0.0006672958,0.00017628532,0.00003911596,0.0000890461,0.001836061,0.0000724986,0.40519175,0.09612663,0.008092523,0.48718974],"study_design_scores_gemma":[0.0011571036,0.00015826024,0.003460518,0.00020882026,0.000015447338,0.00019305402,0.000116237024,0.3199736,0.62406135,0.043579027,0.0060076006,0.001069014],"about_ca_topic_score_codex":0.00015756467,"about_ca_topic_score_gemma":0.000020141282,"teacher_disagreement_score":0.48612073,"about_ca_system_score_codex":0.000054747965,"about_ca_system_score_gemma":0.000012934786,"threshold_uncertainty_score":0.7710019},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013160073,0.00036993308,0.98494595,0.00031360646,0.0001168196,0.0002685749,0.000024311876,0.00041706595,0.00038368654],"genre_scores_gemma":[0.6896525,0.000023141147,0.30959168,0.0003976809,0.000027808233,0.000017362046,0.0000013062228,0.0000122932515,0.0002762214],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99863267,0.000036031488,0.00028880173,0.00047352555,0.0002839237,0.00028505526],"domain_scores_gemma":[0.9990664,0.000051751478,0.00012417026,0.0004901901,0.00010446075,0.00016301431],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017175481,0.00020623,0.000257196,0.00021701772,0.00018234256,0.00011095782,0.00051148294,0.0000840825,0.000024225148],"category_scores_gemma":[0.000012148434,0.00018658319,0.000052581592,0.0004201016,0.000047114503,0.00063127425,0.000008774771,0.00021984351,0.0000049951263],"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.00002662845,0.00009288141,5.3471507e-7,0.000038166814,0.0000041958147,0.0000134766215,0.0004947321,0.0008938921,0.10182213,0.000023654653,0.00008044332,0.8965093],"study_design_scores_gemma":[0.00035443244,0.0002972517,0.000028008219,0.00024130238,0.000013215105,0.000047006422,0.00012034692,0.08319601,0.91490334,0.00019611622,0.00030367894,0.00029927684],"about_ca_topic_score_codex":0.000008898847,"about_ca_topic_score_gemma":0.000007990216,"teacher_disagreement_score":0.89621,"about_ca_system_score_codex":0.000034774115,"about_ca_system_score_gemma":0.000061447216,"threshold_uncertainty_score":0.76086414},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00069637364,0.00009890232,0.9976715,0.000054548116,0.00008311285,0.00036236635,0.000027106906,0.00042966797,0.00057646225],"genre_scores_gemma":[0.10513444,0.00004254722,0.8944849,0.00009392399,0.000032599415,0.000041781288,0.000008498761,0.000008872832,0.00015246242],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987668,0.000050951414,0.0002726319,0.0004251582,0.00027490963,0.0002095741],"domain_scores_gemma":[0.9986118,0.000125258,0.00015873749,0.0008091986,0.00020685913,0.00008810955],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014391,0.00013349376,0.00019033557,0.00010646417,0.000086777356,0.000029538221,0.0010192142,0.00006791524,0.00008581101],"category_scores_gemma":[0.000020723583,0.00011203795,0.000047534275,0.00024950618,0.000053714804,0.0011409877,0.00022338836,0.000083682884,0.00001158338],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005346326,0.0001592336,0.000005309856,0.000005221493,0.0000026976752,0.0000018558259,0.00007440583,0.000040137016,0.04186022,0.003728633,0.0039876145,0.95012933],"study_design_scores_gemma":[0.00017247714,0.00033456567,0.000037402682,0.000032787553,0.0000015096083,0.000006170324,0.000019747975,0.6188251,0.37482917,0.0043053534,0.0013229117,0.000112822185],"about_ca_topic_score_codex":0.000022191352,"about_ca_topic_score_gemma":0.0000010851154,"teacher_disagreement_score":0.9500165,"about_ca_system_score_codex":0.000022223332,"about_ca_system_score_gemma":0.000008439385,"threshold_uncertainty_score":0.45687753},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0020493087,0.00018511293,0.99576724,0.0001394519,0.0001576899,0.00020545299,0.000050911494,0.0006561596,0.0007886792],"genre_scores_gemma":[0.63947445,0.000012352463,0.3601928,0.00004843238,0.000019309087,0.000039776376,0.000003837505,0.000018222228,0.00019080703],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9983192,0.00006542793,0.000438461,0.0004866053,0.0003969851,0.00029331478],"domain_scores_gemma":[0.998734,0.000100772115,0.00025221857,0.0006197681,0.00022771201,0.00006552742],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013986375,0.00022619529,0.00027079752,0.00025812598,0.00031772963,0.00016308979,0.00085231813,0.00008313718,0.000023204166],"category_scores_gemma":[0.000004987919,0.00020604048,0.000087077446,0.0005731596,0.00018274355,0.0018113231,0.0000133360045,0.0002695593,0.000015179095],"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.000046500285,0.0006209322,0.000011162667,0.00019011434,0.000008138526,0.000020193616,0.00010735618,0.0049269856,0.6924867,0.0002808611,0.0018675267,0.29943353],"study_design_scores_gemma":[0.00033367338,0.00006193418,0.00006823812,0.00026916031,0.000010344713,0.000017645583,0.000015237924,0.049326092,0.9470801,0.00213744,0.00045437584,0.0002258076],"about_ca_topic_score_codex":0.00004131548,"about_ca_topic_score_gemma":0.000003335069,"teacher_disagreement_score":0.6374251,"about_ca_system_score_codex":0.00005077527,"about_ca_system_score_gemma":0.0000762675,"threshold_uncertainty_score":0.8402087},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0003889014,0.000062714615,0.96547276,0.0031774724,0.000083208884,0.000074742435,0.0000022705208,0.0021116487,0.02862627],"genre_scores_gemma":[0.04991355,0.000022251705,0.9429227,0.0014798405,0.00013801525,0.000009426811,0.000010219375,0.000008446461,0.0054955343],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99930954,0.000028262848,0.00008734565,0.00029072873,0.00014095032,0.00014314703],"domain_scores_gemma":[0.9990978,0.000018026758,0.000042829633,0.000740094,0.000012795294,0.000088429406],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0000448147,0.00008541292,0.00006686311,0.00006522472,0.0000680683,0.00014619213,0.0008092882,0.00005717695,0.00021285213],"category_scores_gemma":[0.000006424164,0.00006903885,0.000022152826,0.0001830063,0.000011988922,0.007547045,0.00025445392,0.00013470725,0.00009775837],"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.0000033942295,0.00007275025,0.00007564903,0.0000016982926,0.0000017656138,0.0000056631925,0.00005203459,0.000044640514,0.007558896,0.1110922,0.21444415,0.66664714],"study_design_scores_gemma":[0.000071588234,0.000040599738,0.0012108717,0.0000066095326,6.796516e-7,0.000027808674,0.0000049727882,0.01947409,0.15341073,0.005277658,0.82033026,0.00014409525],"about_ca_topic_score_codex":0.000001875334,"about_ca_topic_score_gemma":0.0000022195582,"teacher_disagreement_score":0.6665031,"about_ca_system_score_codex":0.000011471497,"about_ca_system_score_gemma":0.000015621541,"threshold_uncertainty_score":0.54714257},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00011056492,0.00003556243,0.9935019,0.004100967,0.00039651673,0.0006315402,0.0001439017,0.0007808181,0.00029821385],"genre_scores_gemma":[0.71409583,0.0002306905,0.2842599,0.00051546365,0.000011695841,0.0005952401,0.000031455234,0.000024245755,0.00023550157],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988189,0.000084007275,0.00030958766,0.00035321628,0.00019976574,0.00023454451],"domain_scores_gemma":[0.99570256,0.0008542189,0.0001238717,0.0030624897,0.00016678244,0.000090047375],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015802059,0.00018045279,0.00015781818,0.0002755392,0.00072866364,0.000113365895,0.0021168801,0.00007075172,0.000008004372],"category_scores_gemma":[0.00003956674,0.00018450785,0.00010923234,0.00055522815,0.00008825112,0.000613522,0.000017920394,0.00028945896,0.0000809263],"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.00007099638,0.0018481578,3.892913e-7,0.000026761769,0.000056500492,0.0000022465715,0.001221372,0.5860986,0.004716876,0.32943636,0.0011629955,0.07535875],"study_design_scores_gemma":[0.0023254596,0.0011157898,0.000020255835,0.00039489235,0.000036722242,0.000015010619,0.000041760784,0.34603447,0.33753282,0.27827874,0.03323618,0.00096789235],"about_ca_topic_score_codex":0.000025296706,"about_ca_topic_score_gemma":0.0000467325,"teacher_disagreement_score":0.71398526,"about_ca_system_score_codex":0.00012467564,"about_ca_system_score_gemma":0.000080790946,"threshold_uncertainty_score":0.7524012},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.027919374,0.000022244349,0.9702399,0.000074296506,0.00003449947,0.0010073604,0.00015195181,0.00036115703,0.00018924718],"genre_scores_gemma":[0.3248413,0.000007386506,0.6744008,0.000057309106,0.000017235501,0.0005621361,0.00006974381,0.000008858065,0.000035226203],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99889696,0.00003067919,0.00030016043,0.0003643407,0.00021343865,0.00019444012],"domain_scores_gemma":[0.99868274,0.000056507655,0.00016173211,0.0008078723,0.0002128652,0.00007828399],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00009644432,0.00011254643,0.00015972988,0.00009125804,0.00018934709,0.00002408381,0.00085133227,0.000029114863,0.000030353585],"category_scores_gemma":[0.000005160972,0.00010330783,0.00004687852,0.00020001225,0.000068082314,0.00035532776,0.00022403576,0.000046345674,0.0000055292294],"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.000018154988,0.00060339324,0.0001135341,0.00012157351,0.000020733854,0.0000036766671,0.00094147597,0.000644403,0.7923889,0.093500264,0.006628127,0.10501573],"study_design_scores_gemma":[0.00047907015,0.00009653657,0.00035177902,0.000006993783,0.0000032812668,0.000007298838,0.00008667346,0.07312656,0.9211081,0.0011462251,0.003452249,0.00013522535],"about_ca_topic_score_codex":0.00006329786,"about_ca_topic_score_gemma":0.0000069672824,"teacher_disagreement_score":0.2969219,"about_ca_system_score_codex":0.000026385598,"about_ca_system_score_gemma":0.000052925745,"threshold_uncertainty_score":0.4212771},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.040857743,0.000044266435,0.95775074,0.00010097564,0.00010564415,0.0003570791,0.00004272868,0.00040516496,0.0003356517],"genre_scores_gemma":[0.36236796,0.000014360441,0.63706815,0.00035335205,0.00002768997,0.000045327524,0.000012635287,0.000009761813,0.00010074802],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99873704,0.000025429033,0.0003139271,0.00041139676,0.00026627973,0.00024593063],"domain_scores_gemma":[0.9984826,0.0002402347,0.00011943077,0.00082851015,0.000251599,0.00007762198],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00010355518,0.00015229803,0.00021215815,0.0000845867,0.00016508141,0.00006799473,0.0009100574,0.00012144723,0.00007004692],"category_scores_gemma":[0.000042835858,0.00012881406,0.0000791906,0.00023395475,0.00010426828,0.0014252622,0.00039871273,0.00011422571,0.0000100290645],"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.0006655136,0.0023806326,0.031733964,0.0010045392,0.00017811543,0.00008432494,0.006011048,0.008017685,0.2754156,0.61920965,0.017197305,0.038101643],"study_design_scores_gemma":[0.0010077602,0.00026199556,0.01201939,0.00024704132,0.000009261705,0.000043762124,0.00002758656,0.5258775,0.4323293,0.023984915,0.0036891275,0.0005023736],"about_ca_topic_score_codex":0.00004882226,"about_ca_topic_score_gemma":0.0000056479466,"teacher_disagreement_score":0.5952247,"about_ca_system_score_codex":0.000024166064,"about_ca_system_score_gemma":0.000026359075,"threshold_uncertainty_score":0.5252885},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013296899,0.000041500552,0.9798013,0.0051440406,0.00012711546,0.0002092969,0.0000048119723,0.001319632,0.000055414126],"genre_scores_gemma":[0.59331864,0.000001046337,0.40345156,0.0031140237,0.00006348545,0.000024439454,0.000004742542,0.000018173263,0.0000039116653],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9977853,0.000104465566,0.00039018327,0.000725214,0.000516747,0.00047812832],"domain_scores_gemma":[0.998729,0.0001121943,0.000280183,0.0006180741,0.000115061725,0.0001455136],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00031091872,0.00028700812,0.00024407098,0.00019066856,0.00035256526,0.0003470558,0.0012424432,0.00008194638,0.0000045897027],"category_scores_gemma":[0.00003760989,0.0002718681,0.00009365956,0.00044812867,0.00018646459,0.0018609936,0.00013377615,0.00033255242,0.000031885756],"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.000022065693,0.000116707655,0.00004408892,0.0001008656,0.0000047716553,0.00011838863,0.00033906387,0.0044119465,0.9092506,0.00038724378,0.00093965867,0.08426456],"study_design_scores_gemma":[0.0012049603,0.00005099423,0.00016230787,0.0005239891,0.000007510892,0.000023342505,0.000016439375,0.11595458,0.87828314,0.0024381478,0.00071212155,0.0006224504],"about_ca_topic_score_codex":0.000057780017,"about_ca_topic_score_gemma":0.000002884417,"teacher_disagreement_score":0.58002174,"about_ca_system_score_codex":0.00018509805,"about_ca_system_score_gemma":0.00013020054,"threshold_uncertainty_score":0.99997336},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20334871,0.00019386878,0.7955767,0.000069145746,0.00008992409,0.00027205964,0.0000021053595,0.0004131946,0.000034300774],"genre_scores_gemma":[0.65259296,0.0000881057,0.34706524,0.00020372003,0.000019962574,0.0000046029377,0.000005225116,0.000008985952,0.000011212617],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99802077,0.000091309455,0.00051045994,0.0006287242,0.00021217101,0.0005365639],"domain_scores_gemma":[0.9988008,0.0002539004,0.00020025771,0.0005407019,0.00006683746,0.0001374988],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043837965,0.0002232062,0.00027155518,0.00019334351,0.00018273332,0.00021901961,0.0004980372,0.00011347272,0.0000046683613],"category_scores_gemma":[0.00021519717,0.00021290629,0.000038072485,0.00038699264,0.000044232027,0.0018714812,0.00042550228,0.00026860178,0.0000016865611],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003833381,0.00016327373,0.022679433,0.000018008648,0.0000044355147,0.00008151981,0.00059096137,0.0039026293,0.13735515,0.001765438,0.00016111888,0.83323973],"study_design_scores_gemma":[0.00057915587,0.00005194396,0.0059480667,0.00014951617,0.000002219948,0.000025510759,0.00007431447,0.9823307,0.009737325,0.0006590394,0.00017072534,0.00027152046],"about_ca_topic_score_codex":0.00004088904,"about_ca_topic_score_gemma":0.00006603682,"teacher_disagreement_score":0.978428,"about_ca_system_score_codex":0.00009284521,"about_ca_system_score_gemma":0.00002082639,"threshold_uncertainty_score":0.8682067},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00049332826,0.000004518988,0.994162,0.0015873626,0.00012784432,0.0005968398,0.000009715109,0.00071772165,0.002300661],"genre_scores_gemma":[0.045616187,6.114827e-7,0.9521029,0.0005027431,0.00006334421,0.00007590092,0.0000105928575,0.000007952455,0.0016197736],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.998848,0.00003342521,0.00021840939,0.00046091247,0.00017288122,0.00026635686],"domain_scores_gemma":[0.998488,0.0002299682,0.00005290581,0.0009189043,0.000107963744,0.00020225046],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003053449,0.00011489257,0.00015894786,0.00007824296,0.00015602828,0.00011613504,0.00083087606,0.000046398774,0.000041420382],"category_scores_gemma":[0.00023002963,0.0000971947,0.000038909286,0.00029732691,0.000015535785,0.00051672495,0.00041526425,0.00006083254,0.00005150772],"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.000008753969,0.000046720827,0.0003866338,0.000030673793,0.0000048488714,3.4658513e-7,0.000072366725,0.0011104866,0.006947454,0.7707022,0.089034654,0.13165489],"study_design_scores_gemma":[0.00055270083,0.00022002101,0.0017518908,0.000090583395,0.0000070042524,0.000007897296,0.0000046417263,0.19548614,0.16245653,0.26960406,0.36924583,0.0005727035],"about_ca_topic_score_codex":0.00007313559,"about_ca_topic_score_gemma":0.000043683616,"teacher_disagreement_score":0.5010981,"about_ca_system_score_codex":0.0000476668,"about_ca_system_score_gemma":0.00005125967,"threshold_uncertainty_score":0.3963485},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000101230304,0.00019785875,0.99510014,0.00024278222,0.00003340686,0.00030603676,0.000004557333,0.00035828692,0.0036557103],"genre_scores_gemma":[0.0690013,0.00023711518,0.9291649,0.00028784006,0.00001065817,0.00014515285,0.000005044198,0.000005847187,0.0011421487],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99946487,0.000039246122,0.0001139796,0.0001979994,0.000055210727,0.00012867202],"domain_scores_gemma":[0.99897516,0.00023666551,0.000049480717,0.0006461739,0.000053310247,0.000039225],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029609664,0.00006602529,0.00008316502,0.000042835472,0.00014684719,0.000088698296,0.00055723963,0.000030692365,0.000030264966],"category_scores_gemma":[0.00004383838,0.000058518868,0.000011084455,0.00009633266,0.000017650687,0.00067774305,0.00042157475,0.000052640687,0.000007717435],"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.0000046971454,0.00011066576,0.000014721683,0.000040376246,0.000009136273,0.0000012272172,0.00048770406,0.00013925035,0.015627353,0.7300637,0.04780495,0.20569623],"study_design_scores_gemma":[0.0002411757,0.00006370344,0.000009099407,0.00003408864,0.0000020215493,0.000009305336,0.000020077103,0.77351356,0.04521068,0.12845397,0.05228328,0.00015904974],"about_ca_topic_score_codex":0.000011583488,"about_ca_topic_score_gemma":0.000001510365,"teacher_disagreement_score":0.7733743,"about_ca_system_score_codex":0.000011827803,"about_ca_system_score_gemma":0.000002944125,"threshold_uncertainty_score":0.23863302},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00019026588,0.000027873626,0.99640745,0.0004408941,0.000036994003,0.0002688605,0.000009898212,0.00027318564,0.0023445818],"genre_scores_gemma":[0.36491698,0.0000071490617,0.63463616,0.000037755188,0.000013749606,0.000038281254,0.000009150474,0.00000384631,0.00033692416],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99945253,0.000005849273,0.00018387049,0.00016931693,0.00007834318,0.000110074296],"domain_scores_gemma":[0.99947405,0.000066047614,0.00006356089,0.0002959873,0.000084360705,0.00001599052],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000105089435,0.00006094645,0.000086867854,0.000044302105,0.00003729835,0.000023640054,0.00041293446,0.000025525265,0.0000050585827],"category_scores_gemma":[0.000011966423,0.000050615643,0.00003531204,0.000112898575,0.000019137944,0.0005734792,0.000050976592,0.000025208034,6.752795e-7],"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.0000061053333,0.00004603713,0.000016348888,0.00003448585,0.0000024322987,1.4291604e-7,0.000021597316,0.000018502884,0.6286548,0.23202394,0.0050896048,0.13408604],"study_design_scores_gemma":[0.00015350526,0.000044468652,0.000076532415,0.000011210566,0.0000013833835,7.45329e-7,0.0000034036582,0.04305224,0.92218655,0.031444795,0.0029582707,0.00006687294],"about_ca_topic_score_codex":0.000051668587,"about_ca_topic_score_gemma":0.0000074628188,"teacher_disagreement_score":0.36472672,"about_ca_system_score_codex":0.0000126579935,"about_ca_system_score_gemma":0.000015286481,"threshold_uncertainty_score":0.2064046},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02148117,0.00009500122,0.97629267,0.000113060356,0.00015280888,0.0001876496,0.00000973421,0.00052559207,0.0011423026],"genre_scores_gemma":[0.7125163,0.000007761111,0.28719056,0.00005142183,0.000017623466,0.00001224215,0.00001582543,0.000006122919,0.00018214952],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9987799,0.000066440356,0.00032390133,0.00032245636,0.0003242103,0.00018310508],"domain_scores_gemma":[0.9988015,0.00010109138,0.00015720083,0.0007854108,0.000107312604,0.000047473506],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013603501,0.00012019849,0.0001557745,0.0001510008,0.000079431746,0.000034093147,0.00073788187,0.000070291666,0.000018316541],"category_scores_gemma":[0.00003669652,0.000097033095,0.00004982892,0.0003204384,0.000059919028,0.0006767161,0.00038719876,0.000111222886,0.000008392635],"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.00003705051,0.0004742837,0.0060153487,0.00004654156,0.0000060805837,0.0000075964545,0.00007157399,0.00066865206,0.5585831,0.37303928,0.050921984,0.010128541],"study_design_scores_gemma":[0.0005495853,0.00013436229,0.03924826,0.00011614054,0.000004172389,0.000007319816,0.00001272448,0.15173294,0.7552624,0.030880462,0.021735337,0.00031630803],"about_ca_topic_score_codex":0.00026862897,"about_ca_topic_score_gemma":0.000043596032,"teacher_disagreement_score":0.69103515,"about_ca_system_score_codex":0.00002265179,"about_ca_system_score_gemma":0.000016789343,"threshold_uncertainty_score":0.3956895},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0028405567,0.000056439247,0.9946345,0.0013764396,0.0000596372,0.0003218783,0.0000131015095,0.00035425453,0.0003431668],"genre_scores_gemma":[0.06093984,0.000015502383,0.93782693,0.0004155962,0.000097146214,0.000035597375,0.000020330688,0.000011293366,0.0006377659],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999081,0.000035781286,0.00020657842,0.00036918226,0.00014148945,0.00016596145],"domain_scores_gemma":[0.99914956,0.00014470467,0.0000780716,0.0004974613,0.00007620249,0.00005399657],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012906725,0.00009374045,0.00009697096,0.000093285846,0.0001688755,0.00012947577,0.00029591908,0.000044632576,0.000025265257],"category_scores_gemma":[0.00008939714,0.00008340659,0.000021503763,0.00015527828,0.000031384232,0.0013195126,0.00024180106,0.00005371881,0.0000052352175],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000064889304,0.00024444808,0.0016860478,0.00006737461,0.000042295414,0.0000057472553,0.0015687118,0.004840206,0.120826386,0.58719206,0.16715938,0.11630243],"study_design_scores_gemma":[0.00056651863,0.00007107283,0.0021977124,0.000047163674,0.000010802468,0.000021792379,0.000036928846,0.8410937,0.10033478,0.014071575,0.041200098,0.0003478584],"about_ca_topic_score_codex":0.00002091087,"about_ca_topic_score_gemma":0.000019093892,"teacher_disagreement_score":0.83625346,"about_ca_system_score_codex":0.000024041054,"about_ca_system_score_gemma":0.000027504542,"threshold_uncertainty_score":0.3401222},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.045802023,0.0031896546,0.9380653,0.01256719,0.00020899449,0.00005547357,0.0000011242782,0.000047465925,0.00006277583],"genre_scores_gemma":[0.7719029,0.0010028492,0.22663024,0.0003624834,0.00009107901,0.0000024644328,4.2873583e-7,0.0000025753693,0.000004975268],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987509,0.00002069357,0.0003512811,0.00017760879,0.0005346869,0.00016480632],"domain_scores_gemma":[0.9991194,0.0003236894,0.00027145026,0.00008950479,0.000099571145,0.00009638231],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011517071,0.00006623733,0.00015585092,0.00032974515,0.00016902655,0.00012268013,0.000694976,0.000046994322,0.0000016627023],"category_scores_gemma":[0.001988872,0.000044834796,0.000028504617,0.0003732891,0.0006433367,0.0021688521,0.00012228318,0.00018410503,3.917894e-7],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011656545,0.00008227415,0.022038626,0.000015563857,0.0000045513366,0.00017447326,0.0005113248,0.00001638877,0.0015981712,0.0029169146,0.0074080955,0.96522194],"study_design_scores_gemma":[0.004790561,0.00085732003,0.044519465,0.0009791526,0.000012785068,0.023792839,0.0014795709,0.7558118,0.013962637,0.11181876,0.04105794,0.0009171322],"about_ca_topic_score_codex":0.0000019362758,"about_ca_topic_score_gemma":1.2832257e-7,"teacher_disagreement_score":0.9643048,"about_ca_system_score_codex":0.000021042946,"about_ca_system_score_gemma":0.00022530115,"threshold_uncertainty_score":0.2381009},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0011154551,0.004754401,0.9587604,0.012294133,0.0005092332,0.00046411142,0.00008016634,0.0008084845,0.021213615],"genre_scores_gemma":[0.1282956,0.00063020125,0.77487886,0.0009418786,0.0005518886,0.000071709954,0.00006947618,0.00004524486,0.09451514],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99691993,0.00037375867,0.0006187964,0.00090230926,0.00048753375,0.000697679],"domain_scores_gemma":[0.9980577,0.0002053648,0.000249445,0.0012579898,0.0000821521,0.00014729566],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00040591965,0.00041463893,0.00033799498,0.00013145526,0.00038226345,0.00045398643,0.0012915736,0.00021752261,0.002448656],"category_scores_gemma":[0.00003008365,0.00041973582,0.00012814855,0.00027105302,0.0003386729,0.0016522921,0.0011020966,0.0003254861,0.0011961731],"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.000010154332,0.0006647597,0.00011730468,0.00004859792,0.000017327473,0.00012813226,0.00021226538,0.0008015903,0.03664414,0.2796642,0.25218737,0.4295042],"study_design_scores_gemma":[0.00081207795,0.00014370595,0.0025764692,0.00013225246,0.000019190054,0.00008160319,0.00013681903,0.019990241,0.26935938,0.058827605,0.6471972,0.0007234821],"about_ca_topic_score_codex":0.0022511669,"about_ca_topic_score_gemma":0.000038701914,"teacher_disagreement_score":0.42878067,"about_ca_system_score_codex":0.00018960112,"about_ca_system_score_gemma":0.00017673626,"threshold_uncertainty_score":0.9998254},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0013587963,0.00066309294,0.99474937,0.0017056853,0.0003578699,0.0005351605,0.000012485759,0.00039612153,0.00022142717],"genre_scores_gemma":[0.3291641,0.0009789868,0.6676133,0.001900286,0.00017746279,0.0000836335,0.000014103768,0.00002544065,0.00004270264],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973005,0.00052311434,0.0007733851,0.0004274311,0.00039260628,0.0005829618],"domain_scores_gemma":[0.99353004,0.0019631574,0.0005720014,0.0030664885,0.0006515609,0.00021675196],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.00079870573,0.000315422,0.00036320317,0.00039803088,0.00086494273,0.0006825238,0.0058569205,0.00028133264,0.00002067677],"category_scores_gemma":[0.00023443939,0.0002909801,0.00012160547,0.0015293785,0.00008342919,0.0013937345,0.00023390239,0.001706909,0.0000084417525],"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.0006236816,0.0033675823,0.002270444,0.000035747777,0.00018694525,0.000043639204,0.0013287582,0.65375173,0.004977915,0.087244675,0.03578562,0.21038324],"study_design_scores_gemma":[0.0011372019,0.00061847945,0.00737736,0.0011255003,0.000022637349,0.000162066,0.000017780787,0.8149845,0.0047962577,0.15855151,0.010455556,0.0007511534],"about_ca_topic_score_codex":0.000011086393,"about_ca_topic_score_gemma":0.00002991645,"teacher_disagreement_score":0.32780528,"about_ca_system_score_codex":0.0003167898,"about_ca_system_score_gemma":0.00017033856,"threshold_uncertainty_score":0.9999542},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00095292117,0.00005605497,0.9870935,0.00037567495,0.00015253725,0.00040357455,0.000039141385,0.00100437,0.009922247],"genre_scores_gemma":[0.11475371,0.000003618048,0.8703577,0.0006641981,0.00009987903,0.0001347243,0.000023834848,0.000019438803,0.0139428815],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9986426,0.000028754528,0.0002667854,0.000492996,0.00022552194,0.0003432897],"domain_scores_gemma":[0.9985948,0.00013737725,0.000103379534,0.0009973733,0.00010053075,0.00006652704],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016488977,0.00016683195,0.00018374696,0.000090382586,0.00011637687,0.00016039578,0.0011943779,0.00005043618,0.000058928174],"category_scores_gemma":[0.000016957929,0.0001371385,0.00006898017,0.00019877804,0.000044536493,0.00082567596,0.0005335833,0.00008627117,0.000039758645],"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.000016230253,0.0001142151,0.00025129228,0.000032249856,0.000008618947,0.000015653652,0.000059110775,0.0002854742,0.00917874,0.88149375,0.08261707,0.025927594],"study_design_scores_gemma":[0.0017196948,0.00016566408,0.0004467894,0.00006184449,0.0000075962535,0.000020455724,0.000034059856,0.11586993,0.30134276,0.11657433,0.46292228,0.000834599],"about_ca_topic_score_codex":0.00009050799,"about_ca_topic_score_gemma":0.000048642418,"teacher_disagreement_score":0.7649194,"about_ca_system_score_codex":0.000035948466,"about_ca_system_score_gemma":0.000033567503,"threshold_uncertainty_score":0.55923456},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.025332285,0.000028866034,0.97294015,0.0003239888,0.00008684839,0.00060054415,0.000006688439,0.00022736526,0.00045327668],"genre_scores_gemma":[0.5651327,0.000014748413,0.43458912,0.00013107507,0.000009238343,0.000050940867,0.000023483999,0.000008801496,0.00003990424],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99847263,0.000040281848,0.00045778538,0.00042985354,0.00031636033,0.0002831077],"domain_scores_gemma":[0.9985475,0.00015646948,0.00020035998,0.0008538219,0.00014714694,0.00009468926],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024658084,0.00016859914,0.00027460806,0.0002602809,0.00010594083,0.000015535696,0.0007964174,0.00010235289,0.00001146797],"category_scores_gemma":[0.000045905348,0.00013828951,0.000066800756,0.00038757036,0.00006303738,0.0007423461,0.0002818482,0.00010956138,0.000006720224],"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.00035623004,0.0022370187,0.012078651,0.00040144078,0.000022724147,0.000032904623,0.0010888809,0.01045361,0.752099,0.034953002,0.021123739,0.16515282],"study_design_scores_gemma":[0.0007318924,0.00015369999,0.005417204,0.00018495254,0.0000016276084,0.000003849749,0.000007937455,0.43582273,0.55338067,0.0033382792,0.0007844912,0.00017267035],"about_ca_topic_score_codex":0.00006742938,"about_ca_topic_score_gemma":0.000012532609,"teacher_disagreement_score":0.5398004,"about_ca_system_score_codex":0.000054189568,"about_ca_system_score_gemma":0.000092734386,"threshold_uncertainty_score":0.56392825},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009604738,0.0001269231,0.9879967,0.00019293407,0.00016710159,0.00021001743,0.0000031002337,0.00046517968,0.0012332798],"genre_scores_gemma":[0.7044965,0.0001668736,0.29342133,0.00073718827,0.00013423842,0.000013520048,0.0000017554079,0.000030676467,0.0009979092],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99836475,0.00004195374,0.0002862566,0.00061336346,0.00027669081,0.0004169848],"domain_scores_gemma":[0.99893755,0.00007317107,0.00013941726,0.000629757,0.00006147014,0.00015865629],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002129695,0.00023201288,0.00026319898,0.00022099189,0.00028636813,0.00013946924,0.00054020726,0.00009054611,0.00008630149],"category_scores_gemma":[0.000050390117,0.00020599451,0.000052893833,0.00034562364,0.000060446913,0.0013057928,0.0009972873,0.00021029396,0.000024851164],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000075694064,0.0010562151,0.0007588437,0.00055749074,0.00026892507,0.00049313984,0.02629863,0.025834855,0.6267311,0.034011826,0.076267414,0.20764585],"study_design_scores_gemma":[0.00028582252,0.000035378755,0.00005985335,0.00012817723,0.0000040155664,0.00005085661,0.00003625334,0.95004404,0.04589333,0.001200782,0.0019640762,0.0002974371],"about_ca_topic_score_codex":0.00004430446,"about_ca_topic_score_gemma":0.0000011995422,"teacher_disagreement_score":0.9242092,"about_ca_system_score_codex":0.000057739082,"about_ca_system_score_gemma":0.000007756719,"threshold_uncertainty_score":0.84002125},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0009392378,0.0001751892,0.94285387,0.0008392323,0.00006592147,0.00015124051,0.0000046494197,0.0010397885,0.05393087],"genre_scores_gemma":[0.17758857,0.00007858455,0.75388265,0.0017783276,0.00004502678,0.000052799944,0.000006055284,0.000024675604,0.0665433],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9987128,0.000029156,0.00017048209,0.00047408976,0.00033283472,0.00028065132],"domain_scores_gemma":[0.99853015,0.00010609518,0.000075573356,0.0011080039,0.00005664812,0.00012352283],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.000055397144,0.00016810892,0.00016946111,0.000075619624,0.00013259638,0.000110536814,0.0010188547,0.000060451104,0.0025173998],"category_scores_gemma":[0.000029482984,0.000113872105,0.00003147274,0.00027680723,0.00007660791,0.0006830369,0.00067712396,0.0001228126,0.00046139996],"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.000022251485,0.00015339699,0.0007387575,0.000013680528,0.000018577417,0.000056368193,0.00025776293,0.00003327567,0.0021651844,0.027482253,0.8873885,0.081669986],"study_design_scores_gemma":[0.000556339,0.00032216343,0.00011679025,0.00007906626,0.000005065817,0.00009715318,0.000009917383,0.027135963,0.14424112,0.008970681,0.81794196,0.0005237613],"about_ca_topic_score_codex":0.000024055185,"about_ca_topic_score_gemma":0.000043984775,"teacher_disagreement_score":0.18897122,"about_ca_system_score_codex":0.00006114634,"about_ca_system_score_gemma":0.000009713188,"threshold_uncertainty_score":0.9983944},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.031969767,0.00003200745,0.96435505,0.0010365563,0.00019875253,0.0004785836,0.000033797187,0.00016261001,0.0017328642],"genre_scores_gemma":[0.9258574,0.00010238549,0.07323017,0.00029481674,0.00014317106,0.000048423215,0.0000034589511,0.000017127722,0.00030301628],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982771,0.000010282043,0.00047113615,0.0003991286,0.0005969169,0.00024543595],"domain_scores_gemma":[0.99796355,0.00013834247,0.0004986172,0.00011811061,0.0012021279,0.00007923248],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002859837,0.00023352666,0.000351522,0.00016290662,0.00039705264,0.00021174294,0.001175842,0.0000993623,0.00000782067],"category_scores_gemma":[0.0001427793,0.00017847773,0.0001071792,0.00013362785,0.00021347807,0.0008523421,0.00014235314,0.0002462626,8.2402556e-7],"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.0008674085,0.00025493765,0.00008729637,0.00028966804,0.00007066243,0.0000028060965,0.0025009147,0.0015060046,0.8768782,0.05038197,0.0017748487,0.06538527],"study_design_scores_gemma":[0.001499141,0.00013041917,0.000027042284,0.0004975723,0.000024507252,0.000053434098,0.00026950586,0.82059824,0.14556593,0.030960005,0.00013158105,0.00024260102],"about_ca_topic_score_codex":0.0000067437127,"about_ca_topic_score_gemma":3.330255e-7,"teacher_disagreement_score":0.89388764,"about_ca_system_score_codex":0.000056147142,"about_ca_system_score_gemma":0.00010282163,"threshold_uncertainty_score":0.72781104},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009573807,0.000027668637,0.9879456,0.00046412504,0.00008832995,0.00011896986,0.000003665254,0.00039476686,0.0013830425],"genre_scores_gemma":[0.366194,0.000007506432,0.6335433,0.00011581911,0.00001770063,0.0000030696333,0.000004189812,0.0000041776116,0.000110240064],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99914163,0.00003276469,0.00022622335,0.0002501053,0.00021334513,0.00013592983],"domain_scores_gemma":[0.999083,0.00005723256,0.0001128864,0.0006396381,0.0000612343,0.000046035562],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000079048106,0.00009322095,0.00013095405,0.00009788019,0.000028811402,0.000028539587,0.00071573764,0.000045793524,0.000057302183],"category_scores_gemma":[0.000051358624,0.000076067925,0.000036679674,0.00028106794,0.000032563483,0.00066219043,0.00019566926,0.000060844177,0.000015871241],"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.0000072194034,0.00003294504,0.00020364419,0.000008138926,0.000006919157,0.0000018614913,0.00009933951,0.00032426932,0.06299049,0.061471842,0.0050310367,0.8698223],"study_design_scores_gemma":[0.0001460863,0.00004562523,0.00095151115,0.000013517439,0.0000020019431,0.000006409037,0.0000060358398,0.051004462,0.93436396,0.006896894,0.006434963,0.0001285557],"about_ca_topic_score_codex":0.000015282822,"about_ca_topic_score_gemma":0.00001993432,"teacher_disagreement_score":0.8713735,"about_ca_system_score_codex":0.000017290264,"about_ca_system_score_gemma":0.000018161703,"threshold_uncertainty_score":0.31019598},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0011500892,0.000110017805,0.9927838,0.0026403759,0.00012760547,0.00070398586,0.000017164171,0.002449729,0.000017276008],"genre_scores_gemma":[0.4653456,0.000032605574,0.53385776,0.0001996764,0.000014907951,0.0004131192,0.0000012605146,0.000023774883,0.00011131755],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99832505,0.00004491158,0.00027803777,0.00066945265,0.00021606292,0.00046648443],"domain_scores_gemma":[0.998437,0.00018640258,0.00011669353,0.0010378166,0.00014671168,0.00007539748],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002114612,0.00027081446,0.00029774016,0.00063948217,0.00036492365,0.00005946865,0.0011073464,0.0002796283,0.0000063736393],"category_scores_gemma":[0.000014007975,0.0002322965,0.000089736444,0.00067467446,0.00015245451,0.0005548231,0.000010451413,0.00036864687,0.00003300717],"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.00019155271,0.00064155774,0.0000040224586,0.000039698472,0.00015772326,0.000040615276,0.00020212308,0.20555207,0.042164333,0.019383343,0.0012983355,0.7303246],"study_design_scores_gemma":[0.0006341825,0.0005037586,0.000001287143,0.00007400055,0.000022283197,0.00010210989,0.000028377879,0.28921738,0.6956852,0.0073846034,0.0060054893,0.00034129684],"about_ca_topic_score_codex":0.0000022431846,"about_ca_topic_score_gemma":0.000011742001,"teacher_disagreement_score":0.7299833,"about_ca_system_score_codex":0.00008765287,"about_ca_system_score_gemma":0.00005801847,"threshold_uncertainty_score":0.94727767},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0709267,0.00022316258,0.9268594,0.000050492396,0.000081503276,0.00013886888,0.000027908794,0.00037857876,0.0013134244],"genre_scores_gemma":[0.7778433,0.000039831953,0.22203243,0.000023117047,0.00000973111,0.000003300003,0.000011764132,0.000005145605,0.000031372267],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99854374,0.000050717572,0.00050810794,0.00033347492,0.0003346044,0.0002293474],"domain_scores_gemma":[0.99873716,0.00017265909,0.00030718747,0.00059245725,0.00012225723,0.000068271096],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044245113,0.00012731644,0.00022935394,0.00019215081,0.000057707366,0.000011921101,0.00087078527,0.00010511272,0.000028461567],"category_scores_gemma":[0.00005279608,0.000097907345,0.00006244274,0.00045560906,0.00018717014,0.0005324401,0.0005578469,0.0001492548,0.0000012454136],"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.000031768905,0.00028638824,0.013870926,0.000057982645,0.000013244683,0.0000050248573,0.0000789693,0.000043201406,0.87050843,0.00842363,0.00700559,0.099674836],"study_design_scores_gemma":[0.00022379754,0.00016587845,0.013415492,0.00010288659,0.0000032523956,0.0000057910343,0.00003737058,0.00392471,0.9790532,0.0020799714,0.0008732497,0.00011438455],"about_ca_topic_score_codex":0.000028182947,"about_ca_topic_score_gemma":0.0000015208925,"teacher_disagreement_score":0.70691663,"about_ca_system_score_codex":0.000015444994,"about_ca_system_score_gemma":0.0000119029555,"threshold_uncertainty_score":0.39925456},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.097258985,0.000029145884,0.900572,0.00028505197,0.000090617774,0.00017121837,0.000003418247,0.00041159592,0.0011779583],"genre_scores_gemma":[0.5591274,0.000015551434,0.4404065,0.00026816744,0.000011374246,0.0000047999833,0.0000027329984,0.000003268545,0.00016020364],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9987976,0.000031744392,0.00028033106,0.00034911363,0.00030617448,0.00023504025],"domain_scores_gemma":[0.99884266,0.000045049605,0.00008911851,0.000819722,0.00010693595,0.0000965144],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020205352,0.00012795416,0.00016931852,0.00016142658,0.000072724346,0.000048360973,0.0009275661,0.00005038166,0.000054872464],"category_scores_gemma":[0.00005450841,0.00010733636,0.000041633175,0.00039633192,0.000028635846,0.0013188674,0.00025393796,0.00010062284,0.00004612769],"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.00005984569,0.0003166817,0.004957464,0.0000284711,0.000007941925,0.000006233499,0.00026214687,0.0039382004,0.43102407,0.042141993,0.0117458105,0.50551116],"study_design_scores_gemma":[0.00031120205,0.00045207574,0.043348424,0.00009268398,0.0000029851415,0.000011024372,0.00001086031,0.2910642,0.6560461,0.0014463972,0.0069094333,0.00030460904],"about_ca_topic_score_codex":0.000018171268,"about_ca_topic_score_gemma":0.000004192375,"teacher_disagreement_score":0.5052065,"about_ca_system_score_codex":0.000027579115,"about_ca_system_score_gemma":0.000020684953,"threshold_uncertainty_score":0.43770498},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00043456547,0.000053937856,0.9850076,0.0003542993,0.00011434847,0.00030657634,0.000027646667,0.001233837,0.012467233],"genre_scores_gemma":[0.10445032,0.000017940458,0.89393896,0.00020076058,0.00004775745,0.000050444778,0.000025021927,0.000015803926,0.0012529932],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99883777,0.000008352455,0.00024072421,0.00040301567,0.00020624427,0.00030389184],"domain_scores_gemma":[0.9987414,0.00018271332,0.0000857718,0.0007742862,0.00010890405,0.000106936706],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00006606831,0.00015353793,0.00015489412,0.000100724625,0.00016971533,0.00033299255,0.0011063375,0.000054529963,0.00011717169],"category_scores_gemma":[0.00004158573,0.00012020315,0.00006946593,0.00020617717,0.0000365421,0.002623614,0.0005279621,0.00009425471,0.00009457],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018752602,0.00037092835,0.00013464771,0.000051144867,0.00001721914,0.000015874775,0.00023848344,0.000013848283,0.027157765,0.1376833,0.11465521,0.7196428],"study_design_scores_gemma":[0.00060734415,0.00011684408,0.000050129558,0.00006832305,0.000002632596,0.000019847857,0.000013590082,0.69688505,0.11537813,0.04041232,0.14600873,0.000437075],"about_ca_topic_score_codex":0.0000018415666,"about_ca_topic_score_gemma":3.8386915e-7,"teacher_disagreement_score":0.71920574,"about_ca_system_score_codex":0.00002574836,"about_ca_system_score_gemma":0.000005463454,"threshold_uncertainty_score":0.4901742},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00016178197,0.000054078937,0.9935905,0.00032815666,0.00018222647,0.00011849864,0.0000019735935,0.0008928045,0.0046700207],"genre_scores_gemma":[0.3238643,0.0000058516307,0.6749742,0.0005596951,0.000011456115,0.000019102265,0.000008380663,0.000009189273,0.0005478162],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9990966,0.00007395021,0.00015718883,0.00030864115,0.00019211305,0.00017152757],"domain_scores_gemma":[0.99900514,0.00008528692,0.000056870867,0.0007247584,0.00006195798,0.00006595889],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012600975,0.00010267664,0.00009805055,0.0000889718,0.000074351825,0.00007769506,0.0005405897,0.00004341041,0.00013694538],"category_scores_gemma":[0.00007796506,0.00008640971,0.000033019733,0.0003196097,0.00001977084,0.00052784133,0.000062258456,0.00006510973,0.00011761876],"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.0000022294805,0.000089845445,0.00028671723,0.000010392161,0.0000030451351,0.000005882828,0.000034656958,0.00031057716,0.007143632,0.961854,0.018568888,0.0116901565],"study_design_scores_gemma":[0.00032372153,0.00008413604,0.00021708723,0.000031839158,0.0000027564777,0.0000034703494,0.000009402216,0.08492958,0.69094163,0.01744067,0.20567527,0.00034045844],"about_ca_topic_score_codex":0.0000064613837,"about_ca_topic_score_gemma":0.0000020523114,"teacher_disagreement_score":0.9444133,"about_ca_system_score_codex":0.000024043133,"about_ca_system_score_gemma":0.000046614103,"threshold_uncertainty_score":0.3523686},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0076358058,0.00002483591,0.9894502,0.00069652434,0.00013058768,0.00029928068,0.0000063944435,0.00044480962,0.0013115337],"genre_scores_gemma":[0.4363057,0.00002266394,0.56341845,0.00008775834,0.00003345297,0.000022820082,0.000007698976,0.000005128725,0.000096348085],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999162,0.000028889455,0.00019723336,0.0003429286,0.00011677272,0.00015212987],"domain_scores_gemma":[0.9993127,0.00011414252,0.00010345197,0.00035266858,0.00006280021,0.000054267475],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015583866,0.00009544719,0.00009110391,0.00011684641,0.00012942958,0.000108184475,0.00020812514,0.0000586609,0.00006481193],"category_scores_gemma":[0.000043671134,0.00008913755,0.000027325692,0.00016423804,0.000034756355,0.001023925,0.00003715205,0.00006851404,0.000006178043],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001057663,0.000050528528,0.000879528,0.00002660319,0.0000041484045,0.0000012867619,0.000059264847,0.0000145872045,0.06567198,0.09472824,0.004357602,0.8341957],"study_design_scores_gemma":[0.00027228697,0.000049993116,0.00126781,0.000028733019,0.000002465454,0.000027631919,0.000010560486,0.9178914,0.06782031,0.011165198,0.0013230372,0.00014059975],"about_ca_topic_score_codex":0.0000024124895,"about_ca_topic_score_gemma":0.0000027430033,"teacher_disagreement_score":0.9178768,"about_ca_system_score_codex":0.000040915085,"about_ca_system_score_gemma":0.00000769629,"threshold_uncertainty_score":0.3634924},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0069362596,0.0003097331,0.98602957,0.001072852,0.000043525844,0.0002877411,0.0000072037,0.00021610412,0.0050970274],"genre_scores_gemma":[0.48905778,0.0009354895,0.5091422,0.00023717673,0.000017672728,0.00002094267,0.0000048342476,0.0000066276034,0.000577256],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9990026,0.00011802881,0.00026255572,0.00024795503,0.00022880877,0.00014007014],"domain_scores_gemma":[0.9989554,0.0002844148,0.00011509516,0.0005438245,0.00005539923,0.00004586533],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023439109,0.00010887095,0.00016811062,0.000047104233,0.00014123954,0.00008579146,0.0004952295,0.000025810094,0.00028916786],"category_scores_gemma":[0.000046928693,0.000063957596,0.0000332471,0.00014927516,0.00020870629,0.00067089783,0.00017062837,0.000087518834,0.000007776359],"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.000028831008,0.00005572521,0.00050802674,0.000024134531,0.000014457029,0.0000031882532,0.00066070945,0.000047005487,0.6395972,0.3025189,0.010574381,0.045967463],"study_design_scores_gemma":[0.0011305239,0.000047675407,0.0020219723,0.00008799372,0.0000072456855,0.000037468522,0.00007544445,0.0030447582,0.9135999,0.078580745,0.0011937425,0.00017251704],"about_ca_topic_score_codex":0.000065157124,"about_ca_topic_score_gemma":7.8576517e-7,"teacher_disagreement_score":0.48212153,"about_ca_system_score_codex":0.000013606637,"about_ca_system_score_gemma":0.000012801072,"threshold_uncertainty_score":0.31661853},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00056793244,0.00006240559,0.99607974,0.0008768723,0.000035164994,0.00058923545,0.000018445777,0.00090572133,0.00086447364],"genre_scores_gemma":[0.18601675,0.0000053994045,0.8126535,0.0005992581,0.00001505157,0.0002841459,0.000011720769,0.000012467765,0.00040174092],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987645,0.000015462996,0.00024337605,0.00042964052,0.00019226549,0.0003547675],"domain_scores_gemma":[0.9990466,0.000038894817,0.00006930458,0.0005604932,0.00017368354,0.00011097396],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000112392954,0.00014676273,0.00016590788,0.00006573486,0.00018159786,0.000245093,0.0009824693,0.00004434098,0.000023209677],"category_scores_gemma":[0.0000073767546,0.00011824268,0.000058439164,0.00013678778,0.000023338784,0.0023027065,0.00024153996,0.000082964856,0.0000358274],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000028049422,0.0008327408,0.00028770303,0.00035435823,0.000019645366,0.0000031675222,0.0024911528,0.0034209345,0.27373892,0.03884455,0.10866311,0.57131565],"study_design_scores_gemma":[0.00023819695,0.000019312207,0.0000810525,0.00003463257,0.0000022985255,0.0000021234018,0.000012630995,0.919972,0.0530296,0.025265431,0.0011747662,0.0001679567],"about_ca_topic_score_codex":0.000011146606,"about_ca_topic_score_gemma":0.000009818901,"teacher_disagreement_score":0.91655105,"about_ca_system_score_codex":0.0000267109,"about_ca_system_score_gemma":0.00003146141,"threshold_uncertainty_score":0.48217964},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00077314506,0.00016522026,0.9917729,0.0025284663,0.00005689313,0.00010712721,0.000012966271,0.0003287709,0.0042545493],"genre_scores_gemma":[0.7414711,0.000037168356,0.25680706,0.0016327798,0.0000134734055,0.0000027333465,0.00000412772,0.0000032327803,0.000028292485],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981325,0.000072849085,0.00026550106,0.00039514116,0.0009146128,0.00021936136],"domain_scores_gemma":[0.9988181,0.00016785954,0.00008702327,0.0006404151,0.00010289411,0.00018368817],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029329877,0.00015135983,0.00024524826,0.000094907744,0.00007591245,0.000066682784,0.0010485686,0.000114002716,0.00005500445],"category_scores_gemma":[0.00014191313,0.00011069954,0.000030809737,0.0004065222,0.00021094338,0.00043608327,0.00042731952,0.00013740854,0.0000050377353],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000054314925,0.00035099365,0.0008418133,0.000030920575,0.000003856078,0.000028496472,0.000010557796,0.0002390737,0.0005543994,0.101958595,0.021180851,0.87474614],"study_design_scores_gemma":[0.0012257531,0.00071683334,0.008393838,0.00059234904,0.0000056008735,0.00002761999,0.000017694461,0.75047857,0.21147001,0.02258132,0.004095571,0.00039481604],"about_ca_topic_score_codex":0.0000365556,"about_ca_topic_score_gemma":0.0000016323063,"teacher_disagreement_score":0.8743513,"about_ca_system_score_codex":0.00002908717,"about_ca_system_score_gemma":0.00006511217,"threshold_uncertainty_score":0.45141962},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00799299,0.00002777516,0.99005705,0.00010927683,0.00033348365,0.00029672257,0.000066570006,0.00082240737,0.00029371819],"genre_scores_gemma":[0.60740864,0.00001773752,0.39181617,0.00020546804,0.00006700264,0.000096010124,0.000069519956,0.000009892779,0.00030954613],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991368,0.00002511017,0.00018620666,0.0003083683,0.00014791432,0.00019560655],"domain_scores_gemma":[0.9991869,0.00011641542,0.00006923278,0.00047635194,0.00009391246,0.000057241283],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00009523821,0.000099901634,0.00011094344,0.000083408835,0.0002363037,0.000042447376,0.00047571948,0.00005452619,0.000016150805],"category_scores_gemma":[0.00009180436,0.00009378425,0.000045587785,0.00015127893,0.000033128355,0.0008731202,0.00016063405,0.00008588712,0.000023381537],"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.00014026443,0.0004508749,0.02299159,0.000094682255,0.0000622247,0.00006615767,0.0022805748,0.0007156944,0.40716213,0.041069444,0.39968958,0.12527676],"study_design_scores_gemma":[0.0012998489,0.00019360747,0.02708091,0.00009099193,0.0000062911913,0.00009794203,0.000011262607,0.5957883,0.22831829,0.005846701,0.14084624,0.0004196159],"about_ca_topic_score_codex":0.0000075988614,"about_ca_topic_score_gemma":0.0000016623385,"teacher_disagreement_score":0.59941566,"about_ca_system_score_codex":0.000038146303,"about_ca_system_score_gemma":0.000019479176,"threshold_uncertainty_score":0.38244104},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012144844,0.0000464004,0.980342,0.001041709,0.00016960435,0.00022059481,0.000004555834,0.00037646372,0.00565384],"genre_scores_gemma":[0.6707424,0.00004244184,0.32886097,0.00021559473,0.000039030216,0.000029674315,0.000008122379,0.000010944651,0.000050850453],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983176,0.000013656347,0.0003433879,0.00058081164,0.00051230943,0.000232241],"domain_scores_gemma":[0.9986206,0.000057306097,0.00040759015,0.00011782716,0.0007125475,0.00008409199],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016943927,0.00021971356,0.00015756377,0.00032801676,0.00031270372,0.0009910436,0.00053547067,0.00007585042,0.000083329076],"category_scores_gemma":[0.00037395352,0.0002204335,0.000027526921,0.0003119231,0.000062760795,0.0052676667,0.00027897448,0.00023863067,0.000010184037],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004440816,0.00017617451,0.0008487412,0.00018494473,0.000025948835,0.000011586416,0.002966351,0.00007061584,0.25593165,0.11831071,0.00042994297,0.6209989],"study_design_scores_gemma":[0.0002695951,0.00005535126,0.00008314823,0.0003812874,0.000006758872,0.000028617487,0.00019282014,0.8884068,0.1035002,0.006826731,0.000031331172,0.0002173203],"about_ca_topic_score_codex":0.000009782747,"about_ca_topic_score_gemma":3.707352e-7,"teacher_disagreement_score":0.88833624,"about_ca_system_score_codex":0.00013368961,"about_ca_system_score_gemma":0.000022681777,"threshold_uncertainty_score":0.95566565},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000009016485,0.00003171396,0.99643844,0.00034051418,0.000027098105,0.000626861,0.000093166476,0.0007856909,0.001647468],"genre_scores_gemma":[0.0026848824,0.0000024009998,0.99576956,0.00022726433,0.000019183191,0.0005391034,0.000098141994,0.0000080604195,0.00065142044],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9992111,0.000026362139,0.00013868093,0.0003207175,0.00010673071,0.00019640876],"domain_scores_gemma":[0.9988412,0.0002099954,0.0000493433,0.0007499011,0.00006483825,0.00008467045],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000098550365,0.00010127572,0.00010202944,0.00005003512,0.00010201886,0.000040573967,0.0006947291,0.000044106866,0.000049996735],"category_scores_gemma":[0.000093476316,0.00008175919,0.000043869382,0.00023720466,0.00003713867,0.0001913705,0.000117410455,0.00007319171,0.00007827587],"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.0000075079756,0.00024276026,0.000024397037,0.00002431408,0.000021119793,0.0000019165373,0.00010167188,0.0004486925,0.025022253,0.42221993,0.12102331,0.43086213],"study_design_scores_gemma":[0.00020783905,0.000027691127,0.000018723056,0.0000050430917,0.000002350209,0.000007363253,0.0000025631455,0.027415443,0.06557632,0.068566054,0.8379981,0.00017254078],"about_ca_topic_score_codex":8.306981e-7,"about_ca_topic_score_gemma":6.4875746e-7,"teacher_disagreement_score":0.71697474,"about_ca_system_score_codex":0.000017758039,"about_ca_system_score_gemma":0.000027460752,"threshold_uncertainty_score":0.3334043},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00010901008,0.00005759663,0.90882564,0.001484824,0.00012242103,0.00044798202,0.000027582655,0.0008970723,0.08802786],"genre_scores_gemma":[0.029254002,0.000026891612,0.94137645,0.0009638833,0.00009049076,0.00021559875,0.00006121867,0.00002836179,0.027983122],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9985437,0.000022622655,0.00034824762,0.00046669325,0.00019373631,0.00042504328],"domain_scores_gemma":[0.9987903,0.00014439989,0.00007032138,0.0007626611,0.00015177789,0.0000804992],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023847583,0.00018923394,0.00020904075,0.00013958025,0.00018828065,0.0002021742,0.0011241979,0.00009156733,0.00027982114],"category_scores_gemma":[0.000020132931,0.00015486835,0.00008306057,0.00034856398,0.000054998214,0.0011659939,0.00006905428,0.00013220201,0.00006825112],"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.000025572273,0.00012669635,0.000015384861,0.00003257296,0.000008823853,0.0000054303196,0.00003959658,0.000093114555,0.006292239,0.44090822,0.18522665,0.36722568],"study_design_scores_gemma":[0.00032499712,0.000090017675,0.000033257882,0.000027096838,0.0000027420392,0.00001252248,0.0000071126756,0.022777705,0.23373254,0.12716012,0.61558306,0.0002488341],"about_ca_topic_score_codex":0.0001551243,"about_ca_topic_score_gemma":0.00006162066,"teacher_disagreement_score":0.4303564,"about_ca_system_score_codex":0.00003852382,"about_ca_system_score_gemma":0.00007839537,"threshold_uncertainty_score":0.63153476},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0026319437,0.00033688324,0.9883403,0.0030983626,0.00032430823,0.00047356985,0.0008059978,0.0014177499,0.002570873],"genre_scores_gemma":[0.56567603,0.000056730903,0.43258765,0.0007843759,0.00015437059,0.000048242913,0.00051706954,0.00003119104,0.00014434283],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9957848,0.00027486266,0.00070264685,0.0017282099,0.0007617974,0.0007476626],"domain_scores_gemma":[0.99223953,0.0003669846,0.00037086208,0.0063054617,0.00033419413,0.0003829539],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.00040248822,0.00053144834,0.00056140724,0.00027162686,0.00034822177,0.0007399353,0.010423723,0.00016717556,0.00033457877],"category_scores_gemma":[0.00016352441,0.0004634412,0.00008766597,0.00042890615,0.00030448573,0.0037326545,0.0041977693,0.0006531103,0.00025271985],"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.00023622115,0.0017929287,0.0003836584,0.0001967655,0.00007827689,0.00019746184,0.00047108726,0.00039726772,0.37016657,0.024240842,0.2719662,0.32987273],"study_design_scores_gemma":[0.0012256266,0.00009675609,0.00021660021,0.00044789157,0.000016747841,0.000047306527,0.000025330659,0.49588448,0.24594338,0.0013410607,0.25393382,0.0008209845],"about_ca_topic_score_codex":0.000043436223,"about_ca_topic_score_gemma":0.000024239656,"teacher_disagreement_score":0.5630441,"about_ca_system_score_codex":0.00007719327,"about_ca_system_score_gemma":0.00023269143,"threshold_uncertainty_score":0.9997817},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0008779351,0.000021631473,0.99680847,0.0002850839,0.00010839157,0.0006588991,0.000008031385,0.0010436493,0.00018793377],"genre_scores_gemma":[0.03374883,0.000017993843,0.9649142,0.0009390569,0.00008170076,0.00012350768,0.000024310597,0.000017560893,0.00013281137],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986291,0.000058056365,0.00025826538,0.0006039021,0.00014464254,0.00030606272],"domain_scores_gemma":[0.9988248,0.000047007845,0.00008421813,0.00076390035,0.000084878986,0.0001952148],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015902317,0.00017617716,0.00015950354,0.00008330075,0.00017325977,0.00016697923,0.0006021623,0.00006917303,0.000018728626],"category_scores_gemma":[0.000013779601,0.00016818765,0.000022891734,0.00026229315,0.00002526092,0.0010985053,0.0004283244,0.00013061771,0.000032658827],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004383116,0.000057855235,0.000014068299,0.0000037635093,0.0000021196226,0.0000020248667,0.0000746233,0.00035067886,0.006132304,0.000067938534,0.00041172956,0.9928785],"study_design_scores_gemma":[0.0003497404,0.00019426852,0.00017139748,0.000015505177,0.0000025829988,0.0000175564,0.000008373339,0.98803914,0.008580332,0.0014948494,0.00088735565,0.00023892743],"about_ca_topic_score_codex":0.000050476006,"about_ca_topic_score_gemma":0.000038399925,"teacher_disagreement_score":0.9926396,"about_ca_system_score_codex":0.00003002191,"about_ca_system_score_gemma":0.000003422372,"threshold_uncertainty_score":0.6858493},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.038003813,0.0000574863,0.9586147,0.0011705342,0.000045891342,0.00029021103,0.000012664579,0.00041555407,0.0013891136],"genre_scores_gemma":[0.5194828,0.0000076058623,0.47943664,0.000758598,0.000042687392,0.00003364508,0.000009526866,0.000010646929,0.00021784772],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9986504,0.00003443488,0.00035691395,0.0004072357,0.00029796327,0.0002530729],"domain_scores_gemma":[0.9989186,0.000057860714,0.00019264911,0.0006568995,0.0001049614,0.00006906273],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001331221,0.00015420327,0.00016784738,0.000149943,0.00006542687,0.000057853937,0.0008084412,0.000045946592,0.00025478465],"category_scores_gemma":[0.00001887902,0.00012989982,0.00005015739,0.00028978154,0.000032889457,0.0007744465,0.0003180953,0.000092456314,0.00005868104],"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.00002251196,0.00025294817,0.0001034747,0.000023289813,0.00000963963,0.000001948004,0.0003764652,0.00011450332,0.55512315,0.02089288,0.009754542,0.41332462],"study_design_scores_gemma":[0.0004409581,0.0002996545,0.0005762988,0.000028381304,0.0000032737858,0.000010908055,0.000044868582,0.0055485503,0.967186,0.0023557653,0.023302551,0.00020283765],"about_ca_topic_score_codex":0.00003444266,"about_ca_topic_score_gemma":0.00008637155,"teacher_disagreement_score":0.481479,"about_ca_system_score_codex":0.000054574473,"about_ca_system_score_gemma":0.000042461415,"threshold_uncertainty_score":0.52971613},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00074516353,0.000028535498,0.99628556,0.0005687785,0.00003893804,0.00014341081,0.000009285931,0.00029508636,0.0018852218],"genre_scores_gemma":[0.30605417,0.0000015657881,0.6937554,0.0001072188,0.000007998816,0.0000073464325,0.000022238912,0.0000044796107,0.000039609396],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992131,0.00009071376,0.00020475939,0.00018343482,0.00018566022,0.00012232935],"domain_scores_gemma":[0.9990681,0.00022480736,0.00012744292,0.00046969933,0.00008802903,0.000021912107],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021710446,0.000083611165,0.00009740046,0.000045726974,0.00008341752,0.000047593578,0.0006395539,0.000034706045,0.00002920653],"category_scores_gemma":[0.0000379032,0.00005677066,0.000025437559,0.0002517801,0.00012011124,0.00032182614,0.000112817695,0.000054642853,5.1798486e-7],"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.0000087820235,0.00006730883,0.00010381634,0.000008021226,0.0000026391579,7.6550765e-7,0.00000826796,0.95374763,0.011595797,0.017235516,0.0111959195,0.0060255537],"study_design_scores_gemma":[0.0001689359,0.000013383471,0.000018453777,0.000015160958,0.000001805338,0.0000031214997,0.000007980498,0.9133224,0.08546449,0.0003948431,0.00051285856,0.00007656013],"about_ca_topic_score_codex":0.00012197982,"about_ca_topic_score_gemma":0.0000032099795,"teacher_disagreement_score":0.30530903,"about_ca_system_score_codex":0.000015211761,"about_ca_system_score_gemma":0.00004236228,"threshold_uncertainty_score":0.23150404},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00021313968,0.000057863643,0.99799037,0.0001655195,0.000040303454,0.00020187115,0.000011646516,0.00057998864,0.0007393166],"genre_scores_gemma":[0.055160176,0.0000020906912,0.94448406,0.0001989522,0.000030318823,0.000022428396,0.000010591869,0.000011019388,0.00008036998],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99876565,0.00007219215,0.00024374558,0.00039038903,0.0003072246,0.00022080311],"domain_scores_gemma":[0.99846953,0.00010278284,0.0001001855,0.0011737248,0.00008732988,0.00006643547],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017171014,0.00015043592,0.00017295445,0.00016241804,0.000059832564,0.000049679624,0.0013188934,0.000064736654,0.000034320816],"category_scores_gemma":[0.000008570364,0.00011947643,0.00004594186,0.00033723036,0.00006522758,0.00040251197,0.0001401635,0.0001110013,0.000007946931],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016332055,0.00070126576,0.00017120606,0.000018828603,0.0000075852518,0.000029526345,0.000040543597,0.071786724,0.08738617,0.035787273,0.006035676,0.7980189],"study_design_scores_gemma":[0.00016855166,0.00021396749,0.000071526134,0.000020146359,0.0000026819012,0.000004359469,0.0000022375314,0.43985823,0.519355,0.039254352,0.0008829299,0.0001660164],"about_ca_topic_score_codex":0.000081268314,"about_ca_topic_score_gemma":0.000004844935,"teacher_disagreement_score":0.7978529,"about_ca_system_score_codex":0.000016563601,"about_ca_system_score_gemma":0.00005846771,"threshold_uncertainty_score":0.48721075},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09566696,0.00016672646,0.89884007,0.000060238213,0.000111276626,0.00046830607,8.262932e-7,0.000481395,0.004204197],"genre_scores_gemma":[0.93365455,0.00007478377,0.06554161,0.000024315254,0.0000089166415,0.0000353596,3.6969635e-7,0.000005142413,0.0006549635],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99881554,0.000050856066,0.0003166575,0.00031078767,0.00036161605,0.00014455657],"domain_scores_gemma":[0.99877316,0.000036073,0.000101337464,0.00097395276,0.000055468357,0.000060016926],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014068346,0.000099648445,0.00016474826,0.000079037665,0.000063474115,0.00003251946,0.00086118723,0.00003312689,0.00006797413],"category_scores_gemma":[0.0000060484076,0.00007413293,0.000021903492,0.00022963042,0.000013835002,0.00057466025,0.00020169606,0.00008681636,0.000016192742],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002795845,0.0053850184,0.00689979,0.0002899582,0.000055322584,0.000028855862,0.008343591,0.0029567764,0.023782779,0.011403063,0.03447824,0.90634865],"study_design_scores_gemma":[0.00064979825,0.0014840951,0.0011983562,0.0001450171,0.000005565316,0.000015990234,0.00024807555,0.93835485,0.03500134,0.0001270079,0.02248428,0.00028559947],"about_ca_topic_score_codex":0.000022470229,"about_ca_topic_score_gemma":2.2057971e-7,"teacher_disagreement_score":0.9353981,"about_ca_system_score_codex":0.000017260556,"about_ca_system_score_gemma":0.000004026174,"threshold_uncertainty_score":0.3023053},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000565811,0.00015107139,0.99605745,0.00038723802,0.00006686103,0.00037521002,0.000004338862,0.00079813803,0.0015938956],"genre_scores_gemma":[0.20512299,0.000055646018,0.7940685,0.00013977957,0.00003004129,0.00005507352,0.000008218487,0.000012529263,0.00050721207],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988647,0.000102340775,0.00019233412,0.00042853312,0.00016121838,0.00025086064],"domain_scores_gemma":[0.99899566,0.00047261253,0.00009476488,0.00024063999,0.000111998124,0.0000842953],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001831187,0.00015501444,0.00018435594,0.00010271785,0.00023852238,0.00013328624,0.00034671996,0.000057010853,0.00013046295],"category_scores_gemma":[0.000068736255,0.00013807128,0.000035462446,0.00017313061,0.0000705036,0.00069055473,0.00023612227,0.0001429584,0.000023977494],"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.000027046754,0.000091835274,0.00008312396,0.00002112606,0.000017885963,0.000009048611,0.0005242901,0.00020030624,0.0116856685,0.9647067,0.0028400144,0.01979294],"study_design_scores_gemma":[0.0008073227,0.00059667975,0.00022243088,0.000094121046,0.000007659472,0.000032433996,0.00006224141,0.86165035,0.055355646,0.0049907095,0.07575182,0.00042858816],"about_ca_topic_score_codex":0.0000033910321,"about_ca_topic_score_gemma":5.6197996e-7,"teacher_disagreement_score":0.959716,"about_ca_system_score_codex":0.000024010424,"about_ca_system_score_gemma":0.0000063639022,"threshold_uncertainty_score":0.5630383},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006160422,0.000021206564,0.99160933,0.00016318749,0.00047088406,0.0004647607,0.00008528362,0.0009667801,0.00005816848],"genre_scores_gemma":[0.5536996,0.00000583151,0.44586584,0.00023644221,0.00003775081,0.00007255786,0.000004087553,0.0000219482,0.00005592183],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982143,0.00004556262,0.0003690221,0.0006175721,0.00032023154,0.00043331084],"domain_scores_gemma":[0.998192,0.00059800013,0.00015787475,0.00077350816,0.00014625018,0.00013235086],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00012800595,0.00026480036,0.00025496306,0.00026373312,0.00086448796,0.00007401088,0.0007865392,0.00011461197,0.000036077014],"category_scores_gemma":[0.000046475627,0.000260103,0.00014221335,0.0004505686,0.00006785308,0.0006497779,0.000006784461,0.00032790084,0.000009133897],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013565567,0.00024137793,0.000016476553,0.000109683206,0.00004638508,0.00005529288,0.0004210377,0.051235367,0.19037402,0.00079300907,0.0019441979,0.7546275],"study_design_scores_gemma":[0.0007881516,0.00014753205,0.000050448623,0.00013063992,0.00000952466,0.000068094545,0.000007656322,0.5158949,0.4805258,0.0006549317,0.0013832117,0.0003391147],"about_ca_topic_score_codex":0.000013200193,"about_ca_topic_score_gemma":0.000011157658,"teacher_disagreement_score":0.7542884,"about_ca_system_score_codex":0.00009945901,"about_ca_system_score_gemma":0.0001012845,"threshold_uncertainty_score":0.9999851},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004055967,0.00020210011,0.99028105,0.00013402128,0.00037928982,0.00095873285,0.00006257797,0.0006922927,0.0032339587],"genre_scores_gemma":[0.9455702,0.00005936065,0.052664254,0.00026718297,0.00006415129,0.00011242241,0.00004111852,0.00004783413,0.0011735123],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997714,0.00008941643,0.0006772424,0.0006426548,0.0004553974,0.00042129797],"domain_scores_gemma":[0.9976762,0.00019072868,0.00041131815,0.001216368,0.00037299076,0.00013237516],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025620297,0.0002703027,0.0004215317,0.00022133123,0.00014377813,0.0001551675,0.0012266348,0.00016379534,0.000056370904],"category_scores_gemma":[0.000083210005,0.00023703453,0.000103975486,0.00051509903,0.00007249459,0.0010252735,0.00036764884,0.0001239853,0.000022008391],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00024880108,0.0053844936,0.0003266904,0.0028037152,0.00018097942,0.00007553011,0.0037254954,0.0070141735,0.2275252,0.49014494,0.1736492,0.08892077],"study_design_scores_gemma":[0.0010809613,0.00034356862,0.000016627266,0.0007093626,0.000007982161,0.000040910312,0.00006249278,0.76507235,0.22523654,0.001629955,0.005292044,0.000507216],"about_ca_topic_score_codex":0.000036670455,"about_ca_topic_score_gemma":0.000010640431,"teacher_disagreement_score":0.9415142,"about_ca_system_score_codex":0.00007909728,"about_ca_system_score_gemma":0.00002605709,"threshold_uncertainty_score":0.96659875},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0017949718,0.000049028222,0.99656045,0.0006752478,0.00008477605,0.00029228718,0.000029737672,0.000290683,0.00022283092],"genre_scores_gemma":[0.17240185,0.000012969376,0.82715666,0.00024779135,0.00001803443,0.000004208603,0.000121048,0.0000058645205,0.00003157544],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9990365,0.000021043015,0.00024352355,0.0003731774,0.000193,0.00013278604],"domain_scores_gemma":[0.9979284,0.000094749674,0.00013492933,0.0016923308,0.000089085785,0.0000605364],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019539201,0.00008821458,0.00013150802,0.000070205315,0.00006191722,0.000026755568,0.0019224572,0.000044313518,0.0000053758367],"category_scores_gemma":[0.00008247285,0.000071049224,0.000020351468,0.00016753456,0.000052564563,0.0013013799,0.0011866066,0.00005380891,0.000004203644],"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.000022220758,0.00008032494,0.00014948616,0.000104916406,0.000013763258,0.0000026193575,0.0002610396,0.00075251487,0.36767623,0.45172206,0.030865466,0.14834937],"study_design_scores_gemma":[0.00043974584,0.00006310787,0.00017546948,0.000090228015,0.0000022611198,0.0000031007505,0.0000044901335,0.042723466,0.80656517,0.14038776,0.009427534,0.00011769729],"about_ca_topic_score_codex":0.000023161963,"about_ca_topic_score_gemma":0.0000015875306,"teacher_disagreement_score":0.4388889,"about_ca_system_score_codex":0.00001788906,"about_ca_system_score_gemma":0.000059307033,"threshold_uncertainty_score":0.3572436},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.001411575,0.000030227546,0.9939363,0.00084945647,0.000042538344,0.00045018096,0.000040431463,0.00070867233,0.0025306444],"genre_scores_gemma":[0.069980346,0.000020662817,0.92560095,0.00047622528,0.00006527828,0.000076458964,0.000032216234,0.0000180421,0.003729803],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99873275,0.000021792644,0.00019958695,0.00044097894,0.00031600424,0.00028890188],"domain_scores_gemma":[0.9988643,0.00008899512,0.00011443103,0.00067248516,0.000164442,0.00009536772],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018671766,0.0001544804,0.00016778674,0.000092049006,0.00020042511,0.00013869794,0.000622315,0.000059310783,0.00019465917],"category_scores_gemma":[0.000048277492,0.00011572263,0.00003203572,0.00025966606,0.000033443303,0.0009995843,0.0004000139,0.00007713614,0.000028458648],"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.00053744856,0.00023718763,0.00065811496,0.00010075722,0.00007438878,0.000028824466,0.001029246,0.0026323579,0.037517156,0.11563896,0.31092942,0.53061616],"study_design_scores_gemma":[0.0008554302,0.00021044664,0.00003994569,0.000072907234,0.0000066569237,0.000028360722,0.000010133242,0.09888605,0.41110218,0.0025127628,0.48594093,0.00033417175],"about_ca_topic_score_codex":0.000014028869,"about_ca_topic_score_gemma":0.00012161645,"teacher_disagreement_score":0.53028196,"about_ca_system_score_codex":0.0001696865,"about_ca_system_score_gemma":0.00005822867,"threshold_uncertainty_score":0.4719032},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0030951092,0.00014989708,0.99340534,0.000767671,0.00006631393,0.0003818642,0.000006793947,0.00042357916,0.0017034461],"genre_scores_gemma":[0.38123488,0.00000282402,0.617719,0.00074710674,0.000012480276,0.00001025895,0.000009284681,0.0000071613595,0.00025701005],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9987945,0.000031180633,0.00022235708,0.00042987335,0.00028775202,0.0002343595],"domain_scores_gemma":[0.9985621,0.00014939124,0.0001535189,0.0008574508,0.00020103986,0.000076494915],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020174995,0.00016829061,0.0002677434,0.00012750804,0.00009727829,0.000043023,0.0007117834,0.00006260574,0.000011677168],"category_scores_gemma":[0.000051473915,0.000116166404,0.000056221015,0.00019429004,0.000049071863,0.00046220308,0.0000816099,0.000107817046,9.706159e-7],"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.0007662027,0.0006373401,0.00020958539,0.00008969771,0.000029774308,0.0000610609,0.00036761686,0.0013338719,0.2184353,0.037427638,0.08415594,0.656486],"study_design_scores_gemma":[0.0014814069,0.0011822961,0.0015380427,0.0002078435,0.000008338962,0.00002505478,0.000030972642,0.023304416,0.9603771,0.010098125,0.0014564971,0.0002899252],"about_ca_topic_score_codex":0.000013107093,"about_ca_topic_score_gemma":0.000007114338,"teacher_disagreement_score":0.74194175,"about_ca_system_score_codex":0.000017583116,"about_ca_system_score_gemma":0.000052425625,"threshold_uncertainty_score":0.47371283},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03334584,0.00008476252,0.9639411,0.00013375572,0.0004120101,0.00020293579,0.0000073790147,0.0005556876,0.0013165086],"genre_scores_gemma":[0.8146364,0.000047208163,0.18494731,0.00007968017,0.00004443827,0.000013354016,0.0000021420972,0.000009476561,0.00021997587],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99865067,0.00008878519,0.0003873751,0.00037602315,0.00026916253,0.0002279691],"domain_scores_gemma":[0.9990596,0.000103069826,0.00017140961,0.0005158547,0.00007985612,0.000070202106],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00015343004,0.00014704689,0.000252354,0.00018647642,0.00007043336,0.000052786723,0.0006286468,0.0000797296,0.00126467],"category_scores_gemma":[0.000030001414,0.00012931545,0.00009504907,0.0004024003,0.000059091533,0.0010845499,0.00011683709,0.00011438464,0.000020638246],"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.000022257134,0.00011845927,0.00008734633,0.00003894474,0.00004071868,0.000010635665,0.00043873582,0.00017505535,0.8183661,0.036822688,0.0036220422,0.14025702],"study_design_scores_gemma":[0.0005330898,0.000077374054,0.00007172528,0.00008089462,0.000005882793,0.00003142234,0.0000074482855,0.14970951,0.8416178,0.0064329915,0.0012123226,0.00021951826],"about_ca_topic_score_codex":0.000023558352,"about_ca_topic_score_gemma":9.292364e-7,"teacher_disagreement_score":0.7812906,"about_ca_system_score_codex":0.000025228197,"about_ca_system_score_gemma":0.000010184464,"threshold_uncertainty_score":0.99964833},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0008369284,0.000026556425,0.99770594,0.00038221828,0.00003926979,0.0003954788,0.000029451638,0.0003264287,0.0002577296],"genre_scores_gemma":[0.20955414,0.000061422244,0.7898297,0.00016673116,0.000009041097,0.00019923637,0.000027007285,0.0000088903635,0.00014385695],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9989632,0.00009169307,0.00032534538,0.00024096578,0.00018363309,0.00019519255],"domain_scores_gemma":[0.9986797,0.00038397752,0.00012920541,0.0006645464,0.00010857066,0.000033973876],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024505047,0.000101351136,0.00012939404,0.00007233964,0.00008270954,0.00008864974,0.0006078872,0.000058539183,0.00002846236],"category_scores_gemma":[0.00016887217,0.000073306546,0.000037863767,0.00041594022,0.00006158412,0.0007025619,0.0002626404,0.00013768661,0.000009186146],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019140194,0.00022705786,0.00043809516,0.000022992022,0.000004793791,0.000022520035,0.000051551095,0.00015486458,0.016364418,0.0029146213,0.017683607,0.96209633],"study_design_scores_gemma":[0.0004226793,0.0001371575,0.0004290192,0.00027366084,0.000002505088,0.000022778966,0.00001423766,0.3379615,0.6064553,0.005990627,0.047971167,0.00031936186],"about_ca_topic_score_codex":0.000070647315,"about_ca_topic_score_gemma":0.000046723446,"teacher_disagreement_score":0.961777,"about_ca_system_score_codex":0.000048267902,"about_ca_system_score_gemma":0.000010573933,"threshold_uncertainty_score":0.2989354},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00080198725,0.000062699124,0.9933819,0.004356315,0.00012337705,0.00028534592,0.000062582,0.00034392494,0.0005818764],"genre_scores_gemma":[0.82370996,0.0001769424,0.17523135,0.0003470733,0.000005057636,0.00009104784,0.000011774585,0.000015914016,0.0004108587],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987091,0.00025727644,0.00033115767,0.00024824674,0.00027959936,0.00017460872],"domain_scores_gemma":[0.99441797,0.0005927511,0.00018327041,0.0046188985,0.00012577641,0.00006134657],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001569131,0.00014016552,0.00014010546,0.0001628644,0.0008446791,0.000041332067,0.0029856465,0.000071182636,0.00008199969],"category_scores_gemma":[0.00002087261,0.000113546696,0.00012593217,0.00079881185,0.00021674136,0.00034427363,0.000052343872,0.00026898348,0.00003005785],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017712684,0.005819917,0.0025425316,0.00009434523,0.00019339728,0.0000018117589,0.0034327714,0.34983167,0.12167515,0.0776019,0.0061177076,0.43251166],"study_design_scores_gemma":[0.0007894066,0.00014527397,0.0014872381,0.00021338835,0.000051077164,0.000023191538,0.00006957746,0.5408109,0.26794928,0.0048026354,0.18312001,0.00053801766],"about_ca_topic_score_codex":0.00014256245,"about_ca_topic_score_gemma":0.00032937044,"teacher_disagreement_score":0.822908,"about_ca_system_score_codex":0.00009799614,"about_ca_system_score_gemma":0.00007288393,"threshold_uncertainty_score":0.6496674},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006590242,0.0017431999,0.9899846,0.00019076484,0.00020388322,0.00013631838,0.0000014291539,0.0005199907,0.0006296041],"genre_scores_gemma":[0.79124,0.000043412263,0.20810786,0.00029001702,0.00027501225,0.000014672231,0.0000010487547,0.00002149944,0.000006496617],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975274,0.00024260402,0.0006145062,0.00051157863,0.0006639919,0.0004398874],"domain_scores_gemma":[0.99855566,0.00012750005,0.0005199521,0.00040853757,0.00017749236,0.00021088216],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007349641,0.00026478973,0.00028969962,0.00047990726,0.00044227618,0.0004600192,0.0012649405,0.000077384444,0.000012392433],"category_scores_gemma":[0.000043040785,0.00022791207,0.000064197426,0.0007843487,0.00004088857,0.007066809,0.00007288878,0.0007248279,0.00002024699],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005981205,0.00012635565,0.00017250347,0.000048706304,0.0000011404036,0.000046626254,0.00011516725,0.06195309,0.008237129,0.0002976235,0.000010706672,0.9289311],"study_design_scores_gemma":[0.0009321582,0.00062907516,0.000461881,0.001272624,0.0000050096523,0.00046647916,0.00015467609,0.75959086,0.22255594,0.0020685284,0.011303725,0.00055903196],"about_ca_topic_score_codex":0.0000010112254,"about_ca_topic_score_gemma":0.000017351496,"teacher_disagreement_score":0.9283721,"about_ca_system_score_codex":0.0003921194,"about_ca_system_score_gemma":0.00012216644,"threshold_uncertainty_score":0.9293984},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0035059056,0.00004651224,0.9907877,0.0036542106,0.00027953455,0.00033725143,0.000036194713,0.000813087,0.0005396396],"genre_scores_gemma":[0.8109948,0.00020398028,0.18840946,0.00025857243,0.0000065357385,0.00008094276,0.00001733342,0.0000069306925,0.000021451051],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9983743,0.00003644261,0.00072578667,0.00022758126,0.00035857275,0.00027734874],"domain_scores_gemma":[0.9983473,0.00017289144,0.00031414352,0.0009376972,0.00016731626,0.000060690058],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023366493,0.0002031264,0.00029521782,0.0027483767,0.000106498126,0.000018946997,0.00094346143,0.00025398124,0.000058393387],"category_scores_gemma":[0.000041529725,0.00017605987,0.00004834382,0.0024854045,0.00035040404,0.0014663701,0.000008871579,0.00041512024,0.00003338253],"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.00013118265,0.0007837359,0.00052396156,0.00015858177,0.00003547883,0.000034188706,0.00040728017,0.0016613409,0.30538613,0.015383534,0.0029299515,0.6725646],"study_design_scores_gemma":[0.0018404225,0.0005601355,0.00052849436,0.0004098293,0.000008535385,0.00009666131,0.00014730138,0.008929879,0.9711959,0.012305938,0.003681142,0.000295771],"about_ca_topic_score_codex":0.000036349025,"about_ca_topic_score_gemma":0.0000027239496,"teacher_disagreement_score":0.8074889,"about_ca_system_score_codex":0.0001053151,"about_ca_system_score_gemma":0.00006142535,"threshold_uncertainty_score":0.7179513},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00036588512,0.000027854278,0.98904574,0.000022131842,0.0000914443,0.00012221061,0.0000015996283,0.00048496522,0.009838193],"genre_scores_gemma":[0.12655744,0.0000038536155,0.8730384,0.00015156023,0.0000076087454,0.0000050969024,0.0000011327842,0.000006755617,0.00022815763],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9992469,0.00006953168,0.00012878196,0.00025906414,0.00014712938,0.00014859237],"domain_scores_gemma":[0.99930614,0.000044929457,0.00005966248,0.00045979855,0.00008202447,0.000047433892],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000104194,0.00008671958,0.00008493682,0.00006214005,0.00008386974,0.0000645826,0.00036693623,0.000030008958,0.00005839231],"category_scores_gemma":[0.000057287183,0.00007536272,0.000021860908,0.0002009012,0.000027173315,0.0009949392,0.00012992683,0.000058169364,0.000035089888],"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.0000021222536,0.000028588343,0.000040496907,0.000002381792,0.0000032112976,0.000006239038,0.000058862766,0.00007612564,0.09160983,0.90337133,0.0013637936,0.0034369964],"study_design_scores_gemma":[0.0001577114,0.00004913099,0.00008428108,0.000024352268,0.0000023794273,0.000019350728,0.000019251214,0.26305372,0.69916195,0.02905664,0.008127164,0.00024406816],"about_ca_topic_score_codex":0.000009492554,"about_ca_topic_score_gemma":0.0000012311207,"teacher_disagreement_score":0.8743147,"about_ca_system_score_codex":0.000035375775,"about_ca_system_score_gemma":0.00004233876,"threshold_uncertainty_score":0.30732024},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0036278635,0.00002739832,0.99002653,0.000817824,0.00007617881,0.00021403415,0.0000016759684,0.0013057321,0.0039027517],"genre_scores_gemma":[0.58811134,0.0000064800774,0.41082373,0.00069875846,0.000018709667,0.000008492907,0.0000037989894,0.0000047143067,0.00032396524],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99873954,0.000035310357,0.00019405894,0.00044744683,0.00031582647,0.0002678054],"domain_scores_gemma":[0.99886876,0.000055431898,0.00008428285,0.0008210589,0.00006684829,0.00010361493],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013105338,0.0001532151,0.0001379121,0.000114673196,0.00012387485,0.00013828423,0.000784519,0.000048038855,0.000024738232],"category_scores_gemma":[0.000040740888,0.00011122558,0.000026419022,0.00028201024,0.000028979306,0.0014330568,0.00017250297,0.00014145972,0.000040725157],"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.00010351072,0.00042852858,0.0018587268,0.000017732866,0.000014869899,0.00010232829,0.00044866893,0.0012664216,0.20538622,0.35583794,0.043025035,0.39151004],"study_design_scores_gemma":[0.0020656905,0.0015799123,0.032712266,0.0003707522,0.000013529227,0.00016173034,0.000111492445,0.3661199,0.49128953,0.0340718,0.06999809,0.0015053],"about_ca_topic_score_codex":0.0000173795,"about_ca_topic_score_gemma":0.000011051513,"teacher_disagreement_score":0.5844835,"about_ca_system_score_codex":0.000053085703,"about_ca_system_score_gemma":0.000021151109,"threshold_uncertainty_score":0.45356476},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0009237843,0.000061008937,0.99666804,0.000080846316,0.000025640817,0.00014104837,0.000038739276,0.0002688829,0.001791988],"genre_scores_gemma":[0.6262525,0.000010040955,0.37352148,0.000013547003,0.00000683794,0.00005857258,7.789971e-7,0.0000028071313,0.00013349498],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992423,0.000030732146,0.00020815391,0.0002680044,0.00013561593,0.00011515864],"domain_scores_gemma":[0.99890816,0.00031938442,0.00009719385,0.00055801484,0.000057946938,0.000059295522],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00009757328,0.00008037914,0.00022889231,0.000209338,0.00008082217,0.00002954149,0.00048390258,0.000039618793,0.000024444145],"category_scores_gemma":[0.00008690533,0.00006140046,0.00007932203,0.00038995672,0.000029745666,0.00031737864,0.00026181806,0.000028184422,0.0000021491794],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017440918,0.00034433807,0.0026293218,0.0003053501,0.0004663438,0.0000070711544,0.0005283541,0.0001185415,0.044036854,0.23659208,0.011306435,0.70364785],"study_design_scores_gemma":[0.00027187247,0.000069624424,0.0009087925,0.000118148215,0.00018067178,0.0000055639607,0.00012094119,0.5102859,0.48085016,0.0013073724,0.00554861,0.00033233946],"about_ca_topic_score_codex":0.000011561339,"about_ca_topic_score_gemma":0.0000022213892,"teacher_disagreement_score":0.7033155,"about_ca_system_score_codex":0.000010288664,"about_ca_system_score_gemma":0.000003229482,"threshold_uncertainty_score":0.2503838},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00058526435,0.0000715789,0.9956724,0.0020413515,0.00005730023,0.00023549217,0.0000019939987,0.0006411718,0.00069346663],"genre_scores_gemma":[0.10818147,0.00002369927,0.89021564,0.00038321206,0.000043065535,0.00002969325,0.000009016055,0.0000070921355,0.0011071205],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9992645,0.000008487853,0.00015236586,0.0002823974,0.00012109732,0.00017117367],"domain_scores_gemma":[0.99928564,0.000066817236,0.000057015543,0.00046645326,0.000052098352,0.00007198631],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00010506633,0.00008632164,0.00008441341,0.000057028075,0.000073018215,0.00008113097,0.000598069,0.000037512335,0.000020278625],"category_scores_gemma":[0.00003505566,0.00007696152,0.000029933715,0.00015539078,0.00000900926,0.00094336044,0.0001312159,0.00005071747,0.00003037791],"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.00000617962,0.000026756556,0.000021945425,0.000010421979,0.000005021933,4.2539926e-7,0.000059082846,0.000057831185,0.21603775,0.13178478,0.03821657,0.6137732],"study_design_scores_gemma":[0.00031202642,0.000040969426,0.000093221126,0.000028135231,0.0000017013635,0.000004932026,0.000003097521,0.37654412,0.5439853,0.011847289,0.06696018,0.00017906081],"about_ca_topic_score_codex":0.000007057192,"about_ca_topic_score_gemma":0.000020366975,"teacher_disagreement_score":0.6135942,"about_ca_system_score_codex":0.000055830245,"about_ca_system_score_gemma":0.00004721191,"threshold_uncertainty_score":0.31383997},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17171264,0.000009393166,0.82374316,0.0000792535,0.00006234258,0.00012324446,0.0000035546918,0.00038428363,0.0038821353],"genre_scores_gemma":[0.500969,0.0000024264868,0.49890804,0.00008883313,0.0000061704577,0.0000018244025,4.934297e-7,0.0000036295532,0.000019568086],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99867964,0.000058347014,0.0003349369,0.00037223008,0.00027852616,0.0002763288],"domain_scores_gemma":[0.9987548,0.0001445426,0.00014863758,0.0007812302,0.00007322541,0.00009753705],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019706,0.00013990862,0.00020877572,0.00013427017,0.00010532155,0.000050333754,0.00093046296,0.000040283896,0.0002392963],"category_scores_gemma":[0.000080925405,0.00012451685,0.00006133171,0.0003882723,0.00020932211,0.0009415625,0.00041890756,0.00011066907,0.000017971539],"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.000007617578,0.00023408898,0.00089306926,0.000045426576,0.000015593481,0.00007920224,0.000501939,0.0014424097,0.63722163,0.17103724,0.0005107362,0.18801102],"study_design_scores_gemma":[0.00020244639,0.000045988847,0.00011075032,0.000042961932,0.0000021388446,0.00006265935,0.000034669727,0.32735,0.6565545,0.015227007,0.00015745262,0.00020942352],"about_ca_topic_score_codex":0.00003668645,"about_ca_topic_score_gemma":0.0000020586463,"teacher_disagreement_score":0.32925636,"about_ca_system_score_codex":0.00004055471,"about_ca_system_score_gemma":0.000011501363,"threshold_uncertainty_score":0.507765},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003316588,0.00006754944,0.9914433,0.00026805227,0.0000474923,0.00030177025,0.000013928556,0.00013781922,0.0044035073],"genre_scores_gemma":[0.82314956,0.0000019927218,0.17629683,0.00016566782,0.000009547158,0.00003777077,0.0000018420612,0.0000050390013,0.00033173498],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99902827,0.00008529482,0.0002592835,0.0002480049,0.00023102932,0.00014815027],"domain_scores_gemma":[0.99908626,0.00008636993,0.00010574051,0.0006058282,0.000096296884,0.000019479172],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012077408,0.00009863869,0.00012919353,0.00007240787,0.000030170935,0.000024491766,0.00062427676,0.00006415106,0.000036684683],"category_scores_gemma":[0.000032847172,0.00006648816,0.00003392109,0.00034854046,0.00011789727,0.00032969285,0.00032112436,0.0001211477,0.0000034527586],"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.00013209679,0.00047797483,0.018314674,0.000045425702,0.000016733982,0.000039983177,0.00089404976,0.0025898018,0.035588156,0.8972646,0.011183765,0.033452723],"study_design_scores_gemma":[0.0019100206,0.00024989762,0.07138076,0.00065482414,0.000010342261,0.000029649093,0.00008055831,0.29304564,0.33004218,0.29234833,0.009457516,0.00079029996],"about_ca_topic_score_codex":0.00012829222,"about_ca_topic_score_gemma":0.00022671501,"teacher_disagreement_score":0.819833,"about_ca_system_score_codex":0.000044992452,"about_ca_system_score_gemma":0.00008323096,"threshold_uncertainty_score":0.27113083},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0031529188,0.00021559221,0.9871512,0.0000793039,0.00018868828,0.00013940193,0.0000038539856,0.001281085,0.0077879634],"genre_scores_gemma":[0.49005008,0.000036332487,0.5076859,0.00020466604,0.000055398406,0.000021545631,0.0000017076316,0.000010263046,0.0019341002],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988798,0.00004193812,0.00021666498,0.00035750974,0.00025512674,0.0002489813],"domain_scores_gemma":[0.99886686,0.00013383281,0.00007092525,0.0007764646,0.00006360379,0.00008830117],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00009878943,0.00012262525,0.00014208705,0.00008044625,0.00021083627,0.0001087867,0.0008500532,0.00004034046,0.000038188853],"category_scores_gemma":[0.000068119305,0.00009831231,0.000033793098,0.00020579153,0.0000689534,0.00096276484,0.00050903053,0.0001060078,0.000098188815],"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.00001543391,0.0005939273,0.010065241,0.00014673086,0.000062078296,0.001267269,0.0014659864,0.0023851078,0.13869202,0.1803661,0.5178479,0.1470922],"study_design_scores_gemma":[0.0010142385,0.00015808655,0.015125985,0.00024259988,0.0000065208055,0.00094297394,0.000054435215,0.6020327,0.13977635,0.0022620286,0.23702005,0.001364019],"about_ca_topic_score_codex":0.00008726646,"about_ca_topic_score_gemma":5.002473e-7,"teacher_disagreement_score":0.5996476,"about_ca_system_score_codex":0.000025303447,"about_ca_system_score_gemma":0.000031015566,"threshold_uncertainty_score":0.40090597},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19863689,0.00005067084,0.8004782,0.00018028359,0.00014853539,0.00015255812,0.0000039835177,0.000066794884,0.00028207837],"genre_scores_gemma":[0.6020765,0.0000042736006,0.3978625,0.00002152667,0.000012089852,0.0000015324302,2.1659746e-7,0.0000031558425,0.000018244811],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990106,0.00010520704,0.00030369873,0.00017514054,0.00026681845,0.00013850183],"domain_scores_gemma":[0.99908584,0.000090281326,0.00018170584,0.00059441064,0.00003312157,0.000014644204],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003255191,0.00007616793,0.00010966607,0.000084445855,0.00006904912,0.000015530302,0.00078421726,0.00003850118,0.00001001778],"category_scores_gemma":[0.000056510624,0.000044424396,0.00004940744,0.00045611645,0.0000642614,0.00055748736,0.00031441264,0.0001788557,6.569558e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003060796,0.00046779562,0.034372613,0.00013907134,0.00005154673,0.000009545683,0.009145094,0.3230871,0.4791737,0.10858316,0.0013794872,0.043560278],"study_design_scores_gemma":[0.0000884673,0.000020724341,0.0023698474,0.00008995529,0.0000023656573,0.000009016978,0.00009757533,0.8209053,0.15524909,0.021064552,0.000051785304,0.00005128199],"about_ca_topic_score_codex":0.0004800274,"about_ca_topic_score_gemma":0.000011467127,"teacher_disagreement_score":0.49781823,"about_ca_system_score_codex":0.00010048884,"about_ca_system_score_gemma":0.000015722686,"threshold_uncertainty_score":0.18115743},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0017633663,0.000008005972,0.99628264,0.00019641331,0.0003569408,0.00067305565,0.0000053647914,0.0005305356,0.00018368699],"genre_scores_gemma":[0.4420333,0.0000025767845,0.5575047,0.00007395055,0.00006309617,0.00013928831,0.000013923769,0.000008330762,0.00016081422],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989712,0.000023250397,0.00017486006,0.000371787,0.00023396294,0.00022494391],"domain_scores_gemma":[0.99899364,0.000099040604,0.000105586965,0.0005231373,0.00020272599,0.00007586707],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021697009,0.00013008236,0.00013107137,0.00009034613,0.00014457785,0.0001193239,0.0005237593,0.00006998501,0.000017958791],"category_scores_gemma":[0.00008458129,0.00009458106,0.000030780673,0.00016082656,0.00004095623,0.0008698853,0.0001798846,0.00012113512,0.000005964836],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0013559218,0.0009407433,0.0019073341,0.00008233766,0.000076282115,0.00001210407,0.00075436145,0.060671892,0.18845284,0.2572876,0.027322192,0.4611364],"study_design_scores_gemma":[0.0018221883,0.00017028024,0.00018816978,0.000018789538,0.0000029840012,0.0000064263054,0.000009342051,0.89145863,0.084154256,0.0008621733,0.021105753,0.00020100783],"about_ca_topic_score_codex":0.000015419015,"about_ca_topic_score_gemma":0.000007948232,"teacher_disagreement_score":0.83078676,"about_ca_system_score_codex":0.0000187195,"about_ca_system_score_gemma":0.000032932887,"threshold_uncertainty_score":0.38569036},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0022670955,0.000032967277,0.99183404,0.0005416542,0.000047966652,0.00021226925,0.000013720169,0.0015242586,0.0035260457],"genre_scores_gemma":[0.06927255,0.000014936944,0.92694134,0.0024906062,0.000026778525,0.00006303385,0.000037974238,0.000012304187,0.0011404582],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99878854,0.00004680864,0.00023429784,0.00038856294,0.0002840863,0.00025770374],"domain_scores_gemma":[0.99893624,0.000074316165,0.00004912697,0.0008037507,0.00004721859,0.000089367204],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00012360264,0.00012759726,0.00011494958,0.0000846241,0.0001119216,0.00011002674,0.00085905497,0.000038366423,0.0036844874],"category_scores_gemma":[0.000009945396,0.00011450132,0.000044378794,0.00028973303,0.000027106322,0.00083774776,0.00011255973,0.00008044969,0.00033433994],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007155781,0.000049283906,0.0003827459,0.0000035083392,0.0000031926165,0.0000069863227,0.00006745581,0.00012461573,0.00066281756,0.005401573,0.019688353,0.9736023],"study_design_scores_gemma":[0.0017619447,0.00033682867,0.0036627227,0.000046299912,0.000008997,0.000023797747,0.000027585065,0.0516841,0.289179,0.03208233,0.6202748,0.0009116599],"about_ca_topic_score_codex":0.00008517819,"about_ca_topic_score_gemma":0.000030198524,"teacher_disagreement_score":0.97269064,"about_ca_system_score_codex":0.00006738199,"about_ca_system_score_gemma":0.00011346986,"threshold_uncertainty_score":0.9972263},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0041219615,0.000015793388,0.9853342,0.00070036016,0.00009494123,0.00017650829,0.0000042797506,0.00021542788,0.009336485],"genre_scores_gemma":[0.5416507,0.000005647775,0.45789,0.00030563405,0.000004687798,0.000011419336,3.8951026e-7,0.000003896718,0.00012759841],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9989668,0.000100133446,0.00020231208,0.00027736672,0.00025881952,0.00019457588],"domain_scores_gemma":[0.9985181,0.00036747433,0.00010588338,0.0009032854,0.0000556606,0.00004960072],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002388638,0.00011282695,0.00013156743,0.00005075126,0.00006924827,0.000035864407,0.0010001515,0.000032550714,0.000100841484],"category_scores_gemma":[0.00028270786,0.00006776096,0.000055962588,0.00024603706,0.00012451471,0.0002375431,0.0001452126,0.000115029856,0.000024991794],"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.000004060777,0.000032706826,0.0000112335065,0.000002338754,0.0000029570085,0.000003330402,0.000074947995,0.00003889146,0.023199232,0.97323465,0.00079268415,0.0026029684],"study_design_scores_gemma":[0.00027379207,0.00021622742,0.0001253806,0.000057253197,0.0000030372753,0.000017824159,0.000065326974,0.018341193,0.9539178,0.015910057,0.010847857,0.00022425606],"about_ca_topic_score_codex":0.0000062757613,"about_ca_topic_score_gemma":5.117544e-7,"teacher_disagreement_score":0.95732456,"about_ca_system_score_codex":0.000017221277,"about_ca_system_score_gemma":0.00005348339,"threshold_uncertainty_score":0.27632114},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0030885884,0.000044408196,0.99452406,0.0005581069,0.000079445424,0.0001942166,0.0000022445668,0.0009000182,0.00060888083],"genre_scores_gemma":[0.4466041,0.0000065958,0.5526827,0.00043005368,0.000021335749,0.00001322268,0.0000039996216,0.0000022928182,0.00023566071],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993809,0.0000131821025,0.00011914961,0.00023450515,0.00009519601,0.00015709377],"domain_scores_gemma":[0.9994325,0.00008050831,0.000044757624,0.00035782089,0.00004165913,0.00004272223],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00010465071,0.00007317623,0.000077158315,0.00007104826,0.00011758524,0.00008615969,0.00052893057,0.00003043758,0.0000056889976],"category_scores_gemma":[0.000056486682,0.000061118495,0.00003325513,0.000116087176,0.00001056122,0.0009639485,0.00010773957,0.00004161986,0.0000074775153],"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.000023149794,0.00012560302,0.00035923067,0.00001089517,0.00000370407,0.000003862269,0.00021758693,0.00015283296,0.30897382,0.21823043,0.039191786,0.43270713],"study_design_scores_gemma":[0.00052466604,0.00039705838,0.0026598214,0.000050014987,0.0000026253429,0.00000938821,0.000033639313,0.48461008,0.356386,0.094091415,0.06089631,0.0003389702],"about_ca_topic_score_codex":0.0000029602172,"about_ca_topic_score_gemma":8.044579e-7,"teacher_disagreement_score":0.48445725,"about_ca_system_score_codex":0.000017771268,"about_ca_system_score_gemma":0.000008067724,"threshold_uncertainty_score":0.24923398},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00032824746,0.000008698826,0.9971798,0.0003173478,0.00031467082,0.00044011927,0.0000742926,0.00073817646,0.0005986322],"genre_scores_gemma":[0.7836667,0.000018252462,0.21486999,0.0011515247,0.00001835986,0.00011676163,0.000034146404,0.000005373322,0.00011892457],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99901754,0.00005896041,0.0003565865,0.00015573886,0.00021855102,0.00019263245],"domain_scores_gemma":[0.998989,0.00027064994,0.00016216855,0.00038795016,0.0001203934,0.00006987601],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034037782,0.00013808075,0.00010951877,0.00033584863,0.00040640327,0.00017016468,0.00041527994,0.00006891657,0.000022774584],"category_scores_gemma":[0.00002576521,0.00013138865,0.00007617382,0.00023307464,0.000030219015,0.005664243,0.000002089604,0.00013527695,0.000050378447],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014121998,0.00008964968,0.0000012910617,0.000020245598,0.000010912999,3.0487263e-7,0.001557131,0.013344239,0.0020647016,0.15289284,0.0010123422,0.8288651],"study_design_scores_gemma":[0.001757953,0.0006741694,0.00035068445,0.00015037539,0.000020916488,0.000025275467,0.0005932754,0.34849113,0.28473014,0.33911064,0.023404138,0.00069132436],"about_ca_topic_score_codex":0.00000146032,"about_ca_topic_score_gemma":6.4211935e-7,"teacher_disagreement_score":0.8281738,"about_ca_system_score_codex":0.000073158015,"about_ca_system_score_gemma":0.000034375742,"threshold_uncertainty_score":0.53578734},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011170686,0.000026060963,0.98787624,0.000016748607,0.000035883164,0.00019111742,0.000030025529,0.00016644415,0.00048681794],"genre_scores_gemma":[0.10556977,0.0000033849274,0.8940679,0.00007925092,0.000033639033,0.000017412414,0.000047305613,0.000011068683,0.00017030886],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99862623,0.000027345011,0.00046517042,0.00035791734,0.00024763937,0.00027567073],"domain_scores_gemma":[0.9985432,0.00024685232,0.00025080715,0.000752395,0.00016742076,0.0000393445],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003560002,0.00015121813,0.0004101614,0.00032113906,0.00005635871,0.00003403102,0.0006782359,0.00007791149,0.000092267015],"category_scores_gemma":[0.00001050634,0.00013241304,0.00013791356,0.0011165465,0.000038153954,0.0004733373,0.00022850507,0.00007284669,0.0000011187237],"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.000043603497,0.0003221323,0.0071407384,0.00012624571,0.00036585677,0.0000032459254,0.000030964584,0.49588692,0.020141697,0.0023317111,0.0063012457,0.46730566],"study_design_scores_gemma":[0.00021568248,0.00004294154,0.000981227,0.00004504289,0.0000662743,5.1906244e-7,6.7096113e-7,0.9117636,0.085837685,0.00043216514,0.0004723448,0.00014186166],"about_ca_topic_score_codex":0.00008930297,"about_ca_topic_score_gemma":0.0000031865336,"teacher_disagreement_score":0.46716377,"about_ca_system_score_codex":0.000032159358,"about_ca_system_score_gemma":0.000030269486,"threshold_uncertainty_score":0.5399647},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0013910668,0.00013680555,0.98864764,0.00072377844,0.00010691763,0.00017313624,0.000004184438,0.0016159957,0.0072005033],"genre_scores_gemma":[0.061842788,0.0000030485573,0.9368563,0.00032705517,0.00008364441,0.000022301503,0.000035866324,0.000015695721,0.00081327074],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9984563,0.00007326327,0.0002889488,0.00051261584,0.00034979518,0.00031906582],"domain_scores_gemma":[0.9986036,0.00008965852,0.00011656809,0.0009864668,0.000081791084,0.00012191442],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014407732,0.00018461414,0.00017747881,0.0001419287,0.0001917384,0.00019527701,0.0009577611,0.000071383474,0.0002512216],"category_scores_gemma":[0.000024287521,0.00016128205,0.00006489976,0.0004385517,0.000041060797,0.0012668995,0.0004948617,0.00015841768,0.000084276726],"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.000024320325,0.00021327911,0.0007231533,0.00002932409,0.000005623376,0.00013320704,0.000023553943,0.0005495657,0.58138704,0.09755087,0.2938023,0.02555779],"study_design_scores_gemma":[0.000639904,0.00007724592,0.0013934405,0.00021131359,0.0000035165876,0.000013403123,0.0000053009403,0.24929388,0.676107,0.033122163,0.038667828,0.00046501376],"about_ca_topic_score_codex":0.00018714876,"about_ca_topic_score_gemma":0.0000064765527,"teacher_disagreement_score":0.25513446,"about_ca_system_score_codex":0.00004534843,"about_ca_system_score_gemma":0.00007859696,"threshold_uncertainty_score":0.6576891},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013079408,0.00030481143,0.9837959,0.00007889369,0.00014694303,0.00023559098,0.000016852686,0.0004124748,0.0019291298],"genre_scores_gemma":[0.30192566,0.00004400359,0.6977421,0.00019387425,0.0000131216375,0.0000010958257,0.000014462559,0.000012402454,0.00005325643],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977941,0.00018410533,0.00038881888,0.0007985399,0.00039572618,0.00043870223],"domain_scores_gemma":[0.9970442,0.00018166225,0.0001386747,0.0024544282,0.000057267906,0.00012378802],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00060642546,0.00020400432,0.000253921,0.00051456667,0.00013529316,0.00014080395,0.002388721,0.00009023613,0.000038575414],"category_scores_gemma":[0.0003956107,0.00017723774,0.000026088317,0.0015910282,0.00003591104,0.0019316118,0.0022372804,0.00028322765,0.00001816672],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000345386,0.001306201,0.015115594,0.0001605349,0.00004956164,0.00042222484,0.00039136375,0.0005233655,0.38635358,0.39085796,0.02654972,0.17823534],"study_design_scores_gemma":[0.0008330003,0.00004421698,0.0005225075,0.00027932547,0.000004304443,0.0001238749,0.00003463886,0.79472995,0.15802453,0.008871849,0.035868485,0.0006632941],"about_ca_topic_score_codex":0.000037309197,"about_ca_topic_score_gemma":0.0000028836746,"teacher_disagreement_score":0.7942066,"about_ca_system_score_codex":0.00008196079,"about_ca_system_score_gemma":0.00007881852,"threshold_uncertainty_score":0.72275454},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00894334,0.00008413167,0.9856524,0.00014870582,0.00008638201,0.00011221508,0.000015806541,0.0009538934,0.004003137],"genre_scores_gemma":[0.42390522,0.000056888024,0.57507944,0.00024349414,0.000031985528,0.000011408734,0.0000031872544,0.000013831891,0.0006545545],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981708,0.000091784954,0.0003404438,0.00059181836,0.0004443669,0.00036078764],"domain_scores_gemma":[0.99816823,0.00031447856,0.00014549887,0.0011445807,0.0000784679,0.00014873198],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002449834,0.00019831496,0.0002929117,0.00033418686,0.00017898824,0.00018196933,0.0013389812,0.00008429513,0.00069173565],"category_scores_gemma":[0.0001309845,0.00017305136,0.00012359109,0.0015110078,0.000048391314,0.0012604168,0.0005560063,0.00015178704,0.000060133818],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000025058378,0.0018509966,0.016813742,0.000154875,0.0022229669,0.00046995774,0.0013463666,0.0057157204,0.17052308,0.050369617,0.21574931,0.5347583],"study_design_scores_gemma":[0.00007072417,0.000015669531,0.00008047437,0.00003113713,0.00009868548,0.000012764886,0.000010133262,0.7870121,0.20763896,0.00039871407,0.0043377397,0.00029289117],"about_ca_topic_score_codex":0.0000385174,"about_ca_topic_score_gemma":0.0000037140278,"teacher_disagreement_score":0.7812964,"about_ca_system_score_codex":0.000073946314,"about_ca_system_score_gemma":0.000008867929,"threshold_uncertainty_score":0.757402},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0023526433,0.000538545,0.99378467,0.0004037203,0.00034460257,0.0002889513,0.000033181856,0.0012149144,0.0010387502],"genre_scores_gemma":[0.7417616,0.00024055192,0.25630796,0.000404888,0.000045327273,0.00009810231,0.000013186392,0.000056410136,0.0010719763],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9978351,0.00011500273,0.0003851843,0.0006460656,0.00040140978,0.0006172673],"domain_scores_gemma":[0.99828666,0.00020258263,0.0001387086,0.001129631,0.00013607385,0.000106329266],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00011048863,0.00030700472,0.00026288765,0.00024352201,0.00035159732,0.00016176332,0.00087385956,0.0001289979,0.00006600885],"category_scores_gemma":[0.000004429246,0.00029646885,0.00013050625,0.00047898554,0.00011594138,0.00076648995,0.000009518364,0.000578128,0.00015176219],"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.000069453425,0.0011599568,0.000008782271,0.000022026472,0.00004853349,0.000041481577,0.000048380596,0.0022715554,0.6633042,0.0058852844,0.009373841,0.3177665],"study_design_scores_gemma":[0.00048781748,0.00019214778,0.000014711455,0.000043576405,0.000019679499,0.000054889282,0.0000038573685,0.015978165,0.9072481,0.0030279928,0.072508045,0.00042104386],"about_ca_topic_score_codex":0.00005549812,"about_ca_topic_score_gemma":0.000047302936,"teacher_disagreement_score":0.73940897,"about_ca_system_score_codex":0.00019874926,"about_ca_system_score_gemma":0.00010972386,"threshold_uncertainty_score":0.99994874},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00047861124,0.00015401756,0.9969317,0.00017642637,0.00003007279,0.00040062444,0.0002011448,0.00027148784,0.0013559264],"genre_scores_gemma":[0.23890714,0.00006600737,0.7606133,0.00008340632,0.000018343002,0.000005534246,0.00022056671,0.000010019699,0.00007566401],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99805486,0.00009334566,0.00046395024,0.00083679147,0.00032735334,0.00022372032],"domain_scores_gemma":[0.99174523,0.00016427289,0.0001999116,0.007763959,0.000059177015,0.000067454814],"candidate_categories":["open_science"],"consensus_categories":[],"category_scores_codex":[0.00025224962,0.00014594026,0.00023942668,0.00019710633,0.00007442504,0.000050790604,0.0062488425,0.00007067292,0.00004254658],"category_scores_gemma":[0.000073108036,0.00012837138,0.000014111418,0.000612115,0.000068295114,0.0018691398,0.00701993,0.00016142531,0.000009418727],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011591344,0.0005409162,0.00013848802,0.0000531607,0.000012495363,0.000017272263,0.00015638868,0.00070135685,0.07527066,0.011596732,0.027648697,0.88385224],"study_design_scores_gemma":[0.00021765505,0.000009073892,0.00008993662,0.000071172246,0.0000027414615,0.000009895574,0.000010314579,0.9762556,0.014095564,0.001976438,0.007110912,0.00015072791],"about_ca_topic_score_codex":0.00020827449,"about_ca_topic_score_gemma":0.000025814119,"teacher_disagreement_score":0.9755542,"about_ca_system_score_codex":0.000017565622,"about_ca_system_score_gemma":0.000021121648,"threshold_uncertainty_score":0.9991278},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.020920113,0.001108873,0.9769447,0.0005038486,0.00025335542,0.00010781449,2.0203937e-7,0.000076388256,0.00008470298],"genre_scores_gemma":[0.64142483,0.00038959054,0.35778213,0.00023220052,0.00010769472,0.0000029122623,0.0000023520931,0.000013875437,0.00004443127],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998438,0.00016253396,0.00051772856,0.00018618813,0.00034824398,0.00034730812],"domain_scores_gemma":[0.9986674,0.000060674014,0.00072025997,0.0002828942,0.00019301681,0.00007575295],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007171806,0.0001336212,0.00020593086,0.00024345498,0.00014702544,0.00013693376,0.0005858454,0.000023329576,0.000026360005],"category_scores_gemma":[0.00003255451,0.00011409363,0.000084534455,0.00027027464,0.000021586466,0.0025182813,0.00014989279,0.0003021141,0.0000022594818],"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.00028429355,0.00019692999,0.0007776481,0.000018229117,0.00006186975,0.00019162794,0.00037074267,0.039923865,0.6854273,0.0038899544,0.002796556,0.26606095],"study_design_scores_gemma":[0.0035277966,0.00030289224,0.00035535873,0.0004697744,0.0000615299,0.00228469,0.00010449716,0.57300514,0.36489758,0.037149694,0.017273521,0.00056750455],"about_ca_topic_score_codex":0.000009845563,"about_ca_topic_score_gemma":4.4410885e-7,"teacher_disagreement_score":0.62050474,"about_ca_system_score_codex":0.00058688404,"about_ca_system_score_gemma":0.00016226286,"threshold_uncertainty_score":0.46526033},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0035301924,0.00017907622,0.995056,0.00046237872,0.00004334666,0.00014166777,0.000015220955,0.00029912876,0.00027304067],"genre_scores_gemma":[0.79445374,0.000080292186,0.2050274,0.00018108546,0.000013102626,0.000012138771,0.0000026351331,0.0000108230515,0.00021877621],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9989506,0.00004276546,0.00027614963,0.00032327216,0.00023157122,0.00017562804],"domain_scores_gemma":[0.99939656,0.000038402228,0.00013570761,0.00025621467,0.000097635915,0.00007547303],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016186235,0.00014270903,0.0001693907,0.0001446834,0.00018923046,0.00007582781,0.000284575,0.000074074196,0.000008217612],"category_scores_gemma":[0.000004326397,0.0001323738,0.00003382523,0.0002776842,0.00007497799,0.0008660803,0.0000040435107,0.00015468577,0.000002711848],"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.0000132079,0.00008704603,0.0000013875336,0.00003125912,0.000004042806,9.029303e-7,0.00022971144,0.00038220853,0.08717419,0.00008367645,0.00018470283,0.91180766],"study_design_scores_gemma":[0.00036615084,0.000112237074,0.000008187501,0.00018211547,0.000007666743,0.000019522902,0.000020602149,0.067920275,0.9278379,0.000521991,0.002833585,0.00016975249],"about_ca_topic_score_codex":0.0000075148405,"about_ca_topic_score_gemma":0.000009597868,"teacher_disagreement_score":0.9116379,"about_ca_system_score_codex":0.000030985957,"about_ca_system_score_gemma":0.000057550114,"threshold_uncertainty_score":0.5398047},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0041206675,0.00020898925,0.9827542,0.0011157914,0.00022888748,0.00017177238,0.000012680728,0.00039056066,0.010996461],"genre_scores_gemma":[0.79192406,0.00011240993,0.20622931,0.0005722441,0.00013926241,0.000011673125,0.00000799321,0.000017127513,0.0009859194],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99792695,0.00003370026,0.00030921644,0.0006536649,0.00074967585,0.000326799],"domain_scores_gemma":[0.99875605,0.00010063931,0.00022336254,0.00029431598,0.0004961843,0.00012944057],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016390346,0.0002841425,0.00022666174,0.0002506311,0.0002563579,0.00081463513,0.0010309827,0.00008416904,0.00022352616],"category_scores_gemma":[0.00006885571,0.0002287928,0.00003308354,0.00019970408,0.00015687659,0.0012758126,0.00028474926,0.00044706836,0.000029917823],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000062548286,0.00018316272,0.00020630551,0.000059741502,0.000041047388,0.00027311835,0.00053785165,0.00015101933,0.037774224,0.03504723,0.0017176203,0.92394614],"study_design_scores_gemma":[0.0005527315,0.00018830341,0.00015955641,0.00065176527,0.0000133271,0.00029304292,0.000135879,0.9611026,0.010717393,0.023656702,0.0019767836,0.00055188994],"about_ca_topic_score_codex":0.000009838587,"about_ca_topic_score_gemma":0.0000030897177,"teacher_disagreement_score":0.9609516,"about_ca_system_score_codex":0.000079737954,"about_ca_system_score_gemma":0.000055898,"threshold_uncertainty_score":0.9329899},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10939681,0.000039852257,0.88974726,0.000015481199,0.000090601316,0.00009190892,0.0000022864942,0.00033952188,0.0002762841],"genre_scores_gemma":[0.5185992,0.00001547996,0.48130897,0.000032420692,0.000010923317,0.0000016952856,0.000001299344,0.00000343442,0.00002658024],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9991388,0.000029600395,0.00023950927,0.00023648284,0.00019777025,0.00015784675],"domain_scores_gemma":[0.999202,0.00006218132,0.00012240343,0.00046965954,0.000092280556,0.000051432497],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001254828,0.00008551453,0.0001352235,0.00013835878,0.00014141355,0.000022352318,0.00048248688,0.00003432084,0.000012384017],"category_scores_gemma":[0.000087037195,0.00007827403,0.000037411934,0.00029191692,0.000047966594,0.0012699642,0.00030209473,0.00007319199,0.0000036593192],"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.000010838713,0.00014219694,0.0009766942,0.000013152182,0.000005014684,0.000016676418,0.00022716097,0.000506287,0.96869767,0.0076505095,0.0006753717,0.021078454],"study_design_scores_gemma":[0.00038948245,0.00003580408,0.00008784435,0.00004373977,0.0000013275601,0.00003454247,0.000010452129,0.49564463,0.5024338,0.00080058724,0.000420641,0.00009716449],"about_ca_topic_score_codex":0.000044103304,"about_ca_topic_score_gemma":0.0000013004708,"teacher_disagreement_score":0.49513835,"about_ca_system_score_codex":0.000034809556,"about_ca_system_score_gemma":0.000032570522,"threshold_uncertainty_score":0.31919223},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00042097934,0.00005683128,0.9934991,0.00067729247,0.00018065165,0.00029511063,0.0000053958224,0.00095120724,0.00391343],"genre_scores_gemma":[0.013435059,0.000035569323,0.98245007,0.002351379,0.000034632423,0.00012373643,0.000003759519,0.000012828416,0.0015529952],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99891573,0.000016220662,0.00021109864,0.00042520667,0.00016225911,0.0002694898],"domain_scores_gemma":[0.9987068,0.00022132027,0.00007411687,0.00080716226,0.00010421458,0.000086370164],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00011565416,0.00012552792,0.00014711841,0.000091696405,0.00017803012,0.000032717067,0.0009731959,0.000041681404,0.000048327296],"category_scores_gemma":[0.0001486669,0.000106384236,0.00006862643,0.00022574664,0.00004502026,0.0008577804,0.0003350225,0.000075395015,0.00005404608],"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.000026319496,0.00013485827,0.00040971246,0.000017194934,0.000020075062,0.000024516065,0.00021469375,0.00004261065,0.005152327,0.08624168,0.745437,0.16227897],"study_design_scores_gemma":[0.0007752934,0.00018021191,0.00042563461,0.000027232894,0.0000031703644,0.00014830196,0.000011738925,0.049358368,0.061527397,0.05760416,0.8294149,0.0005236005],"about_ca_topic_score_codex":0.000017422215,"about_ca_topic_score_gemma":0.000009304873,"teacher_disagreement_score":0.16175537,"about_ca_system_score_codex":0.000027137585,"about_ca_system_score_gemma":0.000057596117,"threshold_uncertainty_score":0.43382233},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00043388395,0.000048371116,0.998029,0.0001299444,0.00006040824,0.0006142156,0.0000219779,0.00040542457,0.00025675597],"genre_scores_gemma":[0.09597031,0.000014995155,0.9032693,0.00021688163,0.000035031306,0.00003852782,0.00004013463,0.000010975076,0.0004038317],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99870074,0.00005797702,0.00032958316,0.00044919434,0.0002155376,0.0002469594],"domain_scores_gemma":[0.99884796,0.00019673347,0.00017032625,0.0005234884,0.00016942884,0.000092078226],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023289598,0.00018049707,0.00023678648,0.00013567311,0.00009073451,0.00003968337,0.00063278776,0.00008387167,0.00003339253],"category_scores_gemma":[0.000025717198,0.00015097822,0.000083787614,0.00027916435,0.000023154795,0.001029064,0.00008619531,0.00007992155,0.0000063649477],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023909588,0.00010356817,7.686809e-7,0.0000045187053,0.000006551581,9.3434954e-7,0.00015170481,0.000565558,0.12356603,0.0012520722,0.00084809534,0.87347627],"study_design_scores_gemma":[0.00038479047,0.000239875,0.000020982288,0.000049751885,0.0000029939413,9.1093824e-7,0.0000046027294,0.58980346,0.40376824,0.005112971,0.000491908,0.000119483724],"about_ca_topic_score_codex":0.00001466416,"about_ca_topic_score_gemma":2.9799585e-7,"teacher_disagreement_score":0.8733568,"about_ca_system_score_codex":0.00003124874,"about_ca_system_score_gemma":0.000037263275,"threshold_uncertainty_score":0.6156713},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011934042,0.000009139118,0.984392,0.0001383642,0.0000891124,0.00030306767,0.000013388054,0.0011695228,0.0019513605],"genre_scores_gemma":[0.6087612,0.0000011949425,0.39089146,0.000089352514,0.00002571172,0.000013010016,0.000045610133,0.000006727921,0.00016572316],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9987967,0.000050763178,0.00022216978,0.0003799843,0.0002499783,0.00030042656],"domain_scores_gemma":[0.99917734,0.000052052874,0.00010453863,0.0004917077,0.00010457278,0.00006977711],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00007173264,0.00015063645,0.00013717072,0.000073587245,0.00012905487,0.00013630408,0.0004574238,0.000046757825,0.000043791522],"category_scores_gemma":[0.000020768586,0.00011852721,0.00002753144,0.00021566777,0.00012793529,0.0010479959,0.000119216704,0.00008512304,0.000016527596],"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.00007273697,0.0003798611,0.009229051,0.00003726677,0.000009156908,0.000024898964,0.000103894046,0.0010773452,0.117833726,0.8518667,0.006832364,0.012532998],"study_design_scores_gemma":[0.0016233027,0.00022344061,0.05852137,0.00011439134,0.000007723949,0.00004946518,0.000025454658,0.44006494,0.4643603,0.030783216,0.0035119723,0.0007144343],"about_ca_topic_score_codex":0.00018686487,"about_ca_topic_score_gemma":0.00022544977,"teacher_disagreement_score":0.8210835,"about_ca_system_score_codex":0.0000600135,"about_ca_system_score_gemma":0.00005106438,"threshold_uncertainty_score":0.48333997},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.039217815,0.000023286442,0.9594494,0.00022313202,0.00031499687,0.0003638384,0.000047501297,0.00033042638,0.000029578014],"genre_scores_gemma":[0.44260162,0.00001910684,0.5571319,0.00015796571,0.000023896082,2.3076846e-7,0.0000059393537,0.000011556881,0.000047768623],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981104,0.000068555375,0.00026495414,0.0008424325,0.0003133991,0.00040021713],"domain_scores_gemma":[0.9985113,0.0001999544,0.000086457454,0.001005037,0.00006819167,0.0001290244],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023983023,0.00021149097,0.0001986056,0.00020498586,0.00082510285,0.00020032962,0.0006791503,0.000091743466,0.0000058724777],"category_scores_gemma":[0.000015182507,0.00019120322,0.000054078846,0.00037835524,0.00018003747,0.0010275763,0.000011317966,0.00020794716,0.0000024632632],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000079862184,0.000055810888,0.0000027690157,0.00001490103,0.0000049767723,0.0000071202376,0.0001257582,0.012099493,0.08054158,0.000037097823,0.00002248185,0.9070082],"study_design_scores_gemma":[0.00040213772,0.00007942792,0.00007189835,0.00013169815,0.00000909254,0.000036208232,0.000014659062,0.87657243,0.12167824,0.0003766172,0.00040507226,0.00022249107],"about_ca_topic_score_codex":0.0003008818,"about_ca_topic_score_gemma":0.00007305887,"teacher_disagreement_score":0.90678567,"about_ca_system_score_codex":0.000061263396,"about_ca_system_score_gemma":0.00011222296,"threshold_uncertainty_score":0.7797041},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05971855,0.00004196885,0.93765974,0.00006815985,0.00003360072,0.00011048424,0.00000279244,0.00022264509,0.002142086],"genre_scores_gemma":[0.49023828,0.000021687083,0.5095772,0.00008545877,0.000011253427,0.0000035760947,6.985011e-7,0.000005849037,0.000056015462],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99887127,0.000038577957,0.00024047388,0.00037710724,0.00022952177,0.00024307],"domain_scores_gemma":[0.9990008,0.000068599555,0.00012370417,0.0006702331,0.000054769338,0.000081922226],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019455029,0.0001632726,0.00022000476,0.00012359493,0.00011730156,0.000049571827,0.0007295134,0.00005777592,0.000006203218],"category_scores_gemma":[0.00002783591,0.0001260189,0.000033779208,0.00017366969,0.00007378478,0.000691976,0.00076613296,0.00015439189,0.0000016883789],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000033392113,0.00008916198,0.0018535347,0.00021349506,0.000018488978,0.0000024298386,0.0016039261,0.2504444,0.1481601,0.07643106,0.00046462996,0.5206854],"study_design_scores_gemma":[0.00014640977,0.000048713377,0.00009452146,0.0000775064,0.0000026608125,0.000015180781,0.000007859898,0.965163,0.027849665,0.006169141,0.0002652239,0.00016010873],"about_ca_topic_score_codex":0.000014739393,"about_ca_topic_score_gemma":0.0000023030127,"teacher_disagreement_score":0.7147186,"about_ca_system_score_codex":0.000016116273,"about_ca_system_score_gemma":0.000027697479,"threshold_uncertainty_score":0.5138902},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00020669475,0.00004129791,0.9918456,0.00015494035,0.00023716055,0.0003917126,0.0000067489273,0.0007472198,0.006368604],"genre_scores_gemma":[0.16977929,0.00000952803,0.8293462,0.00019965167,0.000018491328,0.00007412452,0.000015596639,0.000011558604,0.00054560835],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9990056,0.00006111202,0.00019958313,0.0003661672,0.00015753256,0.00021000078],"domain_scores_gemma":[0.99891394,0.00013410025,0.00008338495,0.0006744661,0.00012408938,0.00007002924],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017025546,0.00011984879,0.00012977158,0.00007819179,0.0001384432,0.000099401004,0.0006018935,0.000053155836,0.000033941862],"category_scores_gemma":[0.00015273204,0.000098220284,0.000044795826,0.00020191373,0.000024127443,0.0009265918,0.00014583094,0.000060523274,0.000019455341],"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.0000056573413,0.000060546572,0.000010000778,0.0000135412365,0.0000024806739,0.000001104359,0.00003178314,0.0000594883,0.077888854,0.8922108,0.020774055,0.008941699],"study_design_scores_gemma":[0.0005024603,0.000073885356,0.00008914653,0.000030447987,0.0000025823254,0.0000062438885,0.0000070228493,0.15737815,0.72143847,0.060817085,0.059387438,0.00026703178],"about_ca_topic_score_codex":0.0000029878788,"about_ca_topic_score_gemma":6.992019e-7,"teacher_disagreement_score":0.8313937,"about_ca_system_score_codex":0.000022175325,"about_ca_system_score_gemma":0.00002829918,"threshold_uncertainty_score":0.4005307},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0026952093,0.00007472142,0.99514323,0.0007645359,0.00006991471,0.000294095,0.0000073123056,0.00029785192,0.00065315265],"genre_scores_gemma":[0.68969536,0.000025566433,0.30962664,0.00034534483,0.000014462725,0.0000142383515,0.000008179479,0.000005464766,0.00026472798],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9990522,0.000023800527,0.00024843912,0.00029504322,0.00020478379,0.00017570722],"domain_scores_gemma":[0.99919873,0.00006833533,0.00009620708,0.00046926615,0.00010725081,0.000060208517],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001473732,0.00011390895,0.0001554689,0.000092576185,0.00006179336,0.000042664386,0.00062523107,0.000059164013,0.00004111809],"category_scores_gemma":[0.00001221519,0.00009153921,0.000057999398,0.00018108757,0.000026753669,0.0007864552,0.000052203894,0.00005185198,0.0000021607068],"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.00003432806,0.00018048278,0.000005110452,0.000019152882,0.0000044027306,0.0000010684184,0.00027314838,0.00015172186,0.27414843,0.10409978,0.0096060205,0.61147636],"study_design_scores_gemma":[0.00039010335,0.00035317423,0.00038163242,0.00006652847,0.0000027588205,0.0000014925763,0.000008205291,0.041107357,0.9131891,0.029366665,0.014933503,0.00019945434],"about_ca_topic_score_codex":0.000006213832,"about_ca_topic_score_gemma":1.6235462e-7,"teacher_disagreement_score":0.68700016,"about_ca_system_score_codex":0.00001534715,"about_ca_system_score_gemma":0.00003378087,"threshold_uncertainty_score":0.37328604},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00024161095,0.000011343088,0.97465,0.0016797842,0.000060157257,0.00009587488,0.000003742281,0.0011338756,0.022123579],"genre_scores_gemma":[0.41054556,0.0000037683665,0.5865175,0.0023466684,0.000041051237,0.000013038794,0.0000036661104,0.000006861231,0.0005218849],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998991,0.0000355068,0.0001543774,0.00034942687,0.0002524298,0.00021726506],"domain_scores_gemma":[0.9988869,0.00014692095,0.00005129942,0.00079905137,0.00003398575,0.00008185984],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013150228,0.0001202579,0.00011089772,0.00011462884,0.0000989961,0.000095115174,0.0009507464,0.00003775442,0.00016250905],"category_scores_gemma":[0.000033300337,0.000097652264,0.0000356231,0.00020092103,0.000026386042,0.00059026235,0.00024940522,0.00011147255,0.00019668038],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008376121,0.00015387933,0.00010768456,0.000007950273,0.0000034059478,0.000010184895,0.000063216045,0.0023490516,0.011501244,0.33476976,0.038656797,0.61236846],"study_design_scores_gemma":[0.00022704508,0.00007787976,0.0002046169,0.000046018435,0.000001066063,0.0000031081063,0.000005043277,0.630287,0.30690596,0.0032393734,0.058767684,0.00023523306],"about_ca_topic_score_codex":0.0000036892768,"about_ca_topic_score_gemma":0.000003887539,"teacher_disagreement_score":0.6279379,"about_ca_system_score_codex":0.000040779894,"about_ca_system_score_gemma":0.000023512699,"threshold_uncertainty_score":0.39821437},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0049604787,0.0001586388,0.98616785,0.00017146446,0.00006979736,0.00078460056,0.0000060888333,0.0005259108,0.0071551604],"genre_scores_gemma":[0.5101925,0.000038303235,0.48918784,0.00003160586,0.000010058868,0.00012281616,0.0000022821716,0.0000065940567,0.00040795843],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.998645,0.00008853928,0.00030993664,0.00032784932,0.00046496987,0.00016368262],"domain_scores_gemma":[0.998393,0.00015446579,0.00021137681,0.0007142189,0.00048714728,0.000039768332],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00058502913,0.00012609856,0.00017014518,0.00012077031,0.00008753851,0.000024453913,0.00080050755,0.00006820008,0.00010095955],"category_scores_gemma":[0.00010938365,0.000101711754,0.000048494123,0.00021275757,0.000045704302,0.0016199171,0.00032269413,0.00009256982,0.000009780046],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014682965,0.00014336882,0.00014633144,0.000034162204,0.000012303457,1.3436e-7,0.00029360584,0.00022728696,0.03259135,0.027540358,0.019518139,0.9194783],"study_design_scores_gemma":[0.00017072368,0.00013508469,0.00011642662,0.00009082044,0.000005520777,0.0000014564563,0.000004646625,0.43883902,0.54937035,0.0035920942,0.0075796284,0.00009423568],"about_ca_topic_score_codex":0.0000029032667,"about_ca_topic_score_gemma":5.34225e-7,"teacher_disagreement_score":0.91938406,"about_ca_system_score_codex":0.00005494218,"about_ca_system_score_gemma":0.000014070597,"threshold_uncertainty_score":0.41476852},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0053724665,0.00018487369,0.9909197,0.000102119,0.00007940689,0.00011851106,0.000008741151,0.00057538133,0.0026388057],"genre_scores_gemma":[0.50235367,0.000036238274,0.49725604,0.0001221309,0.000007781712,0.000006889447,0.000008900112,0.000009223274,0.00019911796],"study_design_codex":"not_applicable","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9986791,0.00005644127,0.00029915816,0.00036803662,0.00035973292,0.00023755593],"domain_scores_gemma":[0.99867576,0.000079972866,0.00014763277,0.0008900515,0.000105684594,0.000100912],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000095209376,0.00014469145,0.00022313006,0.000058902537,0.00017324256,0.000033593973,0.0011641433,0.00006429211,0.000053421707],"category_scores_gemma":[0.000019327475,0.00011934889,0.000056263092,0.00025875805,0.0003497164,0.00082288036,0.0007437035,0.00014824707,0.00002214833],"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.000032212443,0.0006210144,0.0012120863,0.00006581106,0.00001683004,0.00010750852,0.0006568269,0.00018125767,0.26300386,0.016806083,0.40130398,0.31599253],"study_design_scores_gemma":[0.00045516936,0.00013570975,0.00042655462,0.000103786035,0.0000028190493,0.00007263236,0.000022604621,0.09862128,0.8089612,0.0026799547,0.08812275,0.00039550796],"about_ca_topic_score_codex":0.00008477399,"about_ca_topic_score_gemma":0.0000010345857,"teacher_disagreement_score":0.5459574,"about_ca_system_score_codex":0.000035795565,"about_ca_system_score_gemma":0.00003803345,"threshold_uncertainty_score":0.48669067},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.021725373,0.00008199771,0.97559106,0.00011927493,0.00012696597,0.00016149782,0.000003610524,0.00061547075,0.0015747425],"genre_scores_gemma":[0.5595011,0.00001067105,0.4401119,0.0000383656,0.000017381453,0.000010633187,0.0000043848017,0.000005258062,0.00030027432],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9987024,0.000064170716,0.00039852236,0.00034293623,0.00026528738,0.00022669516],"domain_scores_gemma":[0.99899733,0.00011345208,0.00020407727,0.00054290524,0.00009727656,0.00004495707],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028740225,0.00013210226,0.00020557975,0.00016503214,0.00009201713,0.000071635935,0.00063412194,0.00005510528,0.000024712488],"category_scores_gemma":[0.00008437238,0.000109892535,0.000069188914,0.00026340043,0.000059067675,0.0009421726,0.00037226058,0.000081898936,0.000010353131],"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.000030955438,0.00022134333,0.0035908122,0.000064032654,0.000014228642,0.000012403373,0.00022194523,0.0017707747,0.8467476,0.067719474,0.01316086,0.06644559],"study_design_scores_gemma":[0.00035070343,0.000055245968,0.0015944649,0.00008314912,0.0000030451208,0.000016459688,0.00004634454,0.3398677,0.6202685,0.036050465,0.0014204137,0.00024345999],"about_ca_topic_score_codex":0.00054824114,"about_ca_topic_score_gemma":0.000050551313,"teacher_disagreement_score":0.53777575,"about_ca_system_score_codex":0.00003320165,"about_ca_system_score_gemma":0.00002253998,"threshold_uncertainty_score":0.44812876},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00007440481,0.000025717423,0.99795175,0.00024172828,0.00007212703,0.00023601798,0.00009989707,0.00060817564,0.0006901908],"genre_scores_gemma":[0.032990377,4.0949487e-7,0.965796,0.0006096678,0.00006487522,0.0001083646,0.00012911158,0.0000069011976,0.00029427608],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99909157,0.00003731142,0.00016707653,0.0003513931,0.00016354283,0.00018913488],"domain_scores_gemma":[0.99910223,0.00017083366,0.000054566084,0.00044203483,0.00017699026,0.000053340398],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012220224,0.00010894489,0.000106948486,0.00007373963,0.00013637269,0.00011333452,0.0005793487,0.000041689855,0.000046872818],"category_scores_gemma":[0.000012425014,0.00009108058,0.00003811669,0.00011828996,0.000044837732,0.0009558161,0.000073793,0.000047145753,0.000007853102],"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.000013854708,0.0003420705,0.00020283637,0.00000802069,0.0000063240573,0.000004816588,0.000027060529,0.0013347409,0.010632625,0.83461344,0.0548213,0.09799292],"study_design_scores_gemma":[0.0002723073,0.00008313128,0.0003732117,0.0000063815332,0.00000111468,0.000002269888,0.0000022505387,0.8381571,0.0741894,0.07061327,0.016156716,0.00014283115],"about_ca_topic_score_codex":0.000022750653,"about_ca_topic_score_gemma":0.0000104888095,"teacher_disagreement_score":0.8368224,"about_ca_system_score_codex":0.00003186757,"about_ca_system_score_gemma":0.00005810852,"threshold_uncertainty_score":0.37141585},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0028714899,0.000054972556,0.9951508,0.00031352756,0.000076605706,0.0001663176,0.000052428237,0.00058081734,0.00073301245],"genre_scores_gemma":[0.5561908,0.000014878749,0.44347632,0.00016505126,0.0000122512165,0.000023628772,9.612525e-7,0.00001282684,0.0001032972],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9984792,0.00005796023,0.00037139092,0.00048699125,0.00033808485,0.0002663957],"domain_scores_gemma":[0.99877053,0.000105799874,0.00018500704,0.00069264165,0.00015400196,0.0000920366],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017230582,0.00020606886,0.00021631928,0.00020331857,0.00028689738,0.00015054783,0.0007143721,0.0000699703,0.000043434437],"category_scores_gemma":[0.000011253013,0.00019158471,0.000077319935,0.0003984296,0.0001371466,0.0016617583,0.000007003589,0.0003075706,0.000036767986],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000045302153,0.00052264455,9.489836e-7,0.00004878956,0.000007828403,0.0000045018346,0.00027198435,0.019947248,0.04373522,0.00017490119,0.00015952712,0.9350811],"study_design_scores_gemma":[0.00030821576,0.00010225514,0.000012878393,0.00016927681,0.000007160942,0.0000069162493,0.000010938894,0.20397788,0.79387504,0.00068533205,0.00065134204,0.00019276327],"about_ca_topic_score_codex":0.000010900647,"about_ca_topic_score_gemma":0.000007113297,"teacher_disagreement_score":0.93488836,"about_ca_system_score_codex":0.000075587326,"about_ca_system_score_gemma":0.00009741101,"threshold_uncertainty_score":0.7812597},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00006977537,0.0001009663,0.96454406,0.00014895888,0.00003547701,0.00005286783,0.0000029057737,0.00031190427,0.034733072],"genre_scores_gemma":[0.42755714,0.000039751067,0.5716027,0.00007515952,0.00000676493,0.000003646521,2.1166528e-7,0.0000025715829,0.0007120581],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99943894,0.000020151378,0.00012460124,0.00017551969,0.00013452914,0.00010625497],"domain_scores_gemma":[0.9993255,0.0000735659,0.000060356448,0.00046102618,0.000047482004,0.00003203995],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00005738562,0.00005969923,0.00009188157,0.000059758673,0.000030157458,0.000016858121,0.0006471052,0.00001855668,0.00017465054],"category_scores_gemma":[0.000025793504,0.000048118814,0.000024940073,0.00016583627,0.000033785338,0.0005930731,0.0003630746,0.0000513352,0.000033597793],"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.0000031490545,0.0001220232,0.00011862388,0.000012252842,0.000010865029,0.000016092368,0.0002810307,0.00003111537,0.044843026,0.4531654,0.10128536,0.40011105],"study_design_scores_gemma":[0.0001596598,0.0001276442,0.00026714086,0.00005164112,0.0000017646516,0.0000108453705,0.000026002575,0.10765484,0.8673913,0.017796807,0.0063179494,0.00019442155],"about_ca_topic_score_codex":0.0000063559205,"about_ca_topic_score_gemma":2.72709e-7,"teacher_disagreement_score":0.8225483,"about_ca_system_score_codex":0.000008783636,"about_ca_system_score_gemma":0.000002903045,"threshold_uncertainty_score":0.19622283},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0013118621,0.000022522247,0.99233794,0.00039555255,0.00016267621,0.00088593375,0.000015507318,0.0023859364,0.0024820922],"genre_scores_gemma":[0.12929134,0.000008664166,0.8692769,0.0006130553,0.000088996596,0.0006320287,0.000011218622,0.00002615437,0.000051665706],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9982927,0.000017893113,0.00040198816,0.0006166885,0.00023752952,0.0004331968],"domain_scores_gemma":[0.9988343,0.00012822126,0.00012206398,0.0007072465,0.00012992191,0.0000782257],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017303787,0.00023582291,0.00022417755,0.00027538935,0.00020288558,0.00018504835,0.00096397067,0.00007338784,0.000004410342],"category_scores_gemma":[0.000035513465,0.00022005313,0.00005967517,0.00043359114,0.000021823,0.00048848015,0.0009407677,0.00011044434,0.0000047644535],"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.000023683431,0.000059973463,0.00002375637,0.00008463616,0.000008801986,0.000008203843,0.00015462174,0.000059263537,0.12148269,0.42865756,0.018818531,0.43061826],"study_design_scores_gemma":[0.000071522525,0.00009852403,0.000117098214,0.00008016828,0.0000016576045,0.0000059552863,0.000009633981,0.00069812895,0.90363,0.038172744,0.056749195,0.00036533497],"about_ca_topic_score_codex":0.00007284412,"about_ca_topic_score_gemma":0.00002299995,"teacher_disagreement_score":0.78214735,"about_ca_system_score_codex":0.000106894986,"about_ca_system_score_gemma":0.000040762556,"threshold_uncertainty_score":0.8973506},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012458515,0.000057273377,0.98329574,0.000260411,0.0002186744,0.00024131165,0.000003932426,0.0007559012,0.0027082642],"genre_scores_gemma":[0.4236147,0.00003636188,0.5754279,0.00032090262,0.000037101687,0.000015285621,0.0000019071405,0.000010062938,0.0005357936],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99858147,0.000096545045,0.00025489778,0.0004264984,0.0003214249,0.0003191655],"domain_scores_gemma":[0.99856484,0.00009348804,0.00012566555,0.0010378122,0.00010818893,0.00006999839],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024412145,0.0001544908,0.00012378972,0.000083951934,0.0003386735,0.00020440422,0.0011151036,0.000045722798,0.000083617015],"category_scores_gemma":[0.00010613229,0.00010645783,0.00004586867,0.00047143144,0.00009535941,0.001973998,0.0007046698,0.00018420044,0.000043253993],"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.000005799087,0.00012799412,0.00030131955,0.000020323867,0.0000141545315,0.00004446309,0.0011499216,0.00013545757,0.8366007,0.12676276,0.0071692215,0.02766785],"study_design_scores_gemma":[0.0001488081,0.00003636459,0.00008783131,0.000047907302,0.000004141971,0.00006053877,0.000060768532,0.8310873,0.15360643,0.0019007004,0.0127261095,0.00023313054],"about_ca_topic_score_codex":0.000025586567,"about_ca_topic_score_gemma":0.0000031578275,"teacher_disagreement_score":0.8309518,"about_ca_system_score_codex":0.00010439886,"about_ca_system_score_gemma":0.000017473682,"threshold_uncertainty_score":0.43412244},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0014536474,0.0003120431,0.99657154,0.00021122847,0.0001037209,0.00044045315,0.000026488728,0.00037374583,0.0005071195],"genre_scores_gemma":[0.1287727,0.00017626175,0.86922926,0.0002650842,0.00002519875,0.000042438285,0.000007430353,0.000017033852,0.0014646094],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986212,0.00003678001,0.0003054928,0.000453959,0.00029891162,0.00028361243],"domain_scores_gemma":[0.99864656,0.00023682526,0.0001104421,0.0007871666,0.000102976766,0.00011600442],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000106919186,0.00018587957,0.00024051592,0.00034157248,0.0000766857,0.00006375672,0.0009085986,0.00011791405,0.00013622275],"category_scores_gemma":[0.000032203923,0.00014314646,0.0001166542,0.0006391492,0.00003098633,0.0019957982,0.00029428737,0.00011333621,0.000002599855],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011914427,0.00080820237,0.000021259122,0.00020461848,0.000045731445,0.00002247554,0.0006126953,0.07730811,0.020911036,0.09261121,0.15734665,0.6499889],"study_design_scores_gemma":[0.00030826137,0.00018871423,0.00001738361,0.000048279882,0.000004732521,0.0000050525286,0.0000025000932,0.94382924,0.03283403,0.004558512,0.018016087,0.00018721877],"about_ca_topic_score_codex":0.000006440427,"about_ca_topic_score_gemma":6.697328e-8,"teacher_disagreement_score":0.8665211,"about_ca_system_score_codex":0.000022112794,"about_ca_system_score_gemma":0.00001028927,"threshold_uncertainty_score":0.58373433},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0044259205,0.00009041114,0.9867269,0.0024213733,0.000091596325,0.000301613,0.00003010678,0.0006152978,0.0052968063],"genre_scores_gemma":[0.43122843,0.0000053428807,0.56718755,0.0005954205,0.00003133801,0.000022774713,0.000010171866,0.000007893027,0.000911095],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9981281,0.00006410151,0.00054979895,0.0004772414,0.0004754258,0.00030531245],"domain_scores_gemma":[0.99823403,0.00017739231,0.00018016621,0.001007259,0.00021974227,0.00018140234],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001953132,0.00018338914,0.00036815729,0.00018289806,0.00008173465,0.000048756,0.001511563,0.00007669468,0.00016914448],"category_scores_gemma":[0.000070716305,0.00016343333,0.000072485556,0.00045991087,0.000065936656,0.0006077867,0.00068401144,0.00013883693,0.00017942501],"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.00008193804,0.0009130471,0.0021019776,0.000029514082,0.000038190337,0.0000046757627,0.0010908165,0.004134875,0.0814901,0.5381786,0.22216648,0.14976977],"study_design_scores_gemma":[0.0006276026,0.00028805182,0.0016687248,0.00006606827,0.0000070461388,0.000008683815,0.000049295897,0.2590736,0.5593699,0.004148938,0.17425609,0.000435967],"about_ca_topic_score_codex":0.00002882772,"about_ca_topic_score_gemma":0.00005957042,"teacher_disagreement_score":0.53402966,"about_ca_system_score_codex":0.00007153473,"about_ca_system_score_gemma":0.000073597956,"threshold_uncertainty_score":0.6664618},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14238617,0.0008440465,0.85091203,0.0009584735,0.00023721615,0.0006084065,0.00007762565,0.00043938568,0.0035366574],"genre_scores_gemma":[0.81289095,0.0017873087,0.18504134,0.000111974696,0.000028634566,0.00004240938,0.00005557439,0.000010766583,0.000031054034],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99724877,0.00028046418,0.001009412,0.0005462369,0.00030416902,0.00061095064],"domain_scores_gemma":[0.9969516,0.00025236097,0.0005179244,0.0018645112,0.00023351503,0.00018010284],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005329327,0.00033609278,0.000562664,0.00023018416,0.00035203667,0.0002011696,0.002395648,0.00020238289,0.00002371775],"category_scores_gemma":[0.000096819545,0.00036235247,0.000067415036,0.00078552455,0.00022880285,0.0016991195,0.00092694175,0.00049362873,0.000015238351],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010049474,0.0011706338,0.16875131,0.00009338962,0.00006488934,0.0000035987327,0.0008752122,0.030975925,0.0043596616,0.049559653,0.019303229,0.724742],"study_design_scores_gemma":[0.0008041868,0.000079865094,0.018825557,0.00026998387,0.000009710998,0.000024385308,0.000104747574,0.96779877,0.0027883523,0.000648409,0.008249112,0.0003969205],"about_ca_topic_score_codex":0.00017884791,"about_ca_topic_score_gemma":0.001268217,"teacher_disagreement_score":0.93682283,"about_ca_system_score_codex":0.00032085943,"about_ca_system_score_gemma":0.00012948134,"threshold_uncertainty_score":0.9998828},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0066026333,0.00018278093,0.9920891,0.00026927848,0.00013569799,0.00025026302,0.00006730353,0.0003181344,0.000084801235],"genre_scores_gemma":[0.56407577,0.000042297113,0.435787,0.000044457243,0.0000063278167,0.000014893216,0.000010695964,0.000012015767,0.0000065200074],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9980242,0.00007879611,0.0005302969,0.0006816378,0.00040500576,0.00028000947],"domain_scores_gemma":[0.9983383,0.0000773521,0.00026643035,0.0010771105,0.00016876044,0.00007204617],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028976056,0.00021832871,0.00028672453,0.00034775608,0.00020781466,0.0001927069,0.0017299276,0.00008643891,0.000011389637],"category_scores_gemma":[0.000021080055,0.00020574998,0.000040164057,0.0007928642,0.00022624654,0.0051998287,0.000038333787,0.00032818242,0.000009468866],"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.00009744144,0.0008565545,0.000012626262,0.00029543933,0.000012295208,0.000056257024,0.0013175162,0.08162126,0.30902678,0.0005102825,0.00006209549,0.60613143],"study_design_scores_gemma":[0.00069538964,0.00006746596,0.000026447098,0.00087768154,0.000007765765,0.000021610447,0.0001540552,0.26114744,0.73520684,0.0014988575,0.000052974938,0.00024348116],"about_ca_topic_score_codex":0.00010454036,"about_ca_topic_score_gemma":0.00003232654,"teacher_disagreement_score":0.60588795,"about_ca_system_score_codex":0.00008224761,"about_ca_system_score_gemma":0.00020332355,"threshold_uncertainty_score":0.83902407},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0001907968,0.0004996558,0.9957827,0.000554916,0.00008838501,0.00048043733,0.0000060219827,0.0006172982,0.0017797897],"genre_scores_gemma":[0.4844526,0.00040133824,0.51272213,0.0011017838,0.000040073548,0.00018387611,0.000009878325,0.000016442136,0.0010718696],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998881,0.000088267036,0.00027111286,0.00034844296,0.00012556203,0.00028560794],"domain_scores_gemma":[0.99779665,0.0005784747,0.00016378211,0.001245485,0.0001444972,0.000071133036],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037695796,0.00014341307,0.00020600329,0.00005543734,0.00022870488,0.00012647315,0.0011615703,0.00007896772,0.000057200537],"category_scores_gemma":[0.000044215893,0.00012416748,0.00005844714,0.00021483214,0.000043448395,0.0011312634,0.0004046456,0.00015987745,0.00001660255],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000103214225,0.00022064665,0.000110090776,0.000018140865,0.000052326654,0.000004029754,0.00028157182,0.015965838,0.0020527353,0.44762066,0.36249167,0.1710791],"study_design_scores_gemma":[0.00052101066,0.00006127416,0.000025835945,0.000048045815,0.0000036489332,0.0000011729823,0.000008623855,0.96084297,0.0037611015,0.013690038,0.02086736,0.00016894005],"about_ca_topic_score_codex":0.000022075776,"about_ca_topic_score_gemma":0.0000075448024,"teacher_disagreement_score":0.9448771,"about_ca_system_score_codex":0.000042327756,"about_ca_system_score_gemma":0.0000075666935,"threshold_uncertainty_score":0.50634027},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00022993184,0.00017827735,0.9979376,0.00018949517,0.00015691486,0.00015808518,0.0000024067135,0.000677621,0.00046962596],"genre_scores_gemma":[0.06306415,0.000018432496,0.9356551,0.00032910236,0.000016544645,0.000009279751,0.0000053497242,0.000010907295,0.00089113956],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989006,0.00008451327,0.0001904054,0.00036028313,0.0002634868,0.00020072861],"domain_scores_gemma":[0.9991769,0.000099334655,0.00008175343,0.00049257994,0.00007046138,0.00007893743],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000106024316,0.000121755984,0.00010775306,0.00007921402,0.00013372998,0.00005271941,0.00043021364,0.00006169868,0.00023847203],"category_scores_gemma":[0.000043986507,0.000105732746,0.00003003928,0.0002664527,0.000035921174,0.0007945332,0.00020058556,0.000088041226,0.00007069859],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000067603664,0.0003366889,0.00009112995,0.0000069432285,0.000011423277,0.000012371943,0.00012589993,0.0012514851,0.4634257,0.04596959,0.37296963,0.11579236],"study_design_scores_gemma":[0.000121870624,0.00003313818,0.000016585302,0.00001189788,0.0000017043237,0.000007635394,0.0000017504937,0.9003157,0.06542029,0.0005067471,0.033400327,0.00016234975],"about_ca_topic_score_codex":0.0000129323835,"about_ca_topic_score_gemma":3.548608e-7,"teacher_disagreement_score":0.89906424,"about_ca_system_score_codex":0.00006621553,"about_ca_system_score_gemma":0.000011531238,"threshold_uncertainty_score":0.43116564},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0077010016,0.000034408124,0.9874051,0.00011718536,0.00004966168,0.00016479511,0.0000068656122,0.0002512344,0.004269748],"genre_scores_gemma":[0.37981236,0.000005691167,0.6198426,0.000090684014,0.00001670006,0.0000060486636,0.0000037824068,0.0000057455213,0.00021639762],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9990886,0.000010251301,0.00028180555,0.00022710524,0.0002119398,0.00018033313],"domain_scores_gemma":[0.9992946,0.000023230174,0.000079244004,0.0005186396,0.000053715627,0.000030590298],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000113339454,0.00009640384,0.00013303776,0.000076931814,0.000052139025,0.00003386617,0.00058903795,0.000032977678,0.000042378906],"category_scores_gemma":[0.0000032663502,0.000078652534,0.000045494522,0.00019982668,0.000037756094,0.00052392913,0.00014656005,0.0000535969,0.0000028909453],"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.0000059951226,0.00016737633,0.000052806525,0.000024928739,0.000006527488,0.00000443596,0.000049818635,0.00015333801,0.5364881,0.0918158,0.0021226504,0.3691082],"study_design_scores_gemma":[0.0001824723,0.000060788603,0.000116339,0.000016414628,0.0000018104159,0.0000029426374,0.0000035082185,0.041210674,0.9252138,0.025115708,0.007952291,0.00012324675],"about_ca_topic_score_codex":0.00037950824,"about_ca_topic_score_gemma":0.0000148798445,"teacher_disagreement_score":0.3887257,"about_ca_system_score_codex":0.000032178214,"about_ca_system_score_gemma":0.000038689082,"threshold_uncertainty_score":0.32073572},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12720437,0.000027112477,0.87088287,0.00025609176,0.00015969772,0.00031393656,0.000010919862,0.0007442638,0.00040072887],"genre_scores_gemma":[0.8876713,0.000109560104,0.111885734,0.000116945426,0.00008823926,0.000060026196,0.000012619187,0.000021166677,0.000034432072],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978465,0.00001406947,0.00033531737,0.0008111628,0.00030968685,0.0006832524],"domain_scores_gemma":[0.99851716,0.00005752262,0.00011527387,0.00023623921,0.00045390488,0.00061992905],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00009949534,0.00038367635,0.00034705698,0.00060196745,0.00038978946,0.00039219487,0.0006097676,0.00016444264,0.000016457238],"category_scores_gemma":[0.000033534383,0.0003543071,0.00003703315,0.0007232645,0.00009531513,0.0013152472,0.00010507441,0.0005507666,0.000008177111],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021806089,0.00023735396,0.031667497,0.00018349435,0.0002238741,0.00033803895,0.002674079,0.0016095749,0.028283307,0.55100095,0.0026807073,0.3808831],"study_design_scores_gemma":[0.00043687448,0.000433601,0.0074815177,0.00022825327,0.0000069269986,0.00067245,0.000011373523,0.9860557,0.0032253705,0.0003948372,0.00060388556,0.0004492558],"about_ca_topic_score_codex":0.00065072894,"about_ca_topic_score_gemma":0.00014240456,"teacher_disagreement_score":0.9844461,"about_ca_system_score_codex":0.00021765023,"about_ca_system_score_gemma":0.0003510081,"threshold_uncertainty_score":0.99989086},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0004940982,0.0000455641,0.9961647,0.00007553314,0.00038860316,0.0003139064,0.000006093742,0.00057329226,0.0019382143],"genre_scores_gemma":[0.113638796,0.0000027444737,0.8858239,0.00008737865,0.00005854987,0.000036293186,0.0000014997282,0.000010310872,0.00034050117],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9989033,0.000045000837,0.00017002346,0.00039550796,0.00021323201,0.00027293913],"domain_scores_gemma":[0.99887705,0.00024083855,0.00006339044,0.0006064325,0.00011866968,0.000093616516],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024725206,0.00013108483,0.00013360046,0.00007807517,0.0001226693,0.00007397228,0.00063907076,0.000054465174,0.00002371408],"category_scores_gemma":[0.00017046854,0.000112973656,0.000058282334,0.00023496817,0.00002330005,0.00062310044,0.000114792514,0.00009434324,0.000009007212],"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.00042034953,0.000504486,0.0010657326,0.000060663668,0.00005988988,0.00004439834,0.00029969012,0.008133329,0.061843388,0.82108754,0.035075225,0.07140529],"study_design_scores_gemma":[0.00047277752,0.00021180518,0.00006446719,0.000027251599,0.0000027727244,0.0000031787183,0.000016212338,0.072703555,0.8980554,0.0035578043,0.024659254,0.00022556185],"about_ca_topic_score_codex":0.0000017494843,"about_ca_topic_score_gemma":1.0774343e-7,"teacher_disagreement_score":0.836212,"about_ca_system_score_codex":0.00004637139,"about_ca_system_score_gemma":0.00007038229,"threshold_uncertainty_score":0.46069318},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006075747,0.0005500947,0.99211365,0.00034588046,0.00007499977,0.0005759323,0.000068390254,0.0001685253,0.000026776435],"genre_scores_gemma":[0.2002449,0.00002366577,0.7994828,0.000055850687,0.000017636665,0.000020123967,0.00014487458,0.000007651412,0.0000024817787],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99857527,0.000074980904,0.00029053946,0.00050436106,0.00040808204,0.00014673785],"domain_scores_gemma":[0.99856925,0.00016879055,0.00016765766,0.0007948939,0.00023584123,0.00006355243],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00058287795,0.00012689053,0.00022102143,0.0001146512,0.00012699323,0.00009606723,0.0005245809,0.00005553006,0.000006103823],"category_scores_gemma":[0.00012563879,0.00011006777,0.00001698589,0.00015817139,0.00009211101,0.0010856047,0.00038353854,0.00006695459,5.044781e-7],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000025348487,0.00026548942,0.00023422066,0.00004907253,0.000014613668,6.3069245e-7,0.00020948688,0.0012512519,0.06843543,0.007875968,0.0009910623,0.92064744],"study_design_scores_gemma":[0.00088007085,0.00012319237,0.00073499244,0.00006231994,0.000018762654,0.0000019272038,0.000023267494,0.83844835,0.15540686,0.0039544296,0.00022602912,0.00011976782],"about_ca_topic_score_codex":0.00003929748,"about_ca_topic_score_gemma":0.0000067130477,"teacher_disagreement_score":0.92052764,"about_ca_system_score_codex":0.000038742033,"about_ca_system_score_gemma":0.00011668362,"threshold_uncertainty_score":0.44884333},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002191453,0.00008469074,0.98568714,0.0000639168,0.00011484151,0.00010156748,0.0000034160153,0.00034206867,0.011410883],"genre_scores_gemma":[0.2362674,0.00002395805,0.76300544,0.00013894132,0.0000143477455,0.0000036417775,3.785547e-7,0.000006338281,0.00053952803],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990409,0.000034505876,0.00029348963,0.00023246485,0.0001770513,0.00022161053],"domain_scores_gemma":[0.9989011,0.00019790353,0.00013713907,0.0006391601,0.00006941538,0.000055230677],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018444253,0.000104604056,0.00018918492,0.000083006846,0.000070098205,0.000058836977,0.000865277,0.000049951435,0.0004052864],"category_scores_gemma":[0.00014852585,0.000086574524,0.00003807581,0.00037973063,0.00003469647,0.0012692858,0.0005883416,0.00009740966,0.000015110176],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002193541,0.00037099645,0.00029271084,0.00012629252,0.000048081176,0.00001814505,0.0007718183,0.0020044954,0.3176153,0.517884,0.016534263,0.14431193],"study_design_scores_gemma":[0.00024709402,0.000052015355,0.0000060380316,0.00009888432,0.0000034615298,0.000020135552,0.000018562143,0.7358705,0.24162441,0.016225409,0.005676878,0.000156614],"about_ca_topic_score_codex":0.000049194783,"about_ca_topic_score_gemma":6.188344e-7,"teacher_disagreement_score":0.733866,"about_ca_system_score_codex":0.00003775898,"about_ca_system_score_gemma":0.000012595306,"threshold_uncertainty_score":0.4437602},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0049907193,0.000014064754,0.9835261,0.000118737844,0.00006482278,0.00026832512,0.000007847576,0.0012248086,0.009784537],"genre_scores_gemma":[0.6768641,0.000004122578,0.32197037,0.0004600673,0.000023268436,0.000030385601,0.0000059094077,0.000020507074,0.00062129943],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99829525,0.000018619774,0.00024995982,0.0006522368,0.00039300974,0.00039092998],"domain_scores_gemma":[0.9982352,0.00006342556,0.00009747165,0.0012428076,0.00011169684,0.00024938138],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012688742,0.00022199724,0.0002352752,0.0001967775,0.0001460132,0.00018757727,0.0013708964,0.000037280974,0.00007135548],"category_scores_gemma":[0.00004121791,0.00016623006,0.00004633386,0.00028234906,0.00005104472,0.0017186401,0.0010154406,0.00014130771,0.0001530148],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023942113,0.00076654507,0.0021425588,0.00005415276,0.00010485653,0.00023342433,0.0023177445,0.00030880462,0.006458644,0.084296465,0.023612032,0.87946534],"study_design_scores_gemma":[0.001715613,0.0024374626,0.0055489484,0.0007725225,0.000038212438,0.0003029901,0.0001553283,0.06946989,0.7311055,0.15850319,0.02702409,0.0029262642],"about_ca_topic_score_codex":0.00004215264,"about_ca_topic_score_gemma":0.000012211157,"teacher_disagreement_score":0.8765391,"about_ca_system_score_codex":0.00003178891,"about_ca_system_score_gemma":0.000031403833,"threshold_uncertainty_score":0.6778665},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0009396308,0.000027055627,0.9947543,0.0005425466,0.0001174105,0.00034517824,0.000015567777,0.0011504603,0.0021078177],"genre_scores_gemma":[0.38604656,0.000010440483,0.61189526,0.0014551454,0.00002538331,0.0000727912,0.0000050827693,0.00001571553,0.00047364514],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99837047,0.000037386933,0.00032769865,0.0006080334,0.00022504531,0.00043134755],"domain_scores_gemma":[0.9983065,0.00033802615,0.00013727619,0.0009300901,0.000156809,0.0001312618],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032677385,0.00022225315,0.00024439004,0.00018376164,0.00023104741,0.00022254382,0.0011626778,0.00007125391,0.00008918223],"category_scores_gemma":[0.00018028579,0.00020221986,0.00009237525,0.00026204024,0.000036442343,0.0012739918,0.0003900311,0.00015453334,0.000040498475],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004463524,0.00028165252,0.0001663301,0.00023995539,0.00003243044,0.000025201545,0.00024719734,0.009782919,0.36696216,0.47263616,0.09911527,0.050466098],"study_design_scores_gemma":[0.00036517697,0.000032199903,0.000004408218,0.00008965676,0.0000022564827,0.0000015015519,0.0000034247541,0.80672616,0.18495084,0.006268653,0.0013235258,0.00023220845],"about_ca_topic_score_codex":0.000005410559,"about_ca_topic_score_gemma":0.0000026168323,"teacher_disagreement_score":0.79694325,"about_ca_system_score_codex":0.00007261119,"about_ca_system_score_gemma":0.000053001128,"threshold_uncertainty_score":0.8246287},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0016071133,0.00013891069,0.99480045,0.00018892079,0.00017467518,0.001388435,0.000028632858,0.0016240086,0.000048849317],"genre_scores_gemma":[0.92860556,0.000011157592,0.06970861,0.000018777362,0.000015957585,0.0015273975,0.0000048990373,0.000020304256,0.00008734142],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986296,0.000040487692,0.00033957453,0.0005275284,0.00018358699,0.0002792205],"domain_scores_gemma":[0.9989751,0.0000952109,0.00018449797,0.00056322385,0.00014195283,0.000040033297],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002311797,0.00019923528,0.0002404892,0.0006914015,0.00036292349,0.0000941459,0.0003350445,0.00023279726,6.233225e-7],"category_scores_gemma":[0.000009076262,0.00017448993,0.00003804166,0.0005597343,0.00009901751,0.0006045741,0.0000049351825,0.00022303972,0.0000021471812],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000037244165,0.0003618375,0.0000799889,0.00027200507,0.000043297958,0.000015652698,0.000070439935,0.043914292,0.103167996,0.14491123,0.00025898317,0.70686704],"study_design_scores_gemma":[0.0011677908,0.00081116945,0.000080407444,0.00052311376,0.000030395478,0.0005344005,0.000048644135,0.6150686,0.35468382,0.023688527,0.0027774319,0.00058568007],"about_ca_topic_score_codex":0.0000917066,"about_ca_topic_score_gemma":0.000023886687,"teacher_disagreement_score":0.92699844,"about_ca_system_score_codex":0.00010559541,"about_ca_system_score_gemma":0.000029370576,"threshold_uncertainty_score":0.71154934},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00079169305,0.000031233543,0.9875856,0.0005699853,0.000110072324,0.0005566603,0.000038364768,0.0012010132,0.009115377],"genre_scores_gemma":[0.51189107,0.000014725031,0.4874024,0.00045880617,0.0000064778237,0.00007536211,0.00004203704,0.000032884476,0.00007624091],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99653953,0.0018153666,0.00043693144,0.00061226176,0.00025560675,0.00034029147],"domain_scores_gemma":[0.9953087,0.00024882535,0.0001438842,0.003863931,0.00017784226,0.0002568409],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007346408,0.00025413348,0.00018487597,0.00039092798,0.0008183768,0.0002396084,0.0023467988,0.000046418136,0.000046638186],"category_scores_gemma":[0.00008722733,0.00025975765,0.00009210822,0.0011976665,0.000064012886,0.0004193092,0.00003004856,0.00039651716,0.00028994156],"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.00002997475,0.004695419,0.000014215327,0.000020635087,0.00003791387,0.0000031167276,0.0010836095,0.7471703,0.019594852,0.20040733,0.0006355263,0.026307061],"study_design_scores_gemma":[0.0012785991,0.0006039351,0.0021608023,0.0001122437,0.00005102342,0.000016795588,0.00014835644,0.79540336,0.12940797,0.0006472019,0.06893555,0.0012341739],"about_ca_topic_score_codex":0.000007798196,"about_ca_topic_score_gemma":0.00000529189,"teacher_disagreement_score":0.51109934,"about_ca_system_score_codex":0.00010592052,"about_ca_system_score_gemma":0.00008158426,"threshold_uncertainty_score":0.99998546},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0001383476,0.00012415892,0.9952359,0.0003479211,0.00022102843,0.0004496696,0.00001978296,0.0011049105,0.002358267],"genre_scores_gemma":[0.0030824328,0.0000032659375,0.99461454,0.00014589273,0.000120854296,0.000049595776,0.000028072842,0.000015614447,0.0019397223],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985688,0.000029015328,0.00026999257,0.0005224939,0.00027646846,0.0003332655],"domain_scores_gemma":[0.9987339,0.00012684749,0.000100456295,0.0008301941,0.000097857446,0.00011074232],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001233728,0.00017900828,0.00018307951,0.00012371782,0.00015761553,0.00014100938,0.0011489256,0.00006186656,0.00003847499],"category_scores_gemma":[0.000009482451,0.00014277095,0.00007875049,0.00026768583,0.00003354023,0.00046485945,0.0007164959,0.00009025333,0.00003523814],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007944359,0.0001946473,0.00000630739,0.000013175067,0.0000034465872,0.00001712854,0.000021598838,0.00052206503,0.038684353,0.044995494,0.25367406,0.66185975],"study_design_scores_gemma":[0.00056849525,0.000085225955,0.00015490007,0.000047993297,0.0000028443535,0.000011825716,0.000004399496,0.75330365,0.18116699,0.01976919,0.044608407,0.0002760945],"about_ca_topic_score_codex":0.00009605234,"about_ca_topic_score_gemma":0.000001435322,"teacher_disagreement_score":0.75278157,"about_ca_system_score_codex":0.000039007253,"about_ca_system_score_gemma":0.000052312684,"threshold_uncertainty_score":0.5822031},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0009267854,0.0007523909,0.99417704,0.0006378614,0.0007907642,0.002139334,0.00013357047,0.00037898967,0.00006326507],"genre_scores_gemma":[0.94735426,0.0001404972,0.048563138,0.00010536578,0.000023681692,0.0027204014,0.000004701696,0.000036205372,0.0010517781],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99809444,0.00018737998,0.0005488081,0.00067365036,0.00017624364,0.00031950636],"domain_scores_gemma":[0.9976814,0.0005302019,0.0003399087,0.0011484609,0.0002454112,0.00005463557],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000911748,0.00023058245,0.00041118014,0.00036445906,0.00049187813,0.00005110796,0.00055451505,0.00023910422,0.0000051054994],"category_scores_gemma":[0.000054188364,0.00016967398,0.00011712339,0.00047814965,0.00014977387,0.00024953825,0.000010008075,0.0002114225,0.0000014436466],"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.00018429216,0.0004044742,0.000010194135,0.00061186374,0.00030656316,0.000002464168,0.00052566244,0.010493493,0.64578754,0.16683301,0.008043982,0.16679649],"study_design_scores_gemma":[0.0011764491,0.0007315158,0.0000023402756,0.00016705376,0.000057135414,0.0002315369,0.00023719217,0.031044636,0.8731199,0.017594451,0.075336695,0.00030109996],"about_ca_topic_score_codex":0.00002044295,"about_ca_topic_score_gemma":0.000012969332,"teacher_disagreement_score":0.94642746,"about_ca_system_score_codex":0.00008778611,"about_ca_system_score_gemma":0.000045951176,"threshold_uncertainty_score":0.6919104},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01681476,0.0000105013605,0.9752656,0.00019375954,0.00014230283,0.00007812272,0.000006371257,0.000398012,0.007090529],"genre_scores_gemma":[0.39732894,0.0000050570147,0.6022102,0.000047505502,0.000014401832,0.000002639136,0.0000021895344,0.0000035643436,0.00038547127],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99934644,0.00001653252,0.00014762509,0.00020947978,0.00016051496,0.00011943927],"domain_scores_gemma":[0.9990923,0.000043733544,0.00007824629,0.00066238205,0.00008331299,0.000040055147],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00011337751,0.00006990365,0.00009090369,0.00007697416,0.000033669156,0.00003587042,0.00072220515,0.000026375348,0.00009839705],"category_scores_gemma":[0.000050453582,0.000057290425,0.00002592614,0.00018725978,0.00004828746,0.0007492745,0.00024849607,0.0001140659,0.000013217357],"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.0000010110106,0.00002327929,0.00025169508,0.0000026234698,0.0000010382695,0.0000011630356,0.000025683203,0.000008386153,0.56144756,0.431551,0.0005679924,0.006118566],"study_design_scores_gemma":[0.00011776847,0.000026525715,0.0007484723,0.000004149299,7.9773224e-7,0.000003244452,0.000011598941,0.007434455,0.9814559,0.007851298,0.002256657,0.000089113084],"about_ca_topic_score_codex":0.0000481621,"about_ca_topic_score_gemma":0.000014511859,"teacher_disagreement_score":0.4236997,"about_ca_system_score_codex":0.0000047795065,"about_ca_system_score_gemma":0.000022189877,"threshold_uncertainty_score":0.23362356},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0036845552,0.00013790186,0.9947491,0.00020355833,0.0001445786,0.00021885839,0.0000771472,0.00017213653,0.0006121567],"genre_scores_gemma":[0.483262,0.000057267785,0.5163853,0.000049827064,0.00004343241,0.000007158384,0.00007119351,0.0000062002628,0.00011759157],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99908113,0.00002660854,0.00022519758,0.00037351705,0.00015078094,0.00014274768],"domain_scores_gemma":[0.998611,0.00019755424,0.0001199905,0.00097128254,0.000048307033,0.000051902403],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013439856,0.000095503456,0.00015073913,0.0000719125,0.00006659132,0.00004707891,0.0008488605,0.00004515859,0.00004924646],"category_scores_gemma":[0.00005652844,0.00007748559,0.000018896162,0.00008767807,0.0000430827,0.0011154956,0.00083935587,0.000066183544,0.0000045745774],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000056079843,0.00031350082,0.0076946965,0.00011734737,0.000021420932,0.000010382945,0.00032066213,0.000052068088,0.021456547,0.019774117,0.11129546,0.8388877],"study_design_scores_gemma":[0.00051040767,0.00008232325,0.0031256257,0.000056280005,0.000006010246,0.0000140650955,0.0000077186805,0.9528325,0.030379657,0.005704261,0.007106816,0.00017432203],"about_ca_topic_score_codex":0.0000315116,"about_ca_topic_score_gemma":0.000010271558,"teacher_disagreement_score":0.9527804,"about_ca_system_score_codex":0.000007609134,"about_ca_system_score_gemma":0.000006408532,"threshold_uncertainty_score":0.31597704},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0028217707,0.000055528308,0.9954563,0.0002549426,0.000012795856,0.00075988716,0.000015992387,0.0003082544,0.0003145582],"genre_scores_gemma":[0.46004483,0.000009544362,0.538998,0.00010321856,0.000022698487,0.0005364483,0.000029910498,0.000007753401,0.0002475951],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99919575,0.000020405705,0.00016241966,0.00035988807,0.00010794579,0.00015357981],"domain_scores_gemma":[0.9992371,0.00016604326,0.00010562659,0.00034356865,0.00010272294,0.00004491665],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00009859548,0.00011021255,0.00011098525,0.000048206704,0.00014639861,0.000087245535,0.00025905474,0.000028128085,0.0000035584876],"category_scores_gemma":[0.000003960831,0.00008532294,0.00001403833,0.00012312386,0.000046355082,0.0005387939,0.00010202768,0.000042438805,0.0000027116846],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000058782865,0.00019595433,0.0004646344,0.00007766093,0.000023167564,0.0000037915822,0.00049916765,0.002047809,0.01469761,0.64106256,0.0035902557,0.33727863],"study_design_scores_gemma":[0.0017424072,0.00049587584,0.0021210562,0.00015403847,0.000026384241,0.000017753739,0.00048058052,0.79444706,0.09732805,0.06980457,0.032647453,0.0007347922],"about_ca_topic_score_codex":0.000111737485,"about_ca_topic_score_gemma":0.00010115876,"teacher_disagreement_score":0.7923992,"about_ca_system_score_codex":0.000028354378,"about_ca_system_score_gemma":0.000033145367,"threshold_uncertainty_score":0.34793687},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00043374827,0.000026844518,0.9931453,0.0003521064,0.00016079127,0.0007572652,0.000016550393,0.0012679598,0.0038394611],"genre_scores_gemma":[0.32875848,0.00007735453,0.66766435,0.0007353641,0.00007521646,0.00034100696,0.000028950111,0.00006441632,0.002254886],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9983377,0.000029231212,0.00034137527,0.00057429494,0.00025716526,0.00046024437],"domain_scores_gemma":[0.9987829,0.00008028966,0.00008636183,0.00074496283,0.00010219267,0.00020331114],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021717706,0.00026231832,0.00027522453,0.00014368867,0.0001892912,0.00006049782,0.0013541398,0.0001212069,0.00009013356],"category_scores_gemma":[0.000008590152,0.00021020974,0.00015297133,0.0002253634,0.00006369364,0.0013607586,0.0001579567,0.00014210217,0.000015757123],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005415076,0.0011960452,0.000007621673,0.0002960008,0.00006425313,0.000030091325,0.008673482,0.000015957774,0.05000108,0.07772473,0.033603337,0.8278459],"study_design_scores_gemma":[0.0015061588,0.00048197107,0.0000787895,0.00008354428,0.000010125787,0.000009286008,0.00005885434,0.17131993,0.6928521,0.120138176,0.012909691,0.00055137783],"about_ca_topic_score_codex":0.000043458127,"about_ca_topic_score_gemma":0.0000026686328,"teacher_disagreement_score":0.8272945,"about_ca_system_score_codex":0.000026284113,"about_ca_system_score_gemma":0.000030814812,"threshold_uncertainty_score":0.85721046},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000120378325,0.000058574766,0.9929847,0.0011427877,0.000092962575,0.0002998007,0.000017772303,0.0008870658,0.004395934],"genre_scores_gemma":[0.21744424,0.00004056795,0.7807504,0.00032554977,0.00002659854,0.0000664793,0.0000071040135,0.000008532315,0.0013305203],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99887586,0.000019350704,0.00020828255,0.00042057096,0.00019587984,0.00028003746],"domain_scores_gemma":[0.99890786,0.00008787173,0.00008199332,0.0007438865,0.00009550619,0.00008286515],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015345485,0.00013558553,0.0001384024,0.00010616106,0.00013858212,0.000097055105,0.0007711786,0.00006360531,0.00006230997],"category_scores_gemma":[0.00008421203,0.00011922509,0.000058012753,0.00018778275,0.000023105498,0.0012476385,0.0002236399,0.00008988195,0.000041777],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000033551605,0.00009798585,0.00003113789,0.000028475008,0.0000067478295,0.0000039106812,0.00027316133,0.0009841993,0.028347882,0.7824128,0.0947785,0.0930318],"study_design_scores_gemma":[0.00017706669,0.00002930714,0.000006326951,0.000013912208,0.0000016618229,0.0000047853405,0.0000022120348,0.8828443,0.036611218,0.07885628,0.0013010083,0.00015191536],"about_ca_topic_score_codex":0.0000058820583,"about_ca_topic_score_gemma":0.0000027038327,"teacher_disagreement_score":0.8818601,"about_ca_system_score_codex":0.000049188966,"about_ca_system_score_gemma":0.000008831211,"threshold_uncertainty_score":0.48618582},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000052352676,0.000052960684,0.9934559,0.002670354,0.00009227321,0.00051192124,0.000020507385,0.0004201064,0.002723618],"genre_scores_gemma":[0.2087764,0.0000017417051,0.789473,0.0013692689,0.00001970016,0.000104484636,0.0000028426218,0.00001135712,0.00024120313],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99902934,0.000022025062,0.00017570311,0.00030934092,0.00018864604,0.00027493894],"domain_scores_gemma":[0.9984786,0.0006042692,0.000050071994,0.0007657537,0.000042919033,0.00005841628],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026834974,0.00013932791,0.00011163489,0.00005059795,0.00019946387,0.00007829124,0.0010655,0.00003691664,0.000021540423],"category_scores_gemma":[0.00012690556,0.00007679194,0.00008898979,0.00017703167,0.000070797425,0.00009478698,0.000059195077,0.00011832521,0.000003393179],"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.00004184445,0.00015885368,0.000031443724,0.000050671362,0.000035977588,0.000002386754,0.00050059124,0.0065121013,0.0127161,0.6152573,0.008468094,0.35622463],"study_design_scores_gemma":[0.0007289399,0.00013812936,0.0000924644,0.000026762547,0.000007391847,0.000013578833,0.000022521845,0.27149618,0.45489514,0.04830727,0.22393973,0.00033186414],"about_ca_topic_score_codex":0.000010000207,"about_ca_topic_score_gemma":0.000015325179,"teacher_disagreement_score":0.56695,"about_ca_system_score_codex":0.000013165118,"about_ca_system_score_gemma":0.000050753446,"threshold_uncertainty_score":0.31314847},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00013803417,0.0002350389,0.99644536,0.001668741,0.00012594328,0.00035712193,0.000008306481,0.0008483395,0.0001731109],"genre_scores_gemma":[0.7979292,0.00007100001,0.20088707,0.00076779746,0.00009557287,0.0000830235,0.000003733381,0.000036694997,0.00012589312],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99793994,0.00012657419,0.00041652803,0.0005818589,0.00053448573,0.0004006091],"domain_scores_gemma":[0.998914,0.0001153529,0.00018753346,0.00051285175,0.00013787558,0.00013240648],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031042425,0.00029968726,0.0002309232,0.00024852256,0.00088176294,0.0002891816,0.00093447557,0.00012393811,0.000107331136],"category_scores_gemma":[0.0000022959834,0.00022024344,0.00012965113,0.0006374519,0.000102029546,0.0025237673,0.000008038632,0.00045309865,0.00004603993],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000092570954,0.00026516934,1.09354424e-7,0.00003681545,0.000013757753,0.0000046302575,0.0008905873,0.057836432,0.052159663,0.000051514115,0.00027221025,0.88837653],"study_design_scores_gemma":[0.00043280955,0.00006304902,0.000005309859,0.00012417803,0.000014384096,0.000020131849,0.000020111424,0.75212747,0.24492483,0.0009998276,0.001024197,0.00024372381],"about_ca_topic_score_codex":0.000010598663,"about_ca_topic_score_gemma":0.0000022703102,"teacher_disagreement_score":0.8881328,"about_ca_system_score_codex":0.000079373785,"about_ca_system_score_gemma":0.00008202771,"threshold_uncertainty_score":0.89812666},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.052420624,0.000070870476,0.9392482,0.00008491909,0.00009549366,0.0001355966,0.000003002449,0.00028970843,0.0076515977],"genre_scores_gemma":[0.82480454,0.00010604289,0.17492835,0.00007071679,0.000006650792,0.0000075386765,0.0000016324296,0.0000068472664,0.000067664216],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99884415,0.000049256996,0.00034477006,0.00032458274,0.00019164267,0.00024559163],"domain_scores_gemma":[0.99899375,0.00009508754,0.00009128414,0.0007251227,0.00003592043,0.000058822083],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027593403,0.00012221995,0.00024681952,0.0002086308,0.000030963572,0.000019615705,0.00096952816,0.00005423747,0.00008773337],"category_scores_gemma":[0.000050310442,0.00010232138,0.00004079518,0.00042026595,0.000059059155,0.0006428179,0.00041759238,0.00011164991,0.000010876589],"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.00010547395,0.00039600185,0.040345415,0.00006212225,0.000019889381,0.00009258676,0.0016126576,0.00001546694,0.16668795,0.76833636,0.004677088,0.017649012],"study_design_scores_gemma":[0.0004528612,0.00008037854,0.005457782,0.00006359166,0.0000015131511,0.00000814006,0.000015112821,0.004962845,0.96096903,0.027395086,0.00042941415,0.00016422286],"about_ca_topic_score_codex":0.000116222735,"about_ca_topic_score_gemma":0.00006290979,"teacher_disagreement_score":0.7942811,"about_ca_system_score_codex":0.000025356541,"about_ca_system_score_gemma":0.00003622205,"threshold_uncertainty_score":0.41725445},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0036308898,0.000030351686,0.99343765,0.0002852688,0.000055469554,0.000095371855,0.0000033785234,0.00042526712,0.0020363764],"genre_scores_gemma":[0.5157392,0.000011062614,0.4839461,0.00012045912,0.000015256863,0.0000048334546,0.0000017196655,0.0000027665155,0.00015857223],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99923813,0.000026653732,0.00021191557,0.00021658563,0.00016701255,0.00013972697],"domain_scores_gemma":[0.99919164,0.000075323114,0.00008597016,0.0005387682,0.00006394609,0.000044343124],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013201163,0.0000751975,0.00010913706,0.00008159498,0.000042112402,0.000031229367,0.000604858,0.000034529563,0.000044732733],"category_scores_gemma":[0.00007288911,0.000064646694,0.00003078078,0.0001622853,0.000021000878,0.0011151325,0.0003220591,0.00006206915,0.000026271333],"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.000010130494,0.00010943739,0.0005527241,0.000016038135,0.0000066845587,0.000002283819,0.0002236926,0.00023212422,0.45491228,0.097727664,0.018060155,0.42814678],"study_design_scores_gemma":[0.00022745835,0.00003049289,0.0007138696,0.000030869942,9.105274e-7,0.000005143574,0.000009721515,0.22424614,0.7478854,0.0028476794,0.0238842,0.000118131014],"about_ca_topic_score_codex":0.000018595898,"about_ca_topic_score_gemma":0.000012310909,"teacher_disagreement_score":0.5121083,"about_ca_system_score_codex":0.000028647675,"about_ca_system_score_gemma":0.000012812264,"threshold_uncertainty_score":0.26362157},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00076100574,0.000015560687,0.99485475,0.0014466298,0.00012487489,0.00050714397,0.000012376131,0.00069824065,0.0015794133],"genre_scores_gemma":[0.36710006,0.000025769665,0.63179874,0.0004338773,0.00008769282,0.000058816517,0.000022197806,0.000013291372,0.00045955577],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.998996,0.000015678992,0.00023964714,0.00034934256,0.00015071237,0.00024859715],"domain_scores_gemma":[0.99919665,0.00010332326,0.000064705666,0.00046475686,0.00010359091,0.00006695306],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026269443,0.00013058433,0.00013803535,0.0000942538,0.00012783785,0.00010666805,0.00066321157,0.00005818368,0.000038391347],"category_scores_gemma":[0.000031324475,0.0001127998,0.00005618977,0.00024032056,0.000015706837,0.0013789843,0.00008697557,0.00007001122,0.000038584498],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002647483,0.0001298337,0.000043567343,0.00009099132,0.000010367186,0.0000034233287,0.0003605745,0.00041915165,0.0694958,0.20157118,0.01595167,0.71189696],"study_design_scores_gemma":[0.0002853248,0.00006049882,0.00009280796,0.000052003998,0.0000021184571,0.0000032491766,0.000009219842,0.3419432,0.6263013,0.0035830522,0.027474644,0.0001925691],"about_ca_topic_score_codex":0.0000055091605,"about_ca_topic_score_gemma":0.00001923196,"teacher_disagreement_score":0.7117044,"about_ca_system_score_codex":0.000048742673,"about_ca_system_score_gemma":0.00002900249,"threshold_uncertainty_score":0.4599842},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00572401,0.0000090653875,0.98741406,0.0000953149,0.00023086889,0.0001887996,0.0000040728146,0.0014272021,0.004906587],"genre_scores_gemma":[0.49817088,0.000004205247,0.5015306,0.0001096419,0.000029932115,0.0000052109776,0.000015972413,0.0000042537968,0.00012932697],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9990344,0.000024664501,0.0002252213,0.00028514751,0.00023783531,0.00019274716],"domain_scores_gemma":[0.99918526,0.00008383474,0.00008504881,0.0004638704,0.000112224814,0.00006975199],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041094454,0.000092345836,0.00007933331,0.00013259164,0.00011988574,0.00010067002,0.00039734182,0.000046891862,0.000021830454],"category_scores_gemma":[0.00006754572,0.000081103004,0.000023938639,0.0002441938,0.000030014007,0.0019356902,0.00018253841,0.000095397096,0.00004568301],"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.00004306924,0.00017878153,0.010989361,0.00001678486,0.000009317919,0.000017835671,0.0003634213,0.000056465422,0.6731575,0.1239559,0.018727008,0.17248455],"study_design_scores_gemma":[0.00070962944,0.00015473555,0.07348778,0.00004661421,0.0000042182232,0.00003963004,0.00006626561,0.2692714,0.62371147,0.01429777,0.017880687,0.00032980248],"about_ca_topic_score_codex":0.000023887756,"about_ca_topic_score_gemma":0.000018110575,"teacher_disagreement_score":0.49244687,"about_ca_system_score_codex":0.00007079572,"about_ca_system_score_gemma":0.000011188844,"threshold_uncertainty_score":0.33072844},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0005604948,0.00010163746,0.9980141,0.00008965242,0.0005066741,0.00040135058,0.000038178878,0.0002735714,0.0000143742645],"genre_scores_gemma":[0.55529773,0.00007598812,0.4444092,0.000075647586,0.000055038392,0.00004217137,0.0000025213747,0.000016547254,0.000025146088],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986866,0.00008363537,0.00032432188,0.00041504766,0.00019799112,0.00029238823],"domain_scores_gemma":[0.9989744,0.00025919982,0.00013412676,0.00044937927,0.00011032604,0.00007260806],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00010710889,0.00017715683,0.0002232416,0.00013499167,0.00021237912,0.0000431096,0.00047632217,0.000096743635,0.000003943402],"category_scores_gemma":[0.000004547853,0.00017295385,0.00010484675,0.00045018466,0.00007325789,0.0006445735,0.0000102212225,0.00026545758,3.7496753e-7],"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.0000689361,0.000055569744,6.9252445e-7,0.0000036950623,0.0000059752333,0.0000037055868,0.000021621647,0.56274295,0.0018212604,0.00018992808,0.00004402663,0.43504164],"study_design_scores_gemma":[0.0003208787,0.00019688702,0.000023473696,0.00007013874,0.000008567946,0.000021584481,0.0000034860418,0.9815799,0.017049592,0.00048943696,0.000069856695,0.00016619758],"about_ca_topic_score_codex":0.000018008754,"about_ca_topic_score_gemma":0.000006157536,"teacher_disagreement_score":0.55473727,"about_ca_system_score_codex":0.000037856724,"about_ca_system_score_gemma":0.00001772831,"threshold_uncertainty_score":0.7052853},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0030893404,0.00007698934,0.9934871,0.000024610923,0.000060102455,0.0013459513,0.0000030742585,0.0003583308,0.0015545081],"genre_scores_gemma":[0.68209374,8.927678e-7,0.31693536,0.00002683524,0.000007974292,0.0008862127,0.000002319967,0.000005471289,0.00004120873],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99865955,0.00008509372,0.00034347927,0.00034666178,0.00041314863,0.00015208508],"domain_scores_gemma":[0.99879414,0.00014272542,0.00011603109,0.00076543837,0.000071933755,0.00010974168],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023134581,0.000105691885,0.00019317432,0.00006354457,0.00010707851,0.000019881782,0.0008985095,0.000051732943,0.000021595253],"category_scores_gemma":[0.000028640305,0.00008151789,0.00003627844,0.00015600763,0.000026876385,0.00021409673,0.00027956063,0.00006127565,0.0000042356282],"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.000025855798,0.0050414354,0.00016190183,0.00009107386,0.000031083444,0.0000071152745,0.0007815303,0.00005913,0.020717764,0.95277673,0.004870665,0.01543574],"study_design_scores_gemma":[0.004703141,0.0016041006,0.00011263106,0.00019052744,0.000012201445,0.00006876775,0.00373179,0.06294547,0.88875693,0.0033828916,0.033902805,0.00058877456],"about_ca_topic_score_codex":0.000008380815,"about_ca_topic_score_gemma":0.0000010623394,"teacher_disagreement_score":0.9493938,"about_ca_system_score_codex":0.00002918255,"about_ca_system_score_gemma":0.000038525275,"threshold_uncertainty_score":0.3324203},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.023236003,0.00012461522,0.97462374,0.00007556256,0.000086296546,0.00018635213,0.0000065103814,0.00043453672,0.0012263799],"genre_scores_gemma":[0.4853936,0.000024682011,0.5142548,0.000035568806,0.000012085559,0.00001044364,0.00000475943,0.000005473175,0.00025853858],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987362,0.00007317294,0.00036982592,0.00037807564,0.0002155506,0.00022715419],"domain_scores_gemma":[0.9990619,0.00016813424,0.0001875639,0.000435157,0.00009455013,0.000052702766],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038096978,0.00014063182,0.00023524946,0.00013930982,0.000118871685,0.00009626852,0.00040093792,0.00006320498,0.000017389691],"category_scores_gemma":[0.00010182043,0.00011855135,0.000032761494,0.0002370822,0.00007217306,0.000978344,0.00039281812,0.000087395114,0.0000022678864],"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.000045442353,0.00019016674,0.0029066666,0.000103105864,0.000020202375,0.000006929453,0.0002508929,0.0015359013,0.8291894,0.13398795,0.0058892374,0.025874106],"study_design_scores_gemma":[0.0005476512,0.00006443461,0.0009328439,0.000103979015,0.0000055508076,0.00002352749,0.000058364527,0.6278824,0.32041723,0.048569273,0.0011382957,0.00025643772],"about_ca_topic_score_codex":0.0007898033,"about_ca_topic_score_gemma":0.000036858662,"teacher_disagreement_score":0.6263465,"about_ca_system_score_codex":0.00002590679,"about_ca_system_score_gemma":0.000025897481,"threshold_uncertainty_score":0.48343834},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0020952132,0.000011257748,0.9953015,0.00013809014,0.00025943073,0.00072418194,0.00004646793,0.0008909695,0.00053292746],"genre_scores_gemma":[0.633587,0.000008359679,0.36547902,0.00007003479,0.000053166856,0.00032577742,0.0000017394648,0.000023490662,0.0004514146],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985187,0.000067359906,0.0002997703,0.0005347533,0.00022993528,0.00034945903],"domain_scores_gemma":[0.9990605,0.00019868926,0.00009992995,0.00044861936,0.00010306258,0.00008917195],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021921936,0.00020288318,0.00017959446,0.00016710213,0.00058546127,0.0001217249,0.000435938,0.00008384429,0.000082253886],"category_scores_gemma":[0.000015706497,0.0002045167,0.00010362515,0.00038677864,0.000048668957,0.001173551,0.0000034755533,0.00030372225,0.00004202688],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011397359,0.00010538167,2.2042462e-7,0.000020346117,0.000013215671,0.0000049428586,0.00026992196,0.015077424,0.02992151,0.0002466074,0.00012969716,0.95409673],"study_design_scores_gemma":[0.00061368925,0.0004229021,0.000008706533,0.00017161612,0.000012979693,0.000030390462,0.00004567287,0.64119416,0.35373077,0.0013045999,0.0021153307,0.0003491766],"about_ca_topic_score_codex":0.000031839758,"about_ca_topic_score_gemma":0.0000070519486,"teacher_disagreement_score":0.9537476,"about_ca_system_score_codex":0.00009242025,"about_ca_system_score_gemma":0.000037593276,"threshold_uncertainty_score":0.8339949},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03867486,0.0001410278,0.95810944,0.000040457744,0.0012202795,0.0010457156,0.00011068546,0.0005304122,0.00012713081],"genre_scores_gemma":[0.94963413,0.00002902565,0.050038163,0.00003826784,0.000027965565,0.00012495024,0.0000017815494,0.000041823467,0.00006387926],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99707866,0.00016259144,0.0007952247,0.0008198623,0.0006355032,0.00050815067],"domain_scores_gemma":[0.9976452,0.00029686457,0.00031233672,0.0013352729,0.00019685284,0.0002134469],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005488474,0.0004080791,0.0005836135,0.000510523,0.0005820485,0.00017395348,0.0010325322,0.00023683926,0.000014125077],"category_scores_gemma":[0.000015669959,0.00037717258,0.00012919119,0.00055912323,0.00019899396,0.000849576,0.000019693756,0.0005576038,0.0000024630913],"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.000015657914,0.00029332022,0.000003008906,0.00013700336,0.000056657627,0.000013775586,0.0030327907,0.038699586,0.9347354,0.0022735575,0.00008034476,0.020658871],"study_design_scores_gemma":[0.0011466978,0.0003370803,0.000047361147,0.001031918,0.00004179924,0.00036624464,0.0003662286,0.27807286,0.71462756,0.0005011432,0.0025214406,0.00093966717],"about_ca_topic_score_codex":0.00014167187,"about_ca_topic_score_gemma":0.000004746147,"teacher_disagreement_score":0.9109593,"about_ca_system_score_codex":0.00005809315,"about_ca_system_score_gemma":0.00012565049,"threshold_uncertainty_score":0.99986804},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004877684,0.0000062265517,0.99295723,0.00035997832,0.00025463887,0.00025009448,0.00010141903,0.0002582117,0.0009344854],"genre_scores_gemma":[0.97609794,0.000017430048,0.023125617,0.0006818289,0.0000065639592,0.000012331575,0.0000031866243,0.0000054524703,0.000049672555],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9988915,0.00012078006,0.0003621675,0.00012708725,0.00033300772,0.00016547204],"domain_scores_gemma":[0.99854785,0.0004198318,0.00019604593,0.0007015499,0.000084324536,0.000050381313],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019091247,0.00014706224,0.00012853666,0.00022807487,0.0002150489,0.00006837825,0.0007302597,0.00007437554,0.00067298615],"category_scores_gemma":[0.000027775033,0.00010139375,0.000088740744,0.00031754383,0.00014115374,0.001603202,0.0000049294913,0.0002804814,0.00009644655],"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.00005442481,0.00008363346,2.9258763e-7,0.000017343697,0.000034003602,6.361945e-7,0.0017475861,0.036992118,0.0053914585,0.819901,0.0014717343,0.1343058],"study_design_scores_gemma":[0.0006412865,0.0002720584,0.000009533832,0.00009199879,0.000015039514,0.000023327833,0.00034484259,0.17164527,0.7744587,0.05018607,0.0020045757,0.0003072893],"about_ca_topic_score_codex":0.0000012982341,"about_ca_topic_score_gemma":1.7498368e-7,"teacher_disagreement_score":0.97122025,"about_ca_system_score_codex":0.000032864213,"about_ca_system_score_gemma":0.000015484598,"threshold_uncertainty_score":0.7368726},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0009394582,0.000026575004,0.99256194,0.00032822782,0.00012087922,0.00045065803,0.000018683353,0.00029009182,0.0052634836],"genre_scores_gemma":[0.5215077,0.000009849771,0.4778823,0.00025076888,0.00003694477,0.00021607988,0.000008782018,0.000013969941,0.00007363667],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981078,0.000028361332,0.00036419614,0.0007608537,0.00040421396,0.00033456148],"domain_scores_gemma":[0.99805284,0.00005093473,0.00030492689,0.000093715076,0.0013990081,0.00009858932],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00033727955,0.00025789908,0.00021687808,0.00036875732,0.00018789699,0.0008708399,0.00087861886,0.00008160079,0.000036037833],"category_scores_gemma":[0.00020275735,0.00025471926,0.000042543077,0.00034409852,0.00008184671,0.004704671,0.0000734949,0.00028896995,0.000006354547],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000072541916,0.00024977472,0.00013586911,0.000021013153,0.000014700393,0.0000031719542,0.001848172,0.000009689483,0.05863004,0.57709527,0.00026003685,0.36165974],"study_design_scores_gemma":[0.00068922096,0.00027882212,0.000043265216,0.00023689431,0.0000031395323,0.000017525816,0.00084235345,0.7753251,0.15575814,0.065652214,0.00084580295,0.0003074883],"about_ca_topic_score_codex":0.000007986583,"about_ca_topic_score_gemma":0.0000036623135,"teacher_disagreement_score":0.77531546,"about_ca_system_score_codex":0.0002300063,"about_ca_system_score_gemma":0.00017281043,"threshold_uncertainty_score":0.9999905},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00044488467,0.0012303335,0.95578647,0.039614934,0.00082304195,0.00072236045,0.00026586332,0.00004386528,0.0010682712],"genre_scores_gemma":[0.04970924,0.00007188088,0.9272476,0.021005798,0.0011316069,0.000040747702,0.0005258133,0.00006987276,0.00019742582],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99499446,0.00009567752,0.0019013503,0.00033192008,0.0023663822,0.00031021956],"domain_scores_gemma":[0.9892794,0.00035605527,0.0026430408,0.00041801174,0.0071827755,0.000120716424],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001008581,0.00030668292,0.0006353215,0.0010460642,0.00016901741,0.0001513475,0.0015814482,0.00017061307,0.000014337522],"category_scores_gemma":[0.00079292635,0.00026377398,0.00024820986,0.0002894274,0.000095519565,0.0029853126,0.00033374233,0.00053359056,0.0000023202515],"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.000012459127,0.000051587795,0.00014992956,0.00010861735,0.0000621317,0.000017986622,0.00017486239,0.00043394978,0.0013935203,0.000038940827,0.8970388,0.100517206],"study_design_scores_gemma":[0.0015221166,0.000084769155,0.00024397769,0.0032526357,0.000059183916,0.00029535496,0.000032357762,0.044791177,0.032745022,0.009389601,0.9069777,0.0006060903],"about_ca_topic_score_codex":0.000031545816,"about_ca_topic_score_gemma":0.000010510944,"teacher_disagreement_score":0.099911116,"about_ca_system_score_codex":0.00039916747,"about_ca_system_score_gemma":0.0031097871,"threshold_uncertainty_score":0.99998146},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00077982526,0.00010812297,0.9949591,0.0018512938,0.00012998845,0.0008181677,0.0004252659,0.00046349195,0.0004647166],"genre_scores_gemma":[0.17113063,0.000010946234,0.8274653,0.0010857858,0.00006998142,0.000008929965,0.00019546882,0.000017995084,0.000014978468],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9962725,0.00032292848,0.0007150672,0.0014591643,0.0006644962,0.0005658405],"domain_scores_gemma":[0.9888883,0.00062136893,0.00048643007,0.009551934,0.00028374718,0.00016822177],"candidate_categories":["open_science"],"consensus_categories":["open_science"],"category_scores_codex":[0.0016116248,0.00033332623,0.0005007607,0.00021727796,0.00034285613,0.00045698244,0.014282589,0.000087310436,0.00001937772],"category_scores_gemma":[0.0006101262,0.00023577632,0.000048733076,0.0009965937,0.00013462595,0.0037029667,0.0092589,0.00034606628,0.0000048596135],"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.000111314956,0.00038645687,0.000040585754,0.000100798534,0.00010850342,0.000109487715,0.000729878,0.000584004,0.6808035,0.12796587,0.01433428,0.17472537],"study_design_scores_gemma":[0.00036493645,0.0000554248,0.00012820243,0.000264132,0.000030889638,0.00006521472,0.00007884831,0.80153257,0.18727653,0.009406092,0.00039907327,0.0003980765],"about_ca_topic_score_codex":0.00008940055,"about_ca_topic_score_gemma":0.0000045557194,"teacher_disagreement_score":0.80094856,"about_ca_system_score_codex":0.000048331996,"about_ca_system_score_gemma":0.0001343295,"threshold_uncertainty_score":0.998754},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.037351873,0.00023240023,0.9493453,0.004191244,0.00036175875,0.00026772293,0.000058357025,0.0005049576,0.0076864064],"genre_scores_gemma":[0.85181534,0.00017370585,0.14706466,0.0006506628,0.000060851908,0.00002477174,0.000014006942,0.000012349926,0.00018367625],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99805826,0.00007727778,0.00033579735,0.0005543189,0.0005967049,0.00037762936],"domain_scores_gemma":[0.9984594,0.000112185415,0.00016318659,0.0006814368,0.00048091426,0.000102888975],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027642623,0.00020287144,0.00019396476,0.00014745882,0.00011957736,0.00022094433,0.0016176772,0.000083683735,0.00030389908],"category_scores_gemma":[0.00012316552,0.00019533862,0.00006327362,0.00017366381,0.00009886557,0.0008359798,0.00036399657,0.00035948015,0.00009416873],"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.00007498986,0.00011212562,0.00026802273,0.0000029967748,0.00003715289,0.0000049952787,0.000042177428,0.00021439663,0.011874808,0.81457967,0.0010697985,0.17171885],"study_design_scores_gemma":[0.0007513194,0.00027408995,0.00017609463,0.00008281981,0.000010169133,0.000045795357,0.000010668102,0.5256698,0.1171807,0.05852876,0.29670826,0.00056152436],"about_ca_topic_score_codex":0.000010030116,"about_ca_topic_score_gemma":0.00003856941,"teacher_disagreement_score":0.81446344,"about_ca_system_score_codex":0.0005574675,"about_ca_system_score_gemma":0.00054126245,"threshold_uncertainty_score":0.7965678},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.001909595,0.00006295015,0.9928886,0.00063036126,0.00042295957,0.00049810554,0.000059171627,0.0017413321,0.0017869166],"genre_scores_gemma":[0.30826023,0.000033359916,0.6879195,0.0009991908,0.00012120766,0.000088392975,0.000048004906,0.00002815869,0.0025019664],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985059,0.00004386924,0.00031245642,0.00052200863,0.0003064272,0.00030936414],"domain_scores_gemma":[0.9985861,0.00013082859,0.00010930278,0.000901843,0.00015080895,0.00012108086],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00011954861,0.0001795696,0.00017864395,0.00013071868,0.0001705485,0.00008532287,0.0009480385,0.000100349214,0.00022900525],"category_scores_gemma":[0.0000663074,0.00014575978,0.00007513675,0.0002871044,0.000039271636,0.0011329795,0.00040841036,0.00015782528,0.000053817384],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000075479205,0.00083779404,0.00054528157,0.000059706977,0.000029951849,0.000035266905,0.00037865696,0.0020492794,0.055570755,0.017599735,0.6570622,0.26575592],"study_design_scores_gemma":[0.00040894104,0.00016563767,0.00019198017,0.00003679143,0.0000021923192,0.00001922178,0.0000041011917,0.8985729,0.046281613,0.0012894026,0.05285702,0.00017017634],"about_ca_topic_score_codex":0.0000036154765,"about_ca_topic_score_gemma":9.363742e-7,"teacher_disagreement_score":0.89652365,"about_ca_system_score_codex":0.000030543477,"about_ca_system_score_gemma":0.0000059699337,"threshold_uncertainty_score":0.59439117},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0014855348,0.00008503934,0.9960489,0.0005828593,0.00028145214,0.000533775,0.00014228417,0.0007412551,0.00009884552],"genre_scores_gemma":[0.13054295,0.0001551804,0.8680745,0.0005018722,0.00010840565,0.00015878511,0.000018786472,0.00002945411,0.00041011712],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99821365,0.00004256661,0.0003558811,0.0006471085,0.00035562323,0.00038519857],"domain_scores_gemma":[0.9989297,0.00010761767,0.00015283762,0.0004466603,0.00019415836,0.00016906037],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002576732,0.00025988743,0.00025635865,0.00019790666,0.00054407964,0.00017454223,0.0003905,0.00012669548,0.000021595462],"category_scores_gemma":[0.000007742429,0.00024247232,0.000079886806,0.00042734333,0.00010035508,0.0009711388,0.0000065428167,0.00025965,0.00000638478],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000040314328,0.00015900777,0.000012866282,0.000041528343,0.000010181748,0.000020588679,0.000058754827,0.0005157751,0.003808295,0.000010277595,0.00028900485,0.9950334],"study_design_scores_gemma":[0.0010634933,0.00029623247,0.000019348272,0.00021620888,0.00002136122,0.0001077646,0.000022953946,0.4680769,0.51889795,0.00082046137,0.010176477,0.00028081174],"about_ca_topic_score_codex":0.000008288732,"about_ca_topic_score_gemma":0.000004725112,"teacher_disagreement_score":0.9947526,"about_ca_system_score_codex":0.00008354881,"about_ca_system_score_gemma":0.0001184316,"threshold_uncertainty_score":0.9887734},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.049881976,0.000014203232,0.9484141,0.0007765782,0.00003857703,0.0005762641,0.000011082107,0.000048718866,0.0002384903],"genre_scores_gemma":[0.9246172,0.0000021881042,0.07522721,0.00008970798,0.0000037374202,0.000037975107,0.0000033715319,0.0000035118737,0.0000151447],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99899346,0.000087330096,0.0003551123,0.00017324206,0.00026654347,0.00012430029],"domain_scores_gemma":[0.9987412,0.00041779914,0.00019327257,0.0005653782,0.00006840716,0.000013926742],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024039608,0.00009143526,0.00018227803,0.0000614723,0.0000684838,0.000024796487,0.0010448779,0.000041528863,0.000009330416],"category_scores_gemma":[0.000063363856,0.00004804574,0.0000633919,0.00029564035,0.00007979618,0.0002343262,0.000059600563,0.000112376496,4.931041e-7],"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.00008080643,0.0018551195,0.01973792,0.00041934414,0.000015484744,5.7984596e-7,0.008353139,0.0038819246,0.6648482,0.20428762,0.0022279522,0.09429188],"study_design_scores_gemma":[0.0003151891,0.00006274402,0.0100605115,0.00006853438,0.0000029505866,3.489804e-7,0.000056128105,0.6441523,0.34250677,0.0026649039,0.000050000683,0.000059633854],"about_ca_topic_score_codex":0.000017159573,"about_ca_topic_score_gemma":0.000018347813,"teacher_disagreement_score":0.8747352,"about_ca_system_score_codex":0.000018241783,"about_ca_system_score_gemma":0.000007456989,"threshold_uncertainty_score":0.19592483},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000054349,0.00047629714,0.99444115,0.00051995256,0.0004890078,0.0018159031,0.000065835964,0.002116768,0.000020716352],"genre_scores_gemma":[0.4294917,0.00013939074,0.5678087,0.00007148675,0.000051765495,0.0017033711,0.000005752041,0.000033249224,0.00069461577],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985241,0.00003110742,0.00040715217,0.0005781318,0.00014511448,0.00031436756],"domain_scores_gemma":[0.9988259,0.00012685396,0.00018504597,0.0006260247,0.00015305408,0.00008309685],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020982782,0.00021292537,0.00028209717,0.0006442566,0.0003750396,0.00010128482,0.00045947195,0.00029117815,0.0000031909822],"category_scores_gemma":[0.000035341996,0.00020781305,0.00008095793,0.0003974725,0.000057018533,0.00065831264,0.000005687844,0.00017353188,0.0000058730075],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004721969,0.00008930195,0.0000016178116,0.00007527807,0.000016190721,6.9751206e-7,0.000049363487,0.0010572763,0.0054226234,0.01913104,0.0014191355,0.9727328],"study_design_scores_gemma":[0.0006399549,0.00044361697,0.0000030613603,0.00013738571,0.000019093952,0.0000692617,0.000018818926,0.89314437,0.08633416,0.0060634096,0.012861178,0.0002657133],"about_ca_topic_score_codex":0.000025382482,"about_ca_topic_score_gemma":0.000008307231,"teacher_disagreement_score":0.97246706,"about_ca_system_score_codex":0.000097524884,"about_ca_system_score_gemma":0.000017437347,"threshold_uncertainty_score":0.847437},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0018650732,0.000004048537,0.99583644,0.00013086131,0.0003276493,0.00062067766,0.000007853147,0.0009865345,0.00022083867],"genre_scores_gemma":[0.3272642,5.0987626e-7,0.6723401,0.0002178958,0.00002407422,0.000059859984,0.000014957172,0.0000101309815,0.000068254725],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99894714,0.00006557163,0.00018637456,0.0004183171,0.00018156985,0.0002010109],"domain_scores_gemma":[0.99860686,0.0001629555,0.000088175846,0.00091490475,0.00012854072,0.00009855201],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027785456,0.00013216659,0.00012976289,0.00008866545,0.00011197752,0.0001375684,0.00093517057,0.00007604288,0.000027687769],"category_scores_gemma":[0.00009848692,0.000105194995,0.000034860797,0.00014106306,0.000031996973,0.00047541305,0.000110276145,0.00011150583,0.000006419789],"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.000021532169,0.00007007165,0.000006509472,0.0000049230575,0.0000030688927,8.825837e-7,0.00019692644,0.0031085121,0.5980848,0.36485553,0.0020624022,0.031584833],"study_design_scores_gemma":[0.00017465984,0.00008820544,0.00012067091,0.000003357475,0.0000015414564,0.0000030816439,0.0000034855746,0.5882381,0.40108445,0.008640893,0.0015212185,0.00012032665],"about_ca_topic_score_codex":0.0000035172127,"about_ca_topic_score_gemma":0.000018584233,"teacher_disagreement_score":0.5851296,"about_ca_system_score_codex":0.000012124859,"about_ca_system_score_gemma":0.000058616224,"threshold_uncertainty_score":0.42897272},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0062041683,0.000040281575,0.97852236,0.0016138968,0.00025038645,0.00025182427,0.000019543044,0.00068644155,0.012411088],"genre_scores_gemma":[0.5119045,0.000058956895,0.4870644,0.00027292236,0.000026399768,0.00001925028,0.000034486668,0.000009540827,0.0006095588],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9984819,0.000122951,0.00044544786,0.00045115253,0.00025605236,0.00024246679],"domain_scores_gemma":[0.99854785,0.000072705654,0.0002534832,0.000859394,0.0001731104,0.00009345251],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024788163,0.0001651647,0.0002363392,0.00015679588,0.000121297875,0.00007407843,0.00085722946,0.000076368124,0.0007388745],"category_scores_gemma":[0.000076858385,0.00015333864,0.000058878835,0.0004260937,0.00009132539,0.0016719011,0.0004491519,0.00014487209,0.00006986604],"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.000028552875,0.0007079763,0.00031267648,0.00005668147,0.000026912257,0.0000051634006,0.00068094407,0.00004648995,0.26322803,0.11706211,0.19902694,0.41881752],"study_design_scores_gemma":[0.00095706957,0.00038559723,0.003727664,0.00011911225,0.00001115558,0.00003737824,0.00008292788,0.4089185,0.4568377,0.061528936,0.0666533,0.0007406443],"about_ca_topic_score_codex":0.000058539084,"about_ca_topic_score_gemma":0.000010329258,"teacher_disagreement_score":0.5057003,"about_ca_system_score_codex":0.00007262287,"about_ca_system_score_gemma":0.000012330313,"threshold_uncertainty_score":0.80901575},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0033334314,0.00026430338,0.99394506,0.00038551824,0.000084025625,0.000116045565,0.0000063940606,0.00043301983,0.0014321777],"genre_scores_gemma":[0.32992363,0.00014414174,0.66927207,0.0003119532,0.000021786325,0.0000016692878,0.000047156,0.0000069037224,0.00027070096],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9988375,0.000022530448,0.00019034554,0.0005560048,0.00020724427,0.00018641946],"domain_scores_gemma":[0.9981113,0.00012618133,0.000070068076,0.0015649331,0.000040534087,0.00008698511],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00055227405,0.00009318533,0.00008980864,0.00007315639,0.00009516986,0.000090031666,0.0010447251,0.000047137928,0.000014372759],"category_scores_gemma":[0.00007246431,0.00007768788,0.0000068904387,0.00020348668,0.000034970235,0.0010958514,0.0011641982,0.00009134714,0.000015342797],"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.000003981305,0.000030639396,0.00016395343,0.000004655005,0.0000015819408,0.000006488155,0.000024705158,1.5745358e-7,0.2771852,0.0069471123,0.051411495,0.66422004],"study_design_scores_gemma":[0.0004873511,0.000099325975,0.013637309,0.00008699935,0.000007687979,0.00012312116,0.00007030313,0.21898809,0.5745293,0.015520918,0.17584562,0.00060394953],"about_ca_topic_score_codex":0.000017001144,"about_ca_topic_score_gemma":0.0000039208576,"teacher_disagreement_score":0.66361606,"about_ca_system_score_codex":0.000017553944,"about_ca_system_score_gemma":0.000009979419,"threshold_uncertainty_score":0.31680197},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24341424,0.000068850175,0.75475085,0.00002790471,0.000023340355,0.00030456262,0.0001788438,0.000085596526,0.0011458235],"genre_scores_gemma":[0.5343237,0.000023032324,0.46552867,0.000010863836,0.0000045608817,0.000015889469,0.000030808817,0.000005182168,0.00005726779],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9987913,0.000067155124,0.00051395094,0.00025507365,0.00023149137,0.00014107543],"domain_scores_gemma":[0.998858,0.000196626,0.00033086012,0.00040529273,0.0001853197,0.000023928887],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017073055,0.000104447805,0.0002971362,0.00015206281,0.000009716651,0.000005448406,0.0004192768,0.00006383528,0.000013006987],"category_scores_gemma":[0.00006864272,0.00009101413,0.000041957304,0.00032992903,0.00010010245,0.00036399128,0.000168082,0.00007401684,8.9185284e-7],"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.000355295,0.0036301343,0.017905831,0.00035243353,0.00007357965,0.000020620591,0.0005268117,0.00077707996,0.30217838,0.0036111795,0.02011,0.65045863],"study_design_scores_gemma":[0.0005060934,0.00027278456,0.00048838434,0.00016176296,0.0000044990766,0.000002117158,0.00004514922,0.013781474,0.973313,0.01122181,0.0001062174,0.000096704825],"about_ca_topic_score_codex":0.00095584383,"about_ca_topic_score_gemma":0.000037972237,"teacher_disagreement_score":0.6711346,"about_ca_system_score_codex":0.000016251113,"about_ca_system_score_gemma":0.000027661483,"threshold_uncertainty_score":0.37114483},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.036821112,0.00009071633,0.96144193,0.00068146485,0.000016087042,0.0008232897,0.000019996538,0.000059626538,0.000045775603],"genre_scores_gemma":[0.60769784,0.0000111971995,0.39211452,0.00011850193,0.0000028330448,0.000039680566,0.0000037307937,0.0000035910007,0.000008114968],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99919677,0.00006554215,0.00028261333,0.00013236683,0.00022243736,0.00010029786],"domain_scores_gemma":[0.99870276,0.0004780311,0.0003067518,0.00037882134,0.00010874945,0.000024895906],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015360369,0.000106678104,0.00013747244,0.00006507946,0.00021174048,0.00004466728,0.00040311716,0.000037938466,0.0000061252563],"category_scores_gemma":[0.000022208635,0.00004948786,0.000036129462,0.00024559887,0.0001523477,0.0007874694,0.00009403823,0.000059024256,8.69437e-8],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004358137,0.00048947596,0.0030096378,0.00076318235,0.00010298537,0.0000027753213,0.0052586505,0.10677351,0.28234166,0.006874147,0.00318515,0.59076303],"study_design_scores_gemma":[0.00040937652,0.00008857878,0.0005300022,0.000082952516,0.0000136927,0.0000074183536,0.0001573012,0.71261775,0.2857117,0.000069918075,0.00025315068,0.000058116344],"about_ca_topic_score_codex":0.000026715219,"about_ca_topic_score_gemma":0.000004902909,"teacher_disagreement_score":0.60584426,"about_ca_system_score_codex":0.0000110928095,"about_ca_system_score_gemma":0.000016007203,"threshold_uncertainty_score":0.20180562},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0055603185,0.000024357665,0.9927458,0.0000284293,0.00023172019,0.00051824655,0.0000024599424,0.00043897776,0.00044967755],"genre_scores_gemma":[0.43323743,0.000030890056,0.56646895,0.00013226642,0.00000897558,0.00008139201,0.000016928241,0.0000066035896,0.000016552067],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999005,0.000026793903,0.00039471235,0.00023156704,0.0001363135,0.00020561875],"domain_scores_gemma":[0.9992091,0.00017988727,0.00017430744,0.0002730312,0.00010933699,0.00005434852],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042176037,0.00012150357,0.00016084652,0.00033931833,0.00010337742,0.00008977961,0.00035132322,0.00008247562,0.000009470559],"category_scores_gemma":[0.00026363402,0.000109728775,0.000022807884,0.00029192114,0.000016871081,0.0045658145,0.00030560407,0.00008342605,0.0000054515904],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003088096,0.00012050685,0.00010072197,0.00009438557,0.00001336534,0.0000052642636,0.016160496,0.018406412,0.001886222,0.046595085,0.0013184397,0.9149903],"study_design_scores_gemma":[0.00085657276,0.000062125415,0.00007783025,0.00012037836,0.0000015806926,0.000006028088,0.0002412502,0.96102715,0.019461505,0.01789601,0.000084272426,0.0001652937],"about_ca_topic_score_codex":0.000024966339,"about_ca_topic_score_gemma":0.0000012280385,"teacher_disagreement_score":0.94262075,"about_ca_system_score_codex":0.000027224518,"about_ca_system_score_gemma":0.000014345912,"threshold_uncertainty_score":0.44746095},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.034955293,0.00050027063,0.963155,0.0001689797,0.00023188019,0.00062916026,0.00007305729,0.00023627639,0.000050120823],"genre_scores_gemma":[0.9976859,0.0000191384,0.0020911759,0.000042625354,0.000010849177,0.000106426625,8.2365443e-7,0.000012834873,0.0000302361],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9988021,0.00003981642,0.00041046116,0.00037154,0.00017380943,0.00020223645],"domain_scores_gemma":[0.9988922,0.00020793051,0.00026194518,0.00048950297,0.00011835112,0.000030109752],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016448749,0.00016297316,0.0003409698,0.00035124138,0.00018168055,0.00002968196,0.00047435396,0.00020198348,0.000001448083],"category_scores_gemma":[0.000014305052,0.00012265683,0.000071202434,0.00047495522,0.00022669531,0.0001702649,0.000009923094,0.0002020699,1.9941493e-7],"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.000038068327,0.00039144745,0.0003357342,0.0008523087,0.000066469875,0.0000051408056,0.00011846992,0.0009277013,0.8037113,0.07949304,0.0002225394,0.11383779],"study_design_scores_gemma":[0.0012216471,0.0006304797,0.00033643298,0.00066186563,0.00004440459,0.00008243234,0.00011927091,0.23405844,0.75323886,0.008679363,0.00060121727,0.00032557445],"about_ca_topic_score_codex":0.00005244369,"about_ca_topic_score_gemma":0.000025502533,"teacher_disagreement_score":0.9627306,"about_ca_system_score_codex":0.000018358947,"about_ca_system_score_gemma":0.000053109437,"threshold_uncertainty_score":0.50018007},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07744989,0.000017296228,0.9219154,0.00007601666,0.00006952452,0.00014683357,0.0000073454135,0.00021756625,0.00010012401],"genre_scores_gemma":[0.79822195,0.0000021695487,0.20167756,0.00004055185,0.0000112557145,0.0000132339555,6.2412573e-7,0.000010541469,0.000022095055],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998937,0.000037736467,0.00020363266,0.00035745872,0.00031292418,0.00015123193],"domain_scores_gemma":[0.99905723,0.00022919515,0.00022529297,0.0002629752,0.00015418202,0.00007110425],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00010221306,0.0001606153,0.00016642206,0.00015941777,0.00033867324,0.00014732264,0.00023533544,0.00008347992,0.000022626926],"category_scores_gemma":[0.000005824316,0.00012865358,0.000025964246,0.00024442578,0.0002567159,0.0009214316,0.0000036736164,0.00035640915,0.000002077969],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017736999,0.00010489394,0.000029664936,0.00005759082,0.000012262737,0.0000043322743,0.0004885169,0.20805085,0.027303165,0.00044640497,0.00000800867,0.7633169],"study_design_scores_gemma":[0.00038509496,0.00032466403,0.000059773916,0.00029401944,0.000014247462,0.000036886307,0.00004063014,0.60228187,0.39374548,0.0024327084,0.00018234312,0.00020226643],"about_ca_topic_score_codex":0.0000045458114,"about_ca_topic_score_gemma":0.0000037342757,"teacher_disagreement_score":0.7631147,"about_ca_system_score_codex":0.000015023596,"about_ca_system_score_gemma":0.00008089743,"threshold_uncertainty_score":0.5246341},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011055215,0.00011726251,0.98742956,0.00013409965,0.0000824943,0.00027812223,8.8110613e-7,0.0006079443,0.00029445096],"genre_scores_gemma":[0.77167714,0.000016391516,0.22796014,0.00019913254,0.000025140062,0.000011573366,0.000015706939,0.000010447845,0.00008430689],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985428,0.00007058191,0.00038443305,0.00044628326,0.00022911934,0.00032681818],"domain_scores_gemma":[0.9990188,0.00018180264,0.0001266664,0.00050676614,0.000044689325,0.0001212829],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006436089,0.00016278385,0.00017647247,0.00026369412,0.00013343885,0.00011016311,0.00036149714,0.00012001988,0.0000056354725],"category_scores_gemma":[0.000082144674,0.0001428788,0.000025605419,0.00031889568,0.000045459543,0.0009721736,0.00061177346,0.00023386847,0.0000046998107],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000082793405,0.00019876436,0.0036270565,0.000039492268,0.000005582377,0.00003542167,0.0010250072,0.095261134,0.0070248847,0.0038436041,0.006687312,0.88216895],"study_design_scores_gemma":[0.00034149332,0.00003990971,0.008862203,0.00013229118,0.0000010486631,0.000015513355,0.00006853168,0.97893417,0.007175372,0.0027051594,0.0015442057,0.000180084],"about_ca_topic_score_codex":0.000078818215,"about_ca_topic_score_gemma":0.00005635079,"teacher_disagreement_score":0.8836731,"about_ca_system_score_codex":0.00006373839,"about_ca_system_score_gemma":0.000007685921,"threshold_uncertainty_score":0.5826428},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0054500317,0.00008893661,0.9869076,0.00017458359,0.0012368577,0.0009771377,0.00045031845,0.0005465451,0.004168015],"genre_scores_gemma":[0.30774084,0.00018961524,0.68902904,0.0012547116,0.00032359597,0.0001291321,0.00008744607,0.000082270424,0.0011633402],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99583644,0.000045415985,0.000913258,0.0014195665,0.0009816133,0.00080368295],"domain_scores_gemma":[0.9926902,0.000064620974,0.0008270181,0.000350951,0.005717651,0.0003495245],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0007228306,0.0006860145,0.0005765771,0.00048293296,0.0005425442,0.0012243283,0.0012769327,0.0004176316,0.00015684137],"category_scores_gemma":[0.0011595865,0.0006622759,0.000096340045,0.00076760346,0.00034789665,0.0017963508,0.00013018181,0.0006997326,0.000014659515],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0022813976,0.0033824404,0.0041262596,0.002148979,0.00075628416,0.0002721533,0.0012107664,0.005405659,0.3565255,0.36419216,0.12552008,0.13417833],"study_design_scores_gemma":[0.0012393305,0.00050025666,0.000039887767,0.00051679846,0.000048470178,0.0000802814,0.00013276542,0.91207707,0.070131175,0.008750216,0.005709744,0.0007739984],"about_ca_topic_score_codex":0.000018578157,"about_ca_topic_score_gemma":0.0000035498329,"teacher_disagreement_score":0.9066714,"about_ca_system_score_codex":0.00031179204,"about_ca_system_score_gemma":0.001084662,"threshold_uncertainty_score":0.9998125},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0006048154,0.00010534096,0.9862477,0.0019437475,0.00012335573,0.00014485522,0.000004136551,0.0009042112,0.009921797],"genre_scores_gemma":[0.07210438,0.00011687317,0.92630523,0.0009576628,0.000068822046,0.000008542043,0.0000050139574,0.00001480497,0.0004186777],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99826115,0.00004494759,0.00031577647,0.00040762764,0.0006568897,0.00031361272],"domain_scores_gemma":[0.99881154,0.00008347755,0.000059316462,0.00075814006,0.000059041777,0.00022845229],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00018939209,0.00016242237,0.00019237786,0.0001023495,0.00014066017,0.000077022036,0.0013927518,0.000105201856,0.0015156446],"category_scores_gemma":[0.00004815705,0.00012266834,0.00005910662,0.00028077254,0.000075808995,0.0011628203,0.00048221662,0.00024006683,0.000089196175],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000068303743,0.00036552563,0.000022363924,0.00003133103,0.000011153697,0.00017716094,0.0002160906,0.000018107528,0.04035706,0.029694285,0.04282721,0.88627285],"study_design_scores_gemma":[0.00033024861,0.000034999863,0.000014036825,0.000075779215,0.000001988546,0.0000887279,0.000006014805,0.89238816,0.078429416,0.0041484674,0.024267614,0.00021455843],"about_ca_topic_score_codex":0.00001535192,"about_ca_topic_score_gemma":0.0000019350098,"teacher_disagreement_score":0.89237005,"about_ca_system_score_codex":0.000032387637,"about_ca_system_score_gemma":0.00001715075,"threshold_uncertainty_score":0.9993971},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00021014667,0.00035418876,0.99371904,0.001652676,0.00016830665,0.0013292334,0.0010561274,0.0014675533,0.00004271018],"genre_scores_gemma":[0.7751631,0.00007561734,0.22083363,0.00023676829,0.000083064326,0.0015932021,0.000044677134,0.000058067395,0.001911882],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981917,0.000025765792,0.00041683202,0.0007441492,0.00017619073,0.00044535717],"domain_scores_gemma":[0.9984132,0.00019398685,0.00015870272,0.0009284777,0.00016418847,0.00014146503],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0001612385,0.00028116937,0.00041869504,0.00043488722,0.00034137996,0.00010664115,0.0009100072,0.00031753862,0.0000039057263],"category_scores_gemma":[0.000025294215,0.00025186036,0.000099351964,0.00037789458,0.00006810079,0.0003829296,0.000012046461,0.00031756246,0.0000099377285],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000048575814,0.00013754066,0.0000012573291,0.00015614754,0.000079762984,0.0000028688585,0.00012653678,0.049499135,0.031474344,0.041733317,0.011225106,0.8655154],"study_design_scores_gemma":[0.0014650275,0.00063129433,0.0000015179982,0.00026411173,0.000044516313,0.00017316776,0.00002538088,0.74842626,0.071109936,0.03842466,0.1387833,0.0006508075],"about_ca_topic_score_codex":0.000012495199,"about_ca_topic_score_gemma":0.000019376503,"teacher_disagreement_score":0.8648646,"about_ca_system_score_codex":0.00008969792,"about_ca_system_score_gemma":0.000108106,"threshold_uncertainty_score":0.9999934},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012097618,0.00051414,0.9866891,0.00012822384,0.000035537305,0.00034838816,0.000018937999,0.000110383706,0.000057662404],"genre_scores_gemma":[0.6795712,0.00032220228,0.3199857,0.00002231968,0.0000053849158,0.00006489017,4.8352416e-7,0.000008778677,0.000019045676],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99900836,0.000026770742,0.00029089415,0.0003465603,0.00014878693,0.00017861096],"domain_scores_gemma":[0.9995044,0.00008218455,0.000100506004,0.00017098789,0.00008210175,0.000059808146],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015505619,0.0001432113,0.00018739134,0.00019400826,0.00022389667,0.00009895502,0.00016617557,0.000058888378,0.000004387892],"category_scores_gemma":[0.000004303079,0.00012955388,0.000029755556,0.00022072354,0.00010596142,0.0029346105,0.0000038582925,0.00015150856,3.066246e-7],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000043620345,0.0000843553,0.0000014257012,0.0002200348,0.0000026299597,0.0000010885979,0.0009665128,0.001151126,0.11129729,0.000010655656,0.0000037400357,0.88621753],"study_design_scores_gemma":[0.00041631755,0.00011421145,0.00001094101,0.00016327598,0.0000052779733,0.00000825228,0.00004010432,0.61250776,0.38599032,0.0005879388,0.000058644593,0.000096969554],"about_ca_topic_score_codex":0.000006772492,"about_ca_topic_score_gemma":0.000004263068,"teacher_disagreement_score":0.88612056,"about_ca_system_score_codex":0.000025392377,"about_ca_system_score_gemma":0.000015170863,"threshold_uncertainty_score":0.5283054},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06089469,0.00039291938,0.9364267,0.0014714904,0.000055789955,0.00037374554,0.000032062006,0.000088345645,0.0002642268],"genre_scores_gemma":[0.86700934,0.0012423297,0.13157338,0.000073858886,0.000018276853,0.000031431387,0.000014384675,0.000010682477,0.000026301466],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9981937,0.0003217991,0.0007351586,0.00021176676,0.00033570046,0.00020191373],"domain_scores_gemma":[0.9972195,0.00054090645,0.0004408855,0.0013172353,0.00040255015,0.00007894124],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042685095,0.00014950476,0.00027879316,0.00032842607,0.00022991092,0.000038498667,0.0024185975,0.00009526833,0.000027777496],"category_scores_gemma":[0.0000960734,0.00012706807,0.00008642089,0.0007021238,0.00010968356,0.0005175283,0.00007708356,0.00046077874,0.000001027358],"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.0001669459,0.0009678445,0.0026568456,0.00008178072,0.000047186833,0.0000043366213,0.0023344853,0.010528453,0.11026275,0.0030581024,0.0021289035,0.8677624],"study_design_scores_gemma":[0.0024569926,0.0014285889,0.029363498,0.0051066885,0.000052215444,0.00016090652,0.0001955011,0.13706373,0.7649715,0.048868995,0.009560597,0.00077078136],"about_ca_topic_score_codex":0.000025795163,"about_ca_topic_score_gemma":0.000048547496,"teacher_disagreement_score":0.8669916,"about_ca_system_score_codex":0.00008505719,"about_ca_system_score_gemma":0.000104153834,"threshold_uncertainty_score":0.5181685},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010309914,0.00037498982,0.9866591,0.00021290148,0.000035943514,0.000272116,0.00003336133,0.00030084728,0.0018008272],"genre_scores_gemma":[0.5847278,0.0000040958307,0.41482288,0.00010481493,0.00002369461,0.00001801745,0.0000053436015,0.0000086056825,0.00028474335],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9989788,0.00001287585,0.00030416285,0.00032114223,0.00018638118,0.00019667388],"domain_scores_gemma":[0.9990787,0.00012706582,0.00013836674,0.000511338,0.00006594237,0.00007858008],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000073365394,0.00013537447,0.0002460845,0.00007270774,0.00006626364,0.00011606265,0.0006279341,0.000059218288,0.000024514118],"category_scores_gemma":[0.000019388648,0.00010546934,0.000043084525,0.000116711904,0.00008878333,0.00091789867,0.00043995358,0.000069837806,0.000005472708],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000028693576,0.00028779815,0.0071948385,0.00004018438,0.000011348419,3.0683807e-7,0.00023415765,0.000042106098,0.00655126,0.041347973,0.008661268,0.93560004],"study_design_scores_gemma":[0.0005548869,0.00013972986,0.00025808622,0.00010375654,0.0000037143877,0.0000049547716,0.00004186272,0.11198662,0.342494,0.003982314,0.5401628,0.0002672879],"about_ca_topic_score_codex":0.000004592909,"about_ca_topic_score_gemma":0.0000023849739,"teacher_disagreement_score":0.9353328,"about_ca_system_score_codex":0.000015017965,"about_ca_system_score_gemma":0.000017165885,"threshold_uncertainty_score":0.4300915},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1618346,0.00014421972,0.83637136,0.00032165425,0.000067470624,0.00042958529,0.00003874708,0.00067056046,0.00012182779],"genre_scores_gemma":[0.8975558,0.000043122425,0.10210407,0.000025093785,0.00001604245,0.00016567012,0.000023145853,0.000015562728,0.00005148208],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9984551,0.000018147104,0.00043079126,0.00051638123,0.00019289534,0.00038668947],"domain_scores_gemma":[0.9985149,0.000062186125,0.00027037252,0.00086482574,0.00025325365,0.000034466473],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00011696392,0.00019954501,0.00029461848,0.0002777529,0.00008954496,0.00009895026,0.0012433194,0.00020070256,0.000004257973],"category_scores_gemma":[0.00001782506,0.0001960318,0.00007013732,0.0004826023,0.00013797183,0.0008566627,0.00028940963,0.00015867391,0.000005259713],"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.000008001268,0.00007865025,0.0023020387,0.00004661451,0.000019695586,0.0000092610135,0.000054842312,0.00016562504,0.2649995,0.15756495,0.00022403717,0.5745268],"study_design_scores_gemma":[0.00039112484,0.00011732446,0.00019966597,0.000059602124,0.000006553616,0.000013951395,0.00008709774,0.014191789,0.8787251,0.10149329,0.0044712797,0.00024319088],"about_ca_topic_score_codex":0.00007524831,"about_ca_topic_score_gemma":0.00005033148,"teacher_disagreement_score":0.73572123,"about_ca_system_score_codex":0.000042285676,"about_ca_system_score_gemma":0.00008574988,"threshold_uncertainty_score":0.7993945},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002461903,0.00013458694,0.99343705,0.00035193772,0.00035195478,0.0010238487,0.0017870225,0.0003903397,0.00006136113],"genre_scores_gemma":[0.43690747,0.000057316753,0.56230414,0.00015978553,0.00003559666,0.0000691972,0.000440881,0.00001101109,0.000014593711],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.996535,0.0003989144,0.0007328407,0.0012685589,0.00055627164,0.00050842046],"domain_scores_gemma":[0.9948846,0.00064006855,0.00047865775,0.0033957388,0.0003700826,0.00023085388],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010058684,0.00037127634,0.00047113115,0.000108655244,0.00024072884,0.00020264696,0.004327502,0.0001214096,0.00003418759],"category_scores_gemma":[0.0005361048,0.00031548063,0.000081619044,0.0003075836,0.00014557195,0.0020238326,0.0022212288,0.00021580285,0.000024267743],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008742148,0.002063747,0.0006305902,0.00017522056,0.00007217952,0.000015257095,0.00017012234,0.010336709,0.05782906,0.12061804,0.08788299,0.71933186],"study_design_scores_gemma":[0.0009758001,0.0002533956,0.001132504,0.00037361516,0.000013566874,0.000007204817,0.000009123819,0.89634675,0.08105092,0.0074656038,0.011994674,0.00037683855],"about_ca_topic_score_codex":0.000049993076,"about_ca_topic_score_gemma":0.000012528965,"teacher_disagreement_score":0.88601005,"about_ca_system_score_codex":0.00011594108,"about_ca_system_score_gemma":0.00014366841,"threshold_uncertainty_score":0.9999297},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0013262195,0.00030003747,0.98105574,0.00013385348,0.000054037337,0.000104800645,0.0000052311198,0.00059024827,0.016429843],"genre_scores_gemma":[0.62350243,0.000040582934,0.37614983,0.00006877201,0.000004980296,0.0000052248856,7.340148e-7,0.0000029591133,0.00022448252],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99917483,0.000043120737,0.00019399376,0.0002389645,0.00021511219,0.00013397144],"domain_scores_gemma":[0.9991543,0.00009813236,0.000099778445,0.0005196836,0.00007950951,0.00004858631],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00006213418,0.000086904045,0.00013397081,0.00007577433,0.00004703485,0.000019484198,0.0008773449,0.00003608193,0.00025914333],"category_scores_gemma":[0.00002497664,0.00006441509,0.000027343587,0.00028018508,0.000060486593,0.00071971165,0.0003885731,0.00006671922,0.000034909477],"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.000017136392,0.00039332363,0.00085536693,0.00002669987,0.0000186305,0.000034044817,0.0007404083,0.00013735463,0.19938071,0.39021856,0.06912452,0.33905327],"study_design_scores_gemma":[0.00022293498,0.0002322082,0.0006693186,0.00010305477,0.0000020535351,0.000014896457,0.000036163667,0.3478465,0.6279616,0.015445499,0.0072275554,0.00023821156],"about_ca_topic_score_codex":0.000018862203,"about_ca_topic_score_gemma":8.4999397e-7,"teacher_disagreement_score":0.62217623,"about_ca_system_score_codex":0.000011075786,"about_ca_system_score_gemma":0.0000051551847,"threshold_uncertainty_score":0.28374377},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0012111196,0.00014780831,0.9908562,0.00013885247,0.00012407001,0.00009303321,0.0000021057062,0.00032758614,0.007099232],"genre_scores_gemma":[0.54362506,0.000019725328,0.45572555,0.00014464327,0.000028835071,0.000007319965,9.625352e-7,0.000004229007,0.00044369575],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9990716,0.000038703758,0.00023332908,0.00016492675,0.00021749228,0.00027394723],"domain_scores_gemma":[0.9990603,0.00007079567,0.00011352549,0.0005972729,0.000056093777,0.00010202945],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028341048,0.000085904234,0.00016693062,0.00007683669,0.00004259844,0.000023570767,0.00057809125,0.000032429056,0.00024200854],"category_scores_gemma":[0.00004994501,0.00006762756,0.000042538446,0.00018653263,0.000027385158,0.0011034172,0.00058332586,0.00006895032,0.000058609778],"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.0000020293417,0.00010369677,0.0007130972,0.00001869885,0.000008086871,0.0000012132881,0.00014248594,0.000019754922,0.53069556,0.4304994,0.024419667,0.013376338],"study_design_scores_gemma":[0.00007704254,0.000027801554,0.0005999712,0.00003257118,0.0000017934283,0.0000053492136,0.000008585211,0.003880999,0.97681296,0.005402589,0.013042713,0.00010765378],"about_ca_topic_score_codex":0.0000113924525,"about_ca_topic_score_gemma":2.0714604e-7,"teacher_disagreement_score":0.5424139,"about_ca_system_score_codex":0.000022305705,"about_ca_system_score_gemma":0.000015202184,"threshold_uncertainty_score":0.27577716},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002493063,0.00003296383,0.99521327,0.0006956455,0.000072773684,0.00010178705,8.158901e-7,0.00085863966,0.0005310212],"genre_scores_gemma":[0.5013713,0.0000054616344,0.49828506,0.00029457876,0.000010277364,0.000005521144,0.000003089258,0.0000039134284,0.000020768404],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991213,0.000020781546,0.00018129918,0.00030461393,0.00019649544,0.00017547757],"domain_scores_gemma":[0.9993337,0.00002232613,0.000032143147,0.0004852032,0.000052325322,0.000074333526],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00009195899,0.00009188523,0.00009644947,0.00007500167,0.00008919873,0.00007019766,0.00066132843,0.000045486344,0.00001704727],"category_scores_gemma":[0.000026094958,0.00007824406,0.000030014648,0.00018718763,0.00002379128,0.000895526,0.0003523884,0.0001182938,0.000060042843],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000044823983,0.00004609379,0.0000035319083,0.0000023618732,0.0000023978187,0.0000063476627,0.00010906812,0.21416607,0.0026119642,0.6699128,0.00011628777,0.11301858],"study_design_scores_gemma":[0.00017321597,0.000034151555,0.0000031819256,0.000014011188,6.0977305e-7,0.000011680076,0.0000056546414,0.89551985,0.021008337,0.08280116,0.0003221526,0.00010598979],"about_ca_topic_score_codex":0.000033419572,"about_ca_topic_score_gemma":0.0000032539367,"teacher_disagreement_score":0.6813538,"about_ca_system_score_codex":0.000033299548,"about_ca_system_score_gemma":0.000035768917,"threshold_uncertainty_score":0.31907},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00012965036,0.00004977683,0.9723829,0.00012570004,0.000028211361,0.00006598503,0.0000014553073,0.00034007314,0.026876243],"genre_scores_gemma":[0.3281828,0.000060191524,0.6702247,0.00017127563,0.00001175606,0.00001108694,0.0000024882781,0.0000049056484,0.0013307693],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994468,0.000018000665,0.00014212167,0.0001619067,0.00014462016,0.00008656132],"domain_scores_gemma":[0.99926966,0.000039107697,0.00006412403,0.00053874176,0.000058515263,0.000029861698],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000051327854,0.000050328592,0.00007187591,0.00006595219,0.000023444518,0.000016186099,0.00051740615,0.00002412534,0.00018718893],"category_scores_gemma":[0.0000433159,0.000041381714,0.000016691878,0.0003020239,0.000017412167,0.00044794806,0.00020748764,0.000031353014,0.000022440323],"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":[7.8711145e-7,0.00012769435,0.00037395328,0.000014925173,0.0000029019325,0.0000038857047,0.00023711742,0.000038640424,0.014885564,0.7089754,0.060968984,0.21437018],"study_design_scores_gemma":[0.00036599074,0.00022967269,0.0011524734,0.000087195964,0.000003668445,0.000024407778,0.000014960597,0.41336092,0.38900974,0.1284076,0.0669595,0.00038385313],"about_ca_topic_score_codex":0.000013387457,"about_ca_topic_score_gemma":0.000001242181,"teacher_disagreement_score":0.5805678,"about_ca_system_score_codex":0.000008171723,"about_ca_system_score_gemma":0.0000040897007,"threshold_uncertainty_score":0.20495875},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013454156,0.000007457281,0.9851641,0.0000838246,0.00015596113,0.00036769843,0.000018220531,0.00040091388,0.000347648],"genre_scores_gemma":[0.9442043,0.000015740756,0.055158354,0.00053229625,0.0000040748396,0.000031900938,0.000003367639,0.0000059761182,0.000044019605],"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9988049,0.00008790298,0.0003932401,0.0001632569,0.0003710816,0.00017957464],"domain_scores_gemma":[0.9989322,0.00008827623,0.00020468532,0.00053101056,0.00017669273,0.00006717068],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027459912,0.00017243554,0.00017260884,0.0003183438,0.00015882376,0.00008384482,0.0004629285,0.00007701287,0.000017484987],"category_scores_gemma":[0.000010888701,0.00013128377,0.000059748912,0.00028154431,0.00010547672,0.0033584337,0.000002725159,0.00021087895,0.000060955615],"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.0022264975,0.00060757453,0.0000015093441,0.000099176905,0.00005093709,0.0000024418298,0.0035993722,0.49562484,0.093172565,0.07363386,0.00048653912,0.3304947],"study_design_scores_gemma":[0.0006296532,0.0007941424,0.000016431992,0.0001998719,0.000007714841,0.0000067377528,0.00016678513,0.08055799,0.9151199,0.0020760733,0.0002290197,0.0001956806],"about_ca_topic_score_codex":0.0000040659515,"about_ca_topic_score_gemma":6.331889e-7,"teacher_disagreement_score":0.93075013,"about_ca_system_score_codex":0.0000544628,"about_ca_system_score_gemma":0.00005382674,"threshold_uncertainty_score":0.5353597},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05104555,0.000045231227,0.94796455,0.00005664056,0.00008034496,0.00021014083,0.000013434142,0.0004659259,0.00011820478],"genre_scores_gemma":[0.90608764,0.000106876694,0.09360741,0.000071923285,0.000024731436,0.000023927036,0.00001867534,0.000010385972,0.00004843129],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990814,0.00006461629,0.00015199045,0.0003530363,0.0001696921,0.00017930294],"domain_scores_gemma":[0.99931455,0.000088666435,0.00012026763,0.00030597483,0.00010284486,0.00006768133],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014074516,0.000120479795,0.00012937233,0.00010362788,0.00027021335,0.00007008877,0.00023320699,0.000034652207,0.0000017223715],"category_scores_gemma":[0.00006800939,0.0001041392,0.000012416474,0.00023056475,0.00006845695,0.0014144029,0.00018579043,0.00009847918,0.000003253218],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011675693,0.00077813416,0.07851767,0.00030654974,0.00020934956,0.00060928665,0.027674003,0.029560896,0.6610697,0.13685119,0.011355049,0.0519006],"study_design_scores_gemma":[0.0010401789,0.00022343545,0.011479223,0.00018373915,0.000006310234,0.000078221456,0.00010221529,0.921017,0.06256974,0.0025468532,0.00044279033,0.00031029663],"about_ca_topic_score_codex":0.000029121436,"about_ca_topic_score_gemma":0.000009053527,"teacher_disagreement_score":0.8914561,"about_ca_system_score_codex":0.0000374306,"about_ca_system_score_gemma":0.000023686678,"threshold_uncertainty_score":0.42466736},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00028784387,0.000013087452,0.96200925,0.0004217297,0.00004822242,0.00009619217,0.0000031787565,0.0010416671,0.036078826],"genre_scores_gemma":[0.45500237,0.000010970604,0.5440592,0.00082971423,0.000012447039,0.000012007672,0.0000053548724,0.0000027935596,0.000065117434],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991432,0.00008802372,0.00020729263,0.0001518205,0.00027009257,0.00013958242],"domain_scores_gemma":[0.9987375,0.00003731091,0.00007448215,0.0009651368,0.00011089937,0.00007466633],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002929901,0.000080924074,0.000078436104,0.000063203675,0.000077528624,0.0001850916,0.00093444955,0.000036380465,0.0002964677],"category_scores_gemma":[0.00007759018,0.00006286371,0.00002242297,0.00018177094,0.000041007388,0.006153521,0.00016616912,0.00008490767,0.0002978063],"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.0000013851117,0.00003996665,0.000029093673,0.000006537304,0.0000013545489,7.720572e-7,0.00032314088,0.00000592082,0.002220419,0.67870307,0.007594028,0.31107432],"study_design_scores_gemma":[0.0006787916,0.00025782318,0.0026128103,0.00004226751,0.0000045792335,0.00003256275,0.000121803314,0.4391275,0.16620766,0.33545777,0.054531496,0.000924954],"about_ca_topic_score_codex":0.0000066629405,"about_ca_topic_score_gemma":5.872043e-7,"teacher_disagreement_score":0.4547145,"about_ca_system_score_codex":0.000017382701,"about_ca_system_score_gemma":0.0000053618323,"threshold_uncertainty_score":0.4461154},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005147808,0.00022883904,0.99397117,0.00010823506,0.000023440823,0.00024384691,0.000016406824,0.0002208351,0.00003942325],"genre_scores_gemma":[0.609251,0.000031568692,0.39049825,0.00006327151,0.0000050271697,0.000053192052,0.0000012731825,0.000010462608,0.000085912114],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998537,0.00007874439,0.00035935958,0.0004850026,0.00028211065,0.00025776806],"domain_scores_gemma":[0.99878186,0.00037581476,0.0002490233,0.00031278183,0.0001916371,0.00008885794],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027058093,0.0001841469,0.00036519286,0.0006020241,0.0005525895,0.00008067928,0.00046832446,0.000080906895,0.000010880884],"category_scores_gemma":[0.0000067473993,0.00016384736,0.000106539635,0.0013284518,0.00014312043,0.001101151,0.0000061444257,0.00015209666,9.675032e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007330767,0.0010631998,0.0002063639,0.00053228706,0.00092583353,0.00004971565,0.0054368176,0.23500818,0.09761566,0.0016466978,0.0002711178,0.65651107],"study_design_scores_gemma":[0.0003711184,0.00022562791,0.00015184008,0.000113225215,0.00024562006,0.000020478617,0.000042069325,0.6717945,0.3254227,0.0011378711,0.00020883813,0.0002661107],"about_ca_topic_score_codex":0.000015385403,"about_ca_topic_score_gemma":0.0000018897628,"teacher_disagreement_score":0.65624493,"about_ca_system_score_codex":0.000025213421,"about_ca_system_score_gemma":0.000104297054,"threshold_uncertainty_score":0.6681502},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0009340755,0.0000051666666,0.9909437,0.00022522116,0.000057703557,0.00017201185,0.0000015332438,0.00080233783,0.0068582636],"genre_scores_gemma":[0.2671864,8.861126e-7,0.7324003,0.00029258901,0.0000068106633,0.000013789042,0.0000038679996,0.000008824761,0.00008654254],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99900246,0.00005079056,0.00013150407,0.000367528,0.00023499221,0.00021271588],"domain_scores_gemma":[0.99911493,0.00006211605,0.0000665911,0.00064001814,0.00004795723,0.00006839128],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012016078,0.00013142986,0.00010837814,0.00012603072,0.000091485585,0.00010026822,0.00038945515,0.000029556719,0.000054794567],"category_scores_gemma":[0.000053157328,0.00009754242,0.000020163574,0.00042492268,0.000022066935,0.00048651564,0.000042763568,0.00008962948,0.000028908022],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004127608,0.0003219885,0.0024156477,0.000038501865,0.0000103155935,0.0000753011,0.00010691777,0.15781976,0.013755623,0.8134752,0.003551326,0.008388173],"study_design_scores_gemma":[0.00037568083,0.00018775562,0.0016983146,0.00010460461,0.0000019275042,0.000010925472,0.000005315736,0.8733176,0.12002899,0.0018399995,0.0021559142,0.00027299102],"about_ca_topic_score_codex":0.0000061120727,"about_ca_topic_score_gemma":0.0000036973313,"teacher_disagreement_score":0.81163514,"about_ca_system_score_codex":0.000038591446,"about_ca_system_score_gemma":0.000051218063,"threshold_uncertainty_score":0.39776644},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0018968384,0.000019519486,0.9878356,0.0011406627,0.000050459956,0.00059819524,0.000003596286,0.0009807659,0.0074744057],"genre_scores_gemma":[0.31989217,0.000002971048,0.6766084,0.00041771925,0.0000293646,0.0001156847,0.000011008088,0.000015623495,0.0029070904],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99868566,0.000023851375,0.0002586652,0.0004626641,0.0002670652,0.00030211688],"domain_scores_gemma":[0.9989945,0.000018865876,0.000065164175,0.00070029416,0.00014429326,0.00007687552],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015315926,0.00020041011,0.00018720767,0.00016418209,0.00010452765,0.00015065527,0.0008277857,0.00005595077,0.000025716558],"category_scores_gemma":[0.0000132324385,0.000117986565,0.000039403927,0.00044954068,0.000044279317,0.0015979888,0.000177588,0.00014318418,0.00004243177],"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.000284608,0.00055970694,0.00013276869,0.00020189834,0.00004095938,0.000022191387,0.0014128991,0.0006399546,0.47059748,0.24235877,0.04147211,0.24227665],"study_design_scores_gemma":[0.0003691813,0.00029318617,0.00007196159,0.00011850431,0.000004063666,0.000021533331,0.000063865715,0.08122941,0.8945885,0.0073262844,0.015512363,0.00040118335],"about_ca_topic_score_codex":0.0001864954,"about_ca_topic_score_gemma":0.00004930148,"teacher_disagreement_score":0.423991,"about_ca_system_score_codex":0.00006598045,"about_ca_system_score_gemma":0.00005489523,"threshold_uncertainty_score":0.48113525},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00035777167,0.000053636642,0.9918,0.000080514495,0.00006217895,0.00010113466,0.0000039898227,0.0010381312,0.006502634],"genre_scores_gemma":[0.28029093,0.000002384315,0.7186079,0.00010439943,0.00002434363,0.00001258099,0.00000285895,0.000005250063,0.00094932114],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991116,0.000026609074,0.00015553008,0.00034150982,0.00016542744,0.00019930556],"domain_scores_gemma":[0.9991821,0.000062028535,0.000058854646,0.0006059138,0.00004839702,0.000042712065],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0000732192,0.00010740819,0.000097569115,0.00006578123,0.00007785698,0.00006271196,0.0007396876,0.000035130757,0.00002232284],"category_scores_gemma":[0.000014894757,0.00008810781,0.000030779665,0.00016691726,0.000025280891,0.0008108255,0.00046749867,0.00008102286,0.00005342324],"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.0000057776033,0.00028035944,0.001042192,0.0000057827824,0.0000062380172,0.000061419014,0.000089370405,0.00043393724,0.014655678,0.7326526,0.023798957,0.22696766],"study_design_scores_gemma":[0.0006074954,0.00012771678,0.0095356405,0.000070859365,0.0000034022153,0.000022785222,0.00005758102,0.7126022,0.20452747,0.048917003,0.022895673,0.0006321542],"about_ca_topic_score_codex":0.00023353047,"about_ca_topic_score_gemma":0.000026542952,"teacher_disagreement_score":0.7121683,"about_ca_system_score_codex":0.000034021476,"about_ca_system_score_gemma":0.000017623846,"threshold_uncertainty_score":0.35929322},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00050638715,0.000026391454,0.99722695,0.0008953313,0.00014740558,0.0003033909,0.000007586941,0.0006890926,0.00019744078],"genre_scores_gemma":[0.13430217,0.000009784108,0.8645278,0.00079239096,0.00006212108,0.00008104168,0.000012747276,0.000011803179,0.00020013168],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99922204,0.000009329784,0.00014866519,0.0003031891,0.0001356447,0.00018113072],"domain_scores_gemma":[0.99929416,0.000046873847,0.00005625378,0.00046780688,0.00007964839,0.0000552306],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00008292526,0.00009577019,0.00009720344,0.000073506075,0.000077846824,0.000050106708,0.0005073427,0.000047935377,0.000014143736],"category_scores_gemma":[0.000066131965,0.0000797995,0.000041514973,0.00020164943,0.0000140588745,0.0007261186,0.00019519715,0.000045308683,0.000022338885],"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.000020071295,0.00016345373,0.000018174667,0.00002513988,0.000010597477,0.0000039046895,0.00026460554,0.0023670783,0.009150455,0.96884793,0.0070810956,0.012047479],"study_design_scores_gemma":[0.0014373858,0.00025804972,0.00053593784,0.00007626778,0.0000048649435,0.000011173047,0.000009690136,0.43725654,0.30480778,0.22543529,0.0296944,0.0004726078],"about_ca_topic_score_codex":0.000016637612,"about_ca_topic_score_gemma":0.000010649293,"teacher_disagreement_score":0.7434127,"about_ca_system_score_codex":0.000033783068,"about_ca_system_score_gemma":0.00003931735,"threshold_uncertainty_score":0.32541293},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00061086623,0.000058269452,0.9692337,0.0012741435,0.00006785982,0.00036024163,0.000020441066,0.001030586,0.0273439],"genre_scores_gemma":[0.2594691,0.000011212323,0.73100096,0.0047457013,0.00005104852,0.00013990926,0.00014865375,0.000012546104,0.0044209016],"study_design_codex":"not_applicable","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99887353,0.000025426052,0.00035986587,0.00020231635,0.0003170107,0.00022183447],"domain_scores_gemma":[0.99895,0.00008800884,0.00015433383,0.000508235,0.00024926598,0.000050179202],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015345778,0.00013405664,0.00019831044,0.000098957884,0.000088451,0.00021459737,0.00076226663,0.000058342543,0.00005869708],"category_scores_gemma":[0.00007414488,0.000101304875,0.00004718172,0.00021405458,0.000022332024,0.0031915836,0.0002329565,0.00008723464,0.0001781195],"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.00015983975,0.00023480895,0.00006072626,0.000035680292,0.00001978218,0.000011997998,0.00013099873,0.00012356762,0.0503006,0.16911733,0.5955717,0.18423298],"study_design_scores_gemma":[0.007078205,0.00022344993,0.00031399247,0.000042341937,0.0000112179505,0.000060971128,0.000048706737,0.1622342,0.48704085,0.062101115,0.27997285,0.0008720964],"about_ca_topic_score_codex":0.00012563226,"about_ca_topic_score_gemma":0.000008564364,"teacher_disagreement_score":0.43674025,"about_ca_system_score_codex":0.000028437596,"about_ca_system_score_gemma":0.000035956178,"threshold_uncertainty_score":0.4131093},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0073897857,0.000010362289,0.9846762,0.00021184896,0.00013755435,0.0003256226,7.9622e-7,0.0006271361,0.006620734],"genre_scores_gemma":[0.13679256,0.0000039209494,0.86285025,0.0001288206,0.00007530691,0.000012492844,0.0000017284747,0.0000057677903,0.00012914823],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992331,0.000020036985,0.00020050163,0.00025548416,0.00014386978,0.00014698392],"domain_scores_gemma":[0.9993322,0.000014197447,0.00008930015,0.00045521243,0.00006487315,0.00004422578],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012303027,0.00008964749,0.000081191036,0.00011754814,0.00007815784,0.00007635906,0.00039580118,0.00004760822,0.00010669538],"category_scores_gemma":[0.000018117336,0.00007475911,0.000025571928,0.00020795126,0.000022023405,0.0021113958,0.00021644603,0.0000975307,0.000041354157],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004698892,0.000013633325,0.00011461047,0.000002612125,0.0000013672665,6.2488425e-7,0.00003496513,0.000016766038,0.012422701,0.012751802,0.00018339392,0.97445285],"study_design_scores_gemma":[0.00013921091,0.00006606185,0.00015941708,0.000053006166,0.0000016657797,0.0001238639,0.000012466298,0.7639365,0.19687213,0.017926624,0.020506661,0.00020237565],"about_ca_topic_score_codex":0.00002135609,"about_ca_topic_score_gemma":0.000009994768,"teacher_disagreement_score":0.97425044,"about_ca_system_score_codex":0.0000860535,"about_ca_system_score_gemma":0.000027912389,"threshold_uncertainty_score":0.3048588},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0066038133,0.00067712134,0.98404443,0.00016073884,0.000115455834,0.0006947177,0.00011881538,0.0006770085,0.0069079087],"genre_scores_gemma":[0.2034024,0.000052370193,0.79621047,0.00009500086,0.00000699202,0.000039423197,0.00013171896,0.00001731041,0.000044332883],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99652296,0.00064757693,0.0005149942,0.0008525231,0.0011494459,0.00031251172],"domain_scores_gemma":[0.99587625,0.00027532206,0.0003356359,0.0028498995,0.00055548165,0.00010741486],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015306275,0.0002527056,0.00037128714,0.000121343284,0.00016511354,0.00012658388,0.0028856185,0.00011114087,0.00011009228],"category_scores_gemma":[0.0003569833,0.00021543333,0.000049463473,0.00046234071,0.00021106201,0.0019461967,0.00094948563,0.00021763582,0.000012274041],"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.000052144973,0.00076070183,0.00018831508,0.00004766967,0.000057923262,0.000003910904,0.00036008563,0.0002483216,0.5826795,0.26617485,0.08594177,0.06348482],"study_design_scores_gemma":[0.00041781252,0.00015075489,0.000054283148,0.00008474692,0.000020496262,0.0000056202302,0.00007107908,0.21802054,0.75861585,0.0132248085,0.00905435,0.0002796443],"about_ca_topic_score_codex":0.00005992478,"about_ca_topic_score_gemma":0.0000038073777,"teacher_disagreement_score":0.25295004,"about_ca_system_score_codex":0.000071372066,"about_ca_system_score_gemma":0.00017498607,"threshold_uncertainty_score":0.8785116},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0010047468,0.000038892245,0.99748105,0.000040233648,0.00008870155,0.00021763021,0.0000044996777,0.0005270873,0.0005971804],"genre_scores_gemma":[0.49607787,0.00000331398,0.5037876,0.000015925558,0.0000094264715,0.000013076453,0.0000027470642,0.0000033796794,0.00008667689],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99917793,0.00006249521,0.00019859581,0.0002366233,0.00018892794,0.00013542366],"domain_scores_gemma":[0.99921143,0.00013608354,0.0000991532,0.00044226536,0.000084065396,0.000027028085],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012990393,0.00008404122,0.00011064799,0.00008488831,0.00003904016,0.000025495709,0.0005144074,0.000038629736,0.000011291148],"category_scores_gemma":[0.00004217264,0.00007074527,0.0000262158,0.00020730741,0.000040417362,0.0007775935,0.0001640478,0.000052768963,0.0000085055735],"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.00007313171,0.00028681202,0.0021677688,0.000018714685,0.000013380272,0.000007043867,0.00014882254,0.011464053,0.83033067,0.116657495,0.026626732,0.012205359],"study_design_scores_gemma":[0.00023687775,0.00013573375,0.003993053,0.000022524575,0.0000022620761,0.0000027993526,0.000009008427,0.42452407,0.5545401,0.015904324,0.00050913915,0.00012010888],"about_ca_topic_score_codex":0.00011063239,"about_ca_topic_score_gemma":0.00000322669,"teacher_disagreement_score":0.4950731,"about_ca_system_score_codex":0.000027780516,"about_ca_system_score_gemma":0.000022889973,"threshold_uncertainty_score":0.28849083},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00015326176,0.000032955853,0.99820024,0.00050951156,0.0000524087,0.00015121386,0.0000021006476,0.0005473133,0.00035099464],"genre_scores_gemma":[0.16999272,0.000013221413,0.8296659,0.00020050396,0.0000127047115,0.0000070394603,0.0000036844333,0.0000059157355,0.00009830279],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991775,0.000062995015,0.00021693956,0.00022629132,0.00017933758,0.00013692977],"domain_scores_gemma":[0.99915844,0.0000982712,0.0001038246,0.00050880376,0.00008397303,0.00004667095],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012118881,0.000087249406,0.00011564537,0.00009881391,0.00003668023,0.0000305417,0.0006885599,0.000036452475,0.00006735871],"category_scores_gemma":[0.000041806765,0.000073920026,0.000025474526,0.00030666,0.000029944058,0.0008835628,0.00018548183,0.00005567331,0.000008431377],"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.000016647104,0.000074512194,0.000028079678,0.0000056371364,0.0000056573454,0.0000017645943,0.00009667707,0.9178776,0.015531358,0.020922925,0.0067166784,0.03872246],"study_design_scores_gemma":[0.0001200153,0.000047200367,0.000042673062,0.0000071830186,0.0000011467899,0.0000028123732,0.0000022573256,0.8875249,0.111264706,0.00022167916,0.00068367587,0.00008176334],"about_ca_topic_score_codex":0.0000050059057,"about_ca_topic_score_gemma":7.6792566e-7,"teacher_disagreement_score":0.16983946,"about_ca_system_score_codex":0.00001876774,"about_ca_system_score_gemma":0.000019629,"threshold_uncertainty_score":0.30143714},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0011519598,0.000017125627,0.9971276,0.000195274,0.0001153433,0.0005125469,0.0000029237426,0.00049463403,0.00038260262],"genre_scores_gemma":[0.3536757,0.000013710247,0.64543927,0.0001945692,0.00004320163,0.00014181518,0.000009461437,0.000008768834,0.00047351953],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99906874,0.000022449874,0.00015630577,0.0003211273,0.00023899302,0.00019241484],"domain_scores_gemma":[0.999179,0.00008797622,0.00007935988,0.000438939,0.0001528746,0.00006181493],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00011177645,0.000113805494,0.00014098707,0.000075263895,0.00015541524,0.00004412437,0.0005013099,0.000038267808,0.00001334064],"category_scores_gemma":[0.000037052,0.00008006873,0.000028437591,0.00017880413,0.000036927766,0.0007307615,0.00015795806,0.000050419447,0.0000061061296],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0024560487,0.0016189907,0.0049271127,0.00013993272,0.00020106613,0.000137776,0.0025830716,0.24642248,0.017156783,0.37054706,0.23387401,0.11993567],"study_design_scores_gemma":[0.003961933,0.000568541,0.00034729845,0.00004777314,0.0000046775444,0.00004499665,0.000018812305,0.7708247,0.1890565,0.0023338366,0.03233452,0.00045644018],"about_ca_topic_score_codex":0.0000059432155,"about_ca_topic_score_gemma":8.143926e-7,"teacher_disagreement_score":0.5244022,"about_ca_system_score_codex":0.000023953571,"about_ca_system_score_gemma":0.000039583338,"threshold_uncertainty_score":0.3265108},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00081659365,0.00007834351,0.99633104,0.0005746363,0.000097383556,0.0006282947,0.000012636954,0.00078598945,0.0006750821],"genre_scores_gemma":[0.6626678,0.00003669702,0.33588183,0.0004942929,0.000021984952,0.00008909034,0.0000037120171,0.000022376737,0.0007822125],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99854165,0.000050669463,0.00025364332,0.00054103445,0.00020450178,0.00040849546],"domain_scores_gemma":[0.99892265,0.00018816847,0.000112359245,0.00056005386,0.00008533621,0.00013146429],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022241304,0.00022091938,0.0002499301,0.00012809596,0.00020486962,0.00017619198,0.00076003664,0.00006404575,0.00012449044],"category_scores_gemma":[0.000020702346,0.00015920169,0.00006886225,0.0002271149,0.000042707776,0.0015112675,0.00009227641,0.0001306779,0.000015833386],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022832876,0.00035368733,0.00003795168,0.00024358906,0.00008241662,0.00013720358,0.0010115026,0.0028322234,0.62775683,0.04352147,0.013399101,0.31039566],"study_design_scores_gemma":[0.0013353901,0.00014829126,0.000018739454,0.00017467147,0.0000065545883,0.000015299913,0.000005250557,0.9387003,0.053720295,0.0022160278,0.0033769456,0.00028222855],"about_ca_topic_score_codex":0.0000036975641,"about_ca_topic_score_gemma":9.645036e-7,"teacher_disagreement_score":0.9358681,"about_ca_system_score_codex":0.000056423163,"about_ca_system_score_gemma":0.000010696344,"threshold_uncertainty_score":0.6492057},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00017967993,0.00033970244,0.9977176,0.0003043665,0.00025133273,0.0009220168,0.000007959529,0.00024718806,0.000030148376],"genre_scores_gemma":[0.09516512,0.000035174548,0.90435547,0.00022651066,0.000020407926,0.0001161427,0.0000012098442,0.0000102470685,0.00006974517],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9988586,0.00014466465,0.00023713571,0.00034875746,0.0002010262,0.0002098247],"domain_scores_gemma":[0.997672,0.0008338566,0.00014404999,0.0011912605,0.00011914035,0.000039664475],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003990653,0.00013214577,0.00019284472,0.000046556062,0.00010949301,0.000047860296,0.0011122645,0.000048652906,0.000033913242],"category_scores_gemma":[0.0007987537,0.000076909746,0.000060316437,0.0003044778,0.00006236366,0.00022331718,0.000104847386,0.00009679053,0.0000013984665],"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.000026616504,0.000019274312,0.000007957299,0.000010374387,0.000018177008,3.2448438e-7,0.00015633863,0.00069237984,0.018733444,0.96823573,0.0048314594,0.0072678993],"study_design_scores_gemma":[0.0002484527,0.00010449962,0.000045964618,0.000022762255,0.000008260343,0.000004699226,0.000019960242,0.020768406,0.6533987,0.3181605,0.007057307,0.0001604922],"about_ca_topic_score_codex":0.0000067270207,"about_ca_topic_score_gemma":0.0000012868701,"teacher_disagreement_score":0.65007526,"about_ca_system_score_codex":0.000014249107,"about_ca_system_score_gemma":0.00006957221,"threshold_uncertainty_score":0.31362885},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005273958,0.000103009035,0.9920749,0.00019202114,0.00028608006,0.00019969908,0.000030434208,0.00078062963,0.0010592646],"genre_scores_gemma":[0.34418812,0.000029433118,0.6550575,0.00040352435,0.000029540153,0.00006795582,0.000012424228,0.000011929016,0.00019957064],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9982708,0.00006623808,0.0003496099,0.00072674575,0.00023957372,0.00034701766],"domain_scores_gemma":[0.9983151,0.0001460802,0.00015089287,0.0010707147,0.0001657682,0.00015144382],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022225676,0.0002229681,0.00026746347,0.00009393308,0.00021705897,0.000085035244,0.00090889673,0.0000827185,0.00006000013],"category_scores_gemma":[0.00004272451,0.00017418468,0.000045129756,0.0001635066,0.00012244217,0.00067255396,0.0011475915,0.00010049054,0.00000792367],"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.000036662153,0.00023333027,0.000031191797,0.000024493092,0.000011398891,0.000008404703,0.00019967726,0.000028362532,0.023841813,0.8722633,0.018708762,0.08461257],"study_design_scores_gemma":[0.0009819426,0.00030344087,0.0019035423,0.00008068338,0.000012316679,0.000015654214,0.00002785483,0.06158073,0.7492572,0.17058809,0.0145945605,0.0006539777],"about_ca_topic_score_codex":0.00079402747,"about_ca_topic_score_gemma":0.000012383155,"teacher_disagreement_score":0.7254154,"about_ca_system_score_codex":0.0000322591,"about_ca_system_score_gemma":0.00002766295,"threshold_uncertainty_score":0.7103045},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00012299407,0.00003389461,0.9969357,0.00030545276,0.00039164358,0.0003543777,0.000005230245,0.00077775854,0.0010729022],"genre_scores_gemma":[0.18939114,0.0000036085585,0.8096226,0.00056731526,0.000028533315,0.00008523982,0.00001070423,0.000012779074,0.00027811466],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989371,0.000052854557,0.00020361322,0.00038522237,0.00016810482,0.00025315082],"domain_scores_gemma":[0.99887025,0.00028367425,0.00008935786,0.0005748989,0.00010799516,0.000073831936],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027806073,0.00012629427,0.00013135665,0.000116309675,0.00014031155,0.00012326917,0.0005685857,0.000054910055,0.00006910271],"category_scores_gemma":[0.0003724108,0.00011234748,0.00005190274,0.00028156294,0.000015525575,0.00073615543,0.000085784166,0.00005441133,0.000013844757],"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.000013290908,0.00011790914,0.00013103899,0.000048477476,0.000008699917,0.0000033295835,0.00006684367,0.00025027982,0.01982272,0.78704256,0.024052873,0.168442],"study_design_scores_gemma":[0.00044164862,0.000099015604,0.000025413356,0.000041302523,0.000003088819,0.0000032881537,0.00000800908,0.52880126,0.40344715,0.025327718,0.041488368,0.000313741],"about_ca_topic_score_codex":0.0000023710734,"about_ca_topic_score_gemma":0.0000010921656,"teacher_disagreement_score":0.7617148,"about_ca_system_score_codex":0.000034216504,"about_ca_system_score_gemma":0.00005326154,"threshold_uncertainty_score":0.45813972},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07398458,0.00006591801,0.92370945,0.00028451995,0.000018348283,0.00008414534,0.0000022490929,0.00016891494,0.0016818566],"genre_scores_gemma":[0.69553226,0.00006743173,0.30426222,0.00009717144,0.000004222796,0.000001818779,5.9083055e-7,0.0000036371255,0.0000306124],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993045,0.00001520553,0.00014445101,0.0002864645,0.00014076485,0.00010866769],"domain_scores_gemma":[0.999434,0.000036881993,0.000048000755,0.00038776387,0.00003621856,0.000057123616],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00007434227,0.00009432297,0.00012112125,0.00007796351,0.000044029628,0.000040305924,0.0002730189,0.000034035475,0.000003985077],"category_scores_gemma":[0.000019822,0.00007022707,0.000012613998,0.000081677084,0.00005623144,0.00050780305,0.00045703386,0.00007817199,0.000001614663],"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.00013042866,0.0004930502,0.0009672469,0.00027059685,0.000031406777,0.00004031075,0.002646115,0.1548797,0.18324153,0.40648478,0.0034153345,0.2473995],"study_design_scores_gemma":[0.00064433704,0.00017609446,0.00060368003,0.0003047286,0.0000028873094,0.000011335289,0.000029642397,0.46800253,0.24434772,0.2855806,0.0000582352,0.00023820465],"about_ca_topic_score_codex":0.000015224992,"about_ca_topic_score_gemma":6.3192505e-7,"teacher_disagreement_score":0.6215477,"about_ca_system_score_codex":0.0000076291303,"about_ca_system_score_gemma":0.000009055612,"threshold_uncertainty_score":0.28637767},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0039635724,0.00006283323,0.99393815,0.00050473376,0.000040238974,0.0005227589,0.000043584194,0.0002899978,0.0006341042],"genre_scores_gemma":[0.5613889,0.000012095806,0.43823382,0.0002028968,0.000016026688,0.000037220434,0.0000111827185,0.0000046530613,0.00009322613],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9990427,0.000029191424,0.00022141293,0.0003618207,0.00017870276,0.00016618716],"domain_scores_gemma":[0.9991105,0.00010263858,0.00012885402,0.00046447577,0.00012377361,0.00006974128],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000108433946,0.00013551983,0.0002014539,0.000087216475,0.000073285235,0.00004893106,0.0003742544,0.000061056446,0.0000049252076],"category_scores_gemma":[0.000027272155,0.000091147434,0.000024926998,0.00012466025,0.000060451843,0.0007399545,0.00008275575,0.00007883942,3.2109836e-7],"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.00043584185,0.00023564037,0.00012815506,0.00006265951,0.000021683905,0.0000036836752,0.0004319119,0.00064914365,0.888643,0.024554923,0.025796348,0.059036966],"study_design_scores_gemma":[0.0010624027,0.00093486224,0.0028548231,0.00014153785,0.00000989537,0.000017110979,0.000018696506,0.0643147,0.91415775,0.014367819,0.0019289698,0.00019144865],"about_ca_topic_score_codex":0.000008246305,"about_ca_topic_score_gemma":0.0000016182607,"teacher_disagreement_score":0.5574253,"about_ca_system_score_codex":0.000013064512,"about_ca_system_score_gemma":0.000019153498,"threshold_uncertainty_score":0.37168843},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000049848626,0.000047276746,0.99524885,0.000413375,0.00011429684,0.0003583005,0.000006990433,0.00053857616,0.003222463],"genre_scores_gemma":[0.5912505,0.000032407297,0.4065392,0.00045983717,0.000036666504,0.00014210085,0.000007345082,0.000008908526,0.001523089],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992002,0.000021553637,0.00015029001,0.00029047133,0.00018435068,0.00015308088],"domain_scores_gemma":[0.9992891,0.00009897251,0.00006630741,0.00042698105,0.000067095716,0.000051575647],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00008633802,0.00008500629,0.00008672077,0.00006410956,0.00008579689,0.00006130111,0.00047373853,0.00004167173,0.00006946124],"category_scores_gemma":[0.00005078968,0.00006974482,0.00002635602,0.00014853031,0.00001886795,0.00076426717,0.00017600616,0.000046026027,0.00001532031],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000031541545,0.0004390804,0.0024000127,0.00003315921,0.00003824855,0.000005276658,0.0006391542,0.002892477,0.0068222755,0.23020709,0.35596606,0.40052563],"study_design_scores_gemma":[0.00035185358,0.00018197949,0.000392235,0.000022096945,0.0000024696044,0.0000027701817,0.000010331173,0.8819586,0.04733096,0.03110258,0.03847682,0.00016730024],"about_ca_topic_score_codex":0.0000029170617,"about_ca_topic_score_gemma":7.9810854e-7,"teacher_disagreement_score":0.8790661,"about_ca_system_score_codex":0.000034722252,"about_ca_system_score_gemma":0.0000053591425,"threshold_uncertainty_score":0.28441113},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15383047,0.000028895174,0.841404,0.000047021724,0.00005002771,0.00007691474,0.00000218567,0.00036378967,0.0041966583],"genre_scores_gemma":[0.60026425,0.00005442338,0.3992262,0.00004867091,0.000009661328,0.000003769349,8.6506435e-7,0.000002599888,0.0003895369],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9993245,0.000012499251,0.00016976487,0.00019779245,0.00013970479,0.00015573292],"domain_scores_gemma":[0.9992178,0.00002906208,0.00007130852,0.000587816,0.00005043608,0.000043540913],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00006298309,0.00007819968,0.00012304219,0.00005712693,0.000060859744,0.0000079700385,0.0007758572,0.000025670797,0.000029621096],"category_scores_gemma":[0.000012336653,0.00006136163,0.000029183844,0.0001776533,0.000066787274,0.0006303638,0.00028276898,0.00007085858,0.000009529074],"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.000084087595,0.00051681476,0.021009997,0.00010945317,0.00003747064,0.000039559407,0.000947047,0.00014057024,0.6502875,0.17473307,0.02737084,0.1247236],"study_design_scores_gemma":[0.00013420271,0.0001638242,0.004942246,0.000012026934,6.6923326e-7,0.000033418677,0.0000028893294,0.07756004,0.914863,0.00065610965,0.0015124956,0.00011911691],"about_ca_topic_score_codex":0.000013771385,"about_ca_topic_score_gemma":9.407105e-7,"teacher_disagreement_score":0.44643378,"about_ca_system_score_codex":0.0000118954695,"about_ca_system_score_gemma":0.00003293279,"threshold_uncertainty_score":0.25022545},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.112693556,0.00008964523,0.88644785,0.000020779282,0.00024509456,0.000081263366,7.549171e-7,0.00012963748,0.0002913989],"genre_scores_gemma":[0.95384616,0.000039516406,0.046032336,0.000026081123,0.00000990925,0.0000058287674,0.0000031251227,0.0000027293645,0.000034293735],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995102,0.000029127292,0.00016687384,0.000114638235,0.00008964942,0.000089478635],"domain_scores_gemma":[0.99969065,0.000025353962,0.000052511077,0.00016436758,0.000038518043,0.000028607103],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017497293,0.000046700894,0.00007028858,0.00011299132,0.000021434955,0.000009100907,0.000101113816,0.00003460744,0.0000034902532],"category_scores_gemma":[0.00004016076,0.00004231735,0.00000759271,0.00017794427,0.000011767445,0.0013169388,0.00009376914,0.000049851085,9.999071e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000040146235,0.00033692134,0.109457165,0.00005358161,0.000008768708,5.952874e-7,0.0028024986,0.04985697,0.039562635,0.08584145,0.0014009994,0.7106383],"study_design_scores_gemma":[0.000085745975,0.000019430161,0.0014958931,0.000030307723,7.5255605e-7,0.0000024773096,0.00007461262,0.97611123,0.021549013,0.0005121053,0.00007767084,0.000040755378],"about_ca_topic_score_codex":0.000081836195,"about_ca_topic_score_gemma":0.000014200046,"teacher_disagreement_score":0.9262543,"about_ca_system_score_codex":0.000016491325,"about_ca_system_score_gemma":0.000006381732,"threshold_uncertainty_score":0.17256515},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0046285945,0.000008849235,0.97939235,0.00011999094,0.000026072918,0.000095779294,7.1506855e-7,0.00037229058,0.015355368],"genre_scores_gemma":[0.4292518,0.0000018053262,0.570482,0.0002028168,0.000012560732,0.0000015312409,5.787966e-7,0.000003955416,0.000042930445],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99930435,0.000018792443,0.000118805365,0.00025979884,0.00014559343,0.00015264082],"domain_scores_gemma":[0.9993084,0.00024439904,0.00007095259,0.00026721798,0.000053220276,0.000055829874],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027640513,0.00008663545,0.00007527903,0.00009233645,0.00008612579,0.00007572259,0.0002357824,0.000024168663,0.0000061962032],"category_scores_gemma":[0.000039912546,0.00006389513,0.000007928248,0.00015591625,0.000033814675,0.00089836126,0.00023845934,0.000109178276,0.000007309754],"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.00016687716,0.00008259157,0.0013683139,0.000018454959,0.00001688262,0.000071212926,0.0014527681,0.000007492502,0.04264233,0.64974713,0.001045324,0.30338064],"study_design_scores_gemma":[0.0011263572,0.0016340412,0.010845269,0.0007488951,0.000011915092,0.00011081251,0.00087172276,0.6396375,0.32156098,0.018957207,0.0034948115,0.0010005292],"about_ca_topic_score_codex":0.00001772142,"about_ca_topic_score_gemma":0.000015997332,"teacher_disagreement_score":0.63962996,"about_ca_system_score_codex":0.000021768808,"about_ca_system_score_gemma":0.000007719471,"threshold_uncertainty_score":0.2605568},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0010768397,0.0000051517964,0.9921285,0.00003912044,0.00032069592,0.00030402493,0.00011552999,0.0003574274,0.0056526964],"genre_scores_gemma":[0.7726944,0.000047771584,0.22655368,0.0003633431,0.000005870514,0.00007902763,0.00000826345,0.0000109181465,0.00023671555],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9982829,0.000203737,0.0006780643,0.00019733132,0.00037307854,0.00026486415],"domain_scores_gemma":[0.9979358,0.00066750834,0.00033723967,0.00076224876,0.00019141349,0.00010579551],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00055170595,0.00021875545,0.00023986763,0.00034493764,0.00018129025,0.0001140091,0.00057431794,0.00012010792,0.0007302244],"category_scores_gemma":[0.000097164564,0.00018522152,0.00012358009,0.00047023944,0.00016181673,0.0031780517,0.000006305206,0.00029284478,0.00018373373],"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.00047002075,0.00027792974,0.000017820266,0.00008711103,0.00009979617,0.0000058319915,0.004198464,0.05616218,0.00063311256,0.7821126,0.00048558693,0.15544954],"study_design_scores_gemma":[0.006075819,0.00083904236,0.00004069292,0.00062533596,0.00009917056,0.00035065445,0.0036867778,0.13903892,0.6942376,0.09574818,0.0573554,0.0019024329],"about_ca_topic_score_codex":0.0000033068377,"about_ca_topic_score_gemma":6.8392563e-7,"teacher_disagreement_score":0.7716176,"about_ca_system_score_codex":0.00004966132,"about_ca_system_score_gemma":0.00014200201,"threshold_uncertainty_score":0.7995445},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0011021983,0.00017384102,0.9493477,0.00055650243,0.00009195382,0.00014439253,0.000003154156,0.0013117793,0.04726848],"genre_scores_gemma":[0.5682763,0.00009259081,0.42691445,0.00060019933,0.000023421553,0.000031947413,0.0000018350702,0.000011111004,0.0040481184],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9988014,0.000044242923,0.00017863195,0.00045016213,0.00022252472,0.00030300018],"domain_scores_gemma":[0.9989491,0.000091713024,0.00007191388,0.00072662754,0.000066002234,0.00009462097],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00008295671,0.00013590032,0.00012903824,0.0000898466,0.00019040865,0.00006882512,0.001026275,0.00005282815,0.0006201604],"category_scores_gemma":[0.000042517142,0.000116899224,0.000042154035,0.00037710503,0.000035058845,0.0009651744,0.000668251,0.00015034605,0.0004894383],"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.0000032748621,0.00018317354,0.0013939553,0.000017842722,0.00002930382,0.00007923992,0.0008248062,0.000013311086,0.14099233,0.36462566,0.36439013,0.12744695],"study_design_scores_gemma":[0.0003946016,0.00013285724,0.0009549309,0.00006598716,0.000004528008,0.000096879754,0.000010095724,0.069300584,0.8412033,0.06235457,0.024814414,0.00066728273],"about_ca_topic_score_codex":0.000019088724,"about_ca_topic_score_gemma":0.00000775679,"teacher_disagreement_score":0.7002109,"about_ca_system_score_codex":0.00015065185,"about_ca_system_score_gemma":0.000009436602,"threshold_uncertainty_score":0.67903215},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06551851,0.000018396113,0.93221146,0.00025918733,0.00019153282,0.00025022996,0.000004112204,0.0009097161,0.0006368554],"genre_scores_gemma":[0.50335014,0.000007622353,0.49637884,0.00011807662,0.000024137082,0.000011674782,0.0000029744397,0.0000076041947,0.0000989093],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9985842,0.000043636384,0.00028429017,0.0005158525,0.00026029476,0.00031170837],"domain_scores_gemma":[0.9988498,0.00003837429,0.0001350393,0.00073911366,0.00013495986,0.00010268322],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012671233,0.00018246322,0.00021276616,0.000119452045,0.00020545801,0.00017039123,0.0008238752,0.00006949267,0.000026556585],"category_scores_gemma":[0.00005455883,0.00015861128,0.000049670612,0.0003078206,0.00007985646,0.0013111177,0.0004840245,0.00016544275,0.000021732938],"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.000014078854,0.00007348653,0.0000024586245,0.000009331203,0.000006424697,0.00001437899,0.0002957501,0.0003114406,0.8282022,0.14732389,0.00025165657,0.023494905],"study_design_scores_gemma":[0.00061082037,0.00006488407,0.0000371015,0.000085652144,0.0000044133762,0.000092088616,0.00008515276,0.18228424,0.7734418,0.042868786,0.0001272326,0.00029780928],"about_ca_topic_score_codex":0.000071146096,"about_ca_topic_score_gemma":0.00000461366,"teacher_disagreement_score":0.43783164,"about_ca_system_score_codex":0.00017556584,"about_ca_system_score_gemma":0.000084848834,"threshold_uncertainty_score":0.646798},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00044492108,0.000037278467,0.9964979,0.000031067662,0.00036014256,0.00018035478,0.0000033651556,0.0008085119,0.0016364104],"genre_scores_gemma":[0.29808384,0.000005106259,0.701188,0.0003770769,0.000056505556,0.00006650985,0.0000035642176,0.000008522068,0.00021083989],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989525,0.000034693334,0.00020429736,0.00037180833,0.00013066933,0.00030602992],"domain_scores_gemma":[0.9990234,0.0001425672,0.000089689565,0.00057908974,0.00008691617,0.000078338395],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018465573,0.00011769881,0.0001218965,0.000059414157,0.0001539223,0.000052553798,0.0005977259,0.000040780047,0.00002114656],"category_scores_gemma":[0.00004958487,0.00009951995,0.000054004897,0.00017877333,0.000023262959,0.00035527936,0.00033819952,0.000046787278,0.00000905111],"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.00006813696,0.00018825782,0.00046353493,0.000019321866,0.000017135764,0.000009974255,0.00034522923,0.003275511,0.021123944,0.82404166,0.04070342,0.10974388],"study_design_scores_gemma":[0.00024720107,0.00007522412,0.0001618875,0.000031658892,0.0000028595882,0.0000073420015,0.000012235314,0.8273244,0.12048693,0.0150597645,0.036380854,0.00020967523],"about_ca_topic_score_codex":0.0000505672,"about_ca_topic_score_gemma":0.000011196969,"teacher_disagreement_score":0.8240489,"about_ca_system_score_codex":0.00003218972,"about_ca_system_score_gemma":0.0000135369455,"threshold_uncertainty_score":0.4058306},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0003742702,0.000007402875,0.99676067,0.0002791261,0.000053544234,0.0005869405,0.0000019362521,0.0007932452,0.001142894],"genre_scores_gemma":[0.089037165,0.000010021233,0.91042966,0.000109043205,0.000029816123,0.00024994276,0.000002910369,0.00001388369,0.00011756078],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988437,0.00002902631,0.00017281008,0.00038974403,0.00032598563,0.0002386788],"domain_scores_gemma":[0.9992948,0.00003260174,0.000066114466,0.00036509204,0.00009136315,0.00015000584],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025005013,0.0001303236,0.00013577359,0.00007820944,0.00014124122,0.000038350332,0.0007119873,0.00008415178,0.00008053013],"category_scores_gemma":[0.000018919673,0.00008818603,0.000031672003,0.00016195179,0.00005508654,0.0009394657,0.00014399785,0.00013963875,0.000004924008],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00030030578,0.00030494155,0.000005472147,0.00012129902,0.00001895902,0.000042660697,0.0012186137,0.000015128886,0.026425945,0.035497338,0.0015442482,0.9345051],"study_design_scores_gemma":[0.0005299309,0.0004458197,0.000025145755,0.0001595717,0.0000036234585,0.000054293094,0.000022816579,0.5810372,0.4130816,0.002122791,0.0022867771,0.00023040091],"about_ca_topic_score_codex":0.00002309358,"about_ca_topic_score_gemma":0.0000019271592,"teacher_disagreement_score":0.9342747,"about_ca_system_score_codex":0.00001864212,"about_ca_system_score_gemma":0.00005211498,"threshold_uncertainty_score":0.3596122},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0071679745,0.000060114387,0.98966086,0.0005114231,0.00024120024,0.0016458298,0.000041778636,0.0006173307,0.000053491232],"genre_scores_gemma":[0.5354286,0.000015744925,0.4640373,0.000024216723,0.000039849612,0.0003758148,0.000028600964,0.000011109079,0.000038786875],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99857706,0.000058742484,0.0004013464,0.00045491525,0.00023547286,0.0002724601],"domain_scores_gemma":[0.9979262,0.00011212174,0.00026005378,0.001361602,0.00026951957,0.00007054327],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033479423,0.00018172455,0.00022774872,0.00020785672,0.0002343065,0.000070224014,0.0012475821,0.000073291776,0.000003443778],"category_scores_gemma":[0.00026321466,0.00016703866,0.000077495024,0.00035823218,0.00011503904,0.0015071731,0.00061828416,0.0001603915,0.00000433472],"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.00019696829,0.0013209198,0.000065279666,0.00024249773,0.000074211515,0.0000015681579,0.0057471087,0.15376274,0.65999305,0.044405397,0.0006229197,0.13356736],"study_design_scores_gemma":[0.0007700712,0.00021313643,0.00011837917,0.00011066841,0.0000051441225,0.000004053811,0.000073446456,0.5990177,0.3951616,0.0038303686,0.00048671136,0.00020875916],"about_ca_topic_score_codex":0.00015067626,"about_ca_topic_score_gemma":0.000028943308,"teacher_disagreement_score":0.5282606,"about_ca_system_score_codex":0.00009955505,"about_ca_system_score_gemma":0.000052641815,"threshold_uncertainty_score":0.68116385},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9349632,0.0009244166,0.055827435,0.00070804596,0.0003986269,0.0010332179,0.0003436449,0.0001547421,0.0056466516],"genre_scores_gemma":[0.10780983,0.0005271008,0.8905149,0.00004950859,0.00018597132,0.00013195118,0.000017873179,0.00003592546,0.0007269246],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986998,2.939589e-8,0.00047627563,0.0002938188,0.00031429567,0.00021580678],"domain_scores_gemma":[0.9980311,0.00021168945,0.00034409674,0.00009291639,0.0012748431,0.00004535436],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003394644,0.00016598556,0.00037738707,0.00016566186,0.00003536675,0.000026171874,0.0010120488,0.00010726264,0.000020492009],"category_scores_gemma":[0.0004049767,0.00014042045,0.00040138297,0.00049045973,0.00015026478,0.00040655382,0.00016985263,0.00011975804,8.87415e-7],"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.00021939041,0.00015001671,0.0001720438,0.00042330494,0.00057366025,9.36294e-8,0.00013346547,0.00011218405,0.48944795,0.46731937,0.018984076,0.022464437],"study_design_scores_gemma":[0.00093640096,0.0009230396,0.0014606208,0.00037535327,0.00033685935,0.000011576797,0.000081619546,0.47923464,0.4364124,0.0046247174,0.07517369,0.00042910484],"about_ca_topic_score_codex":8.434018e-7,"about_ca_topic_score_gemma":2.5667232e-8,"teacher_disagreement_score":0.8346875,"about_ca_system_score_codex":0.000064684056,"about_ca_system_score_gemma":0.000024165143,"threshold_uncertainty_score":0.57261795},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0026988694,0.00011837802,0.9865312,0.00022896256,0.000121403864,0.00021115407,0.0000012636292,0.0015519165,0.008536829],"genre_scores_gemma":[0.12435024,0.000023711917,0.87435454,0.00026095365,0.00004662729,0.000013221518,0.000004043824,0.000020043526,0.0009266149],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983031,0.00012884423,0.00030698054,0.0005520984,0.00033532124,0.00037363873],"domain_scores_gemma":[0.9986407,0.00013549163,0.0001462877,0.0008521141,0.00009471027,0.00013065228],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016671584,0.00019742125,0.00019895208,0.00012088559,0.00021770647,0.00019613132,0.0011067452,0.00006850953,0.00034808228],"category_scores_gemma":[0.00015814896,0.00016258044,0.000055672026,0.00031785775,0.00007019046,0.001412261,0.00087517255,0.00030433526,0.00013446498],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016012948,0.00076821435,0.00047881017,0.00015885748,0.00004672535,0.00021889109,0.001391471,0.0081334105,0.59578454,0.06123403,0.049971573,0.28179744],"study_design_scores_gemma":[0.00017226885,0.00005341251,0.000049439004,0.0000817683,0.000003985596,0.000036774254,0.000011074807,0.96067166,0.011972886,0.0042325133,0.022439677,0.0002745378],"about_ca_topic_score_codex":0.000017956323,"about_ca_topic_score_gemma":8.284578e-7,"teacher_disagreement_score":0.95253825,"about_ca_system_score_codex":0.000060804352,"about_ca_system_score_gemma":0.000009845382,"threshold_uncertainty_score":0.6629838},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000079372854,0.000058940794,0.99586177,0.000104060935,0.00021506824,0.00032974072,0.0000034250138,0.000719934,0.0026276927],"genre_scores_gemma":[0.08866214,0.0000073409037,0.9101242,0.0005540194,0.000035266108,0.00012423414,0.0000055454716,0.000010679203,0.00047657124],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989062,0.000038300688,0.00018411982,0.00037658485,0.00014883082,0.0003459702],"domain_scores_gemma":[0.9987491,0.0003128844,0.00005919263,0.000694876,0.00007683269,0.00010716511],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020277614,0.00012858378,0.00015350674,0.000037080186,0.00009886066,0.000053390046,0.000734243,0.000061136285,0.000038064027],"category_scores_gemma":[0.00007975837,0.00010409194,0.00004953296,0.000243048,0.000046896796,0.00039206588,0.00018104025,0.00008199012,0.00001922582],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011400556,0.00009828644,0.00021823513,0.000011952171,0.000011479632,0.0000079494275,0.00006160632,0.0007111295,0.0010096477,0.43225303,0.12585561,0.43974966],"study_design_scores_gemma":[0.0005542814,0.00009663925,0.000051611416,0.00003732038,0.0000031793145,0.000013085281,0.000014021375,0.6772169,0.06424126,0.075469226,0.18195416,0.00034830536],"about_ca_topic_score_codex":0.0000047621215,"about_ca_topic_score_gemma":0.000006398538,"teacher_disagreement_score":0.6765058,"about_ca_system_score_codex":0.00002534347,"about_ca_system_score_gemma":0.000036524787,"threshold_uncertainty_score":0.4244746},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009593415,0.00004557462,0.9895959,0.00018299035,0.000044838398,0.00020872633,0.00000195765,0.00017193276,0.00015467677],"genre_scores_gemma":[0.42253053,0.000008275444,0.5773731,0.000054739598,0.0000030535898,0.000006391467,0.000007619411,0.0000029962114,0.00001333318],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9994164,0.0000119499355,0.00017480456,0.00019798291,0.000116468764,0.00008237803],"domain_scores_gemma":[0.9994453,0.00007215135,0.000095779855,0.00026295273,0.000094500574,0.000029325602],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017134259,0.00006265684,0.00010020324,0.0000723437,0.000061775565,0.000029210147,0.00016621676,0.000032697997,0.0000020933871],"category_scores_gemma":[0.000097812335,0.00005369314,0.000013830097,0.00012420928,0.000023284523,0.000617471,0.00011491064,0.000024790033,5.261055e-7],"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.00001834083,0.00007226745,0.0000612053,0.00006798895,0.000004128534,0.0000012939115,0.0004259663,0.0030270973,0.09153564,0.6515967,0.00041422134,0.25277516],"study_design_scores_gemma":[0.0006356175,0.00015651193,0.00021594002,0.000098563,0.000002647309,0.000010037007,0.000011971068,0.16777384,0.55781835,0.2729853,0.00018942005,0.000101763835],"about_ca_topic_score_codex":0.000009591678,"about_ca_topic_score_gemma":0.0000015517268,"teacher_disagreement_score":0.46628273,"about_ca_system_score_codex":0.000012590426,"about_ca_system_score_gemma":0.00001703934,"threshold_uncertainty_score":0.21895428},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00013707094,0.00028350262,0.9873701,0.00049103634,0.000026641246,0.00045293913,0.0000026048372,0.0007559715,0.010480135],"genre_scores_gemma":[0.22870411,0.00000975351,0.77003187,0.00071758596,0.000010472555,0.0001500533,0.00000787292,0.000009585212,0.00035866897],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9988531,0.000105524145,0.0002267439,0.0003777604,0.00018118409,0.0002556978],"domain_scores_gemma":[0.9985529,0.0001836563,0.00013428167,0.00091598264,0.00014483364,0.00006833941],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029687572,0.0001484224,0.00015511329,0.000083819345,0.0002499017,0.00012901402,0.0012228907,0.00007011317,0.000034408666],"category_scores_gemma":[0.000085405336,0.00011880177,0.00004956796,0.00025928463,0.000057139634,0.00061422674,0.00024879916,0.00016973072,0.0000070521182],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014528354,0.000103881925,0.0000026314774,0.000047181773,0.000005939356,9.971085e-7,0.00047508738,0.0007111624,0.046359837,0.14636497,0.0034268694,0.8024869],"study_design_scores_gemma":[0.00047610575,0.00012526248,0.000015280057,0.000097632525,0.0000047470385,0.000018582623,0.0000719907,0.025013754,0.5350478,0.40423986,0.03450499,0.00038392833],"about_ca_topic_score_codex":0.0000028266609,"about_ca_topic_score_gemma":0.0000049829637,"teacher_disagreement_score":0.802103,"about_ca_system_score_codex":0.000031688447,"about_ca_system_score_gemma":0.00007065466,"threshold_uncertainty_score":0.48445955},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.024024205,0.00006104534,0.9732359,0.0009021491,0.00006750407,0.00018945342,0.000061304236,0.00005352001,0.0014049106],"genre_scores_gemma":[0.85801566,0.00004854225,0.14151503,0.00029153025,0.000022409433,0.0000054817488,0.00001159794,0.000008378482,0.000081397564],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99811536,0.000103065264,0.0004869278,0.00038445208,0.00072188117,0.00018832389],"domain_scores_gemma":[0.9983209,0.0005713978,0.00027797878,0.0002365297,0.00054974866,0.00004344307],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021593519,0.00017410258,0.00025060805,0.00017901356,0.00012216099,0.00017070398,0.0007721587,0.00006353488,0.00010547751],"category_scores_gemma":[0.0001241392,0.00013706538,0.00003614254,0.0001685459,0.00053136895,0.00064078916,0.00024707877,0.00032283258,0.000003026839],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001725495,0.0006942553,0.00027678834,0.00019663246,0.000048251415,0.000033907512,0.003621153,0.11876113,0.027176127,0.62791896,0.0011949406,0.21990532],"study_design_scores_gemma":[0.00027511382,0.00011468526,0.0004371808,0.0006016889,0.0000035784929,0.000011395289,0.000077926634,0.887488,0.008262691,0.10254742,0.00004631047,0.00013401601],"about_ca_topic_score_codex":0.00008298597,"about_ca_topic_score_gemma":0.0000052958426,"teacher_disagreement_score":0.8339914,"about_ca_system_score_codex":0.00005017887,"about_ca_system_score_gemma":0.00007745382,"threshold_uncertainty_score":0.55893636},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00065873447,0.000060292346,0.9901962,0.0020196596,0.000098735385,0.0004930682,0.000033397482,0.0009547755,0.005485113],"genre_scores_gemma":[0.32046977,0.00008900778,0.6780949,0.0006629758,0.000023373088,0.00009116156,0.000021153817,0.000013216971,0.00053445814],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986825,0.000063673586,0.00032015817,0.0003855977,0.00022547103,0.00032261704],"domain_scores_gemma":[0.9967158,0.0003799771,0.00013045651,0.0025027294,0.00016008208,0.000110992754],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019832047,0.00016412708,0.00020869679,0.0001171007,0.00037324568,0.00016988591,0.0037006189,0.00006960028,0.00009988909],"category_scores_gemma":[0.00005049011,0.0001517128,0.000070800874,0.00033825342,0.00016160372,0.0008633266,0.0018222881,0.00018349521,0.00008422154],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000038267262,0.00036371098,0.000081214945,0.000044597655,0.000011361585,0.0000051928296,0.00017823029,0.000007405205,0.0050288932,0.67546135,0.0465744,0.27223977],"study_design_scores_gemma":[0.00062728475,0.0000956407,0.00006976857,0.00012734407,0.000005449621,0.000044683235,0.000024099145,0.7973599,0.12421434,0.04558096,0.03135761,0.0004929447],"about_ca_topic_score_codex":0.000022450391,"about_ca_topic_score_gemma":0.000043710803,"teacher_disagreement_score":0.7973525,"about_ca_system_score_codex":0.000053651598,"about_ca_system_score_gemma":0.000014328908,"threshold_uncertainty_score":0.6876732},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2160199,0.0000051752386,0.78244656,0.000053401163,0.000018613893,0.00014448959,0.0000034879827,0.0006987878,0.00060957187],"genre_scores_gemma":[0.49140623,0.000010116206,0.5084659,0.000021311336,0.0000090334825,0.0000068528893,0.000003924952,0.0000058146957,0.00007081976],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9989164,0.000028520808,0.00016561244,0.00044044718,0.0002040214,0.00024501508],"domain_scores_gemma":[0.99922293,0.000067450674,0.0000929868,0.00045882637,0.000059303962,0.000098495715],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001199174,0.00014898623,0.00014296731,0.00008030378,0.00018353786,0.00014967058,0.0003883768,0.000045842677,0.000010527737],"category_scores_gemma":[0.000043674638,0.00011748205,0.000018226032,0.00018206135,0.000048957027,0.0017166449,0.00050842424,0.00009269874,0.000012814472],"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.00012674974,0.00028930698,0.004452943,0.000028765982,0.000040121555,0.00016393869,0.002629664,0.0150266085,0.8661072,0.032006457,0.00048861915,0.07863962],"study_design_scores_gemma":[0.0036011243,0.00073052576,0.0053401375,0.00040542352,0.000017922825,0.00014742302,0.0006225717,0.48242658,0.5008979,0.004524038,0.0002786084,0.0010077434],"about_ca_topic_score_codex":0.00041744695,"about_ca_topic_score_gemma":0.000031923242,"teacher_disagreement_score":0.46739998,"about_ca_system_score_codex":0.00006780649,"about_ca_system_score_gemma":0.000034113942,"threshold_uncertainty_score":0.47907788},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004061317,0.000038808786,0.99291116,0.0001753975,0.000600719,0.00055595546,0.000005257537,0.0010386367,0.00061272917],"genre_scores_gemma":[0.528735,0.0000036823626,0.47046077,0.00027020686,0.00006911298,0.000038205126,0.0000074993786,0.000010590061,0.00040497066],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9983744,0.000024821471,0.00035319265,0.000518368,0.00025516038,0.00047404805],"domain_scores_gemma":[0.99860364,0.00037900003,0.00013203092,0.0006237042,0.00013206301,0.00012957107],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00075138774,0.00016750082,0.00017234315,0.00022490023,0.00025332908,0.00013319321,0.0008424313,0.000083072235,0.000012537498],"category_scores_gemma":[0.00028058217,0.00014965289,0.00006976967,0.0002839089,0.000031777297,0.0012675636,0.0004436904,0.000115494986,0.000015750682],"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.00017486082,0.00028829408,0.0014212404,0.00011706327,0.000028649227,0.000030113137,0.0016395586,0.0019752677,0.45825538,0.1914133,0.03597499,0.30868128],"study_design_scores_gemma":[0.0006249027,0.00013366206,0.0004000351,0.00009786634,0.000003784223,0.000013334992,0.0000765548,0.29498163,0.65517104,0.013479606,0.034628592,0.0003889789],"about_ca_topic_score_codex":0.000015488225,"about_ca_topic_score_gemma":0.000014195335,"teacher_disagreement_score":0.52467364,"about_ca_system_score_codex":0.00010605078,"about_ca_system_score_gemma":0.000020301526,"threshold_uncertainty_score":0.61026675},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.031783808,0.000010529305,0.95932955,0.00006077969,0.00003587327,0.00024106009,0.000022408736,0.00032236904,0.008193654],"genre_scores_gemma":[0.8720255,0.0000011217809,0.12763302,0.00013346212,0.000010737056,0.000023401577,0.000017059463,0.000009398739,0.00014629606],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9988144,0.000040489394,0.00026379438,0.0003597097,0.00031553282,0.00020605022],"domain_scores_gemma":[0.99916565,0.000051249805,0.00013572,0.0004746947,0.00009225923,0.000080412225],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00010936233,0.00012943574,0.00012945458,0.00009894704,0.000059865433,0.00012674884,0.0005326055,0.000035066965,0.00017107525],"category_scores_gemma":[0.000021612916,0.000107721135,0.00003051758,0.00024328638,0.000031518484,0.0017149228,0.00010606486,0.000069245674,0.000014867286],"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.00004216801,0.0013902416,0.0010169898,0.00006765656,0.00002249594,0.0000140260745,0.001041516,0.00021161312,0.08107943,0.15981136,0.0032351695,0.7520673],"study_design_scores_gemma":[0.00035501,0.00063651893,0.00025347795,0.000026622653,0.000002074839,0.000008498348,0.00014488112,0.002411268,0.977222,0.015495328,0.003247057,0.00019726185],"about_ca_topic_score_codex":0.00000862093,"about_ca_topic_score_gemma":0.000006835668,"teacher_disagreement_score":0.89614254,"about_ca_system_score_codex":0.00002851817,"about_ca_system_score_gemma":0.000057643567,"threshold_uncertainty_score":0.43927404},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.063467346,0.00002972302,0.9256031,0.000044744054,0.000118670665,0.0002774044,0.000022214925,0.00037842419,0.010058362],"genre_scores_gemma":[0.781739,0.000020179405,0.21767016,0.00015965427,0.0000073032493,0.000042248706,0.000009226064,0.000007781958,0.00034446275],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99882954,0.000056248668,0.00027068387,0.00033294995,0.00024837573,0.0002621837],"domain_scores_gemma":[0.9988117,0.000083580075,0.00012033654,0.00077337155,0.00012864548,0.00008232779],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017338163,0.0001414876,0.00019620285,0.00011859388,0.00015129699,0.000033759872,0.0006860036,0.00005263581,0.00026157178],"category_scores_gemma":[0.000019801872,0.00012604761,0.00004775651,0.00036340381,0.00013871092,0.0008042391,0.00024971756,0.00012830646,0.000039881128],"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.000012861452,0.0007642922,0.00088593026,0.0002199683,0.000035113582,0.000013023533,0.00054098415,0.0084647685,0.052001163,0.91679686,0.012508613,0.0077564013],"study_design_scores_gemma":[0.00044977845,0.00020150939,0.0010095848,0.00011844727,0.000004841799,0.000059302085,0.00011637193,0.15563484,0.7832552,0.05641496,0.0023017484,0.00043339416],"about_ca_topic_score_codex":0.000010369536,"about_ca_topic_score_gemma":0.0000035724008,"teacher_disagreement_score":0.8603819,"about_ca_system_score_codex":0.00003655073,"about_ca_system_score_gemma":0.00004649097,"threshold_uncertainty_score":0.5140073},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0011385771,0.000017699178,0.9951042,0.00043543105,0.00003553308,0.0001392569,0.000008105061,0.0003100817,0.0028111115],"genre_scores_gemma":[0.4997277,0.0000058945793,0.50003326,0.00007117672,0.00001877776,0.000010581537,0.0000033569813,0.000003942085,0.00012533853],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99944115,0.0000054928764,0.00017110824,0.00019798211,0.000062093226,0.00012216615],"domain_scores_gemma":[0.9992932,0.00008154011,0.00007981736,0.0004413961,0.0000660408,0.00003799895],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000049755814,0.00006961833,0.000094111776,0.00011086514,0.000028477283,0.0000743101,0.0006495004,0.000023172915,0.0000041562726],"category_scores_gemma":[0.000036329497,0.000057775054,0.000063320775,0.00014787147,0.00004051553,0.0015784035,0.0002974638,0.00003844401,0.000003851907],"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.000015197372,0.00009491748,0.00014779695,0.00002782113,0.000007984971,0.0000030451351,0.00006933722,0.000003642097,0.01403235,0.4285718,0.037620965,0.5194051],"study_design_scores_gemma":[0.00064994337,0.0002906264,0.00019779432,0.00017403765,0.000004294373,0.000046017994,0.000038866838,0.03551764,0.723812,0.0805412,0.15828902,0.0004385577],"about_ca_topic_score_codex":9.35029e-7,"about_ca_topic_score_gemma":0.0000014920467,"teacher_disagreement_score":0.7097797,"about_ca_system_score_codex":0.000009218552,"about_ca_system_score_gemma":0.000006341479,"threshold_uncertainty_score":0.23559983},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0059973635,0.00014661932,0.99112445,0.00016068773,0.000040600087,0.00006613031,0.00000278624,0.00031169597,0.0021496837],"genre_scores_gemma":[0.7117133,0.00014103157,0.28793624,0.000048155664,0.0000068640948,0.000004485129,0.0000015892132,0.0000023004086,0.00014601003],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995276,0.000015426498,0.00013113035,0.00014756349,0.000115029536,0.0000632786],"domain_scores_gemma":[0.9995624,0.000030422088,0.0000566034,0.00027883888,0.000047628255,0.00002414592],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000059413305,0.000046876045,0.00006531677,0.0000610663,0.00003087602,0.000019689815,0.00020203415,0.00002700081,0.000038646736],"category_scores_gemma":[0.000035245568,0.000038774746,0.000009286032,0.00015594723,0.00002872104,0.0006883955,0.00011648812,0.000031057367,0.0000034035959],"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.000002933097,0.00012252374,0.006846496,0.00004656659,0.000011103935,0.0000025186046,0.00094410067,0.00006712615,0.269505,0.5017356,0.014577029,0.20613898],"study_design_scores_gemma":[0.000272323,0.0001659177,0.007370234,0.0000524605,0.0000040433647,0.000017229222,0.000038021593,0.48578823,0.4665567,0.0351432,0.004411491,0.00018015424],"about_ca_topic_score_codex":0.000010722616,"about_ca_topic_score_gemma":0.0000012483816,"teacher_disagreement_score":0.70571595,"about_ca_system_score_codex":0.0000063773696,"about_ca_system_score_gemma":0.000002672824,"threshold_uncertainty_score":0.15811883},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0005938121,0.000085879845,0.9977417,0.0004398401,0.00004805757,0.00021659504,0.000003686415,0.00038230268,0.00048810706],"genre_scores_gemma":[0.51768386,0.000052738145,0.4819409,0.0002807385,0.0000053915696,0.0000030021074,0.000006962253,0.0000039387837,0.00002246428],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99892056,0.00006150047,0.00033367486,0.000312922,0.00022395678,0.00014738746],"domain_scores_gemma":[0.9990635,0.00011488169,0.00020996237,0.00040243435,0.00014885451,0.000060376027],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021950366,0.00012727141,0.00020965168,0.00017096713,0.000086803164,0.00008483536,0.00030610416,0.000054250773,0.000018002434],"category_scores_gemma":[0.0001408115,0.00011268542,0.000027893668,0.00027238968,0.00004778757,0.00064692454,0.00010307629,0.0000719939,0.0000010181045],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000028015556,0.00023437038,0.00031982968,0.00006882691,0.000011338716,0.0000055783385,0.0001938082,0.024815964,0.027242817,0.72161067,0.001676581,0.22379221],"study_design_scores_gemma":[0.00037128717,0.00016174263,0.00047662115,0.0001073725,0.0000044757157,0.000002876044,0.000019759182,0.89501476,0.101716146,0.0018069972,0.00017611534,0.0001418598],"about_ca_topic_score_codex":0.000013738464,"about_ca_topic_score_gemma":0.0000023694572,"teacher_disagreement_score":0.8701988,"about_ca_system_score_codex":0.000022551305,"about_ca_system_score_gemma":0.000029755949,"threshold_uncertainty_score":0.4595178},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011634841,0.000079114,0.98702,0.000021470109,0.00015495405,0.0000783151,0.000014606849,0.00025571932,0.0007409573],"genre_scores_gemma":[0.4054187,0.000012159051,0.5945026,0.0000074509508,0.000011096082,7.590089e-7,0.0000018248674,0.0000046017803,0.00004080662],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99902505,0.00005735557,0.00022966582,0.00025551172,0.00023565794,0.00019674374],"domain_scores_gemma":[0.9990044,0.00007978132,0.00010572085,0.0006403588,0.000108736225,0.000060966642],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019536036,0.00010380718,0.00015361625,0.000069712514,0.00006418285,0.000042003656,0.00055093697,0.00004111883,0.00001916801],"category_scores_gemma":[0.00018023603,0.00008863889,0.000037170943,0.0004133679,0.00003721573,0.0006411499,0.00023705735,0.00008995775,0.0000022226575],"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.000021540785,0.00018263223,0.0058811046,0.000050847833,0.000028729237,0.00003680722,0.00010412073,0.00022860662,0.86940897,0.10102695,0.0024288602,0.020600822],"study_design_scores_gemma":[0.0001193254,0.000023006814,0.00050938426,0.000032629283,0.0000020837736,0.000010819249,0.000008182169,0.0028977292,0.9889979,0.0059489897,0.0013363254,0.000113628914],"about_ca_topic_score_codex":0.00000820883,"about_ca_topic_score_gemma":4.9851913e-8,"teacher_disagreement_score":0.39378384,"about_ca_system_score_codex":0.000035923844,"about_ca_system_score_gemma":0.00003746921,"threshold_uncertainty_score":0.3614589},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00010008181,0.0000725685,0.9787504,0.000283792,0.00015281442,0.00007329936,0.000002223472,0.00090389384,0.019660925],"genre_scores_gemma":[0.07874089,0.000058963815,0.9165788,0.0007187605,0.000028538181,0.0000120936265,0.0000011546435,0.000008713329,0.0038520873],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991354,0.000021987313,0.0001387074,0.00029981745,0.00019426078,0.00020987028],"domain_scores_gemma":[0.99911094,0.000053615087,0.000039747567,0.00067810697,0.000039406972,0.000078196164],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00008177901,0.00009655526,0.00009673551,0.00006869311,0.00008313678,0.00009726313,0.00082770037,0.000036943107,0.0006282355],"category_scores_gemma":[0.000018942694,0.00007950809,0.00002969216,0.00021387961,0.000025688554,0.00082815054,0.00040698185,0.00009377359,0.000258686],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[4.2022262e-7,0.00008416564,0.00002421631,0.0000033642311,0.00000418107,0.000034312463,0.00018175965,0.0000034099035,0.002801007,0.044532765,0.09534917,0.8569812],"study_design_scores_gemma":[0.00041530514,0.000113332906,0.00014006508,0.000060896433,0.0000014878204,0.000057978286,0.000019576604,0.38854346,0.33640605,0.01302827,0.2606305,0.00058310217],"about_ca_topic_score_codex":0.000002730471,"about_ca_topic_score_gemma":3.4395993e-7,"teacher_disagreement_score":0.8563981,"about_ca_system_score_codex":0.00001856811,"about_ca_system_score_gemma":0.000003904014,"threshold_uncertainty_score":0.68787384},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.33432552,0.00037509296,0.6547343,0.0002987408,0.0009734133,0.0024489006,0.00040487805,0.0023871344,0.0040519717],"genre_scores_gemma":[0.9122236,0.00014049895,0.08622885,0.0005151586,0.000050738196,0.00021315632,0.000069318565,0.00005527976,0.00050340936],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9973044,0.00016918237,0.0005667893,0.0009952144,0.00042883417,0.0005356147],"domain_scores_gemma":[0.9978847,0.00028133558,0.0003022166,0.0009441358,0.00034139428,0.00024623668],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007856307,0.00034821205,0.00032575137,0.00028376552,0.0010234842,0.0002308588,0.0009280862,0.00019900077,0.000030022195],"category_scores_gemma":[0.0006486506,0.00035841626,0.00008410096,0.00061273546,0.000054339904,0.0039490773,0.0006405776,0.00026643943,0.000014919988],"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.000052382235,0.0000981924,0.000080065445,0.00006904101,0.000026054437,0.000011021001,0.00001645727,0.00085971685,0.0552208,0.4030025,0.000019831628,0.540544],"study_design_scores_gemma":[0.0017393811,0.00031344534,0.0014490788,0.00032365363,0.000032003678,0.00012267692,0.000017624152,0.12059787,0.16615942,0.5565316,0.15143844,0.0012748165],"about_ca_topic_score_codex":0.000036151294,"about_ca_topic_score_gemma":0.00002126759,"teacher_disagreement_score":0.5778981,"about_ca_system_score_codex":0.00016171549,"about_ca_system_score_gemma":0.000014789077,"threshold_uncertainty_score":0.9998868},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0047125528,0.0000033910796,0.9897813,0.00023519112,0.00020953627,0.00018855321,0.000028441635,0.0002773316,0.0045636822],"genre_scores_gemma":[0.9943329,0.000019246007,0.004852771,0.000580634,0.000006241038,0.0000537688,0.0000035997382,0.0000048558913,0.00014597093],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9990631,0.00011034341,0.000326739,0.000102482045,0.00027055625,0.00012682438],"domain_scores_gemma":[0.9988374,0.0003952584,0.00013195211,0.0005530612,0.00004574777,0.000036546702],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039299057,0.00010599933,0.00010087971,0.00014911588,0.00020768338,0.000043492662,0.0005037533,0.000046888923,0.00047648879],"category_scores_gemma":[0.00001631918,0.00007584985,0.000074585034,0.00028038205,0.00007366963,0.0016228701,0.0000014807174,0.00018398547,0.00016646723],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000088290835,0.000045196295,7.878202e-8,0.000007947847,0.000011329397,1.7019954e-7,0.0027710423,0.011767371,0.00024294773,0.21686162,0.0004102031,0.7677938],"study_design_scores_gemma":[0.001296851,0.00094923447,0.00019351579,0.00042926,0.00003436186,0.000026804926,0.0013453239,0.07051354,0.6781404,0.22280996,0.023411008,0.00084976206],"about_ca_topic_score_codex":0.0000031254854,"about_ca_topic_score_gemma":4.6287795e-7,"teacher_disagreement_score":0.9896204,"about_ca_system_score_codex":0.000041519415,"about_ca_system_score_gemma":0.000029921914,"threshold_uncertainty_score":0.5217218},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0039411965,0.00004975766,0.9940735,0.00022772531,0.00017766628,0.00057548133,0.000041621843,0.00056910363,0.00034396333],"genre_scores_gemma":[0.7438866,0.00008937728,0.25535187,0.00023874955,0.00012750285,0.00018640069,0.000012886974,0.000022610287,0.00008402189],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99772453,0.000010594949,0.00032450815,0.00084999565,0.0002704049,0.0008199664],"domain_scores_gemma":[0.9984129,0.00012131663,0.00010715608,0.00023251839,0.00045466755,0.0006714558],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00014352864,0.00038389122,0.00037270333,0.0005111934,0.00036731,0.00038271717,0.0008301833,0.0001415732,0.0000071334516],"category_scores_gemma":[0.00008315018,0.00039094352,0.000064892316,0.00047179282,0.000067729095,0.0010262425,0.00016950493,0.00042570094,0.000004731878],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000037509548,0.000099757526,0.0010464287,0.00009018514,0.00006703096,0.00006996107,0.0012308061,0.0003827691,0.005482463,0.55490303,0.001883089,0.434707],"study_design_scores_gemma":[0.00054264383,0.00042703166,0.0009044531,0.00012469411,0.0000055995,0.000073366165,0.000012138649,0.9913371,0.002452863,0.0014985503,0.0021550492,0.00046647005],"about_ca_topic_score_codex":0.0007709835,"about_ca_topic_score_gemma":0.0001290037,"teacher_disagreement_score":0.9909544,"about_ca_system_score_codex":0.00022479959,"about_ca_system_score_gemma":0.0003628122,"threshold_uncertainty_score":0.99985427},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016298711,0.0004077841,0.9793856,0.00018660314,0.0005336202,0.0022318969,0.00014791824,0.00077556266,0.000032281827],"genre_scores_gemma":[0.96496475,0.0000687757,0.032813925,0.000069755304,0.000017471148,0.0018961305,0.0000046234336,0.000031442898,0.00013314157],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9980975,0.000044417004,0.0004591195,0.0007915159,0.00017319305,0.00043427845],"domain_scores_gemma":[0.9985427,0.00018532739,0.00024188777,0.00068550644,0.00022154342,0.00012302643],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027712516,0.00028284566,0.00042767168,0.0004582541,0.00049084774,0.000086319145,0.00043799466,0.00023299853,0.000002267538],"category_scores_gemma":[0.000030287816,0.00024066617,0.000054831104,0.00028525954,0.00021349863,0.0005682267,0.000011615074,0.00021640041,0.0000014076804],"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.00088054186,0.0012782307,0.00057049055,0.0018347141,0.0005854434,0.00005463233,0.0068066777,0.0011269418,0.2133591,0.1730295,0.0028410605,0.59763265],"study_design_scores_gemma":[0.013197744,0.011643553,0.00043708042,0.0030560677,0.00035932832,0.0014249483,0.0066992664,0.24228172,0.6436602,0.031922158,0.042209845,0.0031080896],"about_ca_topic_score_codex":0.00007407531,"about_ca_topic_score_gemma":0.00008423505,"teacher_disagreement_score":0.94866604,"about_ca_system_score_codex":0.00008679038,"about_ca_system_score_gemma":0.00005354446,"threshold_uncertainty_score":0.9814081},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015184948,0.000033715467,0.98300666,0.00003612387,0.00013894282,0.00067170605,0.0000032989587,0.00032499002,0.0005996098],"genre_scores_gemma":[0.6809228,0.000022485066,0.3186966,0.000047635876,0.000032719563,0.00003579305,9.4568395e-7,0.000007003469,0.00023401533],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99884516,0.000032668962,0.00029364065,0.0003713157,0.00021973444,0.00023746301],"domain_scores_gemma":[0.99882597,0.00017849774,0.00015077613,0.0006603468,0.00013068883,0.000053702654],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017518098,0.0001341033,0.00022256035,0.000091076814,0.00010770918,0.00003233177,0.0009107168,0.000040672185,0.000032363852],"category_scores_gemma":[0.00002200541,0.00011109764,0.00003185467,0.00031252357,0.000027476328,0.0007470081,0.00043302064,0.00009822163,0.000004726311],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009277142,0.0019866044,0.0013596865,0.00004450512,0.000103788174,0.000014018029,0.002338204,0.01594303,0.0015585787,0.035544917,0.02302577,0.9179881],"study_design_scores_gemma":[0.00057935587,0.0009574639,0.0006075063,0.000030017642,0.0000047997105,0.0000024503956,0.00008248942,0.9912225,0.005779716,0.00035703953,0.00022712584,0.00014951047],"about_ca_topic_score_codex":0.000023245786,"about_ca_topic_score_gemma":0.0000028622833,"teacher_disagreement_score":0.9752795,"about_ca_system_score_codex":0.000024835887,"about_ca_system_score_gemma":0.000004937712,"threshold_uncertainty_score":0.453043},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018983789,0.000011208829,0.97870123,0.00022174402,0.00034249696,0.00043531842,0.000048569083,0.00061487564,0.00064074644],"genre_scores_gemma":[0.20675659,7.493273e-7,0.79255825,0.000100104065,0.00007340749,0.00004422436,0.00003287939,0.000012045422,0.0004217665],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99887496,0.000012931456,0.00023037987,0.00042573866,0.00020855335,0.0002474161],"domain_scores_gemma":[0.998825,0.00011622829,0.00012542833,0.0006720855,0.00016890978,0.00009231118],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001059578,0.0001569848,0.0001579344,0.00008653275,0.00020012663,0.00045114793,0.00084124046,0.00008652551,0.00002190712],"category_scores_gemma":[0.000051729632,0.0001283775,0.000054955537,0.00013479355,0.00006523268,0.0026630636,0.00059393124,0.000155711,0.00002135379],"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.000022573016,0.000111288675,0.00016972076,0.000027301416,0.000005986666,0.0000031011305,0.00005016064,0.000051187977,0.9147004,0.03480833,0.012881296,0.037168674],"study_design_scores_gemma":[0.00035219334,0.00005945437,0.00008112596,0.00003946977,0.0000023329458,0.000015643378,0.00001103031,0.41797248,0.5457183,0.009244669,0.026232058,0.00027121173],"about_ca_topic_score_codex":0.0000051950974,"about_ca_topic_score_gemma":0.0000027629897,"teacher_disagreement_score":0.4179213,"about_ca_system_score_codex":0.000019977735,"about_ca_system_score_gemma":0.00004216657,"threshold_uncertainty_score":0.5235083},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.050726302,0.000044653276,0.94750667,0.00019000762,0.00036398228,0.00014467072,0.000028613316,0.00033102123,0.0006640721],"genre_scores_gemma":[0.7569307,0.00004465052,0.24263361,0.00018007465,0.00011798627,0.0000050532576,0.0000066030957,0.000013988237,0.00006732905],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998305,0.000038585924,0.00039147332,0.00053922395,0.00042444267,0.0003012366],"domain_scores_gemma":[0.99900585,0.00006484139,0.00023944944,0.00021814145,0.0003396726,0.00013204107],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001547076,0.0002419762,0.00019236188,0.00025275134,0.00024048552,0.0006944351,0.00070181076,0.000113270304,0.000068149544],"category_scores_gemma":[0.00005691917,0.00022964778,0.00004519284,0.00019132462,0.00011749761,0.0012272951,0.00013016906,0.00042192018,0.0000060930392],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004680465,0.00014012052,0.000075530304,0.00003020458,0.00002993276,0.00005413171,0.0003537897,0.0019661447,0.6930744,0.001394055,0.00012349294,0.30271137],"study_design_scores_gemma":[0.00026078054,0.00014858505,0.000026788437,0.00027001786,0.0000095743835,0.00008623922,0.000037113638,0.93670464,0.05840743,0.0037877667,0.00004118745,0.00021987909],"about_ca_topic_score_codex":0.000013011153,"about_ca_topic_score_gemma":8.712501e-7,"teacher_disagreement_score":0.9347385,"about_ca_system_score_codex":0.0001070418,"about_ca_system_score_gemma":0.000056793342,"threshold_uncertainty_score":0.9364764},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0014993012,0.00006828223,0.99539816,0.00092052907,0.00040437782,0.00021346498,0.0000620679,0.00022771867,0.0012061134],"genre_scores_gemma":[0.85135895,0.00009288222,0.14701821,0.00051819667,0.00015849432,0.0000423837,0.000009061081,0.000015363477,0.00078648207],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984742,0.000021676544,0.00029726798,0.0004976391,0.0004193818,0.00028983847],"domain_scores_gemma":[0.99878275,0.00022223976,0.0001870177,0.0002078306,0.0004792435,0.00012091579],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015426522,0.00021361255,0.00018883028,0.00018587007,0.00018382164,0.00057205145,0.00081989093,0.00007148858,0.00008569415],"category_scores_gemma":[0.00011308534,0.00019390108,0.00004401834,0.000132436,0.00007370858,0.0006912088,0.00012518826,0.00020989975,0.000020711042],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012501201,0.00032709006,0.000020049758,0.00013423663,0.00003603416,0.00012686949,0.00070704374,0.0036772508,0.13104047,0.032208417,0.0052683307,0.8263292],"study_design_scores_gemma":[0.0003372104,0.00017036285,0.000007003825,0.0001945809,0.0000046518003,0.00002427685,0.000015727031,0.9444111,0.022399072,0.030946895,0.0012403869,0.00024874255],"about_ca_topic_score_codex":0.0000029710288,"about_ca_topic_score_gemma":6.00665e-7,"teacher_disagreement_score":0.94073385,"about_ca_system_score_codex":0.000038522325,"about_ca_system_score_gemma":0.000046252495,"threshold_uncertainty_score":0.7907057},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.023080608,0.000021884583,0.9720097,0.000034613,0.000080742204,0.00016220656,0.0000026350801,0.0005201201,0.004087456],"genre_scores_gemma":[0.5437948,0.00000986614,0.45591515,0.000053491767,0.000009951979,0.000011482688,0.0000065466343,0.000008946843,0.00018975193],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9986607,0.00006256731,0.0003296123,0.00039761045,0.00033949543,0.0002100454],"domain_scores_gemma":[0.9985781,0.0000371359,0.00019622322,0.0009409948,0.00014387557,0.00010371043],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016919998,0.00015594673,0.00018234937,0.00015840407,0.000058104913,0.000032506035,0.0011177701,0.00008476416,0.00015665719],"category_scores_gemma":[0.00004512411,0.00013054855,0.000049983777,0.00033742416,0.0000678505,0.00088027655,0.00080923806,0.000109911205,0.000037494054],"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.00005988687,0.00068314775,0.0034411938,0.000063012674,0.00004681455,0.000021107955,0.011807915,0.00035038783,0.04921916,0.13981467,0.004232921,0.7902598],"study_design_scores_gemma":[0.0003189826,0.00021727405,0.0017401659,0.000055695957,0.000005593366,0.000014607509,0.0002837723,0.022192828,0.959637,0.014466435,0.0007516057,0.00031608055],"about_ca_topic_score_codex":0.00005515608,"about_ca_topic_score_gemma":0.000008310555,"teacher_disagreement_score":0.9104178,"about_ca_system_score_codex":0.000024749266,"about_ca_system_score_gemma":0.000037291284,"threshold_uncertainty_score":0.5323615},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00010639664,0.00023439068,0.99571395,0.0008622923,0.000056983183,0.0007593498,0.0015940003,0.00047426214,0.00019840134],"genre_scores_gemma":[0.40969643,0.00005925452,0.5881843,0.00018759051,0.000025739184,0.00007868453,0.0017015617,0.000019160227,0.000047299363],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973443,0.00022838355,0.00074109435,0.0008493615,0.0004660621,0.00037078065],"domain_scores_gemma":[0.99242544,0.0009393517,0.0006260219,0.005346737,0.00050719496,0.00015524542],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0006598941,0.0003100026,0.00048593455,0.00019929254,0.00025292297,0.00037157352,0.006318008,0.00008006456,0.00004392888],"category_scores_gemma":[0.00043248074,0.00027418576,0.00006854267,0.00020403907,0.00024039572,0.0032357275,0.0033681109,0.00023694734,0.000023874849],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00028182403,0.0012522368,0.00002884722,0.00026060085,0.00007984666,0.000008157658,0.00038723144,0.015104048,0.1339979,0.012715771,0.23897266,0.5969109],"study_design_scores_gemma":[0.0005158406,0.00008148813,0.000015645515,0.0003045415,0.000010928531,0.000005704039,0.000014420324,0.81990784,0.14700933,0.0064374884,0.02540355,0.00029324304],"about_ca_topic_score_codex":0.000016139564,"about_ca_topic_score_gemma":0.0000022754336,"teacher_disagreement_score":0.8048038,"about_ca_system_score_codex":0.000035872024,"about_ca_system_score_gemma":0.00018240238,"threshold_uncertainty_score":0.99997103},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00011039419,0.00009039769,0.9405633,0.0015177442,0.000054960798,0.00006717394,7.9594577e-7,0.0009290153,0.05666618],"genre_scores_gemma":[0.059563108,0.00009874457,0.9338867,0.0010872533,0.000019400293,0.0000184064,9.0235113e-7,0.0000049572736,0.0053205476],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9994527,0.000011761322,0.00009936713,0.00018068761,0.00012182483,0.00013363364],"domain_scores_gemma":[0.99941236,0.000015757147,0.000015736206,0.0004884519,0.000016609214,0.000051091127],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00003831279,0.000061646584,0.0000659017,0.00004234602,0.000044775745,0.00004108375,0.0006907411,0.000022700538,0.00061943935],"category_scores_gemma":[0.0000051142933,0.000047410227,0.000027861934,0.00014927321,0.000012439696,0.0006086064,0.000094488605,0.000046545432,0.0001707889],"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":[4.8727355e-7,0.000032956323,0.00000545246,0.0000016551047,0.000002060015,0.0000059648205,0.000077553974,0.0000046567775,0.0026023716,0.42243207,0.075446494,0.49938828],"study_design_scores_gemma":[0.0003271406,0.000045061784,0.000030355934,0.000006659932,0.0000010735274,0.000020813464,0.0000021729854,0.15836959,0.16220012,0.06490096,0.6138582,0.0002378649],"about_ca_topic_score_codex":0.000004184183,"about_ca_topic_score_gemma":9.549489e-7,"teacher_disagreement_score":0.5384117,"about_ca_system_score_codex":0.000008984155,"about_ca_system_score_gemma":0.0000019143322,"threshold_uncertainty_score":0.6782427},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0037887054,0.00063214294,0.98028237,0.0037412427,0.00037637248,0.00064765033,0.00041887202,0.0010754265,0.009037232],"genre_scores_gemma":[0.5866039,0.00054145884,0.4118232,0.00039931788,0.000058887217,0.00012943333,0.00010839183,0.000017572922,0.00031785524],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9959073,0.00038240972,0.001398548,0.0008093231,0.0006246332,0.00087778916],"domain_scores_gemma":[0.99387115,0.00033208483,0.00077065994,0.0038098677,0.0008315394,0.00038469967],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00059875345,0.00050861534,0.00065693917,0.00035012967,0.00071553286,0.00023856584,0.005043254,0.00026553034,0.00017417366],"category_scores_gemma":[0.00032582317,0.0005444707,0.00027954183,0.0009606418,0.0004388596,0.0016800067,0.0015925847,0.0005487263,0.00023101225],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007072247,0.002970587,0.002170013,0.00008416251,0.0003496969,0.000009652871,0.0009938935,0.016967053,0.024062496,0.5309129,0.18926097,0.23214784],"study_design_scores_gemma":[0.0021612549,0.00020747459,0.0034418977,0.00043793797,0.00007406538,0.00028133646,0.00028172703,0.7115517,0.020001879,0.040476676,0.21943972,0.0016443061],"about_ca_topic_score_codex":0.00032843297,"about_ca_topic_score_gemma":0.0010418071,"teacher_disagreement_score":0.69458467,"about_ca_system_score_codex":0.0005924323,"about_ca_system_score_gemma":0.000615831,"threshold_uncertainty_score":0.99970067},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0030593646,0.00006519202,0.99462545,0.0002230739,0.0000629597,0.00009720072,9.0621705e-7,0.00030471195,0.0015611654],"genre_scores_gemma":[0.2970073,0.00007931187,0.7013994,0.0005109917,0.000045977,0.0000044999206,4.7692885e-7,0.000010578973,0.000941493],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99919164,0.000020251386,0.0001431187,0.0003161369,0.00013771436,0.00019113057],"domain_scores_gemma":[0.99937224,0.000031841948,0.000058289803,0.0004216325,0.000035477864,0.0000805281],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00009906592,0.000102779384,0.00012168314,0.00008890429,0.0001257706,0.000064971464,0.00032640214,0.000038792485,0.000048612575],"category_scores_gemma":[0.000026046244,0.000087618624,0.000021010504,0.00017194623,0.00003883036,0.0006584747,0.000593381,0.00009864292,0.000022728],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016256987,0.00044288288,0.00041475616,0.00016217462,0.000063308464,0.00016457542,0.007051588,0.00452176,0.35701644,0.027916426,0.065937,0.53629285],"study_design_scores_gemma":[0.00011305472,0.000021332586,0.000031980777,0.000043369444,0.0000013271623,0.00003462426,0.0000142378485,0.9539355,0.04082762,0.0008378637,0.0040036803,0.00013538156],"about_ca_topic_score_codex":0.000022275928,"about_ca_topic_score_gemma":5.8343704e-7,"teacher_disagreement_score":0.9494138,"about_ca_system_score_codex":0.00002176002,"about_ca_system_score_gemma":0.000004067245,"threshold_uncertainty_score":0.3572984},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0014639728,0.00016300351,0.9895934,0.007888619,0.0002870283,0.00023558574,0.000029567133,0.00027684792,0.00006200626],"genre_scores_gemma":[0.69737816,0.00024968348,0.3014108,0.00081440015,0.00006043186,0.000046045938,0.000001728183,0.000011480249,0.000027253584],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99771655,0.00008999376,0.00046639465,0.00051514985,0.0009099198,0.00030199825],"domain_scores_gemma":[0.99804497,0.0009127102,0.0000852411,0.0005320242,0.00011941335,0.0003056265],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00090838585,0.00016489877,0.00029733838,0.00022484417,0.00018731589,0.000047533285,0.0008349877,0.00009962988,0.00018629104],"category_scores_gemma":[0.0003740343,0.00014254541,0.000073519856,0.00041292555,0.00032620324,0.0008151227,0.000025575453,0.0004194949,0.000004145737],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001010781,0.00017905817,0.000021952179,0.00004332578,0.000010634206,0.0000063886114,0.00006928616,0.000036314446,0.00086330366,0.0010010782,0.0013124137,0.99644613],"study_design_scores_gemma":[0.0018364827,0.00014084936,0.00030693357,0.0004402224,0.000029278914,0.00013001024,0.000043603213,0.6946054,0.2921153,0.003998409,0.0059040603,0.00044941952],"about_ca_topic_score_codex":0.00004505248,"about_ca_topic_score_gemma":0.000006004919,"teacher_disagreement_score":0.9959967,"about_ca_system_score_codex":0.000056750752,"about_ca_system_score_gemma":0.0001278701,"threshold_uncertainty_score":0.5812833},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00048233924,0.00001446343,0.97421163,0.0001479057,0.000042674194,0.00046106539,0.00000994588,0.0012098289,0.023420172],"genre_scores_gemma":[0.33168843,0.000012535849,0.6675852,0.0005241613,0.000007035171,0.00009795935,0.000004225015,0.000012168034,0.00006828357],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9987278,0.000053669493,0.00021984422,0.00050524104,0.00024053724,0.0002528937],"domain_scores_gemma":[0.99876,0.000069700676,0.00006373145,0.000924661,0.000046968526,0.00013496766],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020497666,0.00019988786,0.00018203247,0.00017572517,0.00011412095,0.000060139246,0.000872494,0.00005416096,0.00011103789],"category_scores_gemma":[0.000017373586,0.00014123078,0.000046083853,0.00013799293,0.000083766514,0.0008815597,0.00024447145,0.00019486774,0.000018384455],"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.00024042765,0.0010407562,0.0003308164,0.00013271661,0.000015476291,0.0002776117,0.00047689732,0.000011445836,0.33207247,0.12060321,0.020187588,0.5246106],"study_design_scores_gemma":[0.00028703202,0.00026467908,0.00039800254,0.00010677438,0.0000020131363,0.000025200483,0.0000033435936,0.034153644,0.93614066,0.024653714,0.0037082338,0.00025672917],"about_ca_topic_score_codex":0.00003095027,"about_ca_topic_score_gemma":0.0000010491531,"teacher_disagreement_score":0.60406816,"about_ca_system_score_codex":0.000018853912,"about_ca_system_score_gemma":0.000023037837,"threshold_uncertainty_score":0.57592237},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0001564921,0.0002522264,0.9870589,0.0015993142,0.00022157315,0.00031918002,0.000004979523,0.0007860153,0.009601334],"genre_scores_gemma":[0.05032364,0.00007476831,0.94764423,0.0010926251,0.00007095842,0.000025749934,0.0000016463182,0.000016656886,0.0007497358],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982851,0.00018022407,0.00030590832,0.0004691707,0.00040367083,0.00035592375],"domain_scores_gemma":[0.9981621,0.00031851712,0.00010017942,0.0012537673,0.00006440775,0.000101046484],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034346443,0.00020549813,0.0002051924,0.00009172623,0.00035462438,0.00014234832,0.0018672996,0.000079669466,0.00026164638],"category_scores_gemma":[0.000030859937,0.00012168433,0.00009038122,0.00042825582,0.000059693913,0.0010841059,0.0005007111,0.00028334453,0.00003672671],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000074510776,0.00017181155,0.000022621387,0.000016664653,0.000019564528,0.000018864506,0.0013423522,0.00058965496,0.019707942,0.07240912,0.035165858,0.8705281],"study_design_scores_gemma":[0.00024436807,0.00004546629,0.000027217891,0.00005173756,0.000007023343,0.00006090764,0.000037831793,0.79511464,0.10559179,0.012506925,0.08604525,0.00026686938],"about_ca_topic_score_codex":0.000041563646,"about_ca_topic_score_gemma":0.000003761553,"teacher_disagreement_score":0.8702612,"about_ca_system_score_codex":0.000042527296,"about_ca_system_score_gemma":0.000012665417,"threshold_uncertainty_score":0.4962143},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0016362204,0.00006687223,0.99578214,0.00013257437,0.00074788684,0.000095609226,0.000008384219,0.0014430222,0.0000873081],"genre_scores_gemma":[0.8708602,0.000064052256,0.12853384,0.0003074499,0.00006978477,0.000054043227,0.0000016146718,0.000023515242,0.00008548686],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985914,0.000024760613,0.00026218026,0.0003671534,0.00046267986,0.00029182943],"domain_scores_gemma":[0.998944,0.00009912885,0.00003799542,0.0006407476,0.000032339092,0.00024578438],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000104318,0.0001783797,0.00017053561,0.0003248393,0.00020448172,0.00002339138,0.00071470835,0.00012296656,0.00002743873],"category_scores_gemma":[0.000010884694,0.00016197076,0.0000773436,0.00052921457,0.00008720329,0.0004425164,0.000010133325,0.00040231863,0.000055464385],"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.000058115875,0.0014700548,0.00001489925,0.00012259178,0.00010757043,0.00061898254,0.0007852828,0.080700375,0.52734727,0.004265749,0.015533665,0.36897546],"study_design_scores_gemma":[0.0009860223,0.00040966747,0.00025508314,0.00030685778,0.000008099031,0.00021082743,0.00000620481,0.44032645,0.36625788,0.00027154273,0.19017154,0.0007898356],"about_ca_topic_score_codex":0.000004176687,"about_ca_topic_score_gemma":1.9198163e-7,"teacher_disagreement_score":0.869224,"about_ca_system_score_codex":0.00006405286,"about_ca_system_score_gemma":0.000042470565,"threshold_uncertainty_score":0.6604976},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.034365624,0.000017772445,0.9626928,0.00021076915,0.00010917263,0.00022648586,0.000003815951,0.0009952289,0.0013783054],"genre_scores_gemma":[0.7365133,0.0000022243453,0.2631149,0.00007982197,0.000023589213,0.000021692465,0.00004375047,0.0000075569114,0.00019315067],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9989531,0.000049554594,0.00021600521,0.0003449575,0.00025488462,0.00018150914],"domain_scores_gemma":[0.9991825,0.00006212763,0.00013290498,0.00048442296,0.00009380428,0.000044228687],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000103930855,0.00012776509,0.00011961251,0.00008476963,0.00012384173,0.000115258474,0.00033569438,0.000038820646,0.000010630115],"category_scores_gemma":[0.000019901136,0.000100339246,0.000025537087,0.00021220434,0.000047738526,0.0013972042,0.00009398743,0.000076250486,0.00003296586],"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.00017749565,0.00042749257,0.02590192,0.000043024553,0.000021726255,0.00004068146,0.00019485019,0.006981114,0.52503806,0.3854849,0.015248293,0.04044041],"study_design_scores_gemma":[0.0016577767,0.00037677324,0.123271674,0.000110669294,0.0000137387515,0.000043634813,0.000036629215,0.29593712,0.54112923,0.020209903,0.016346525,0.0008663416],"about_ca_topic_score_codex":0.0004376026,"about_ca_topic_score_gemma":0.00028823235,"teacher_disagreement_score":0.7021477,"about_ca_system_score_codex":0.000084786225,"about_ca_system_score_gemma":0.0000206957,"threshold_uncertainty_score":0.40917158},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006675481,0.00011372039,0.9918654,0.00024884762,0.000117069816,0.0001751841,0.000008743778,0.00046501012,0.00033052516],"genre_scores_gemma":[0.19458282,0.0000044925346,0.80513597,0.00013094278,0.000054115026,0.000006413272,7.969059e-7,0.000012475524,0.00007197523],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985906,0.00014351636,0.00032278843,0.00040972946,0.00025686965,0.00027648913],"domain_scores_gemma":[0.99867487,0.000095445415,0.00016550306,0.00086663594,0.00009375347,0.000103816805],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029087887,0.00017872753,0.00027735071,0.00016520642,0.00008261219,0.000046327837,0.0011127884,0.00007817205,0.000018340312],"category_scores_gemma":[0.00003915333,0.00014772084,0.000082712024,0.0003115205,0.000070082184,0.0005996814,0.00080127985,0.00017620002,0.0000025889735],"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.00001750883,0.00011490268,0.00002162132,0.000048110185,0.00003227631,0.000013402205,0.0006523024,0.038598225,0.25659728,0.016605375,0.0006679822,0.686631],"study_design_scores_gemma":[0.000109470304,0.000021927477,0.000009168905,0.000037987764,0.0000042378924,0.000031309264,0.0000069330854,0.5622694,0.43351385,0.0024440638,0.0014131366,0.00013849557],"about_ca_topic_score_codex":0.00009196131,"about_ca_topic_score_gemma":0.000009757864,"teacher_disagreement_score":0.6864925,"about_ca_system_score_codex":0.000044995355,"about_ca_system_score_gemma":0.000061786595,"threshold_uncertainty_score":0.6023881},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0031611477,0.00030598146,0.99074197,0.0007970432,0.00081670814,0.0026824127,0.000116889816,0.0013619442,0.000015883874],"genre_scores_gemma":[0.98759365,0.000029875162,0.008431491,0.00006046962,0.000034056808,0.0037384175,0.0000018757084,0.000026955966,0.00008321082],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9984269,0.000019859617,0.000361285,0.0006561285,0.00015387984,0.00038196179],"domain_scores_gemma":[0.9988718,0.000080313555,0.00015133753,0.0006544293,0.00016434875,0.00007774534],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021757088,0.00022248634,0.00030207488,0.0006507214,0.00055539684,0.0001028479,0.00047343268,0.00025180168,5.838193e-7],"category_scores_gemma":[0.000018969291,0.00020325967,0.00009103841,0.00050990004,0.00011176678,0.00016835665,0.000005813066,0.00020017571,0.000004717326],"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.000076187935,0.0009114138,0.0000011236117,0.00059842924,0.0001308813,0.000009542228,0.00046264663,0.1668399,0.08148128,0.12748356,0.00023217365,0.6217729],"study_design_scores_gemma":[0.004273647,0.0032808117,0.000006345385,0.0007297084,0.000058269143,0.0005136346,0.00024212389,0.3019533,0.5986351,0.0685952,0.020663003,0.0010489143],"about_ca_topic_score_codex":0.000040727246,"about_ca_topic_score_gemma":0.000010372704,"teacher_disagreement_score":0.9844325,"about_ca_system_score_codex":0.00012557417,"about_ca_system_score_gemma":0.00007134136,"threshold_uncertainty_score":0.82886887},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0029237894,0.00007321356,0.9946844,0.0002660964,0.00016181379,0.0002952742,0.0000024112833,0.0013606503,0.00023235739],"genre_scores_gemma":[0.17064945,0.000028970648,0.82873845,0.0002312886,0.00005740562,0.000015774376,0.00000739179,0.000016911592,0.0002543299],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99850863,0.000091968286,0.00030517037,0.00047511453,0.00027337472,0.00034573075],"domain_scores_gemma":[0.99880934,0.00006842386,0.00014941508,0.0007551161,0.00011738778,0.00010032347],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016827739,0.00016973812,0.00017576118,0.0001256586,0.00018003391,0.00018273834,0.0007573949,0.00007136856,0.00011288021],"category_scores_gemma":[0.000095982294,0.00015496986,0.00004910527,0.0005242463,0.000036383743,0.0012637955,0.00040439112,0.00013418972,0.00009044952],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016007198,0.0006619077,0.001074864,0.00007867548,0.000045338464,0.000043621898,0.00073469226,0.0026028468,0.4678006,0.22408105,0.0055269045,0.29733348],"study_design_scores_gemma":[0.00018286864,0.00005342273,0.00005721924,0.000048553913,0.0000047943595,0.0000072011194,0.0000042284005,0.8362374,0.14955622,0.0015292978,0.012077945,0.00024085758],"about_ca_topic_score_codex":0.000024684185,"about_ca_topic_score_gemma":0.0000020816913,"teacher_disagreement_score":0.83363456,"about_ca_system_score_codex":0.0000535447,"about_ca_system_score_gemma":0.000013762805,"threshold_uncertainty_score":0.63194877},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00014179312,0.000008996054,0.9959885,0.00009057804,0.00010209455,0.00022754273,0.0000022964061,0.00068073353,0.0027574978],"genre_scores_gemma":[0.11455779,0.0000034265938,0.88502747,0.00016803472,0.000008878994,0.000046452977,0.000011170654,0.000004750094,0.00017204178],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994654,0.000012500498,0.00012971401,0.00020289399,0.000083507,0.00010595202],"domain_scores_gemma":[0.9993522,0.000039737963,0.00006125603,0.00043945608,0.00007431627,0.00003303274],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000099443736,0.00006179355,0.00006120502,0.000062758714,0.00005816313,0.000029493951,0.00047886508,0.000031382475,0.000029585743],"category_scores_gemma":[0.00006668381,0.000052187737,0.000020741258,0.00012553687,0.00001306757,0.0009629112,0.00013661369,0.000025326688,0.000030067928],"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.000006427065,0.0000479433,0.000080298436,0.0000095299265,0.0000020435568,5.1956357e-7,0.00016331693,0.00006138257,0.0024027664,0.82526034,0.0061393506,0.16582608],"study_design_scores_gemma":[0.00014246033,0.00007591535,0.00061427127,0.000012568961,0.0000019518918,0.0000025118666,0.0000043430387,0.6216068,0.18975712,0.18439972,0.0032520848,0.00013018421],"about_ca_topic_score_codex":0.000009739788,"about_ca_topic_score_gemma":0.0000015328621,"teacher_disagreement_score":0.6408606,"about_ca_system_score_codex":0.000011083356,"about_ca_system_score_gemma":0.000013018859,"threshold_uncertainty_score":0.2128154},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.049057435,0.000021527645,0.94911474,0.00006788289,0.00008542951,0.0003130916,0.000014060333,0.00083627354,0.00048958143],"genre_scores_gemma":[0.77982473,0.000066215274,0.21986,0.00007084548,0.000020646003,0.000021598587,0.00001836602,0.0000104965475,0.000107068285],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99868804,0.000095465475,0.00023904147,0.0005015089,0.00023186089,0.00024409911],"domain_scores_gemma":[0.9990185,0.00013305183,0.00016099383,0.0004159819,0.00016912865,0.00010235666],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002060416,0.00017341723,0.00018554721,0.0001331612,0.000400658,0.000084191845,0.00032865818,0.000041969397,0.00000774201],"category_scores_gemma":[0.00008145837,0.00014219133,0.000018722181,0.00031364727,0.0001235854,0.0021575545,0.00031938567,0.00012466226,0.0000037607244],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011944337,0.0009828466,0.09063429,0.00028377326,0.00020596603,0.00023878364,0.011490219,0.016939895,0.38751894,0.4637261,0.010679644,0.016105102],"study_design_scores_gemma":[0.00089771807,0.00020767502,0.01445499,0.000104640174,0.000004913798,0.000058796326,0.00009153808,0.9352865,0.043496907,0.0049301223,0.00016099185,0.00030516947],"about_ca_topic_score_codex":0.00009418639,"about_ca_topic_score_gemma":0.00003629232,"teacher_disagreement_score":0.91834664,"about_ca_system_score_codex":0.000055052853,"about_ca_system_score_gemma":0.000032429558,"threshold_uncertainty_score":0.5798394},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0153756635,0.000089171524,0.9807307,0.00014435648,0.000087032065,0.00020409713,0.000011214823,0.00063567713,0.0027220454],"genre_scores_gemma":[0.43847263,0.000094795694,0.5612329,0.0000300144,0.000021582797,0.000012016391,0.0000074552127,0.0000064778715,0.00012207897],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99870163,0.000053024996,0.00041800446,0.00033467464,0.00030875168,0.0001839295],"domain_scores_gemma":[0.99898964,0.00012341482,0.00013074453,0.0005894045,0.00010427731,0.00006252595],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001406695,0.00012400841,0.00017262448,0.00026389756,0.00006931792,0.00002304453,0.00058300333,0.00007705377,0.000106266714],"category_scores_gemma":[0.000026865258,0.00011224897,0.000038240272,0.0005148483,0.000022255957,0.0011881369,0.00027894636,0.00018468667,0.000018794193],"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.000044053693,0.0041237553,0.0036531896,0.00017528459,0.000045605648,0.000072710536,0.0052956254,0.5845189,0.05402341,0.038450677,0.017566983,0.29202977],"study_design_scores_gemma":[0.00026181972,0.000053163727,0.0001673123,0.000071727416,0.000001949229,0.0000058435917,0.0000128206775,0.97497934,0.020162426,0.0028063892,0.0013742413,0.00010295618],"about_ca_topic_score_codex":0.000034981524,"about_ca_topic_score_gemma":0.00000381655,"teacher_disagreement_score":0.42309698,"about_ca_system_score_codex":0.00003705355,"about_ca_system_score_gemma":0.0000108029835,"threshold_uncertainty_score":0.457738},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0032545808,0.000121841564,0.98881495,0.00030196022,0.000089051384,0.00016208194,0.000017855644,0.00075151975,0.0064861495],"genre_scores_gemma":[0.8113109,0.000008096889,0.18811448,0.00011517577,0.000012249326,0.0000106340385,0.0000072955345,0.000009025613,0.00041217377],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9987068,0.000029207351,0.00030314247,0.00036066744,0.0003690905,0.00023105166],"domain_scores_gemma":[0.9984736,0.00012831054,0.00014102098,0.001060969,0.000092718896,0.0001034021],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00005877226,0.00015266653,0.00020488187,0.000117391915,0.00006097316,0.0001076187,0.001301124,0.000063215724,0.0001289196],"category_scores_gemma":[0.000027410782,0.000120763805,0.00007461565,0.00035491935,0.00008564677,0.00081731967,0.00050826196,0.000108598404,0.000047803667],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000026065036,0.0014322636,0.0036061732,0.00009262865,0.00002358184,0.000056814886,0.0001633057,0.000854408,0.031817023,0.02836738,0.057944763,0.8756156],"study_design_scores_gemma":[0.000903803,0.00023184583,0.0003224831,0.00018018874,0.000004938873,0.0000168529,0.000011867563,0.4283048,0.5281115,0.0047757183,0.03661873,0.0005172514],"about_ca_topic_score_codex":0.000005114783,"about_ca_topic_score_gemma":5.1817244e-7,"teacher_disagreement_score":0.87509835,"about_ca_system_score_codex":0.000014991557,"about_ca_system_score_gemma":0.000009103221,"threshold_uncertainty_score":0.4924605},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00096518255,0.000017205042,0.9712611,0.00014557492,0.00013879807,0.00015946175,0.000010710731,0.0003233971,0.026978614],"genre_scores_gemma":[0.5383935,0.000006615206,0.4611131,0.0003751585,0.000007821043,0.000016495433,0.0000030115998,0.000005200188,0.00007909447],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99892706,0.00006313399,0.00028283402,0.00032588688,0.00024087584,0.00016022228],"domain_scores_gemma":[0.9987338,0.00019976105,0.00010210486,0.0008624393,0.000049574373,0.000052291456],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015797693,0.000114888106,0.00015957652,0.0002556795,0.000032053893,0.000011534354,0.0008325877,0.00007276432,0.00017434124],"category_scores_gemma":[0.00006412471,0.00009063206,0.000032749984,0.00030002746,0.00003118697,0.00047203267,0.00029423504,0.00016034364,0.000009528647],"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.0006977188,0.0052827788,0.104401514,0.0003617048,0.000038316186,0.00016435843,0.0015661048,0.0022736469,0.07258424,0.13310622,0.17506975,0.50445366],"study_design_scores_gemma":[0.00044723076,0.00041614784,0.01482843,0.00026726737,0.0000019660433,0.0000017542296,0.00001632874,0.17619568,0.8020736,0.004701577,0.00087608455,0.00017393597],"about_ca_topic_score_codex":0.000082592,"about_ca_topic_score_gemma":0.000003668137,"teacher_disagreement_score":0.7294893,"about_ca_system_score_codex":0.00001658589,"about_ca_system_score_gemma":0.00002301742,"threshold_uncertainty_score":0.3695868},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00005154664,0.000020291222,0.99431694,0.00037473283,0.00013263486,0.00020588835,0.000007068483,0.0008190466,0.0040718853],"genre_scores_gemma":[0.047709458,0.0000011687927,0.95023,0.00029016656,0.000056259385,0.000048764658,0.000011406998,0.000006787488,0.0016459711],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99934375,0.000013158896,0.00014021398,0.00024163554,0.000109219916,0.00015202584],"domain_scores_gemma":[0.9991618,0.0002434128,0.000051716164,0.000441263,0.0000779838,0.000023870018],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00009558397,0.00007063206,0.00008021569,0.000030200126,0.00007255511,0.000083255094,0.0004893541,0.0000430656,0.000046679543],"category_scores_gemma":[0.000100633595,0.000060572638,0.000021427075,0.00020428089,0.000010630416,0.0005961712,0.00013634209,0.00003579703,0.0000140299035],"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.0000015306175,0.000024348396,0.000022581053,0.0000042848264,8.050713e-7,1.9394892e-7,0.0000029255968,0.00010332765,0.015012814,0.9583193,0.024919465,0.001588392],"study_design_scores_gemma":[0.00022471798,0.000058323953,0.00058630196,0.000014663466,0.0000019428783,0.000002262574,0.0000014314514,0.12177148,0.1453177,0.5826868,0.14914075,0.00019364752],"about_ca_topic_score_codex":0.000045743654,"about_ca_topic_score_gemma":0.0000024499861,"teacher_disagreement_score":0.37563255,"about_ca_system_score_codex":0.000016897693,"about_ca_system_score_gemma":0.000021945707,"threshold_uncertainty_score":0.24700806},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0034528472,0.00014049637,0.9937552,0.0007052209,0.000091742775,0.00011202506,0.000035214292,0.00041657733,0.0012906747],"genre_scores_gemma":[0.21309601,0.00004286229,0.7861915,0.0002836221,0.00006669837,0.0000022762767,0.000048014626,0.0000083742,0.0002606229],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9985843,0.00003496403,0.00032776073,0.00053560635,0.00031468162,0.00020271394],"domain_scores_gemma":[0.9973914,0.000091894595,0.000117747084,0.0022694531,0.00006189486,0.00006758159],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031638867,0.00011356607,0.00016582425,0.000079186946,0.000064676555,0.0000483957,0.0022046084,0.000050612172,0.00009307603],"category_scores_gemma":[0.00009246654,0.000093764436,0.000021876516,0.0002490918,0.00003788736,0.0015523998,0.0019059408,0.00010274551,0.000042381067],"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.000004061522,0.00006846118,0.000020965603,0.0000030111642,0.0000022786721,0.000002614666,0.000017189437,0.000007867083,0.23294398,0.0046076067,0.13691399,0.625408],"study_design_scores_gemma":[0.000053803422,0.000026497468,0.000030432722,0.000022010212,0.0000018805742,0.0000098334,0.000004841528,0.06450354,0.83878493,0.0034554396,0.09297484,0.00013192811],"about_ca_topic_score_codex":0.000027355329,"about_ca_topic_score_gemma":0.000008148452,"teacher_disagreement_score":0.625276,"about_ca_system_score_codex":0.000018823805,"about_ca_system_score_gemma":0.00002641395,"threshold_uncertainty_score":0.40967473},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000074486015,0.0000086511045,0.9975606,0.000028719698,0.0004660426,0.00076165795,0.000045210705,0.0007720224,0.00034963846],"genre_scores_gemma":[0.041066434,0.000027335682,0.9580533,0.0003498187,0.000009760201,0.0003705222,0.000015836185,0.000012870617,0.00009410431],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99876446,0.00014120927,0.00043651467,0.00020595868,0.00021459101,0.00023726774],"domain_scores_gemma":[0.99876404,0.00015369253,0.00020400397,0.00056520384,0.0002322483,0.00008079962],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005935029,0.000180134,0.00013576543,0.00036895214,0.00034865979,0.00008940495,0.00056223373,0.00012341439,0.00011288613],"category_scores_gemma":[0.000026614429,0.0001689242,0.0000915187,0.0002941719,0.000060437804,0.0050977897,0.0000055686146,0.0001514352,0.000099012825],"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.00026020862,0.00022070418,3.9344962e-7,0.000030692834,0.00002771846,3.3496568e-7,0.0027152475,0.7582892,0.00020842231,0.05725667,0.00052521063,0.18046518],"study_design_scores_gemma":[0.00055158045,0.00013883834,0.000006165189,0.00003162997,0.000011017081,0.0000053831673,0.000085829044,0.91421074,0.078630775,0.005684796,0.0004356599,0.00020758061],"about_ca_topic_score_codex":0.0000043330174,"about_ca_topic_score_gemma":5.913703e-7,"teacher_disagreement_score":0.18025759,"about_ca_system_score_codex":0.00006975101,"about_ca_system_score_gemma":0.000049884882,"threshold_uncertainty_score":0.6888529},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00019546275,0.00034026266,0.99493855,0.00085018977,0.00019995029,0.001198785,0.0017058641,0.00049496925,0.00007597101],"genre_scores_gemma":[0.06309972,0.00011011467,0.93361825,0.00022058254,0.00011254693,0.00023910146,0.0023932422,0.00003759776,0.00016882179],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99650866,0.00025143605,0.00080849207,0.001318859,0.0006091157,0.00050342124],"domain_scores_gemma":[0.9952193,0.00045831,0.00067528326,0.0027990409,0.00060866785,0.0002394293],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00059794314,0.00043878256,0.0005552683,0.00026641175,0.00025906198,0.00025051655,0.004638502,0.00019023297,0.000097964905],"category_scores_gemma":[0.000107882035,0.00036816066,0.00009391847,0.00042924122,0.00018716957,0.0027424009,0.0011265689,0.00027911266,0.000009872186],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007591852,0.000387884,0.000009518967,0.00008631605,0.000016107333,0.0000030878455,0.000096552656,0.0024224361,0.05658924,0.0009851631,0.01198351,0.92734426],"study_design_scores_gemma":[0.0011403868,0.00015510293,0.0001256795,0.0005794561,0.000018230423,0.0000028812647,0.0000101725245,0.7643564,0.2042221,0.00044812087,0.02858784,0.00035367644],"about_ca_topic_score_codex":0.000026523108,"about_ca_topic_score_gemma":0.000003503524,"teacher_disagreement_score":0.92699057,"about_ca_system_score_codex":0.000043686887,"about_ca_system_score_gemma":0.00028619682,"threshold_uncertainty_score":0.99987704},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00062725117,0.000059953505,0.9961543,0.0009904082,0.00006754426,0.00036139975,0.000010302711,0.0004928702,0.0012359552],"genre_scores_gemma":[0.09849942,0.0000072348457,0.90095854,0.00020607875,0.00004111651,0.000052279753,0.00000802599,0.000008748605,0.00021855059],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9989584,0.00003471969,0.00020956193,0.0004119556,0.00016049798,0.00022484716],"domain_scores_gemma":[0.9987868,0.00051620434,0.00009588495,0.0003916988,0.00013934377,0.00007004677],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016348525,0.00012455389,0.00015318919,0.00005719318,0.00014494985,0.00014439924,0.00030548187,0.00004992911,0.00000780982],"category_scores_gemma":[0.00009976998,0.00009754303,0.000033360026,0.0000841657,0.0000669948,0.001342822,0.00043372496,0.000097429576,0.000004832086],"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.00005618607,0.00011944698,0.00014592953,0.000015461452,0.0000060817783,0.000014096139,0.000023331062,0.000007350749,0.101650976,0.8441186,0.035886638,0.017955907],"study_design_scores_gemma":[0.0014931298,0.00031321959,0.0021634374,0.00012724972,0.00001312606,0.00010548125,0.000079266974,0.29977524,0.46417767,0.19346365,0.037649978,0.0006385244],"about_ca_topic_score_codex":0.00005653451,"about_ca_topic_score_gemma":0.0000058115575,"teacher_disagreement_score":0.650655,"about_ca_system_score_codex":0.000018725197,"about_ca_system_score_gemma":0.000019572692,"threshold_uncertainty_score":0.39776894},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0027712532,0.00003026564,0.9949921,0.000615558,0.00008911388,0.0005130388,0.00004735462,0.00047797104,0.0004633824],"genre_scores_gemma":[0.5642714,0.000018051775,0.43523064,0.00016557981,0.000023149612,0.00011031763,0.0000029016041,0.000028345985,0.00014965166],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9983101,0.000062010906,0.00043003846,0.00047561445,0.00033775225,0.00038449073],"domain_scores_gemma":[0.99878997,0.00016799224,0.00013835302,0.0006535175,0.00015523558,0.000094926596],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042905295,0.00022509569,0.00024179698,0.0001729712,0.0006301256,0.0002781446,0.0010679257,0.00007494491,0.00004800334],"category_scores_gemma":[0.00000911029,0.00017756662,0.00012179631,0.00045123993,0.00016120991,0.003407701,0.0000035503533,0.0003010522,0.000006503071],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005285041,0.00017434843,3.247875e-7,0.00009900416,0.000009818226,0.0000034348006,0.0014884818,0.00047543715,0.044620078,0.00007698607,0.00004240676,0.95295686],"study_design_scores_gemma":[0.0006060912,0.00014078477,0.000007300891,0.00023121473,0.000020825104,0.00002719761,0.00010947837,0.16841179,0.8251506,0.004193934,0.0008448267,0.00025597066],"about_ca_topic_score_codex":0.000011124202,"about_ca_topic_score_gemma":0.000008985589,"teacher_disagreement_score":0.95270085,"about_ca_system_score_codex":0.000053536118,"about_ca_system_score_gemma":0.00009937278,"threshold_uncertainty_score":0.72409564},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0017866084,0.00017635668,0.9945636,0.0004385032,0.00008607435,0.00013826834,4.889422e-7,0.0007312301,0.0020788966],"genre_scores_gemma":[0.08505991,0.000057409117,0.91369826,0.00091832207,0.000049554612,0.000004996302,0.000014598855,0.0000045940187,0.0001923344],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990725,0.0001470738,0.00022414186,0.00023747068,0.00012473983,0.00019405567],"domain_scores_gemma":[0.9986083,0.00004138081,0.00011889396,0.0011105537,0.00006489064,0.000056000485],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029289952,0.00010147771,0.00012547798,0.000046309757,0.00019684636,0.00009773512,0.0009211373,0.00004845918,0.000023870987],"category_scores_gemma":[0.000019679415,0.00009132797,0.000035695055,0.0002668525,0.000020769618,0.00097099645,0.00026313134,0.0001051072,0.000008865583],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000058936042,0.00020553182,0.00010036964,0.0000046373307,0.000014832706,0.000009313648,0.00016834073,0.20599076,0.04425589,0.40426838,0.06296061,0.2819624],"study_design_scores_gemma":[0.00028475557,0.00004071168,0.0006947165,0.000029249964,0.0000034485004,0.000008011941,0.0000020601328,0.92451125,0.014807181,0.05302348,0.0063761654,0.00021895522],"about_ca_topic_score_codex":0.000020043179,"about_ca_topic_score_gemma":0.0000013021076,"teacher_disagreement_score":0.7185205,"about_ca_system_score_codex":0.00006574367,"about_ca_system_score_gemma":0.00002231918,"threshold_uncertainty_score":0.37242466},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009117739,0.000028285545,0.98929775,0.00026881087,0.00047256096,0.00035734472,0.000023287426,0.00038615544,0.00004804644],"genre_scores_gemma":[0.5953823,0.0000148559175,0.404457,0.000030910487,0.000036939902,0.000027243466,0.0000026653172,0.000015238708,0.00003289949],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9986251,0.00009603672,0.00037224666,0.00044294374,0.00020912486,0.00025454685],"domain_scores_gemma":[0.9985299,0.00026702433,0.00027165445,0.0005984921,0.00022880409,0.00010410103],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00009890365,0.00020233332,0.0002293993,0.00030983475,0.00019052468,0.000076171564,0.0005873672,0.00008854175,0.000049202994],"category_scores_gemma":[0.00003323202,0.00019473865,0.00009346636,0.00043186828,0.00011805647,0.0019437853,0.000012100614,0.00029866653,0.000038585767],"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.00023050609,0.0013607363,0.000023324346,0.000082401675,0.000108809785,0.00009124823,0.00314446,0.014265274,0.43539456,0.0011039652,0.0008232823,0.54337144],"study_design_scores_gemma":[0.000253099,0.000059134745,0.0000145410795,0.00020572322,0.000009384476,0.000032999145,0.00002650583,0.44826382,0.5507742,0.00009703321,0.00012107885,0.00014243073],"about_ca_topic_score_codex":0.000021986212,"about_ca_topic_score_gemma":0.000011508264,"teacher_disagreement_score":0.5862645,"about_ca_system_score_codex":0.0001864283,"about_ca_system_score_gemma":0.000058313304,"threshold_uncertainty_score":0.79412115},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009612666,0.00017860664,0.97546273,0.00039338673,0.000017156903,0.0004649277,0.0000012531696,0.00069103483,0.013178247],"genre_scores_gemma":[0.36277413,0.000037850277,0.6370049,0.000045438694,0.000018521154,0.000064330496,0.0000025593824,0.0000046465184,0.000047618578],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9986228,0.00007327107,0.00026458397,0.00026899265,0.0006217605,0.00014862482],"domain_scores_gemma":[0.9988048,0.000025670062,0.00013803346,0.0005916844,0.00039158363,0.000048247886],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000643422,0.000106532476,0.00012209565,0.000118245,0.000055197408,0.000025416934,0.00073177076,0.00004968898,0.00014011079],"category_scores_gemma":[0.000025204383,0.00008172757,0.000035151545,0.00023825305,0.000050241542,0.0017683727,0.00016284565,0.00008310518,0.000011138245],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000033279969,0.000049741247,0.000019981026,0.00000793443,0.0000016138155,2.40603e-7,0.00006605069,0.000015223614,0.05024905,0.0012749829,0.00084723264,0.94746464],"study_design_scores_gemma":[0.000109612716,0.00006438006,0.00024780066,0.00006519405,0.0000040978603,0.0000050883486,0.0000026945365,0.22346285,0.7687241,0.0009207664,0.0063042315,0.000089222136],"about_ca_topic_score_codex":0.0000014574217,"about_ca_topic_score_gemma":1.8972165e-7,"teacher_disagreement_score":0.9473754,"about_ca_system_score_codex":0.000046379635,"about_ca_system_score_gemma":0.00006709657,"threshold_uncertainty_score":0.33327535},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000050769286,0.000051656632,0.9864443,0.00063930993,0.00008858766,0.00038278586,0.000032822998,0.0010415504,0.011268231],"genre_scores_gemma":[0.045944437,0.000015839076,0.95020324,0.00052342797,0.000039050465,0.000116932875,0.000007008717,0.000014056813,0.003135986],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99882615,0.000026965163,0.00020184595,0.00044749604,0.00022716417,0.00027039697],"domain_scores_gemma":[0.9987696,0.00013820925,0.000080850215,0.0007760023,0.00013147807,0.000103899874],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00010068211,0.00014500385,0.00014996857,0.000072014445,0.00014604635,0.00008585247,0.0010292885,0.00006237531,0.00005221794],"category_scores_gemma":[0.00005665405,0.00011851011,0.00005250897,0.00013694025,0.00004505611,0.0015134406,0.0004140268,0.00011395595,0.000045274333],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005078115,0.0005759882,0.000037116977,0.000062027386,0.000030012985,0.000017710907,0.0012602472,0.004438355,0.03201092,0.21147877,0.6379212,0.11211685],"study_design_scores_gemma":[0.00027273613,0.00007101673,0.000015209348,0.000022185632,0.000003285653,0.000005130805,0.000004387843,0.95650905,0.018146493,0.020431854,0.0043672808,0.00015135348],"about_ca_topic_score_codex":0.0000020431635,"about_ca_topic_score_gemma":5.7542223e-7,"teacher_disagreement_score":0.9520707,"about_ca_system_score_codex":0.000028245458,"about_ca_system_score_gemma":0.000009785401,"threshold_uncertainty_score":0.4832702},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0009927705,0.000021176102,0.9924916,0.000783797,0.00009186531,0.00038347903,0.00002271752,0.0010330555,0.0041795406],"genre_scores_gemma":[0.13895857,9.0960225e-7,0.8597363,0.0004353746,0.000058084534,0.00016187032,0.000051958683,0.000011923126,0.00058501126],"study_design_codex":"not_applicable","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99877936,0.00003792386,0.0002663191,0.0004168492,0.00020769746,0.00029182725],"domain_scores_gemma":[0.99881554,0.00024190922,0.00010951716,0.0006491508,0.000121447345,0.000062412866],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014279659,0.00014565344,0.00016039978,0.00008947394,0.00021624495,0.00014299627,0.0007024252,0.000056131965,0.000036506444],"category_scores_gemma":[0.000037233312,0.00012167014,0.000068092144,0.00018354144,0.00004354846,0.00067293615,0.00023854709,0.00007580363,0.000020695865],"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.00006638097,0.00048627844,0.00013963885,0.00006165047,0.000007965896,0.000021397222,0.000023544595,0.00068895816,0.3589485,0.15315287,0.419386,0.06701682],"study_design_scores_gemma":[0.0005870651,0.00008175847,0.00040931097,0.000041558353,0.0000028909492,0.0000033128765,0.0000023547611,0.4106332,0.5143701,0.015771862,0.057892743,0.0002038135],"about_ca_topic_score_codex":0.000022253871,"about_ca_topic_score_gemma":0.000015962158,"teacher_disagreement_score":0.40994427,"about_ca_system_score_codex":0.000033801076,"about_ca_system_score_gemma":0.00003308015,"threshold_uncertainty_score":0.49615642},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0037524498,0.000111921916,0.98840237,0.00073328736,0.00003952206,0.00035722766,0.000010718206,0.0005259561,0.0060665505],"genre_scores_gemma":[0.56815493,0.00008653335,0.42981023,0.0012899494,0.000019558622,0.000029520139,0.0000019978168,0.000012356096,0.0005949608],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984206,0.000032097803,0.00029644926,0.00060103845,0.0002643833,0.0003854163],"domain_scores_gemma":[0.99900633,0.00007500568,0.000029634604,0.00056149723,0.000110127425,0.00021740657],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017785977,0.00020649497,0.00025292477,0.000108281274,0.00019435797,0.00015181935,0.0007168668,0.0000709685,0.00020132124],"category_scores_gemma":[0.000011961162,0.00017984814,0.000035453806,0.0002913597,0.000042542208,0.0013872592,0.00021700164,0.00016054638,0.00007696369],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000032635537,0.000027998485,0.0000030703377,0.0000076105,0.0000066355706,0.000009344487,0.0003796242,0.001501011,0.0014463454,0.009199252,0.00075388525,0.9866326],"study_design_scores_gemma":[0.00027252,0.00010236561,0.000004751779,0.00009239863,0.0000030880017,0.000024842204,0.000044210352,0.9548552,0.029135425,0.009949003,0.0052238684,0.00029230159],"about_ca_topic_score_codex":0.00016541257,"about_ca_topic_score_gemma":0.000039272876,"teacher_disagreement_score":0.9863403,"about_ca_system_score_codex":0.00005231648,"about_ca_system_score_gemma":0.000020908183,"threshold_uncertainty_score":0.73339945},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18083638,0.00003215372,0.81689775,0.00044990118,0.00010802972,0.00026971698,0.000013136851,0.00012448545,0.0012684799],"genre_scores_gemma":[0.93406016,0.00008371476,0.06547791,0.000069366695,0.000082306084,0.00001671326,9.0538003e-7,0.000016182992,0.0001927342],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9981275,0.000011542936,0.0004524829,0.0004330644,0.0007558798,0.0002194879],"domain_scores_gemma":[0.9979059,0.00003915649,0.00072405516,0.00013875181,0.0011222471,0.0000698612],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026177196,0.00023028222,0.00028117903,0.00022118866,0.00029427037,0.00016421662,0.0009769667,0.00008147901,0.000012202947],"category_scores_gemma":[0.000100828016,0.00016349994,0.000053688786,0.00023032096,0.00045536854,0.00091387494,0.00027485428,0.00032609384,0.0000010067512],"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.00022687894,0.0002097885,0.00084838783,0.00033304837,0.000045158362,0.000008398157,0.0013951142,0.0008902147,0.8766912,0.00747037,0.00022056841,0.111660875],"study_design_scores_gemma":[0.00043625353,0.00030763447,0.0004945617,0.0013420476,0.0000177328,0.00019671014,0.00030977698,0.21217935,0.77309924,0.011262793,0.000053779433,0.00030012048],"about_ca_topic_score_codex":0.000027598722,"about_ca_topic_score_gemma":5.525033e-7,"teacher_disagreement_score":0.7532238,"about_ca_system_score_codex":0.000054205542,"about_ca_system_score_gemma":0.00012999565,"threshold_uncertainty_score":0.6667334},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.044178817,0.00048692973,0.95416075,0.000024694935,0.00004751314,0.0002683809,0.000031587933,0.00022094104,0.00058037],"genre_scores_gemma":[0.9974772,0.00005458834,0.0022469524,0.000037097525,0.000035565456,0.000018878382,0.0000036015283,0.00001774407,0.0001083713],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984037,0.000055643417,0.00033939048,0.0006030391,0.00027671875,0.00032149276],"domain_scores_gemma":[0.99938214,0.00008185462,0.000108040185,0.00012958187,0.00010902839,0.00018937852],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015669825,0.00026250308,0.00030148265,0.00020883535,0.0012939897,0.00088401634,0.00014189025,0.000119859535,0.000007647764],"category_scores_gemma":[0.0000024278088,0.0002358866,0.00004463041,0.00039169603,0.000105914994,0.00282808,0.000005686343,0.0002562249,0.0000010899337],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000048190614,0.00017494243,0.00004536792,0.00022704687,0.000024211802,0.000010554024,0.00046507063,0.013314749,0.023536623,0.00007018975,0.000015560125,0.9620675],"study_design_scores_gemma":[0.0005949267,0.00041077213,0.00001534904,0.00083479064,0.000035501922,0.00019349597,0.000107250875,0.96736974,0.029097505,0.0004899865,0.00044720515,0.00040346297],"about_ca_topic_score_codex":0.00006368638,"about_ca_topic_score_gemma":0.0000040668133,"teacher_disagreement_score":0.961664,"about_ca_system_score_codex":0.000057556652,"about_ca_system_score_gemma":0.00007748428,"threshold_uncertainty_score":0.99524534},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0005066047,0.000096619275,0.9564608,0.0034180465,0.00003982747,0.00017164681,0.000005282653,0.00029219364,0.039008997],"genre_scores_gemma":[0.5635698,0.00025359436,0.43106547,0.0036881748,0.00003457256,0.00006302043,0.00000277566,0.000010656829,0.0013119458],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9990634,0.00004332438,0.00016609201,0.00022220185,0.00029577178,0.00020924919],"domain_scores_gemma":[0.9991649,0.000072324125,0.000022302465,0.0006906168,0.000018373612,0.00003150404],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022793945,0.000089663845,0.00009569487,0.00006816877,0.00005854795,0.00008435744,0.001367961,0.000032985703,0.00027513588],"category_scores_gemma":[0.0000131079305,0.000049160113,0.000029686862,0.0003553022,0.000029057752,0.0006799636,0.000087373955,0.00014923699,0.00005601493],"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.0000046608266,0.00008285478,0.000048227324,0.000004417489,0.0000022721165,0.000040742,0.002685195,0.000011949195,0.00030756186,0.14455177,0.052202277,0.80005807],"study_design_scores_gemma":[0.0006123253,0.00020889673,0.0004662664,0.000034592817,0.0000011782461,0.000052544867,0.00011496691,0.038354877,0.026296904,0.06959837,0.86388826,0.0003708123],"about_ca_topic_score_codex":0.000011687801,"about_ca_topic_score_gemma":0.000016783191,"teacher_disagreement_score":0.811686,"about_ca_system_score_codex":0.000033579858,"about_ca_system_score_gemma":0.000011503879,"threshold_uncertainty_score":0.30125448},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.030284112,0.00016574809,0.9690792,0.000022323213,0.00008233948,0.00011079378,0.0000038087728,0.00016249713,0.000089162495],"genre_scores_gemma":[0.5489863,0.00005524678,0.4509004,0.000032317654,0.000002855202,0.00000383116,2.914852e-7,0.000007668524,0.000011027096],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989584,0.000050413506,0.00027135253,0.00033316715,0.00020303359,0.00018364498],"domain_scores_gemma":[0.999413,0.000037599337,0.00012350062,0.00027165917,0.0000902078,0.00006403659],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015778928,0.0001394904,0.00017777339,0.0001629016,0.00022860606,0.00008764274,0.00018909789,0.00006427856,0.000003195985],"category_scores_gemma":[0.000010438708,0.00013271354,0.00004283964,0.00045654082,0.00004525788,0.00089970615,0.0000025123047,0.00014436276,9.2482935e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017291273,0.00013727778,0.000014833977,0.00010128893,0.000012931535,0.0000048425813,0.0003789826,0.3195939,0.046025272,0.00041613512,0.0000052052087,0.633292],"study_design_scores_gemma":[0.00012691521,0.00003102176,4.041711e-7,0.00014258496,0.000008735575,0.00002205151,0.000027623082,0.5297688,0.46732205,0.00241502,0.000024970597,0.00010980626],"about_ca_topic_score_codex":0.00001453084,"about_ca_topic_score_gemma":0.0000018188855,"teacher_disagreement_score":0.6331822,"about_ca_system_score_codex":0.000026559654,"about_ca_system_score_gemma":0.00006494584,"threshold_uncertainty_score":0.54119015},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0016863244,0.00021490922,0.9951234,0.00037676355,0.00020976858,0.00023546739,0.00002514678,0.0012434073,0.00088481663],"genre_scores_gemma":[0.8315367,0.000024852261,0.16715086,0.0007548376,0.000027959766,0.0000818897,0.0000032182384,0.000033764794,0.00038591682],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99790823,0.00010028912,0.00042207824,0.0007145826,0.00041325067,0.00044158043],"domain_scores_gemma":[0.9986503,0.00013612665,0.00013129982,0.0007768656,0.0001273017,0.00017809898],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00017090033,0.00031713885,0.00029427014,0.00026958986,0.00066026143,0.00047150813,0.0011027966,0.0001012679,0.00036683658],"category_scores_gemma":[0.000006152717,0.00028987112,0.000114728806,0.0005670828,0.00017347485,0.0020486973,0.0000071712975,0.00049121317,0.00010828752],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000046815356,0.00021647337,0.0000019969766,0.00005309049,0.0000065530344,0.000026689266,0.00017903715,0.0019442216,0.015707979,0.00003326073,0.00035839874,0.98142546],"study_design_scores_gemma":[0.0008213892,0.00010173132,0.000019252511,0.00092136,0.000016201446,0.000045699104,0.00003892879,0.3564899,0.63363934,0.0008391533,0.006532142,0.00053494435],"about_ca_topic_score_codex":0.00002183965,"about_ca_topic_score_gemma":0.000005562669,"teacher_disagreement_score":0.9808905,"about_ca_system_score_codex":0.00010039683,"about_ca_system_score_gemma":0.000103098115,"threshold_uncertainty_score":0.99995536},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0013068105,0.00003405875,0.9950149,0.00030401972,0.00010860233,0.0001197331,0.0000052518308,0.0004930635,0.0026135826],"genre_scores_gemma":[0.332191,0.000011063738,0.66766256,0.00010045639,0.000007431552,0.000003241956,0.0000061471483,0.00000282313,0.000015281677],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991694,0.000025504532,0.00020359374,0.00023999781,0.00022200457,0.00013948153],"domain_scores_gemma":[0.9992645,0.000009491609,0.00009400757,0.00048884534,0.00008851849,0.00005463878],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001062444,0.00008759757,0.00010995307,0.00005883195,0.000044123582,0.000043909746,0.0005830113,0.000039027123,0.000017616587],"category_scores_gemma":[0.000022818707,0.00007734159,0.000040798514,0.0004402421,0.0000400437,0.0010847355,0.00019365092,0.000042195046,0.000011206528],"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.0000067041055,0.00009434664,0.0002652801,0.000009580589,0.000005834011,0.0000035307849,0.000046843517,0.20065632,0.007049238,0.77858174,0.00042292327,0.01285766],"study_design_scores_gemma":[0.0028361056,0.0003499761,0.001746553,0.00022828153,0.000017078051,0.000051409457,0.00006385766,0.4065882,0.27561057,0.31072634,0.001044849,0.000736809],"about_ca_topic_score_codex":0.000113948896,"about_ca_topic_score_gemma":0.000010680096,"teacher_disagreement_score":0.4678554,"about_ca_system_score_codex":0.000069863905,"about_ca_system_score_gemma":0.00003520161,"threshold_uncertainty_score":0.31538984},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.59855384,0.0006705573,0.34858945,0.0023832868,0.004216897,0.011344873,0.005726192,0.008467802,0.020047134],"genre_scores_gemma":[0.67075604,0.000041732823,0.32802594,0.00062820286,0.000020173713,0.00031697386,0.000052419364,0.000062549676,0.000095973795],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99580145,0.00018243733,0.00096738973,0.0014250089,0.00047090114,0.0011528432],"domain_scores_gemma":[0.9971017,0.00043092546,0.00043858885,0.0014151676,0.00025899196,0.0003545828],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011626976,0.00052833435,0.0005846467,0.00036387375,0.00088023243,0.00016993475,0.0022018293,0.00027530105,0.000012320256],"category_scores_gemma":[0.0009293432,0.0005494228,0.00019871716,0.0008157836,0.00009990808,0.0027657787,0.001289076,0.00081127725,0.00004111261],"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.00008362194,0.00023887669,0.000011300354,0.00008028659,0.000027465068,0.000041731855,0.000011439412,0.00025340976,0.23047622,0.5805791,0.000008423849,0.18818817],"study_design_scores_gemma":[0.004671871,0.00071743963,0.00035880093,0.0013245262,0.000033270568,0.0000871357,0.000076539574,0.013067204,0.45237353,0.46142927,0.063869394,0.0019910263],"about_ca_topic_score_codex":0.00011249556,"about_ca_topic_score_gemma":0.00021774347,"teacher_disagreement_score":0.22189732,"about_ca_system_score_codex":0.0014205098,"about_ca_system_score_gemma":0.000081165745,"threshold_uncertainty_score":0.9996957},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00012590461,0.000106155996,0.9939782,0.001576744,0.0000825444,0.00022733572,0.0000068453633,0.00073811004,0.0031581828],"genre_scores_gemma":[0.20827201,0.00019768556,0.78892475,0.0011596024,0.000026739634,0.00012147594,0.000010597165,0.000010812604,0.00127632],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992322,0.00005098737,0.00018672555,0.00024461953,0.000095111,0.00019040426],"domain_scores_gemma":[0.99793875,0.0004527908,0.00006848301,0.0014040029,0.000075277145,0.00006070313],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017941587,0.00009209095,0.000108251676,0.00008364746,0.00022754115,0.00011377392,0.001774068,0.000036212732,0.000059435166],"category_scores_gemma":[0.00009420436,0.00008270776,0.000043988843,0.00022511961,0.00004977795,0.0008824549,0.00094499835,0.00008797246,0.000080373444],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000064917313,0.0003327305,0.00006269311,0.000031954838,0.00001817499,0.0000030630763,0.00024489153,0.000037787224,0.033291634,0.5042322,0.19298564,0.26875272],"study_design_scores_gemma":[0.00025816166,0.000067183515,0.000048091104,0.000045399167,0.000002601718,0.000003996925,0.000010099039,0.7941699,0.0680469,0.010905005,0.12622736,0.00021529532],"about_ca_topic_score_codex":0.0000045036136,"about_ca_topic_score_gemma":0.000002954079,"teacher_disagreement_score":0.7941321,"about_ca_system_score_codex":0.000026221625,"about_ca_system_score_gemma":0.000008711174,"threshold_uncertainty_score":0.33727247},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0025595299,0.00002230062,0.995631,0.00021339118,0.00016210871,0.00039355783,0.000007646328,0.0006612718,0.0003492324],"genre_scores_gemma":[0.46548092,0.0000014864089,0.5340123,0.000071843635,0.00003827718,0.00006612573,0.000025035142,0.0000062023587,0.00029778865],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990532,0.000028710743,0.00020810826,0.00032084688,0.00019666825,0.00019245833],"domain_scores_gemma":[0.99927014,0.00011369325,0.00009044687,0.00039663294,0.00009247082,0.000036640053],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014120332,0.00010476795,0.000095221556,0.0000755986,0.00011004791,0.00012636438,0.00042311422,0.000053318578,0.0000121939165],"category_scores_gemma":[0.000049137227,0.00009341087,0.00003516787,0.00016184775,0.000016462503,0.0010597319,0.00015970829,0.00004939359,0.000011504484],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000807345,0.0005892975,0.0072147367,0.00005319973,0.000016571083,0.0000048840525,0.00010426493,0.027900672,0.1564653,0.7071467,0.053506587,0.046917062],"study_design_scores_gemma":[0.0004258113,0.00008010666,0.0053753103,0.000015066953,0.0000028761915,0.0000024309848,0.0000071270106,0.8604561,0.10825719,0.0075199716,0.017669,0.00018899783],"about_ca_topic_score_codex":0.000058099064,"about_ca_topic_score_gemma":0.000015084927,"teacher_disagreement_score":0.8325554,"about_ca_system_score_codex":0.000063328305,"about_ca_system_score_gemma":0.000019095154,"threshold_uncertainty_score":0.38091844},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0021088584,0.000017769047,0.9938975,0.00023211326,0.000075512085,0.0006490669,0.000010968075,0.001606939,0.0014012799],"genre_scores_gemma":[0.35963657,0.000008833883,0.6400747,0.00014439628,0.000015065403,0.00004864063,0.00001688574,0.000015678626,0.00003926382],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99833244,0.000091152666,0.00035874912,0.00051077607,0.00039314988,0.00031374715],"domain_scores_gemma":[0.99864614,0.00007990889,0.00012253775,0.0008962577,0.00014171218,0.000113424],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017535155,0.0002258607,0.00023738103,0.00023441899,0.00031155703,0.00006173224,0.00094263215,0.00011783998,0.000043537486],"category_scores_gemma":[0.000031788837,0.0001912887,0.000078255565,0.0005401538,0.000087690096,0.0014603985,0.00019152359,0.00018670532,0.000009451819],"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.000028572578,0.0001850109,0.000021669794,0.000033886958,0.000004793113,0.000067374014,0.000105251245,0.00072263,0.97487885,0.01635404,0.0013827399,0.0062152003],"study_design_scores_gemma":[0.0002152396,0.000036546873,0.000070302216,0.000050232145,0.0000016358408,0.00004710797,0.0000016366193,0.44293505,0.55435705,0.0015144104,0.0005838929,0.00018688371],"about_ca_topic_score_codex":0.00005356013,"about_ca_topic_score_gemma":0.0000014435125,"teacher_disagreement_score":0.4422124,"about_ca_system_score_codex":0.000075530625,"about_ca_system_score_gemma":0.000105484236,"threshold_uncertainty_score":0.78005266},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.001216318,0.000032972424,0.9889807,0.0003698544,0.00036176204,0.00040856237,0.000049441718,0.0015665401,0.0070138443],"genre_scores_gemma":[0.12369823,0.0000049819605,0.8731231,0.0015449013,0.00017628922,0.00005557037,0.00010185739,0.00004640443,0.001248657],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99688387,0.00007416041,0.0005595483,0.0010425049,0.0007817892,0.00065810396],"domain_scores_gemma":[0.9976534,0.00037767904,0.00022796962,0.0013961985,0.00016438664,0.00018031657],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00033435927,0.00045049682,0.00035473294,0.00036852006,0.0003054879,0.00019462455,0.001173569,0.0001963478,0.00011409368],"category_scores_gemma":[0.000080367885,0.00038547162,0.00013084526,0.00052469346,0.000085121676,0.0011818078,0.00033034137,0.00040061888,0.00023740005],"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.00021498838,0.008244946,0.00012248565,0.00008864589,0.000070309994,0.0012892855,0.00045456432,0.04736391,0.25857812,0.0718184,0.06429743,0.5474569],"study_design_scores_gemma":[0.0011727838,0.00070311857,0.00017245479,0.00020482055,0.000006520091,0.000014728768,0.00001555078,0.5547013,0.42587015,0.013674634,0.0027066043,0.00075730245],"about_ca_topic_score_codex":0.0002588228,"about_ca_topic_score_gemma":0.000026809235,"teacher_disagreement_score":0.54669964,"about_ca_system_score_codex":0.00024209221,"about_ca_system_score_gemma":0.00006913492,"threshold_uncertainty_score":0.9998597},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00028878776,0.000041777384,0.9946475,0.0010407852,0.00017395976,0.00032232603,0.000011263563,0.0008194183,0.002654162],"genre_scores_gemma":[0.054731455,0.0000053097756,0.94383895,0.00045499447,0.000048973543,0.00008203185,0.00004697757,0.000009816866,0.00078148575],"study_design_codex":"not_applicable","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9990516,0.000034519322,0.00017894016,0.00032932166,0.00022312475,0.00018253266],"domain_scores_gemma":[0.99872464,0.000081478756,0.000079232464,0.0007490639,0.00023236421,0.0001332362],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000244619,0.00010529765,0.00011186507,0.00005496144,0.00006771686,0.0001052124,0.0009072351,0.000047362075,0.000011139961],"category_scores_gemma":[0.000097373246,0.00008353803,0.000031027495,0.00016216308,0.000028765566,0.0012640283,0.0004701944,0.00005987863,0.00006131633],"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.000031290885,0.000111884234,0.000073364965,0.000026747792,0.000006953013,0.00000408946,0.00030044353,0.00008829241,0.050108287,0.14732514,0.70089006,0.101033434],"study_design_scores_gemma":[0.0007534444,0.00017755525,0.00009711213,0.000046517376,0.0000032461917,0.000011904099,0.000039939685,0.22432609,0.3934782,0.11187411,0.26886147,0.0003303963],"about_ca_topic_score_codex":0.000012804674,"about_ca_topic_score_gemma":0.0000017742718,"teacher_disagreement_score":0.43202862,"about_ca_system_score_codex":0.000036886875,"about_ca_system_score_gemma":0.000047033493,"threshold_uncertainty_score":0.3406582},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04688121,0.006754555,0.9362111,0.0013452066,0.00030492168,0.00052237767,0.000039642804,0.00011671157,0.007824288],"genre_scores_gemma":[0.79219675,0.0021629764,0.19750254,0.00003140983,0.00010355257,0.000004835743,0.000014359113,0.000017977733,0.007965572],"study_design_codex":"bench_or_experimental","study_design_gemma":"not_applicable","domain_scores_codex":[0.9976488,0.00074812025,0.0003576059,0.00046876102,0.00041590072,0.00036080982],"domain_scores_gemma":[0.9982233,0.00037648118,0.00022360285,0.0007126525,0.00028898672,0.00017496185],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007198461,0.00027679396,0.00032591762,0.00013140064,0.00054387876,0.000056561275,0.0017676271,0.0002891245,0.00006375938],"category_scores_gemma":[0.00014682462,0.0002869837,0.00024498196,0.0005776461,0.00096577,0.00084827485,0.00067391136,0.00037330747,0.00002172023],"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.0005152615,0.0056236126,0.008728645,0.0037259401,0.00044140345,0.00028427225,0.027216805,0.061268494,0.317332,0.30758324,0.020501534,0.24677882],"study_design_scores_gemma":[0.0016091332,0.00014548471,0.049042482,0.0051531224,0.00018063505,0.00033212834,0.00019078635,0.25939488,0.26352268,0.005897302,0.41403025,0.0005011018],"about_ca_topic_score_codex":0.0024363052,"about_ca_topic_score_gemma":0.001053673,"teacher_disagreement_score":0.74531555,"about_ca_system_score_codex":0.0012120028,"about_ca_system_score_gemma":0.00073094945,"threshold_uncertainty_score":0.9999582},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000069571274,0.00025810432,0.3804042,0.000267163,0.00026837818,0.00040850928,0.000162585,0.00057832396,0.6176458],"genre_scores_gemma":[0.00055407535,0.00016581657,0.8038289,0.00019925808,0.000022209208,0.000016432,0.00026549128,0.000052832598,0.19489497],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9973224,0.000013792373,0.00059856416,0.001204259,0.00044442376,0.0004165745],"domain_scores_gemma":[0.9935282,0.000048255868,0.00044538593,0.005559323,0.00013594165,0.00028292846],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.00014013077,0.0004579639,0.0005250981,0.00095891143,0.00019900493,0.000020694963,0.0068735117,0.0005544137,0.0008954266],"category_scores_gemma":[0.000026862843,0.00039490024,0.00004711096,0.00010411672,0.00014972927,0.00031716542,0.007356826,0.00044787806,0.00041140398],"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.0000063788066,0.000020370553,0.0000041897247,0.000028469689,0.00003271803,0.00006165024,0.000107456304,5.378571e-7,0.00058639713,0.7226863,0.05312367,0.22334188],"study_design_scores_gemma":[0.00008539757,0.00004380928,0.00001605921,0.00043487444,0.0000062489507,0.000012222625,0.0000014897219,0.0001420696,0.01961294,0.04027489,0.93890053,0.00046949723],"about_ca_topic_score_codex":0.0013360113,"about_ca_topic_score_gemma":0.015628876,"teacher_disagreement_score":0.8857768,"about_ca_system_score_codex":0.00029315666,"about_ca_system_score_gemma":0.00066451787,"threshold_uncertainty_score":0.9998503},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000045601223,0.000634825,0.9869522,0.00039660296,0.0014181416,0.0005513589,0.000032273078,0.0007734965,0.009236555],"genre_scores_gemma":[0.015458841,0.00007752846,0.9827873,0.00075990614,0.0004102395,0.000020245383,0.000016242331,0.000067356385,0.00040233118],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9941484,0.000069407135,0.0007305772,0.0023771487,0.0017244635,0.00095002877],"domain_scores_gemma":[0.99498206,0.00055525894,0.00055460446,0.002757874,0.0007491985,0.0004010083],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0010497182,0.00084100495,0.00083350856,0.0012051836,0.00031107533,0.0006602597,0.0070793102,0.00044145453,0.0000428198],"category_scores_gemma":[0.00013888576,0.0007535173,0.00014669083,0.0009609957,0.0011802925,0.0022017118,0.0047989315,0.0013681763,0.0001033545],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001827206,0.00004500452,0.0000074680884,0.00003141668,0.000015276775,0.00037339612,0.00045633613,0.0020595547,0.00058717903,0.14058045,0.00077237753,0.8550533],"study_design_scores_gemma":[0.0002916139,0.00019915184,0.000010299546,0.0006479147,0.000007345235,0.000086329106,2.345743e-7,0.4400626,0.0072659976,0.54483473,0.005576374,0.0010174157],"about_ca_topic_score_codex":0.000020090596,"about_ca_topic_score_gemma":0.000019002284,"teacher_disagreement_score":0.85403585,"about_ca_system_score_codex":0.00070398423,"about_ca_system_score_gemma":0.0008316462,"threshold_uncertainty_score":0.9994916},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00031302436,0.00051953964,0.97776306,0.0010071141,0.018605115,0.0005765287,0.000058506732,0.0010951934,0.00006190531],"genre_scores_gemma":[0.06275462,0.00049298175,0.85366136,0.00078549644,0.08123632,0.00023874373,0.00047149774,0.00007342884,0.00028557205],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9969411,0.00044024404,0.0006796959,0.0011148715,0.00042838472,0.00039571951],"domain_scores_gemma":[0.9962792,0.00012106255,0.0002920292,0.0030241716,0.00015853348,0.00012503444],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005962104,0.00031171882,0.0003826727,0.00024993636,0.0001491182,0.00032988522,0.0028048402,0.00023047783,0.0000051196166],"category_scores_gemma":[0.000009417554,0.0002087704,0.00003945749,0.0004167018,0.00003608834,0.0019548927,0.0018172944,0.0002045895,0.000018072898],"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.000008278129,0.00008050699,0.00032722985,0.000024519879,0.000012606374,0.000041565927,0.000054894055,0.0006659097,0.016034108,0.014454048,0.55771804,0.41057828],"study_design_scores_gemma":[0.00028961257,0.00005049308,0.00014640439,0.00029797587,0.000001927247,0.000051259754,0.000004169857,0.6779404,0.005902106,0.000014849174,0.31495252,0.00034825646],"about_ca_topic_score_codex":0.000019116522,"about_ca_topic_score_gemma":0.000023028982,"teacher_disagreement_score":0.6772745,"about_ca_system_score_codex":0.00009975355,"about_ca_system_score_gemma":0.000048088983,"threshold_uncertainty_score":0.851341},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008293335,0.0000667054,0.9872707,0.00044680972,0.000054229262,0.0001864568,0.0000032976714,0.00083104835,0.0028473758],"genre_scores_gemma":[0.3386835,0.0000057470515,0.661006,0.00018986584,0.0000116724395,0.000012982276,0.0000081845665,0.000010519809,0.00007153551],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988298,0.000050550047,0.0001903471,0.00039345495,0.0003201662,0.0002156898],"domain_scores_gemma":[0.9989923,0.00006780761,0.00013819772,0.0004992717,0.000158875,0.0001435405],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033730746,0.00014288224,0.00015138624,0.00009480954,0.00010516389,0.00014514597,0.0004813417,0.00007061046,0.0000047904405],"category_scores_gemma":[0.00015563949,0.00010747434,0.000011734246,0.00043177517,0.000029199358,0.0013886557,0.00034402052,0.00014189447,0.0000063417056],"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.00004754578,0.00062160473,0.016395666,0.000042538763,0.00010509259,0.0001044377,0.005033728,0.0002547143,0.08610986,0.81276834,0.0098650865,0.06865138],"study_design_scores_gemma":[0.008811331,0.0018167389,0.012232087,0.0009783214,0.000045395755,0.00046310615,0.00070670724,0.24192561,0.022403775,0.7035469,0.0043142634,0.0027557784],"about_ca_topic_score_codex":0.00011246388,"about_ca_topic_score_gemma":0.000060572285,"teacher_disagreement_score":0.33039016,"about_ca_system_score_codex":0.000115800416,"about_ca_system_score_gemma":0.00010220627,"threshold_uncertainty_score":0.43826765},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005387813,0.00009190242,0.9823293,0.00038968454,0.00021925988,0.00018220367,0.0000014999911,0.0006916719,0.010706678],"genre_scores_gemma":[0.5747287,0.000026280808,0.42354771,0.00070337957,0.000025500023,0.000026298354,0.0000050671483,0.000009517625,0.0009275141],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99852616,0.00006909291,0.00027119,0.00049658294,0.00035164846,0.00028535747],"domain_scores_gemma":[0.9984288,0.00007809236,0.00007426694,0.0010758291,0.00017402117,0.0001689694],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034766548,0.00014593021,0.00019505764,0.00015380437,0.000035943285,0.00006777982,0.001033607,0.00006914906,0.000030145855],"category_scores_gemma":[0.00019582867,0.000117564785,0.000024709658,0.00053676765,0.000034520614,0.0010983755,0.00077880913,0.00015287368,0.00014315928],"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.00010245889,0.00048877666,0.00050364813,0.000022461056,0.000008964743,0.00015033461,0.0014395181,0.00070289086,0.12509237,0.16149023,0.14977513,0.5602232],"study_design_scores_gemma":[0.0015762144,0.00030697713,0.0019495161,0.00016470812,0.000002398804,0.000029451014,0.00008594266,0.08966114,0.76390094,0.09170198,0.04987501,0.0007457015],"about_ca_topic_score_codex":0.000058721325,"about_ca_topic_score_gemma":0.000038723458,"teacher_disagreement_score":0.6388086,"about_ca_system_score_codex":0.000072082774,"about_ca_system_score_gemma":0.00008424524,"threshold_uncertainty_score":0.4794153},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5257178,0.00004462672,0.47198942,0.000027100592,0.000066557586,0.00022371688,0.0000053278773,0.00004848607,0.0018769525],"genre_scores_gemma":[0.97199064,0.0000062631543,0.027883185,0.000043920038,0.0000053711065,0.0000016436035,0.0000018323543,0.0000044865565,0.00006264099],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9984425,0.00016521006,0.00038756823,0.00029725555,0.00057727523,0.00013019369],"domain_scores_gemma":[0.9974807,0.0007267108,0.00037170362,0.0012240474,0.0001621538,0.00003472164],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011983383,0.00012190896,0.0004084603,0.00042365387,0.00008743053,0.0000035299313,0.00094209757,0.000064184875,0.000019655623],"category_scores_gemma":[0.00020992367,0.00006710955,0.00018882287,0.0016632634,0.00009816182,0.00017520368,0.0018266977,0.000106598316,4.5290173e-7],"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.0003322162,0.000188889,0.005622042,0.00006308956,0.00020052555,0.0000065045915,0.0011290698,0.0012092972,0.8040429,0.001984675,0.00046684226,0.18475397],"study_design_scores_gemma":[0.00020742646,0.0004195763,0.026120782,0.000081157916,0.00006205347,0.0000011151159,0.000011585179,0.0055654263,0.96660316,0.00084231875,0.000019670402,0.000065723914],"about_ca_topic_score_codex":0.00010676968,"about_ca_topic_score_gemma":0.000030364914,"teacher_disagreement_score":0.44627285,"about_ca_system_score_codex":0.00003148466,"about_ca_system_score_gemma":0.000016871314,"threshold_uncertainty_score":0.2736648},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0068737613,0.00027000587,0.98642236,0.002284629,0.00008241602,0.00023058498,0.0000065321237,0.00005026415,0.0037794276],"genre_scores_gemma":[0.9591224,0.000017191784,0.040388722,0.00043256173,0.0000036027839,0.000015655807,6.398005e-7,0.0000018338181,0.000017369264],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989395,0.00028364928,0.00027777802,0.00012132703,0.00029322386,0.000084510284],"domain_scores_gemma":[0.99420416,0.004666404,0.0001591914,0.00081100076,0.00013822573,0.000021017937],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00083620375,0.00005157584,0.00010430774,0.000090704816,0.000024880139,0.000016457785,0.0014036556,0.000012192646,0.0000015029619],"category_scores_gemma":[0.006381756,0.000026017973,0.00003270731,0.00091577985,0.000079871505,0.00033450846,0.00038787822,0.00007992996,0.0000017011457],"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.000004089562,0.00027793986,0.027544431,0.00001464273,0.0000058163896,0.0000018931192,0.005581961,0.00017775226,0.00085588347,0.67925143,0.011439302,0.27484483],"study_design_scores_gemma":[0.0017675444,0.00018375106,0.36571696,0.00026770614,0.00002314549,0.000016918983,0.012897743,0.042855132,0.18505041,0.36861446,0.022024075,0.0005821312],"about_ca_topic_score_codex":0.000230282,"about_ca_topic_score_gemma":0.000058957296,"teacher_disagreement_score":0.95224863,"about_ca_system_score_codex":0.000016240414,"about_ca_system_score_gemma":0.000052831292,"threshold_uncertainty_score":0.7640019},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00014439604,0.0000196822,0.99675506,0.00018400913,0.00030143268,0.00054487743,0.000031009866,0.0014936804,0.00052583934],"genre_scores_gemma":[0.034892794,0.0000016752053,0.96301985,0.0015852746,0.00010408936,0.00019492576,0.000049805174,0.000025717087,0.00012586822],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981364,0.000123519,0.00031559498,0.00074854505,0.00025563923,0.0004203155],"domain_scores_gemma":[0.99752903,0.0002238838,0.00015410286,0.0017101829,0.00015429454,0.00022851917],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000400123,0.00023850884,0.0002663548,0.00013073519,0.00022546503,0.00018041425,0.0017789492,0.0000833389,0.000045389814],"category_scores_gemma":[0.00007381753,0.00019301599,0.00008062103,0.00018903743,0.000048089656,0.0012213731,0.00031822774,0.000134929,0.000018019993],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001135595,0.00017183354,0.000009255755,0.000016704073,0.0000046021964,0.0000013001786,0.000025041996,0.00007298397,0.27848017,0.005931912,0.009472624,0.7058022],"study_design_scores_gemma":[0.0005224332,0.00024703515,0.00001768026,0.000019519115,0.0000020933976,0.0000013160991,0.0000024168946,0.5978203,0.37352547,0.0038614357,0.023808934,0.00017137485],"about_ca_topic_score_codex":0.000052369505,"about_ca_topic_score_gemma":0.000003996597,"teacher_disagreement_score":0.70563084,"about_ca_system_score_codex":0.000035884077,"about_ca_system_score_gemma":0.00005370322,"threshold_uncertainty_score":0.7870964},"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":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000012600661,0.0006076849,0.52241415,0.000042954856,0.00003456674,0.00018179078,0.00006797307,0.0008299219,0.4758197],"genre_scores_gemma":[0.16286676,0.0003971258,0.18143189,0.0017606564,0.00111573,0.00013045012,0.0012295748,0.0006585327,0.6504093],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9973076,0.0000106199805,0.0005493331,0.000994325,0.0007132942,0.0004248129],"domain_scores_gemma":[0.99835354,0.000088655586,0.00043011972,0.000744874,0.00017259338,0.0002102078],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00007277618,0.0005754353,0.0005127612,0.00022621916,0.00026770515,0.0014998576,0.0019058246,0.00031956012,0.00031637636],"category_scores_gemma":[0.000010412259,0.0005191802,0.00016027344,0.00009238012,0.00019987635,0.0041673924,0.0009941276,0.0005872943,0.00043503765],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020768477,0.000033358403,3.5437134e-7,0.00006184263,0.000008626229,0.00010583659,0.000031556563,0.000012508269,0.00041501122,0.01629956,0.0042190948,0.9787915],"study_design_scores_gemma":[0.0002514188,0.00012237534,0.0000014642764,0.0018086281,0.000012555833,0.000081146805,0.0000022468978,0.030092768,0.002153651,0.31040797,0.65401816,0.0010476006],"about_ca_topic_score_codex":8.4850126e-7,"about_ca_topic_score_gemma":1.159192e-7,"teacher_disagreement_score":0.97774386,"about_ca_system_score_codex":0.00009296377,"about_ca_system_score_gemma":0.00016436979,"threshold_uncertainty_score":0.999726},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00009995378,0.000032165965,0.99478346,0.0001226117,0.000019733821,0.0007024761,0.00004042694,0.0008674172,0.0033317634],"genre_scores_gemma":[0.13485822,0.0000017890538,0.86441916,0.00013315813,0.000075355914,0.00030618344,0.00015030688,0.00001751488,0.00003832452],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9985241,0.00006904952,0.00044522085,0.0005059638,0.0002598544,0.00019577167],"domain_scores_gemma":[0.9982283,0.00010943813,0.00028342745,0.0011373276,0.00018828339,0.00005323071],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012411576,0.00017793068,0.00020891428,0.0002318754,0.00015902967,0.0000754377,0.0011507835,0.00007303377,0.0000040812347],"category_scores_gemma":[5.99287e-7,0.00016720605,0.00007059326,0.0005453796,0.00005447664,0.00029982073,0.00027843984,0.00010099007,0.000038186256],"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.000012415477,0.0006316054,0.0001612102,0.00021607215,0.0000071128165,0.0000038502894,0.00003634967,0.0070723407,0.23438047,0.62160105,0.03286399,0.10301353],"study_design_scores_gemma":[0.0006263693,0.0000782226,0.0016275095,0.00030650132,0.000010073633,0.000012770936,0.000005529979,0.38698894,0.3953539,0.008621771,0.20594712,0.00042126025],"about_ca_topic_score_codex":0.000036460475,"about_ca_topic_score_gemma":0.0000010687173,"teacher_disagreement_score":0.6129793,"about_ca_system_score_codex":0.00007346028,"about_ca_system_score_gemma":0.00003466077,"threshold_uncertainty_score":0.68184644},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000094891766,0.000011938563,0.99651897,0.0007730346,0.000037826096,0.0014282867,0.00006731236,0.0006800755,0.00038767923],"genre_scores_gemma":[0.017231429,0.0000016071913,0.9801047,0.0013066059,0.00019297116,0.00089706003,0.00021514803,0.000022940714,0.000027580281],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99820226,0.000063255095,0.00044852096,0.0006849564,0.00023083283,0.00037019886],"domain_scores_gemma":[0.9979003,0.0008318944,0.00022505592,0.00069005816,0.00021324228,0.0001394315],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00060422503,0.00021484884,0.00019979767,0.00028163806,0.00043750275,0.00015924519,0.00089315395,0.00009321285,0.00000845084],"category_scores_gemma":[0.000004271744,0.00021345212,0.000118624885,0.00041195334,0.00004372737,0.00045706652,0.00022256472,0.00016223892,0.000033288758],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007862614,0.0004060111,0.000026870157,0.00004382503,0.000012670498,0.0000029117864,0.00011597536,0.0014275139,0.2586319,0.04860388,0.02179802,0.6688518],"study_design_scores_gemma":[0.0010060888,0.00011230446,0.00071705476,0.00006585338,0.000010834747,0.000011993656,0.0000075748294,0.340629,0.31021103,0.007808114,0.3390194,0.00040075273],"about_ca_topic_score_codex":0.0000026290888,"about_ca_topic_score_gemma":0.0000020463362,"teacher_disagreement_score":0.668451,"about_ca_system_score_codex":0.000089551526,"about_ca_system_score_gemma":0.00005392492,"threshold_uncertainty_score":0.87043244},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00029273194,0.00014488271,0.9967355,0.0005175946,0.000018034807,0.00062694674,0.000021408861,0.0011745425,0.00046832944],"genre_scores_gemma":[0.0075318017,0.000011215796,0.99066705,0.00065494986,0.00016956686,0.000675237,0.00013204315,0.000015694053,0.00014245095],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9986976,0.000027241365,0.00032006597,0.00051443797,0.00016833567,0.00027232524],"domain_scores_gemma":[0.9989063,0.00005153424,0.000114794144,0.0007784016,0.000091636895,0.000057333484],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00008020117,0.00015559343,0.00012257238,0.00013416201,0.0002842617,0.0002447316,0.00113066,0.000049116545,0.00004284804],"category_scores_gemma":[2.0973143e-7,0.00016251954,0.000057280457,0.0004232166,0.000045648132,0.00059518195,0.00046076608,0.00010111217,0.00023880757],"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":[6.372243e-7,0.00010140931,0.00038315597,0.000005703083,0.0000053955046,0.0000013817884,0.00004598883,0.000060992195,0.01306611,0.09866658,0.058621913,0.8290407],"study_design_scores_gemma":[0.0001777952,0.000011619136,0.0022560973,0.0000042121055,0.0000023174534,0.00001622001,0.0000025735949,0.0004962477,0.039854195,0.04288314,0.91409284,0.00020272094],"about_ca_topic_score_codex":0.000079496764,"about_ca_topic_score_gemma":0.000013718376,"teacher_disagreement_score":0.85547096,"about_ca_system_score_codex":0.00006256952,"about_ca_system_score_gemma":0.000046911446,"threshold_uncertainty_score":0.66273546},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00030767752,0.000039312603,0.99805945,0.00030465628,0.0000075853336,0.00038450412,0.000010992656,0.0002937619,0.0005920574],"genre_scores_gemma":[0.06607613,0.000004370407,0.933408,0.00026556928,0.000038240996,0.00013353823,0.00004298295,0.000009821053,0.00002134359],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99902177,0.000023627263,0.00032210123,0.00037324394,0.00012350132,0.00013574418],"domain_scores_gemma":[0.9989979,0.00009479463,0.0002073655,0.000540206,0.00012170993,0.000038000006],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00010055562,0.00011764384,0.00013213675,0.0001572044,0.000100377016,0.000057597004,0.00052706175,0.000045924357,0.0000044898566],"category_scores_gemma":[0.0000014932787,0.000116411975,0.000028292287,0.00040923158,0.000048809172,0.00022177567,0.0002505964,0.000084969586,0.0000045969805],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000063223642,0.00049021916,0.00080616015,0.000065926215,0.000008097879,0.0000018466421,0.00007737455,0.1555831,0.03411652,0.08109895,0.007215924,0.72052956],"study_design_scores_gemma":[0.00026657415,0.000045980807,0.000768196,0.000056409706,0.000004675798,0.0000069349735,0.0000026734556,0.8567336,0.0845222,0.0079182815,0.049452454,0.00022200009],"about_ca_topic_score_codex":0.000016828788,"about_ca_topic_score_gemma":9.4282694e-7,"teacher_disagreement_score":0.7203076,"about_ca_system_score_codex":0.000021623584,"about_ca_system_score_gemma":0.00002417912,"threshold_uncertainty_score":0.47471428},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00043107854,0.000033515407,0.98700994,0.00005491206,0.000029621635,0.00008363384,0.0000019158006,0.00032481426,0.012030595],"genre_scores_gemma":[0.5967986,0.000016399674,0.40290067,0.000048436395,0.000007778476,0.0000057640495,8.17288e-7,0.0000033138003,0.00021823084],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99933356,0.000028346878,0.0001798185,0.00019610269,0.00015750839,0.00010465455],"domain_scores_gemma":[0.99929535,0.00005874585,0.00011535145,0.0004219692,0.000078336445,0.00003025477],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00008052833,0.000062741776,0.0000934267,0.00006939394,0.000048979855,0.000017836719,0.00044101576,0.000025435453,0.00003552198],"category_scores_gemma":[0.000055305645,0.00005526801,0.000020164112,0.0002756794,0.000018322973,0.0005065891,0.00023424682,0.000044143424,0.0000076063893],"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.0000020956732,0.00007809706,0.00013426403,0.000012353291,0.0000063583952,0.000002444762,0.00062927767,0.00064615934,0.017876156,0.87558967,0.0071976697,0.09782548],"study_design_scores_gemma":[0.000096742995,0.00005379653,0.000094852505,0.00004504825,0.0000012670362,0.0000048563875,0.000018852093,0.867681,0.11978786,0.011423256,0.0006950773,0.000097364406],"about_ca_topic_score_codex":0.000016789312,"about_ca_topic_score_gemma":0.0000014457432,"teacher_disagreement_score":0.86703485,"about_ca_system_score_codex":0.000016514468,"about_ca_system_score_gemma":0.0000042195743,"threshold_uncertainty_score":0.22537641},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00024720607,0.000038593338,0.99368924,0.00023831664,0.00003143037,0.00006508421,0.0000108628,0.00015141965,0.0055278665],"genre_scores_gemma":[0.34585702,0.00005289193,0.65279377,0.0003441027,0.000008608547,0.000011149508,0.0000052520495,0.0000033324236,0.00092391047],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99938047,0.000030571762,0.0001717048,0.0001261872,0.00020368143,0.00008737645],"domain_scores_gemma":[0.9990062,0.00003690001,0.00010098726,0.0007821637,0.000052256368,0.000021463116],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00006010825,0.000054480894,0.00010457185,0.00013104567,0.00006849985,0.00003206767,0.00083289883,0.00002211551,0.00016444831],"category_scores_gemma":[0.000013187088,0.000032967913,0.00008164575,0.0012012505,0.000033088858,0.0006064107,0.00027605734,0.000044668905,0.00000955126],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[2.3283467e-7,0.00004460268,0.00017381556,0.0000021157211,0.000047104848,3.9667498e-7,0.00023980545,0.00029978147,0.0004267082,0.01097472,0.006614076,0.9811766],"study_design_scores_gemma":[0.00003920211,0.000009817709,0.00080373685,0.000004332562,0.00002494575,0.0000012525779,0.0000054868374,0.9575018,0.03182451,0.0011668591,0.008566073,0.00005192594],"about_ca_topic_score_codex":0.000016801874,"about_ca_topic_score_gemma":0.0000067878004,"teacher_disagreement_score":0.9811247,"about_ca_system_score_codex":0.000014212116,"about_ca_system_score_gemma":0.000003482327,"threshold_uncertainty_score":0.18005936},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0017577905,0.00007284718,0.99619496,0.0004364467,0.000015897098,0.0011212489,0.00003462795,0.00028415606,0.000082037295],"genre_scores_gemma":[0.033691335,0.000036183068,0.96555644,0.00037278153,0.00004468392,0.00019587512,0.00007277352,0.000010337051,0.00001957644],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9983458,0.00007180178,0.00059529574,0.0005532783,0.00014855203,0.0002852588],"domain_scores_gemma":[0.9986556,0.00006748686,0.00026647304,0.0008100565,0.0001239888,0.00007639214],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022272705,0.00019058025,0.0002525109,0.00029918106,0.000092159855,0.000069912014,0.0012183966,0.00007020632,0.000011989531],"category_scores_gemma":[5.849905e-7,0.00018969737,0.000060887094,0.000772283,0.00003284792,0.0005642494,0.00037332493,0.00016522653,0.000015201593],"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.0000022582026,0.00013197181,0.000037870937,0.00000908148,0.000002795328,0.000001315917,0.000102412625,0.00002748792,0.15068085,0.0019311593,0.00048717554,0.84658563],"study_design_scores_gemma":[0.0012686462,0.00014231104,0.010383158,0.000120211815,0.000005870867,0.000020687005,0.000031287756,0.07768593,0.8437822,0.021913722,0.044192635,0.00045336792],"about_ca_topic_score_codex":0.000060847822,"about_ca_topic_score_gemma":0.000010575486,"teacher_disagreement_score":0.8461323,"about_ca_system_score_codex":0.000067873676,"about_ca_system_score_gemma":0.000055246335,"threshold_uncertainty_score":0.7735634},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000052636726,0.00002785867,0.9938674,0.0014093228,0.000010029328,0.0009873968,0.000067436275,0.0009627321,0.0026151985],"genre_scores_gemma":[0.06841884,0.000014643226,0.92987525,0.00097573455,0.000082311104,0.00052770396,0.000039777864,0.000022509636,0.00004320105],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9983512,0.00004219074,0.00048846845,0.000575109,0.00025375176,0.00028927356],"domain_scores_gemma":[0.99822474,0.00017133978,0.00018491867,0.0011378475,0.00018224074,0.000098920755],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017598335,0.00024655645,0.0002829503,0.00029308893,0.00011417224,0.00008619257,0.00182795,0.00009039794,0.000021272392],"category_scores_gemma":[0.0000012007957,0.00023259781,0.00011340961,0.00043809903,0.00011051782,0.0005498545,0.00029586232,0.00024972786,0.000038354694],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000073103515,0.00035252294,0.00000532085,0.000040161223,0.000008031635,0.0000010043603,0.00014536448,0.00014848357,0.08830552,0.020993525,0.0074127936,0.88258],"study_design_scores_gemma":[0.00015912594,0.000043174055,0.0000308079,0.00006513488,0.0000036066467,0.0000048697343,0.000002057025,0.05477691,0.52457887,0.0015384662,0.41861054,0.00018645721],"about_ca_topic_score_codex":0.000008247797,"about_ca_topic_score_gemma":0.0000019738484,"teacher_disagreement_score":0.8823935,"about_ca_system_score_codex":0.000079307334,"about_ca_system_score_gemma":0.000042943226,"threshold_uncertainty_score":0.94850636},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0012071964,0.000108547436,0.9911895,0.0016824987,0.000194808,0.00041682608,0.000011206318,0.0028726123,0.0023168295],"genre_scores_gemma":[0.24066617,0.0000171178,0.7588418,0.00031140467,0.000032059997,0.000024740859,0.000044102126,0.000028085373,0.000034495097],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9970987,0.000066258144,0.00051096146,0.00085505174,0.00048775476,0.0009813047],"domain_scores_gemma":[0.9976834,0.00025150322,0.00029216096,0.0014083661,0.00023339133,0.00013120071],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00055827136,0.00035713502,0.00037547637,0.0008725783,0.00030810037,0.00009513047,0.0019091975,0.0003442013,0.000015319292],"category_scores_gemma":[0.000085971085,0.00035127194,0.00008226329,0.0013079027,0.0003589895,0.00041671033,0.00065073045,0.0008876396,0.000062906394],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000035440866,0.00040777432,0.00002589051,0.000013285124,0.000014860451,0.00006822827,0.00001857753,0.0006191625,0.031666454,0.30252674,0.0009337468,0.6636698],"study_design_scores_gemma":[0.0006623684,0.0007154456,0.00011673175,0.0000555091,0.0000062173817,0.00004271319,0.000011079954,0.621302,0.24679674,0.12698995,0.0029051732,0.00039604283],"about_ca_topic_score_codex":0.0000046534174,"about_ca_topic_score_gemma":0.000004137975,"teacher_disagreement_score":0.6632738,"about_ca_system_score_codex":0.0003200881,"about_ca_system_score_gemma":0.00013361323,"threshold_uncertainty_score":0.9998939},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00011489415,0.000025721722,0.9942667,0.001769277,0.000030896354,0.00072367437,0.000020480687,0.0011508077,0.00189753],"genre_scores_gemma":[0.17089753,0.0000073216515,0.8266791,0.0018694635,0.000116905685,0.0002872262,0.00006575553,0.000012556517,0.00006413026],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99838763,0.000039137696,0.0003416623,0.0006490687,0.00025348325,0.0003290214],"domain_scores_gemma":[0.99882305,0.00016851816,0.000111822665,0.0006664909,0.00011328629,0.000116857154],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018971387,0.00021345583,0.00017670034,0.00023401393,0.00045333116,0.00022733699,0.00090435665,0.00008173883,0.000010236295],"category_scores_gemma":[0.0000031335626,0.00021642735,0.00008983555,0.00058235484,0.000030087322,0.0006833831,0.00008949664,0.00022742088,0.00006640468],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008463348,0.00028219982,0.00005987298,0.000010148275,0.0000044705216,0.0000013189546,0.00006563272,0.0012657536,0.05614427,0.008143086,0.005705907,0.9283089],"study_design_scores_gemma":[0.0005791314,0.00010483177,0.0022149174,0.00009409911,0.000005631841,0.000016874896,0.000003284665,0.45027962,0.16169104,0.011019118,0.37357265,0.00041879842],"about_ca_topic_score_codex":0.000008868176,"about_ca_topic_score_gemma":0.0000022871009,"teacher_disagreement_score":0.92789006,"about_ca_system_score_codex":0.00013094803,"about_ca_system_score_gemma":0.000043797103,"threshold_uncertainty_score":0.8825651},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009363943,0.000053861408,0.98322725,0.00055683,0.0003465978,0.0003796938,0.000012775072,0.0024852909,0.0035737567],"genre_scores_gemma":[0.18266006,0.000018659688,0.8094372,0.0006816204,0.00009423795,0.000098216464,0.00005629296,0.000034915432,0.0069187935],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9974872,0.00018601093,0.00040652056,0.0008259752,0.00053297036,0.0005613391],"domain_scores_gemma":[0.9968337,0.00030773666,0.00018873221,0.0021422273,0.00028083904,0.0002467873],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00042569294,0.00033959773,0.00031628954,0.00024482855,0.0003739188,0.00040215833,0.0013618281,0.00012442526,0.00023298894],"category_scores_gemma":[0.00033526222,0.0002667781,0.00008235584,0.00070766994,0.00012438495,0.0024959452,0.0005370107,0.0003030386,0.0015655957],"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.00018751602,0.0009477904,0.008819852,0.00012201625,0.0000926846,0.0000063148077,0.0010526995,0.0008968043,0.29629165,0.43251815,0.21189247,0.047172032],"study_design_scores_gemma":[0.0009507828,0.000116508505,0.0040892703,0.00013922506,0.000024989808,0.00006139923,0.000020767706,0.0150598,0.026965922,0.013851555,0.9378376,0.0008821642],"about_ca_topic_score_codex":0.00023970968,"about_ca_topic_score_gemma":0.00079663104,"teacher_disagreement_score":0.7259452,"about_ca_system_score_codex":0.0000989598,"about_ca_system_score_gemma":0.000062915045,"threshold_uncertainty_score":0.9999784},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.54757565,0.000042246535,0.45122305,0.000105455794,0.000047867197,0.0001758884,0.0000068585205,0.00020902572,0.0006139692],"genre_scores_gemma":[0.9666111,0.000019925264,0.033216454,0.000020841559,0.000032719945,0.000020358784,0.0000017158997,0.000008890663,0.00006800461],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.998766,0.000059248112,0.0003060722,0.00047067253,0.00019558203,0.00020243351],"domain_scores_gemma":[0.99873525,0.00054097694,0.00012135597,0.00045235065,0.00008195973,0.00006812804],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018092245,0.0001684327,0.0002593587,0.00018051077,0.000044105356,0.000036379046,0.00040431196,0.000058869857,0.0000060026296],"category_scores_gemma":[0.0004087829,0.00009171756,0.000032279626,0.00023696,0.00009220975,0.0006547145,0.0006339415,0.000094289826,0.0000010068316],"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.00009081619,0.00069105614,0.22732913,0.000056233694,0.00001364947,0.000024623767,0.0035602392,0.000007046549,0.31012577,0.04220303,0.00019330824,0.41570508],"study_design_scores_gemma":[0.00079724536,0.00031879032,0.50819796,0.00035153812,0.00000495104,0.000014626251,0.00008017286,0.01776376,0.41318294,0.058691856,0.000106862804,0.0004892827],"about_ca_topic_score_codex":0.000032340376,"about_ca_topic_score_gemma":0.00008749932,"teacher_disagreement_score":0.41903543,"about_ca_system_score_codex":0.000028152592,"about_ca_system_score_gemma":0.000013869391,"threshold_uncertainty_score":0.37401333},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00012012333,0.00017789105,0.9930909,0.00005118785,0.00017969137,0.00041501262,0.0000023527223,0.0005851593,0.0053776396],"genre_scores_gemma":[0.010170816,0.00000244531,0.98867863,0.00038095374,0.00009094129,0.000025328776,0.000004713257,0.00001602877,0.000630113],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986372,0.00008006356,0.0002267799,0.0004826277,0.000162576,0.00041075802],"domain_scores_gemma":[0.99887097,0.00015266822,0.00010818467,0.00067750417,0.0000613946,0.00012929329],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022200517,0.0001661202,0.00020528283,0.00005235847,0.00025249703,0.00024174889,0.0008142445,0.000055162276,0.00002214774],"category_scores_gemma":[0.00005742349,0.00014232322,0.00006563468,0.00029880184,0.00003107815,0.0009346324,0.00029755986,0.0001048385,0.0000023793432],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000377293,0.00015575097,0.00035369286,0.000061947896,0.00003377596,0.000010044178,0.00013092782,0.15548211,0.021966254,0.49639615,0.20800352,0.11736808],"study_design_scores_gemma":[0.00032782875,0.000031818556,0.000021105683,0.000017701042,0.0000056498757,0.000034566205,0.0000071178893,0.93797874,0.02256866,0.019214178,0.01954267,0.00024994332],"about_ca_topic_score_codex":0.000014053756,"about_ca_topic_score_gemma":4.883709e-7,"teacher_disagreement_score":0.78249663,"about_ca_system_score_codex":0.00002352512,"about_ca_system_score_gemma":0.00007112024,"threshold_uncertainty_score":0.5803772},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000035616533,0.00005784283,0.95363784,0.00039453834,0.00018690347,0.00028441442,0.0000028172662,0.00052844564,0.044871558],"genre_scores_gemma":[0.058469817,0.000026529497,0.938891,0.00075644307,0.000048947484,0.00008685465,0.0000011497018,0.000009136375,0.0017101449],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9991854,0.000018105131,0.00015162541,0.00028343854,0.00014631076,0.00021512328],"domain_scores_gemma":[0.99866104,0.00025267835,0.000057946752,0.0009199022,0.00006220613,0.000046199475],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023159845,0.00010008014,0.00009255358,0.00004268937,0.00015939762,0.000057714067,0.0016354123,0.000035964727,0.000122009194],"category_scores_gemma":[0.000055339373,0.00005849891,0.000051995263,0.00013369341,0.00003965937,0.00058066624,0.00049169187,0.00007943182,0.000033194097],"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.000009550305,0.00005089305,0.00007787008,0.0000061793953,0.0000119491515,0.0000051415786,0.0005115312,0.0000017244978,0.0040504644,0.43966854,0.056329083,0.49927709],"study_design_scores_gemma":[0.0003635968,0.0001333125,0.00052776537,0.000026421214,0.000009330615,0.00003002958,0.00011638335,0.062120296,0.64031327,0.14333014,0.1526573,0.0003721476],"about_ca_topic_score_codex":0.000026105869,"about_ca_topic_score_gemma":0.000016874048,"teacher_disagreement_score":0.63626283,"about_ca_system_score_codex":0.000010498288,"about_ca_system_score_gemma":0.000018466913,"threshold_uncertainty_score":0.303903},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016667144,0.00010397706,0.97978413,0.00010384906,0.0014299415,0.000818201,0.00020374311,0.0006945517,0.00019444636],"genre_scores_gemma":[0.9833425,0.000021462492,0.015933886,0.00006868766,0.00015040308,0.00014266156,0.0000021129397,0.000058798127,0.00027943304],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9965396,0.00024613805,0.00097358576,0.0009359964,0.00066904636,0.0006356173],"domain_scores_gemma":[0.9970066,0.00040731757,0.00051912083,0.0016415501,0.00021843726,0.00020697588],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00038066646,0.000459496,0.0006516354,0.0006318037,0.0005208402,0.00013565595,0.0015602548,0.00024084501,0.000012919535],"category_scores_gemma":[0.000034412977,0.00036296737,0.0002178688,0.0005669598,0.00017749281,0.00115533,0.000048986367,0.00043730444,0.00000913395],"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.000025974827,0.00020511108,0.000007292476,0.00017664836,0.00007361099,0.000017280443,0.0016877198,0.021406492,0.81673497,0.0008672121,0.00026615072,0.15853152],"study_design_scores_gemma":[0.001192077,0.00012291486,0.000022927787,0.0042030727,0.000025511805,0.00018331726,0.00012596081,0.014095464,0.97430086,0.00035322565,0.0045068217,0.0008678703],"about_ca_topic_score_codex":0.00023834898,"about_ca_topic_score_gemma":0.000009476264,"teacher_disagreement_score":0.9666754,"about_ca_system_score_codex":0.00019139967,"about_ca_system_score_gemma":0.00015563307,"threshold_uncertainty_score":0.9998822},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000044523626,0.00026148863,0.7404174,0.00013614658,0.0004018363,0.0009320871,0.00025845197,0.0006906589,0.25685737],"genre_scores_gemma":[0.0023333787,0.0005367215,0.9237047,0.00056986645,0.00011565809,0.000049355793,0.001031205,0.00010286313,0.07155628],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9970206,0.000021055028,0.00081452704,0.000951417,0.0008333884,0.00035898236],"domain_scores_gemma":[0.9964822,0.00019553938,0.00047569585,0.0024423564,0.00017674014,0.00022744553],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00022373968,0.0005212681,0.00058049365,0.00011615759,0.00010542427,0.0001143379,0.00260519,0.00048032243,0.0002478006],"category_scores_gemma":[0.00001633244,0.0005083364,0.00026902556,0.000042504755,0.00032172792,0.00076975574,0.001786377,0.00066314475,0.00007353681],"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.00001252257,0.000052415206,0.0000013920569,0.0003624527,0.0002786101,0.0000049369796,0.00074241514,0.000042979307,0.021867154,0.4793812,0.046744313,0.4505096],"study_design_scores_gemma":[0.001801615,0.00036344587,0.000027306567,0.0018400361,0.00016680537,0.000032570297,0.00022119592,0.12692748,0.21178898,0.14343818,0.51096225,0.002430131],"about_ca_topic_score_codex":0.000010951925,"about_ca_topic_score_gemma":4.722388e-7,"teacher_disagreement_score":0.46421793,"about_ca_system_score_codex":0.00011842426,"about_ca_system_score_gemma":0.000102104386,"threshold_uncertainty_score":0.99973685},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0023849972,0.000039520677,0.988005,0.00014324456,0.00003941405,0.0000649994,0.000002002324,0.0003699695,0.008950888],"genre_scores_gemma":[0.3379575,0.000027298518,0.66138154,0.00006301473,0.000008158422,0.000004608044,0.0000022195798,0.0000034774582,0.00055219524],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99940306,0.000020274289,0.00015000143,0.00017607518,0.00015052616,0.00010008261],"domain_scores_gemma":[0.9992797,0.000033439155,0.00006778271,0.00052751217,0.000055491844,0.000036094134],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00004700198,0.00006152838,0.00008288691,0.000066548535,0.000023668092,0.000019535099,0.00052318955,0.000028848417,0.0002591265],"category_scores_gemma":[0.000029504423,0.000050589726,0.00002232706,0.0002574608,0.000023940449,0.0005280033,0.00021478058,0.000037722275,0.000038429873],"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.0000046088408,0.00035455803,0.0004009702,0.000024898642,0.0000134727925,0.000009781105,0.00078000355,0.0012739882,0.043296862,0.28245565,0.073377565,0.5980076],"study_design_scores_gemma":[0.00018699937,0.00009364918,0.00016898135,0.000024608038,0.0000016831103,0.000008036916,0.000016837534,0.41048625,0.5797693,0.0035128705,0.005566443,0.00016429836],"about_ca_topic_score_codex":0.0000024651831,"about_ca_topic_score_gemma":2.6102873e-7,"teacher_disagreement_score":0.59784335,"about_ca_system_score_codex":0.0000069200396,"about_ca_system_score_gemma":0.0000036280876,"threshold_uncertainty_score":0.28372535},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0005554857,0.2611481,0.20466577,0.00016590166,0.024233166,0.0029620158,0.0005342298,0.00053287076,0.5052025],"genre_scores_gemma":[0.90485483,0.014972439,0.040752534,0.00042398175,0.001100026,0.00020877943,0.00007560983,0.00013579529,0.037476026],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9951613,0.0006695695,0.0015938553,0.0011055245,0.0009885344,0.0004812347],"domain_scores_gemma":[0.9909482,0.0050019566,0.001375153,0.0017920771,0.0007969325,0.000085707994],"candidate_categories":["metaresearch","metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.008602194,0.000615604,0.0015733219,0.0021704908,0.00019878593,0.000043754742,0.0027154186,0.00016715036,0.0001519524],"category_scores_gemma":[0.0121116275,0.00049582147,0.00022214274,0.00078048755,0.010672486,0.00020843201,0.00089320366,0.0006831695,0.0000035833525],"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.00013719563,0.000117100535,0.000015324484,0.00032343194,0.00017023119,0.00003827615,0.04955554,0.00005551949,0.000018863098,0.9439611,0.0001395298,0.005467913],"study_design_scores_gemma":[0.00036954822,0.00029324382,0.0000716153,0.0020555002,0.0007028316,0.00001025446,0.0007821948,0.001175286,0.000055819506,0.9319705,0.06185327,0.00065998663],"about_ca_topic_score_codex":0.000016304715,"about_ca_topic_score_gemma":0.000018402825,"teacher_disagreement_score":0.9042993,"about_ca_system_score_codex":0.0005766525,"about_ca_system_score_gemma":0.00036533296,"threshold_uncertainty_score":0.99974936},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013111288,0.00032742618,0.8193227,0.0001024225,0.00093123043,0.0065185153,0.0007529993,0.0011852772,0.15774813],"genre_scores_gemma":[0.14684121,0.00024867884,0.8314373,0.0002012773,0.00009062016,0.00011735802,0.0006238136,0.00013452525,0.02030521],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99652123,0.000048285478,0.0011538913,0.0009930484,0.0009891894,0.00029433373],"domain_scores_gemma":[0.99561894,0.00026006522,0.00069172936,0.0029854889,0.0002699168,0.00017383085],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003527639,0.0004955581,0.0007697963,0.00011747017,0.000082739345,0.000063655025,0.002648182,0.0003722795,0.00031598945],"category_scores_gemma":[0.000025984495,0.00047021432,0.00024239927,0.000059407914,0.0003276207,0.000755073,0.0021510515,0.0005908607,0.00001236018],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000091891336,0.0012869551,0.00017016853,0.0013945753,0.0012608325,0.0000067761953,0.008216616,0.00022533789,0.03295752,0.15996426,0.016099047,0.77832603],"study_design_scores_gemma":[0.013209861,0.0051113903,0.0035567405,0.0030089165,0.001086198,0.000032472777,0.009832569,0.1391491,0.53958625,0.08883773,0.18914768,0.0074411267],"about_ca_topic_score_codex":0.000045197372,"about_ca_topic_score_gemma":0.0000028006632,"teacher_disagreement_score":0.7708849,"about_ca_system_score_codex":0.00010548062,"about_ca_system_score_gemma":0.00008952766,"threshold_uncertainty_score":0.99977493},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00001117641,0.0004116634,0.98529935,0.0011216872,0.0003824376,0.00062764104,0.00005652296,0.0002836813,0.011805847],"genre_scores_gemma":[0.015346176,0.0150430305,0.76723725,0.0009831009,0.000790671,0.0002760377,0.0003132954,0.00019830212,0.19981216],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9978952,0.000036819605,0.0006561519,0.0008514856,0.00025526006,0.00030511705],"domain_scores_gemma":[0.99891657,0.00010513506,0.00018353088,0.00057002925,0.00009994995,0.00012479351],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0002940872,0.00041690032,0.00041780013,0.00029549783,0.00021586916,0.00019863686,0.00073613407,0.00033586103,0.00084640156],"category_scores_gemma":[0.000040328203,0.0003943841,0.00011686644,0.00008962567,0.00021512447,0.0007763834,0.00028479422,0.0004800373,0.00006129659],"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.00005074894,0.000030297158,5.6800684e-7,0.000068052934,0.0000042417764,0.0000055950118,0.0005823479,0.0004897211,0.000732863,0.29748473,0.0005610301,0.6999898],"study_design_scores_gemma":[0.000053741467,0.000316146,0.0000058088344,0.0005289136,0.000010462433,0.000031299234,0.000059752118,0.18649004,0.0030999305,0.61427087,0.1943711,0.0007619212],"about_ca_topic_score_codex":0.000013839084,"about_ca_topic_score_gemma":0.000025515648,"teacher_disagreement_score":0.69922787,"about_ca_system_score_codex":0.000063474945,"about_ca_system_score_gemma":0.00001977616,"threshold_uncertainty_score":0.9998508},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013269617,0.0006004899,0.9845925,0.0004954772,0.00013814284,0.00026346376,0.000021036318,0.00057923427,0.000040026032],"genre_scores_gemma":[0.4655521,0.00020881058,0.53389674,0.0001603531,0.000038623333,0.000015663129,0.000002455211,0.000024541538,0.00010072601],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99814653,0.00009447977,0.00037125565,0.0006704872,0.00031263498,0.00040461798],"domain_scores_gemma":[0.9987653,0.0001761257,0.00022381116,0.0005565526,0.000103087106,0.00017513779],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031143764,0.00028666944,0.00032853775,0.0002914365,0.000592162,0.00034432398,0.00036045533,0.00011667293,0.000039903913],"category_scores_gemma":[0.000079549674,0.00022087015,0.00006002561,0.00043280327,0.00012096393,0.0013089381,0.000029874025,0.00020675221,0.000004349059],"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.000058790545,0.000074485666,0.000032876047,0.000117140604,0.0000135682985,0.00003194858,0.00042002113,0.0012741304,0.39137697,0.00010688053,0.000026599844,0.6064666],"study_design_scores_gemma":[0.0013487244,0.00007834796,0.000023805069,0.0010669195,0.000032584645,0.00007190961,0.00009982426,0.23364735,0.7626123,0.00050219515,0.00013092946,0.00038513495],"about_ca_topic_score_codex":0.000029100516,"about_ca_topic_score_gemma":0.0000050017566,"teacher_disagreement_score":0.6060815,"about_ca_system_score_codex":0.00010850326,"about_ca_system_score_gemma":0.00009321392,"threshold_uncertainty_score":0.90068233},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019931832,0.00010732732,0.97708666,0.0014982396,0.000019884961,0.00010422817,0.000003989195,0.00023116443,0.0010166649],"genre_scores_gemma":[0.49946046,0.00006302617,0.5002249,0.0001704611,0.000013551726,0.000003882667,8.244146e-7,0.0000028828924,0.00006004863],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99882287,0.000043830143,0.00021224782,0.00034792456,0.00041760821,0.00015551777],"domain_scores_gemma":[0.99898463,0.00018546186,0.00006240589,0.0005831214,0.00008443423,0.000099912104],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032480684,0.00009718966,0.00018543,0.0000892897,0.000051643445,0.000035756853,0.00066995487,0.000047010653,0.00011886882],"category_scores_gemma":[0.00017334272,0.00006424819,0.00001406558,0.00038715443,0.00015550261,0.0008488983,0.0006561368,0.0001190168,0.000003322693],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014694022,0.00019994425,0.0038215155,0.0000481333,0.000015141693,0.000013494406,0.00013339073,0.000016951002,0.0021249007,0.08094677,0.006838159,0.9058269],"study_design_scores_gemma":[0.0021463877,0.00084117387,0.04850711,0.00030411177,0.000015983922,0.00022187032,0.00005832981,0.13772048,0.77676433,0.01226151,0.02019781,0.000960885],"about_ca_topic_score_codex":0.000071303344,"about_ca_topic_score_gemma":0.000011018665,"teacher_disagreement_score":0.90486604,"about_ca_system_score_codex":0.000020157566,"about_ca_system_score_gemma":0.000045585373,"threshold_uncertainty_score":0.26199654},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002850385,0.0001251379,0.98475426,0.0013961814,0.0027264715,0.0042972406,0.00017654168,0.0015181635,0.0021556062],"genre_scores_gemma":[0.7363365,0.00012504063,0.26171893,0.0002673665,0.0003211882,0.00082009984,0.00010724874,0.00010414122,0.00019947335],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.98971504,0.00093341054,0.0031623458,0.002673801,0.0016072851,0.0019081407],"domain_scores_gemma":[0.98478633,0.0035432773,0.0033288891,0.0040357155,0.003635239,0.00067056535],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":["metaepi_narrow"],"category_scores_codex":[0.0039839917,0.0014618377,0.0019868503,0.001157024,0.0008267285,0.0013341618,0.007420996,0.0007272421,0.0000890362],"category_scores_gemma":[0.00052530493,0.0012165166,0.0005609073,0.0013956118,0.00085547246,0.0015749705,0.0008581545,0.0011630062,0.000033737004],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003322683,0.00039125202,0.0005004679,0.000646788,0.00011645789,0.000018218278,0.00028039317,0.00037636317,0.015674705,0.12201931,0.002981771,0.85666203],"study_design_scores_gemma":[0.0012194765,0.0016163492,0.00048711253,0.0024445476,0.00008822535,0.00003512603,0.0010125545,0.94295496,0.024532365,0.0040987525,0.019560998,0.0019495081],"about_ca_topic_score_codex":0.0005498614,"about_ca_topic_score_gemma":0.0001752623,"teacher_disagreement_score":0.9425786,"about_ca_system_score_codex":0.00046315603,"about_ca_system_score_gemma":0.0021055292,"threshold_uncertainty_score":0.99981314},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0055211843,0.0003032176,0.99241763,0.000069044094,0.00012288896,0.00019882493,9.921779e-7,0.000260074,0.0011061368],"genre_scores_gemma":[0.31202808,0.000025738065,0.6870085,0.0003043525,0.00005455937,0.00003173854,0.0000073617416,0.0000089672085,0.0005306779],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988542,0.000045016815,0.00026736505,0.00036231094,0.00018137097,0.00028972444],"domain_scores_gemma":[0.9992168,0.000055962493,0.000070807444,0.0006064992,0.000005909523,0.000044032782],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00011571756,0.000112367285,0.00012555525,0.000052045183,0.00004649715,0.000046095047,0.00057174976,0.000043844702,0.000018489507],"category_scores_gemma":[0.000009198355,0.00009929361,0.000029312005,0.00013370275,0.000027777158,0.00036711563,0.0004441932,0.00008782906,0.00003109816],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000040420124,0.0008930907,0.038003135,0.000014503661,0.000021124417,0.0007552891,0.00017041307,0.06748778,0.10398931,0.0387238,0.021943139,0.727958],"study_design_scores_gemma":[0.0013299005,0.00014572676,0.023572737,0.00015020557,0.000004061305,0.00009361773,0.0000075977123,0.48255026,0.34541747,0.035208143,0.11056872,0.00095156056],"about_ca_topic_score_codex":0.00011208543,"about_ca_topic_score_gemma":0.00003089031,"teacher_disagreement_score":0.72700644,"about_ca_system_score_codex":0.000060686827,"about_ca_system_score_gemma":0.00000596469,"threshold_uncertainty_score":0.40490758},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002860109,0.00007549489,0.9958005,0.000050561626,0.0000659102,0.00057345117,0.0000050547064,0.0004529009,0.0001159964],"genre_scores_gemma":[0.35356736,0.0001514185,0.64609265,0.000050098544,0.000017758219,0.000035252415,0.000026054451,0.000015704734,0.000043695905],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987422,0.000054268214,0.00030371593,0.00051516393,0.00018784065,0.00019676193],"domain_scores_gemma":[0.999034,0.00014388346,0.00021111268,0.00021421586,0.0003195399,0.00007728539],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004592747,0.00016773072,0.00017660297,0.00021492947,0.0003208795,0.00014750788,0.00016574045,0.00007640688,0.000020348976],"category_scores_gemma":[0.00022945093,0.00013774511,0.0000133298145,0.00043961502,0.00002183784,0.002084396,0.00014489652,0.00006493679,7.5823715e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007550234,0.00050889153,0.006134251,0.00042348867,0.0000759285,0.0000065373783,0.0024806056,0.09010707,0.14889698,0.50073683,0.00205013,0.24782425],"study_design_scores_gemma":[0.0004246608,0.00021372814,0.00022894761,0.00012402578,0.000009675137,0.000016672591,0.000029355702,0.9027913,0.093806565,0.0020484861,0.00011663892,0.00018989385],"about_ca_topic_score_codex":0.000019528432,"about_ca_topic_score_gemma":0.00002298015,"teacher_disagreement_score":0.8126843,"about_ca_system_score_codex":0.000030043677,"about_ca_system_score_gemma":0.000028240265,"threshold_uncertainty_score":0.5617083},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00015973834,0.000014160213,0.99855196,0.0003637573,0.00010392817,0.00024547044,0.000005331227,0.00045917317,0.00009646441],"genre_scores_gemma":[0.12377212,0.0000035780463,0.87576616,0.000151669,0.000035246932,0.000043092357,0.000001988727,0.000007489226,0.00021863682],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99927354,0.000040959712,0.00014981389,0.0002502523,0.00011856439,0.00016689561],"domain_scores_gemma":[0.9992187,0.0002709976,0.000068903144,0.00030386678,0.00009306009,0.000044472792],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017688828,0.00007518673,0.0000775862,0.000053103286,0.0001243633,0.000057547073,0.00034326417,0.000030469573,0.000033641],"category_scores_gemma":[0.000092777605,0.00004992439,0.000025951113,0.000085618456,0.000023262612,0.00091884047,0.00011699907,0.000018646277,0.000011858396],"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.000016737413,0.000029531822,0.00007093443,0.00000690244,0.0000061636274,0.0000011212034,0.000033073306,0.00046692422,0.31303006,0.6373674,0.005628606,0.04334252],"study_design_scores_gemma":[0.00028220285,0.000070582966,0.000077592056,0.000085758336,0.0000025808574,0.000006390266,0.0000018156874,0.30501992,0.62800074,0.06011748,0.006156929,0.00017800865],"about_ca_topic_score_codex":0.0000023563125,"about_ca_topic_score_gemma":6.8207214e-7,"teacher_disagreement_score":0.57724994,"about_ca_system_score_codex":0.00004127556,"about_ca_system_score_gemma":0.00004702161,"threshold_uncertainty_score":0.20358574},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000051699804,0.00019443088,0.9980912,0.00007482437,0.00024364176,0.00031308839,0.00000237945,0.0007083119,0.00032038713],"genre_scores_gemma":[0.014323802,0.000087326385,0.98435664,0.00070020603,0.000053109583,0.000021881215,0.000012560673,0.000012827428,0.00043163364],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989918,0.000014485399,0.00021935882,0.0003444612,0.00013821023,0.00029170993],"domain_scores_gemma":[0.9990034,0.00022363542,0.000093073184,0.00049980654,0.00010119122,0.00007889992],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035556374,0.0001146623,0.000106722706,0.0000838697,0.00012361482,0.00008535671,0.0006137727,0.00007777246,0.000029435803],"category_scores_gemma":[0.000061661136,0.00010058803,0.000040112533,0.00023614093,0.000016878294,0.00090758695,0.000311086,0.00008843258,0.000005522459],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008121378,0.000239285,0.00021377445,0.000030960877,0.000024755576,0.0000128915335,0.00022171655,0.21312518,0.008504262,0.029025387,0.04026772,0.70825285],"study_design_scores_gemma":[0.00030735572,0.00003165599,0.00022019667,0.00001804808,0.0000018370122,0.0000020613777,0.0000049881987,0.97073054,0.007004205,0.00022764206,0.021301523,0.00014993204],"about_ca_topic_score_codex":0.0000020323134,"about_ca_topic_score_gemma":0.000008256403,"teacher_disagreement_score":0.7576054,"about_ca_system_score_codex":0.000039673283,"about_ca_system_score_gemma":0.000011041882,"threshold_uncertainty_score":0.41018608},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0002618552,0.00008365815,0.99478644,0.0018176546,0.00015000394,0.0003089284,0.00018858768,0.00078670983,0.0016161567],"genre_scores_gemma":[0.076002866,0.00002342544,0.9222388,0.000370511,0.00014996217,0.000023357043,0.0004472012,0.000010434029,0.00073339004],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99862987,0.000028226013,0.00024587163,0.0006412957,0.0001568065,0.00029795477],"domain_scores_gemma":[0.9975916,0.00018214872,0.00009987477,0.001965317,0.00007848501,0.00008256791],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001689716,0.00013809305,0.00017389712,0.00009247639,0.00014931338,0.00015384912,0.0026298545,0.00007315647,0.000039274724],"category_scores_gemma":[0.000110214554,0.000114265174,0.000028459865,0.0001468944,0.00005845507,0.004890541,0.0021388424,0.0001015385,0.000071600574],"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.00002710676,0.000118891054,0.00002719197,0.000012194717,0.000009278742,0.0000028910165,0.000020381594,0.0000857578,0.016224874,0.07202889,0.615655,0.29578754],"study_design_scores_gemma":[0.0007158496,0.00013891543,0.00015518705,0.00003476095,0.0000047099034,0.00003060776,0.000006441589,0.31860176,0.045115747,0.021110864,0.6137326,0.00035257186],"about_ca_topic_score_codex":0.000009091191,"about_ca_topic_score_gemma":0.000002922304,"teacher_disagreement_score":0.31851602,"about_ca_system_score_codex":0.000044391643,"about_ca_system_score_gemma":0.0000310936,"threshold_uncertainty_score":0.48869678},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.053495266,0.00904574,0.17285037,0.0070248344,0.0028241284,0.0027520598,0.0022292421,0.0007714595,0.7490069],"genre_scores_gemma":[0.8907237,0.0044726804,0.02949169,0.0020515325,0.00016133004,0.000063529,0.00045395028,0.00012384103,0.072457716],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99700326,0.000052981373,0.0004573523,0.00055408827,0.0015886783,0.00034363382],"domain_scores_gemma":[0.99864084,0.00016995073,0.00037156467,0.000498874,0.0000010861578,0.00031769281],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000012083543,0.00036576367,0.00046814085,0.00006688818,0.0002831856,0.00007594162,0.00061800284,0.000082810526,0.000025256888],"category_scores_gemma":[0.0000031821342,0.0003330328,0.0000391113,0.00008979915,0.00005529064,0.0008064595,0.00035517037,0.00030966225,3.5380632e-9],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0013658117,0.00013328774,0.0003609676,0.0017773528,0.00018139226,0.00026616987,0.0013807641,0.0002607494,0.03942903,0.08497028,0.019627945,0.85024625],"study_design_scores_gemma":[0.0009686722,0.00027551912,0.012653645,0.0030052674,0.000057593534,0.000044441753,0.0027273574,0.074660674,0.6993457,0.021850836,0.18256487,0.0018454277],"about_ca_topic_score_codex":0.0014607148,"about_ca_topic_score_gemma":0.0062133735,"teacher_disagreement_score":0.84840083,"about_ca_system_score_codex":0.000009576299,"about_ca_system_score_gemma":0.0008742184,"threshold_uncertainty_score":0.99991214},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011306269,0.000017418204,0.9861832,0.00031278632,0.0002026775,0.00009691485,6.7288005e-7,0.0002843379,0.0015957112],"genre_scores_gemma":[0.6635646,0.000016359565,0.33620533,0.000039751747,0.0000113384785,0.0000048264114,4.690726e-7,0.0000037080704,0.00015359577],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9993068,0.00002357383,0.00020871227,0.00024738972,0.000084798754,0.0001287146],"domain_scores_gemma":[0.9982555,0.00008627819,0.00026116165,0.001280087,0.00007297119,0.000044026405],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013092584,0.00008250168,0.00013311487,0.00007377316,0.0001908076,0.00016657123,0.0010612366,0.000038067035,0.000007753449],"category_scores_gemma":[0.00040651372,0.000073003386,0.00003129657,0.00003354815,0.0000531378,0.0018314224,0.0009960358,0.00008059736,0.0000054227235],"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.00003087503,0.00011230279,0.021579117,0.0000938747,0.000020165691,0.00008101719,0.0003759272,0.0000409746,0.39470056,0.18945739,0.017322369,0.37618545],"study_design_scores_gemma":[0.00051428,0.00008521965,0.0056293327,0.00048804996,0.0000038438443,0.00006840098,0.000030111341,0.10899422,0.8549078,0.019910306,0.009056694,0.00031172164],"about_ca_topic_score_codex":0.00014035038,"about_ca_topic_score_gemma":0.00006962282,"teacher_disagreement_score":0.65225834,"about_ca_system_score_codex":0.000040158746,"about_ca_system_score_gemma":0.000011786666,"threshold_uncertainty_score":0.29769915},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017192403,0.000110810506,0.96952045,0.009999709,0.000264669,0.00056876044,0.000019498622,0.0007498438,0.0015738499],"genre_scores_gemma":[0.90354866,0.00016403328,0.09520107,0.00068282674,0.00004908564,0.00016655582,0.000032515403,0.000018422548,0.00013682025],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984108,0.000018919469,0.00032229727,0.00061011716,0.00026829305,0.00036956594],"domain_scores_gemma":[0.99905163,0.00014406031,0.00017038843,0.00041743962,0.00015563979,0.00006082901],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016880155,0.00022873338,0.00020887122,0.00046703417,0.0002066608,0.00011154173,0.00075164466,0.00020581986,0.000018589139],"category_scores_gemma":[0.000040680985,0.00022830396,0.000046642872,0.0004345565,0.00013030108,0.00008715861,0.00017502172,0.00024504674,0.000027420281],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005634716,0.0002556286,0.000037711845,0.000018321529,0.000019544483,0.000003703554,0.000035013803,0.00078877975,0.40686473,0.53481823,0.00035832403,0.056743663],"study_design_scores_gemma":[0.00077630987,0.00047519288,0.00008052975,0.00004960641,0.0000075235175,0.000021856946,0.0000061302394,0.7784039,0.20133027,0.012989635,0.005595218,0.00026384598],"about_ca_topic_score_codex":7.360175e-7,"about_ca_topic_score_gemma":4.2546813e-7,"teacher_disagreement_score":0.8863563,"about_ca_system_score_codex":0.00008717305,"about_ca_system_score_gemma":0.000007625044,"threshold_uncertainty_score":0.93099654},"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":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000073231913,0.00093068,0.5210943,0.00022435331,0.00023283887,0.0003095434,0.00003118883,0.0005416646,0.4766281],"genre_scores_gemma":[0.00037079203,0.0020416975,0.04839935,0.00049059384,0.00008752801,0.0000148620165,0.000077609904,0.000029497949,0.94848806],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99888587,0.000009869663,0.00020626506,0.00056465616,0.00019011361,0.00014321477],"domain_scores_gemma":[0.99814665,0.000077259,0.0002076671,0.0013700383,0.00011121039,0.000087167085],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0000945396,0.0002598556,0.0002718481,0.00009743261,0.0002665675,0.00031239173,0.00090037304,0.00020803884,0.00021540925],"category_scores_gemma":[0.000025527164,0.00021472895,0.000038479935,0.000006741145,0.00012268353,0.0007788999,0.0014429522,0.0001779661,0.0001757646],"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.000009066243,0.0000076269116,0.0000071051827,0.000035988836,0.000021177953,0.00003924124,0.00003920555,0.000002076815,0.0017850016,0.8371048,0.10191474,0.059033997],"study_design_scores_gemma":[0.00013616274,0.000053702035,0.000013716757,0.00019211698,0.000005252675,0.000026150552,1.843121e-7,0.0022911124,0.01688614,0.011784815,0.9682387,0.00037194652],"about_ca_topic_score_codex":0.000008142858,"about_ca_topic_score_gemma":0.000013732073,"teacher_disagreement_score":0.86632395,"about_ca_system_score_codex":0.000040562147,"about_ca_system_score_gemma":0.000042079282,"threshold_uncertainty_score":0.8756392},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0009846225,0.000031910728,0.99434435,0.0033239226,0.00010548179,0.00062957394,0.00003919171,0.00023456446,0.00030638164],"genre_scores_gemma":[0.6663744,0.00018687964,0.33312055,0.00011691501,0.0000035407722,0.00014136528,0.0000024882177,0.000012843156,0.00004101951],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99846923,0.00034358123,0.00035333267,0.00030464877,0.00031873153,0.00021046527],"domain_scores_gemma":[0.99179995,0.0012765783,0.00036755094,0.0062703025,0.00020940666,0.00007623214],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.00045176654,0.00019095704,0.00021293687,0.00028811206,0.0015837942,0.00015864719,0.003578557,0.00007378425,0.000016987557],"category_scores_gemma":[0.00014438099,0.00013401045,0.00009905799,0.00036399806,0.0005185346,0.00071584625,0.000039996958,0.00045536636,0.000027862196],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004339873,0.0054095644,0.00014221732,0.0000629834,0.0005472357,0.000010149225,0.0017054172,0.12818179,0.11597802,0.5502694,0.0026737978,0.19458543],"study_design_scores_gemma":[0.00094595965,0.00044389183,0.00045998124,0.00027506787,0.000049504008,0.000015307285,0.00008634556,0.7979145,0.18975273,0.009019541,0.00069054303,0.00034659982],"about_ca_topic_score_codex":0.000093035414,"about_ca_topic_score_gemma":0.00004924987,"teacher_disagreement_score":0.66973275,"about_ca_system_score_codex":0.000062511055,"about_ca_system_score_gemma":0.00008572544,"threshold_uncertainty_score":0.999716},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011849813,0.0000059805925,0.9854541,0.00026343137,0.00006319432,0.00013510656,0.000012504878,0.00023450152,0.0019813674],"genre_scores_gemma":[0.5172579,0.0000053448043,0.4825714,0.00007000925,0.000011999628,0.000011875586,0.000004783079,0.0000044815556,0.00006220693],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99915546,0.000027741464,0.00019024801,0.00028334174,0.00018663917,0.00015654392],"domain_scores_gemma":[0.997859,0.000017145267,0.00021248871,0.001749939,0.00009929595,0.00006214769],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015646625,0.00008547867,0.00011057729,0.000056550198,0.00019694265,0.00017891446,0.0016963861,0.000028285489,0.00014543954],"category_scores_gemma":[0.000016753469,0.0000732249,0.00003022297,0.00003948199,0.00005569031,0.003050173,0.0005597039,0.000051367362,0.000017772618],"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.000005162815,0.00010961605,0.0018786921,0.0000142695835,0.000009441617,0.0000063122843,0.00030348625,0.000010511004,0.12598771,0.04547462,0.011168314,0.8150319],"study_design_scores_gemma":[0.0002688299,0.00007570013,0.014516806,0.00000881347,0.0000023427524,0.0000025396332,0.000052134143,0.013980021,0.9470685,0.022307668,0.0015741449,0.00014251233],"about_ca_topic_score_codex":0.00022174766,"about_ca_topic_score_gemma":0.00006581224,"teacher_disagreement_score":0.8210808,"about_ca_system_score_codex":0.000015934542,"about_ca_system_score_gemma":0.000032514257,"threshold_uncertainty_score":0.3152336},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04283154,0.00009885661,0.9534373,0.00020606232,0.00014582247,0.00018824039,0.000008447415,0.0005298774,0.0025538534],"genre_scores_gemma":[0.55316544,0.000012096199,0.44645354,0.0001789613,0.000011150055,0.0000049440214,0.000006116572,0.0000071404233,0.00016060729],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99832773,0.000059885537,0.00036159527,0.00048205198,0.00048107735,0.00028767798],"domain_scores_gemma":[0.9982254,0.0000977149,0.00014866683,0.0012153811,0.0001966869,0.000116161136],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018006339,0.00017136188,0.0002438668,0.00016945503,0.00013269945,0.000019120067,0.0010718968,0.00007364758,0.00011229719],"category_scores_gemma":[0.00007281936,0.00013757017,0.00007944062,0.00046086466,0.00015191034,0.00048459077,0.00023727698,0.00012894522,0.000021876718],"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.000092349124,0.0015101552,0.006382307,0.000112775735,0.000027445083,0.0006542147,0.00059332955,0.0018193497,0.7567578,0.07805015,0.065312736,0.08868737],"study_design_scores_gemma":[0.0005528461,0.00023082538,0.002042729,0.0000631514,0.0000030218648,0.00009044341,0.000009133501,0.028492983,0.96336967,0.0034284645,0.0014325927,0.00028412332],"about_ca_topic_score_codex":0.000045335266,"about_ca_topic_score_gemma":0.000003068486,"teacher_disagreement_score":0.5103339,"about_ca_system_score_codex":0.00002807927,"about_ca_system_score_gemma":0.00010805018,"threshold_uncertainty_score":0.56099486},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04362485,0.000045807796,0.952802,0.00052632863,0.001068358,0.00064742233,0.000045095694,0.00023543692,0.0010047004],"genre_scores_gemma":[0.8283661,0.000022217091,0.17046557,0.00040151016,0.00012813651,0.00036316089,0.000008961943,0.000021801032,0.00022255014],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9983342,0.000052608473,0.00031564204,0.00062877615,0.00025490113,0.00041384462],"domain_scores_gemma":[0.99724233,0.00014198781,0.00031592688,0.0020841684,0.00011018699,0.00010538822],"candidate_categories":["open_science"],"consensus_categories":[],"category_scores_codex":[0.00024357848,0.00020846669,0.00029566645,0.00013613507,0.00042299074,0.0008321065,0.0055749663,0.00009001273,0.000024782614],"category_scores_gemma":[0.0001145581,0.0001790151,0.00006340735,0.000098731456,0.00009539627,0.0037056976,0.0008791435,0.00018861296,0.00001935763],"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.00015913186,0.0004707155,0.008127167,0.00017512115,0.000025132205,0.00009888979,0.00037927344,0.00044103657,0.8642241,0.006550858,0.063146815,0.056201812],"study_design_scores_gemma":[0.00088704936,0.00004661212,0.005392758,0.00017885976,0.0000027205003,0.0000040578716,0.0000030043345,0.0070419316,0.9620928,0.011960283,0.012106501,0.0002833844],"about_ca_topic_score_codex":0.00010645247,"about_ca_topic_score_gemma":0.00004821858,"teacher_disagreement_score":0.7847412,"about_ca_system_score_codex":0.00005163993,"about_ca_system_score_gemma":0.000048569855,"threshold_uncertainty_score":0.99980533},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008925177,0.000030161878,0.98780835,0.0008829884,0.00047484352,0.0005076831,0.000010471304,0.00060053344,0.0007597692],"genre_scores_gemma":[0.50172263,0.0000061566343,0.49716145,0.0001796736,0.000046994825,0.00008304525,0.0000042026777,0.000010128513,0.0007857188],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986623,0.000032813867,0.00025082807,0.00051179656,0.00023047108,0.00031176908],"domain_scores_gemma":[0.9975562,0.00015757982,0.00023515441,0.0018160577,0.00014097961,0.00009401257],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030261575,0.00015100314,0.00016928722,0.00010970873,0.0006069223,0.0004309919,0.0017870349,0.00007723586,0.000013984906],"category_scores_gemma":[0.0005402281,0.00012895519,0.00006816142,0.00007471036,0.000057739322,0.001959024,0.0008354965,0.0001091256,0.000033091797],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022340716,0.0005606191,0.03217739,0.00024973683,0.000075552045,0.000031519085,0.0010528251,0.00022440814,0.30755302,0.36207157,0.0904123,0.20536767],"study_design_scores_gemma":[0.0013902825,0.00014429499,0.09054848,0.00018368059,0.0000070372676,0.000009602259,0.0000657532,0.6613756,0.099441655,0.023270441,0.122909635,0.00065353984],"about_ca_topic_score_codex":0.00010870156,"about_ca_topic_score_gemma":0.000061432074,"teacher_disagreement_score":0.6611512,"about_ca_system_score_codex":0.000049592392,"about_ca_system_score_gemma":0.000030549905,"threshold_uncertainty_score":0.525864},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0006448585,0.000043305135,0.9866432,0.003335991,0.00012087673,0.0005339638,0.000028537412,0.00051914295,0.008130101],"genre_scores_gemma":[0.10340679,0.00007408281,0.8874465,0.0005950441,0.000031000254,0.00015773403,0.000008796021,0.000019531508,0.008260495],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9988669,0.000023460252,0.00019253162,0.0004602731,0.00013296839,0.00032387493],"domain_scores_gemma":[0.99841654,0.00011432525,0.00010625173,0.0011765806,0.00006438567,0.000121940466],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033533832,0.00015835944,0.00020360951,0.00006606567,0.0006527302,0.00043063937,0.0013230768,0.00006650589,0.000026751457],"category_scores_gemma":[0.000035824534,0.00012918422,0.00003800264,0.000040821815,0.00014118968,0.0015976368,0.00035868562,0.00008080308,0.000012562578],"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.000063845866,0.000060396007,0.000086694155,0.00007127443,0.000020400304,0.00000773617,0.00014658552,0.000015125927,0.028405206,0.7374568,0.039574083,0.19409187],"study_design_scores_gemma":[0.0009539728,0.00013838762,0.00023514366,0.00003859244,0.0000043886885,0.0000057099414,0.0000110166075,0.011885739,0.49163258,0.41227922,0.08252164,0.0002936037],"about_ca_topic_score_codex":0.000063671185,"about_ca_topic_score_gemma":0.00002232989,"teacher_disagreement_score":0.46322736,"about_ca_system_score_codex":0.000019320742,"about_ca_system_score_gemma":0.00003965414,"threshold_uncertainty_score":0.52679795},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012069866,0.000007952064,0.9836593,0.0015508244,0.00018994715,0.00012733894,0.0000033292183,0.0002178185,0.0021736247],"genre_scores_gemma":[0.70151293,0.000008639048,0.29733625,0.0010474435,0.000034144745,0.0000045895285,0.0000048678294,0.000011654493,0.000039496004],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984654,0.00007218545,0.0003331483,0.00042182268,0.00047973925,0.00022768906],"domain_scores_gemma":[0.9968873,0.00012712437,0.00038719672,0.002343728,0.00010725679,0.00014736269],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003027474,0.00016022382,0.00023799071,0.00016657356,0.0002755039,0.00013913642,0.0024878527,0.00012448347,0.00007244877],"category_scores_gemma":[0.00022813387,0.000121839665,0.000074600146,0.000084743035,0.00022814753,0.0010804109,0.0010756677,0.00026658858,0.0000048379293],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00032485652,0.0023229218,0.03013531,0.00044730146,0.00006970695,0.0018587784,0.00017074605,0.0002346114,0.13757545,0.38191828,0.16339727,0.28154477],"study_design_scores_gemma":[0.0006301605,0.00014817138,0.0030394015,0.0010765435,0.0000058888904,0.000030025565,0.0000034485415,0.7648207,0.21359737,0.012627821,0.0036976268,0.0003228675],"about_ca_topic_score_codex":0.000108541746,"about_ca_topic_score_gemma":0.000011593086,"teacher_disagreement_score":0.7645861,"about_ca_system_score_codex":0.000018434046,"about_ca_system_score_gemma":0.000060971008,"threshold_uncertainty_score":0.49684775},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005227481,0.00006235282,0.99267495,0.000053805295,0.0002462659,0.00034953267,0.0000854645,0.00030883326,0.0009913456],"genre_scores_gemma":[0.09782668,0.00002093131,0.9015111,0.00010668983,0.000053353953,0.000020143854,0.000027696147,0.000018627345,0.00041477435],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99781394,0.00007677333,0.0004979304,0.0006599208,0.0005324019,0.00041905374],"domain_scores_gemma":[0.99618274,0.00013100747,0.00063900347,0.0027493807,0.00014857258,0.00014927522],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003080522,0.00026971576,0.0004002706,0.00012207019,0.0005575879,0.00023566492,0.002689961,0.0000971047,0.0005591598],"category_scores_gemma":[0.00008421206,0.00022542017,0.000096338445,0.00010634896,0.00014448694,0.0018323496,0.002657057,0.00016310399,0.000066649365],"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.0000456937,0.00061300973,0.0008222164,0.00006917504,0.00006450459,0.00002652269,0.00044213058,0.0002878921,0.50404686,0.009116358,0.011847485,0.47261813],"study_design_scores_gemma":[0.00054202246,0.00011086651,0.0007107429,0.00017604169,0.0000068972677,0.0000040092345,0.0000065074632,0.3738815,0.6100317,0.0056540277,0.008513256,0.00036240683],"about_ca_topic_score_codex":0.00072874496,"about_ca_topic_score_gemma":0.000014748102,"teacher_disagreement_score":0.47225574,"about_ca_system_score_codex":0.00005649788,"about_ca_system_score_gemma":0.000060620634,"threshold_uncertainty_score":0.9192368},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00028875237,0.00014612073,0.997235,0.0006529761,0.00017709474,0.00075594836,0.00015451355,0.00049933116,0.00009024171],"genre_scores_gemma":[0.5086247,0.00011678524,0.4910017,0.000051632043,0.000010099843,0.00014212064,0.000008522195,0.000014205628,0.00003027976],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99823177,0.00032467063,0.0005160973,0.00037272542,0.0002575967,0.0002971627],"domain_scores_gemma":[0.99460465,0.0013377238,0.00027469173,0.003213012,0.00046545404,0.00010445717],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003696953,0.00020523439,0.00026805841,0.0006971565,0.0006679441,0.00009690672,0.0031245558,0.00011690888,0.00002053971],"category_scores_gemma":[0.00006544086,0.00020567882,0.00013887529,0.0016021234,0.0003933554,0.0006394745,0.00003468443,0.00027104258,0.000020329544],"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.00027406996,0.0039180387,0.00003508286,0.00008027499,0.0006579486,0.0000031571321,0.0027428693,0.017043423,0.5914198,0.2517313,0.0011258615,0.13096812],"study_design_scores_gemma":[0.0012853356,0.0009050849,0.00009377922,0.000116581345,0.000105016334,0.000020888714,0.0000810132,0.6857072,0.29976517,0.0077948626,0.0036107472,0.00051428255],"about_ca_topic_score_codex":0.00006629661,"about_ca_topic_score_gemma":0.000004682964,"teacher_disagreement_score":0.6686638,"about_ca_system_score_codex":0.000057768517,"about_ca_system_score_gemma":0.00016038364,"threshold_uncertainty_score":0.83873385},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.042709704,0.000092279035,0.95596033,0.000097680604,0.0002964983,0.00043954008,0.000048751564,0.00013096469,0.00022424455],"genre_scores_gemma":[0.9971785,0.00006600869,0.002532436,0.00006617858,0.00004186067,0.000042403517,0.0000024880135,0.000014688279,0.00005543997],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9986513,0.00010755274,0.00033063334,0.00042651308,0.0002650821,0.00021891114],"domain_scores_gemma":[0.99906266,0.0000878183,0.00015516256,0.0004824178,0.000084156745,0.0001278],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024389807,0.00017396851,0.00023865976,0.00018272192,0.00027920486,0.000097624776,0.00026748932,0.00007913452,0.000008543185],"category_scores_gemma":[0.0000052943847,0.00015130609,0.000041830415,0.00023149089,0.00015467896,0.00028563122,0.000007847615,0.00013803307,0.0000014435559],"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.0000055306323,0.000035562254,0.000033903238,0.00013471996,0.000037384405,0.000004309533,0.001354457,0.00018115944,0.09963815,0.0018381159,0.000057832527,0.89667886],"study_design_scores_gemma":[0.0018233862,0.00076630723,0.001545754,0.0011050968,0.00006026973,0.00036855883,0.001953428,0.0105593065,0.9710433,0.00076315453,0.0090729585,0.00093846803],"about_ca_topic_score_codex":0.00006596742,"about_ca_topic_score_gemma":0.00004025717,"teacher_disagreement_score":0.9544688,"about_ca_system_score_codex":0.000026270844,"about_ca_system_score_gemma":0.000039585222,"threshold_uncertainty_score":0.6170083},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00093611516,0.00006553625,0.99436635,0.0021117786,0.00050368137,0.0007289679,0.00008368102,0.00083284854,0.00037103833],"genre_scores_gemma":[0.589029,0.00007023549,0.40995803,0.00023464963,0.00002560786,0.00041153148,0.000010019291,0.000017611164,0.00024330002],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998458,0.00017489876,0.00040332752,0.0004328156,0.00022883866,0.00030207096],"domain_scores_gemma":[0.9949626,0.0007016716,0.00015822548,0.0037177606,0.0003510429,0.0001087284],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000299765,0.00019160385,0.00018101427,0.00032655726,0.0011545684,0.00013399424,0.0024267263,0.000108360735,0.000021075162],"category_scores_gemma":[0.000052209885,0.00019743956,0.00011806228,0.0006661508,0.00023220411,0.00094918744,0.00004339547,0.0003202147,0.00009282918],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005927851,0.0069883885,0.00046168748,0.00022167427,0.00047562085,0.0000041508006,0.010178136,0.0057959934,0.29150194,0.12780951,0.0336079,0.52236223],"study_design_scores_gemma":[0.0010968496,0.0003690888,0.0011280165,0.00022091868,0.000032096865,0.000013450352,0.00019496343,0.77293116,0.09574584,0.00797552,0.11968796,0.00060414965],"about_ca_topic_score_codex":0.000078891084,"about_ca_topic_score_gemma":0.00035759143,"teacher_disagreement_score":0.76713514,"about_ca_system_score_codex":0.00012845013,"about_ca_system_score_gemma":0.00006966582,"threshold_uncertainty_score":0.88801235},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0178186,0.0006991751,0.97642887,0.0008078448,0.00007616255,0.00029230554,0.0000038357766,0.0005766465,0.003296578],"genre_scores_gemma":[0.60726297,0.000095333504,0.39180058,0.00037558476,0.00002419493,0.000011537124,0.0000020989246,0.0000073263573,0.0004203573],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.998971,0.00005693785,0.00021919556,0.00034682077,0.00023973013,0.00016635582],"domain_scores_gemma":[0.99883217,0.0002400308,0.00011118282,0.00069187675,0.000039660812,0.00008507723],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00010169868,0.00014061817,0.00020728048,0.00012486569,0.00007505569,0.000048863225,0.00048368605,0.000050409864,0.000019870691],"category_scores_gemma":[0.000040082577,0.00010447665,0.000029023016,0.00014723108,0.000082975,0.000643024,0.00049716415,0.00010817874,0.000018048206],"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.000024954445,0.00029036767,0.00035540524,0.00009774071,0.000007712409,0.000020523024,0.00016407507,0.00004886041,0.17642082,0.021083757,0.032455437,0.76903033],"study_design_scores_gemma":[0.0003758641,0.00018764335,0.0014042727,0.00018735683,0.0000021910016,0.000009440644,0.0000025827603,0.005109086,0.9656138,0.0028085771,0.02413275,0.00016644265],"about_ca_topic_score_codex":0.000016600685,"about_ca_topic_score_gemma":0.0000012730895,"teacher_disagreement_score":0.789193,"about_ca_system_score_codex":0.000013736268,"about_ca_system_score_gemma":0.00001372883,"threshold_uncertainty_score":0.4260434},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01445662,0.00020691045,0.98367554,0.0004981137,0.00019042345,0.00045368224,0.000016742715,0.00049059675,0.000011374513],"genre_scores_gemma":[0.56997097,0.0000030824112,0.42900133,0.0008180686,0.00012881267,0.00003629987,0.000004727361,0.000027894142,0.00000883749],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99754137,0.00021111575,0.00053928106,0.0007105145,0.00044115208,0.00055658753],"domain_scores_gemma":[0.99792373,0.0004483547,0.00054118596,0.0005700529,0.0003975731,0.00011908786],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007381364,0.00030374687,0.0003677418,0.0006280798,0.00034362622,0.0003092263,0.0016411227,0.00011601541,0.00000596431],"category_scores_gemma":[0.00012525757,0.00027730933,0.00009611179,0.0016030861,0.00025267544,0.0014216626,0.00017166515,0.00020323752,0.0000103118655],"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.00007289389,0.00006259976,0.000046345478,0.00008521195,0.000029998215,0.000010347679,0.00029799732,0.0024892315,0.9750778,0.00035023186,0.001687506,0.019789828],"study_design_scores_gemma":[0.0006275981,0.00042883278,0.0001644647,0.00023722858,0.00003340182,0.000015097463,0.000011624001,0.3885033,0.6071143,0.0017627189,0.00060760375,0.00049381575],"about_ca_topic_score_codex":0.000025492198,"about_ca_topic_score_gemma":1.5264791e-7,"teacher_disagreement_score":0.55551434,"about_ca_system_score_codex":0.000050064173,"about_ca_system_score_gemma":0.00015879629,"threshold_uncertainty_score":0.99996793},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00002334818,0.0006341098,0.98081535,0.000009681001,0.00005653969,0.0004252449,0.00020820786,0.00023022697,0.017597295],"genre_scores_gemma":[0.89694786,0.000089494395,0.061852004,0.00030808515,0.0006584495,0.000086037246,0.0011795514,0.00025993065,0.03861858],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984723,0.000004722285,0.0003868112,0.00059671176,0.0003186056,0.00022089508],"domain_scores_gemma":[0.99848944,0.00033305972,0.00048376812,0.0003500822,0.0002567661,0.00008689128],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000046671354,0.00034789124,0.0003729095,0.00017717743,0.00010781691,0.0008271845,0.00057833013,0.00020075947,0.000008753745],"category_scores_gemma":[0.000099738696,0.00030497034,0.00008098476,0.00005968439,0.00019367185,0.0027678204,0.0005049203,0.00013989075,0.0000024748533],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002646168,0.000011884165,0.0000049288938,0.0006820061,0.000018919533,0.000005078649,0.00012883561,0.0000062372283,0.00008164261,0.016652353,0.001022742,0.9813589],"study_design_scores_gemma":[0.00040619905,0.00041844495,0.000012302964,0.0024904262,0.00002655477,0.000018154482,0.000003881934,0.01537518,0.006070329,0.9175424,0.056889374,0.0007467265],"about_ca_topic_score_codex":2.6979515e-7,"about_ca_topic_score_gemma":1.410874e-7,"teacher_disagreement_score":0.98061216,"about_ca_system_score_codex":0.000025315567,"about_ca_system_score_gemma":0.00006577206,"threshold_uncertainty_score":0.9999402},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00008588901,0.0006539385,0.9898632,0.0010274178,0.0013863567,0.0018782273,0.00019258154,0.0014330928,0.0034792565],"genre_scores_gemma":[0.009467405,0.00013639478,0.9879606,0.0005279739,0.0002443692,0.0006408245,0.00019051936,0.000044381777,0.0007875829],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9967177,0.00015447963,0.00049025245,0.0016150301,0.0005100629,0.0005124644],"domain_scores_gemma":[0.9948102,0.00040263234,0.0005276021,0.002860521,0.0011906037,0.00020843511],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0003482228,0.00057776156,0.00062515365,0.00015557375,0.00041224246,0.00081787584,0.004931579,0.0006326347,0.000056602566],"category_scores_gemma":[0.000183289,0.00047227918,0.00016213761,0.0004675386,0.00028479254,0.0006771322,0.0082945,0.0007796015,0.00004760555],"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.00020921252,0.00041985445,0.000058266036,0.0006687381,0.0001577136,0.00003082535,0.00197825,0.0030978397,0.0017655011,0.2301472,0.46804208,0.29342452],"study_design_scores_gemma":[0.00019762003,0.00023512561,0.000035639558,0.00073435815,0.00001852526,0.000008387591,0.00010516247,0.44535217,0.18361011,0.22026792,0.14835463,0.0010803536],"about_ca_topic_score_codex":0.000016685553,"about_ca_topic_score_gemma":0.000018769093,"teacher_disagreement_score":0.44225433,"about_ca_system_score_codex":0.00018383792,"about_ca_system_score_gemma":0.0003477196,"threshold_uncertainty_score":0.9997729},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01960321,0.000043165885,0.97683454,0.000093372626,0.0005225385,0.0005702667,0.000047489513,0.00125993,0.0010254743],"genre_scores_gemma":[0.82381934,0.00005802293,0.17536537,0.0002196705,0.00007783748,0.00000538085,0.00013239434,0.00003455204,0.00028741668],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9970703,0.00028121696,0.0003365994,0.0016379609,0.00021583651,0.00045810136],"domain_scores_gemma":[0.9959675,0.00020538166,0.00053005153,0.0027134297,0.0003455382,0.00023807514],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00022224616,0.0004833643,0.0004412447,0.00041764232,0.00030501126,0.00022473051,0.00352694,0.00032400442,0.00013678824],"category_scores_gemma":[0.000050156155,0.00052508886,0.00020775304,0.0005867687,0.00022805856,0.00090125465,0.004049771,0.0005949509,0.0002226089],"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.0006868028,0.0026443554,0.009312304,0.0019533858,0.0006573674,0.0038659854,0.0014575284,0.72538686,0.057163805,0.11513553,0.051593482,0.03014257],"study_design_scores_gemma":[0.0006584615,0.000073314586,0.00039933645,0.0003371901,0.000038453196,0.00000327551,0.0000236877,0.93004185,0.029461434,0.037570655,0.00071799295,0.00067434163],"about_ca_topic_score_codex":0.00007726105,"about_ca_topic_score_gemma":0.000018020519,"teacher_disagreement_score":0.80421615,"about_ca_system_score_codex":0.00024708296,"about_ca_system_score_gemma":0.00019011305,"threshold_uncertainty_score":0.9997201},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006960465,0.0000144955175,0.9902492,0.00061327603,0.0015321221,0.0001497198,0.000004499638,0.00039961498,0.00007658042],"genre_scores_gemma":[0.0780282,0.00001339873,0.92134625,0.00031887257,0.0002753059,0.0000025240204,0.0000026359553,0.000008531527,0.0000042652578],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99792105,0.00009632282,0.0010506083,0.0001663678,0.0004647797,0.00030086585],"domain_scores_gemma":[0.99684674,0.000064623586,0.001365827,0.0006754526,0.0009512741,0.00009608566],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030916033,0.00021186209,0.000407352,0.0013901346,0.00019688367,0.00019752266,0.0020161162,0.00022465472,0.000046704154],"category_scores_gemma":[0.0000499089,0.00017262899,0.00011688318,0.00068827876,0.00012355503,0.005191957,0.001254474,0.00044940252,0.000037804897],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000069528694,0.0001191429,0.000019433806,0.00003692002,0.00006922395,0.000026562351,0.0005996706,0.000110322944,0.084631726,0.26509973,0.0064961025,0.64272165],"study_design_scores_gemma":[0.00081940007,0.0006033961,0.000059535236,0.00017468994,0.000014537787,0.0011162004,0.000030133186,0.44819152,0.4363847,0.0995862,0.012761385,0.00025830406],"about_ca_topic_score_codex":0.000002273636,"about_ca_topic_score_gemma":2.3692543e-7,"teacher_disagreement_score":0.6424633,"about_ca_system_score_codex":0.000075804965,"about_ca_system_score_gemma":0.00009532434,"threshold_uncertainty_score":0.7039606},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006259654,0.00014520819,0.9497307,0.00048651686,0.00042912248,0.0011571645,0.00022029717,0.0008007724,0.04077059],"genre_scores_gemma":[0.528481,0.00008321418,0.46465373,0.0041343924,0.00049212895,0.0001947319,0.0018041008,0.000038310503,0.00011842526],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9981498,0.00003556023,0.00069061393,0.00030368796,0.0002676861,0.0005526614],"domain_scores_gemma":[0.99866414,0.00012931273,0.00039277872,0.0005344658,0.000061223654,0.00021807234],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.000112763075,0.00031116314,0.0002870215,0.00023855943,0.00035829472,0.0010019406,0.00080918457,0.00013143191,0.000045079472],"category_scores_gemma":[0.000024079874,0.00027125978,0.000099066936,0.0003131425,0.00007187195,0.023515562,0.00043055564,0.00022972147,0.000015072362],"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.000120683566,0.000110576635,0.0035534275,0.00050802715,0.000110880326,0.000005260991,0.0012192653,0.012530332,0.00011492475,0.64173514,0.04750516,0.2924863],"study_design_scores_gemma":[0.0013753595,0.00028982825,0.0010241885,0.0007644192,0.000014351014,0.00015094173,0.000018616533,0.45432508,0.0017963398,0.054357037,0.48475546,0.0011283793],"about_ca_topic_score_codex":5.200941e-7,"about_ca_topic_score_gemma":3.5398446e-7,"teacher_disagreement_score":0.5873781,"about_ca_system_score_codex":0.000024534522,"about_ca_system_score_gemma":0.000062921565,"threshold_uncertainty_score":0.99997395},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000565684,0.000060866398,0.9981869,0.00022783186,0.0001595591,0.00042937114,0.00006726799,0.00020949403,0.00009302865],"genre_scores_gemma":[0.53070086,0.000087792665,0.46908477,0.000016404543,0.0000043633163,0.00006051898,0.0000035029766,0.000008082391,0.000033671415],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9988846,0.00017151854,0.00041975503,0.00020798162,0.00016359542,0.00015252134],"domain_scores_gemma":[0.9965156,0.0007085788,0.00024203424,0.0021258127,0.00036217345,0.000045839217],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002994294,0.00011545539,0.00020041807,0.00021400278,0.0003634306,0.000023217728,0.0020336667,0.00008059365,0.000020150374],"category_scores_gemma":[0.00001866385,0.000116371746,0.0000925113,0.00042665147,0.00040656052,0.00038412525,0.000028823526,0.00016887572,0.000006810458],"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.0004005501,0.0023675554,0.000014313564,0.00010583011,0.00034760276,6.700542e-7,0.004613225,0.08151523,0.7588343,0.060499538,0.0019295126,0.08937165],"study_design_scores_gemma":[0.00028816354,0.0002752308,0.000005726541,0.000093278235,0.00002524648,0.0000034265781,0.0000342024,0.4016158,0.5958398,0.0010631402,0.0006488572,0.00010716248],"about_ca_topic_score_codex":0.00002276542,"about_ca_topic_score_gemma":0.000005717093,"teacher_disagreement_score":0.5301352,"about_ca_system_score_codex":0.000025489922,"about_ca_system_score_gemma":0.00007287839,"threshold_uncertainty_score":0.4745502},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0019658017,0.00009553157,0.9962972,0.00012711834,0.00014731077,0.00060963875,0.000024896435,0.0005893256,0.00014318487],"genre_scores_gemma":[0.3597271,0.000008344887,0.64004827,0.00008086408,0.0000403114,0.000026140415,0.000005954638,0.000011818673,0.000051169245],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9981832,0.00012749665,0.00044754855,0.0005170938,0.00032479764,0.0003998461],"domain_scores_gemma":[0.9978109,0.00053623284,0.00027262952,0.0008763123,0.00039068086,0.00011324199],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042482212,0.00020359633,0.00030118512,0.00053905917,0.00014246213,0.00011597884,0.0014900996,0.0001036212,0.00004076803],"category_scores_gemma":[0.00038779998,0.00016891325,0.00008939055,0.0012924114,0.00017203778,0.00077064603,0.0003692565,0.000093062095,0.000015317302],"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.000087455315,0.0002376052,0.00028506,0.000035241806,0.00009371584,0.000008123851,0.00026793103,0.00021762788,0.5066902,0.46910506,0.0020490512,0.020922923],"study_design_scores_gemma":[0.0012313985,0.001037781,0.00047419412,0.000051315867,0.000027915368,0.000022013455,0.000030145997,0.4565511,0.52001226,0.01779064,0.002298621,0.00047259365],"about_ca_topic_score_codex":0.000050215644,"about_ca_topic_score_gemma":2.8000684e-7,"teacher_disagreement_score":0.4563335,"about_ca_system_score_codex":0.000026610307,"about_ca_system_score_gemma":0.000118496646,"threshold_uncertainty_score":0.6888082},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00013216525,0.00008288207,0.99507827,0.00082127133,0.0010826834,0.0004866617,0.00025720056,0.0008721432,0.0011867264],"genre_scores_gemma":[0.01644359,0.0000075167163,0.98145455,0.0008483708,0.0008375849,0.00005150508,0.00023955814,0.000019678691,0.00009763601],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9976906,0.00017039369,0.0003598503,0.001027588,0.00032853783,0.00042299394],"domain_scores_gemma":[0.9949722,0.0004593766,0.00021384329,0.0039676884,0.00021986397,0.00016698253],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006757044,0.00022938561,0.0003179222,0.00009985713,0.00043854327,0.00015427532,0.005234263,0.00009223278,0.000043709344],"category_scores_gemma":[0.00029030046,0.00019889745,0.00006293831,0.0002755499,0.00024532093,0.0011263139,0.00501453,0.00018739543,0.00006499168],"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.00011580087,0.00025272087,0.00011349035,0.000045258093,0.000030069823,0.0000061561386,0.00021493633,0.000011589913,0.010142031,0.12696546,0.37348935,0.48861313],"study_design_scores_gemma":[0.00042925155,0.00013111539,0.00061033136,0.000044025102,0.0000044396115,0.000013409197,0.0000056886556,0.34611773,0.0110914875,0.18718699,0.4540864,0.00027912413],"about_ca_topic_score_codex":0.00006129658,"about_ca_topic_score_gemma":0.00003315316,"teacher_disagreement_score":0.48833403,"about_ca_system_score_codex":0.0000330381,"about_ca_system_score_gemma":0.000063224164,"threshold_uncertainty_score":0.972665},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0040136357,0.00006790118,0.9921439,0.0009887264,0.00015815212,0.00015538438,0.0000045677825,0.0006170178,0.0018506711],"genre_scores_gemma":[0.7751466,0.000007768545,0.22432499,0.00041562712,0.000022172248,0.000019247447,0.0000049327027,0.000008988795,0.000049705635],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99874747,0.00009269034,0.00018192234,0.00051129144,0.00015649041,0.00031016304],"domain_scores_gemma":[0.9988396,0.00015582365,0.00009816841,0.00064576155,0.00011688486,0.00014372253],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017777769,0.0001972051,0.00020717768,0.00010027916,0.0001970148,0.00032893513,0.000779287,0.000034503926,0.000024011657],"category_scores_gemma":[0.00009497134,0.00016935763,0.000032591346,0.00012487535,0.00016335929,0.0008024126,0.00056148344,0.0001739022,0.000016710135],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006835011,0.00019920287,0.0056202323,0.0001546746,0.00001078767,0.000040554518,0.0006964227,0.00018134416,0.5631336,0.055361815,0.008114864,0.36641818],"study_design_scores_gemma":[0.0004261972,0.000052736617,0.0040565296,0.00010561398,0.000002340334,0.000012683204,0.000010464329,0.944078,0.0420209,0.00247207,0.0065154876,0.0002469582],"about_ca_topic_score_codex":0.000027086187,"about_ca_topic_score_gemma":0.000012940957,"teacher_disagreement_score":0.94389665,"about_ca_system_score_codex":0.00002094844,"about_ca_system_score_gemma":0.000039075803,"threshold_uncertainty_score":0.6906204},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00038500852,0.00014460113,0.9966962,0.0007264032,0.00013989657,0.0004195415,0.000038315626,0.0004209244,0.0010291425],"genre_scores_gemma":[0.60121083,0.00036657057,0.39783028,0.00007455482,0.0000018466048,0.0000671951,0.0000052049318,0.000012453904,0.00043105066],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99858534,0.0002967011,0.0003736056,0.00029120702,0.00024896336,0.00020417658],"domain_scores_gemma":[0.994445,0.00068710523,0.00020668405,0.0043855496,0.00020972785,0.00006591681],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021263024,0.00014997009,0.00021454043,0.000310011,0.00026050475,0.00004786764,0.003394001,0.00008749855,0.000054740238],"category_scores_gemma":[0.000012309984,0.00014769264,0.00007254067,0.0009584308,0.0001005326,0.00083505997,0.00003804082,0.00036451328,0.00013009274],"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.00025058768,0.005710731,0.00026783216,0.00015678637,0.00035246235,0.000008680291,0.0018612675,0.13052885,0.48694476,0.21650128,0.006622458,0.1507943],"study_design_scores_gemma":[0.0015166802,0.0007856291,0.00067142973,0.00038822446,0.000057913272,0.000028666924,0.00011290596,0.36800903,0.59075433,0.014949966,0.021774199,0.00095100905],"about_ca_topic_score_codex":0.00011090852,"about_ca_topic_score_gemma":0.000006333015,"teacher_disagreement_score":0.60082585,"about_ca_system_score_codex":0.000054593846,"about_ca_system_score_gemma":0.00012029536,"threshold_uncertainty_score":0.63069546},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.032514803,0.00022977008,0.94504017,0.0015981756,0.0037619597,0.000970659,0.000020734144,0.0025905068,0.013273251],"genre_scores_gemma":[0.14768036,0.000069862916,0.8466913,0.00075993215,0.00014219791,0.000076454744,0.00002156879,0.000027520511,0.004530777],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9982919,0.000060749502,0.00027965035,0.00061862316,0.00036391887,0.0003851485],"domain_scores_gemma":[0.9962577,0.0005372097,0.00013150986,0.002820977,0.00009406081,0.00015849264],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0002299242,0.0001899876,0.00024357672,0.0001282886,0.00006454779,0.000096044314,0.003241474,0.00011011582,0.0005516999],"category_scores_gemma":[0.00048774527,0.00017774597,0.0000715395,0.00038701473,0.000041015108,0.0010472389,0.0016451847,0.00024829086,0.0017970063],"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.0000210537,0.00013885552,0.013515574,0.000023334629,0.000022450748,0.0000316318,0.00033805773,0.000019573907,0.018887043,0.005471103,0.13470747,0.82682383],"study_design_scores_gemma":[0.0015661018,0.00044795254,0.009752191,0.000112008995,0.0000089688465,0.00004359245,0.00003876315,0.07755689,0.08130177,0.041834824,0.7861511,0.0011858494],"about_ca_topic_score_codex":0.00004974652,"about_ca_topic_score_gemma":0.000007668151,"teacher_disagreement_score":0.825638,"about_ca_system_score_codex":0.00005832046,"about_ca_system_score_gemma":0.00006953699,"threshold_uncertainty_score":0.9989802},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009015598,0.00033273455,0.9876775,0.0006532228,0.00009433673,0.00023355785,0.000010566922,0.00043627401,0.0015461753],"genre_scores_gemma":[0.74141616,0.0000527055,0.25632522,0.00021811757,0.0000091090815,0.000012030818,0.000017262155,0.000019073548,0.0019303432],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9988052,0.000051385065,0.00028060685,0.00040650903,0.00020757093,0.000248681],"domain_scores_gemma":[0.9988994,0.00006876771,0.000123795,0.0007840646,0.000048644564,0.00007529897],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00011819363,0.0001537785,0.00022898329,0.00008505224,0.00004685808,0.0000422621,0.0010132163,0.00007574633,0.00006806098],"category_scores_gemma":[0.0000047078206,0.00012782858,0.00006206023,0.00016167841,0.00004184644,0.0007298382,0.00027630638,0.00011269997,0.000095099625],"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.000013291422,0.00013751109,0.00033276016,0.000051195027,0.000015261305,0.0000052746614,0.00021419207,0.0010815709,0.77334684,0.004444402,0.013627989,0.20672973],"study_design_scores_gemma":[0.0003116309,0.00013227238,0.0004992839,0.00006579709,0.0000032554385,0.0000057325037,0.0000069651583,0.011457018,0.9571678,0.0070494316,0.023076827,0.00022400763],"about_ca_topic_score_codex":0.000022789543,"about_ca_topic_score_gemma":2.4885105e-7,"teacher_disagreement_score":0.73240054,"about_ca_system_score_codex":0.000030771273,"about_ca_system_score_gemma":0.000039666375,"threshold_uncertainty_score":0.5212698},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0016082732,0.000080625025,0.9936803,0.0005956997,0.00038774498,0.00036748665,0.00009584581,0.0009158615,0.002268176],"genre_scores_gemma":[0.15705729,0.000009976491,0.838669,0.00042519617,0.00007345057,0.000034201053,0.00036778126,0.000023676874,0.0033394252],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978394,0.000056788806,0.0003578683,0.0010187338,0.00035948056,0.00036775682],"domain_scores_gemma":[0.99574995,0.00026079817,0.00017825693,0.003584019,0.00010720189,0.000119785225],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000261234,0.00022032921,0.00026560077,0.00013554667,0.00014043423,0.00013174732,0.0029935415,0.000086323365,0.000058771297],"category_scores_gemma":[0.00004442642,0.00016390705,0.000050976192,0.0002416343,0.000024817757,0.00083465246,0.002814467,0.000100949874,0.000041754],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012199645,0.0006677274,0.0006606589,0.00012268215,0.00004842997,0.000022638762,0.00012507418,0.0012946975,0.11994924,0.42730373,0.19430234,0.25538078],"study_design_scores_gemma":[0.0004071533,0.00007816371,0.00005182665,0.00007200636,0.0000030983688,0.0000057314496,0.000010460125,0.6050597,0.070738025,0.0013164438,0.321999,0.00025837988],"about_ca_topic_score_codex":0.000036540918,"about_ca_topic_score_gemma":0.0000050824615,"teacher_disagreement_score":0.603765,"about_ca_system_score_codex":0.0000356555,"about_ca_system_score_gemma":0.000049782244,"threshold_uncertainty_score":0.6683936},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04045453,0.000036473757,0.95782846,0.000250406,0.00038800694,0.00033110756,0.00010319991,0.00042484162,0.00018299662],"genre_scores_gemma":[0.68976533,0.0001664956,0.3051864,0.0017829684,0.00015347468,0.000018146053,0.0028853312,0.000020864492,0.000020983802],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99831015,0.00017629421,0.00026752762,0.00077707536,0.000265345,0.00020362604],"domain_scores_gemma":[0.99859893,0.0002637487,0.00019342366,0.0007721707,0.000100037905,0.000071696355],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017784697,0.00018941579,0.00018986825,0.00011102167,0.00017672902,0.00026848548,0.0006770049,0.00008037078,0.00014749324],"category_scores_gemma":[0.00001619596,0.00017641569,0.000030575822,0.00019015429,0.000027660533,0.0033312268,0.001003329,0.0002105861,0.00019605998],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016113532,0.00004735694,0.0005250756,0.000025521253,0.000009301678,0.0000036748481,0.00029320995,0.00003345764,0.0009933856,0.00004689148,0.0010565222,0.9969495],"study_design_scores_gemma":[0.002348918,0.0011080824,0.02153455,0.00078354316,0.00002189858,0.00007674305,0.000108142885,0.912795,0.01732642,0.020560116,0.02240387,0.00093273097],"about_ca_topic_score_codex":0.00003991237,"about_ca_topic_score_gemma":0.0000027051879,"teacher_disagreement_score":0.99601674,"about_ca_system_score_codex":0.000030155607,"about_ca_system_score_gemma":0.000015175706,"threshold_uncertainty_score":0.7194023},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0031385857,0.00018536461,0.9895418,0.000025579586,0.0007533644,0.00031908695,0.000006159214,0.0012190958,0.0048109475],"genre_scores_gemma":[0.08282112,0.00010261165,0.91178304,0.00024703087,0.00011649852,0.000025266312,0.000487042,0.00003645941,0.0043808967],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99805164,0.000059848808,0.0004224624,0.00071659347,0.00042759458,0.0003218651],"domain_scores_gemma":[0.99834824,0.00007786023,0.00032777325,0.0009640238,0.00018586553,0.000096218246],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0001682624,0.0003222154,0.00031811142,0.0003248045,0.0002151342,0.00031079006,0.0012475306,0.0002739869,0.000030487876],"category_scores_gemma":[0.00012566875,0.00031109928,0.00010202915,0.00035538038,0.000012045552,0.0016851018,0.00015626587,0.0003419091,0.000030676834],"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.00006107552,0.00018241427,0.00012181611,0.00017122437,0.000033532808,0.000055193406,0.00067280163,0.00029147213,0.35457584,0.03640337,0.017688239,0.589743],"study_design_scores_gemma":[0.0006107402,0.00013989475,0.0025176548,0.0014723439,0.000041767227,0.00004025588,0.00022958321,0.40943253,0.5275908,0.035492167,0.020613953,0.0018182972],"about_ca_topic_score_codex":0.000111652516,"about_ca_topic_score_gemma":0.00011874826,"teacher_disagreement_score":0.5879247,"about_ca_system_score_codex":0.00015114003,"about_ca_system_score_gemma":0.0000918624,"threshold_uncertainty_score":0.99993414},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006164844,0.00014704253,0.98730195,0.0003530263,0.00019188381,0.00028523992,0.000038872506,0.00032675258,0.0051904116],"genre_scores_gemma":[0.74050957,0.00004605744,0.25853184,0.00023542802,0.000012083704,0.0000030762592,0.00021320333,0.000011902083,0.000436834],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985833,0.00006297572,0.0003207495,0.0005009723,0.00036796142,0.00016403239],"domain_scores_gemma":[0.9972254,0.00021506248,0.00025381063,0.0021801877,0.000074003154,0.000051541698],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025472444,0.00013143514,0.0002474844,0.00008455951,0.000040557476,0.00004310694,0.001891736,0.000059084923,0.000071271075],"category_scores_gemma":[0.00009547178,0.000111936126,0.000021809245,0.00024645784,0.000022259455,0.0015613122,0.0010837585,0.00019681577,0.00011541292],"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.000023551507,0.00041994298,0.0035017242,0.00010844289,0.00001447054,7.0528046e-7,0.00021576334,0.00013883894,0.6026108,0.02749295,0.30749825,0.05797456],"study_design_scores_gemma":[0.00025936813,0.00017882505,0.00048335796,0.00036397553,0.0000045365778,9.154319e-7,0.00003806523,0.52717847,0.46118397,0.00091409346,0.009130283,0.0002641177],"about_ca_topic_score_codex":0.000028816237,"about_ca_topic_score_gemma":0.0000016189969,"teacher_disagreement_score":0.7343447,"about_ca_system_score_codex":0.000019518986,"about_ca_system_score_gemma":0.00002449926,"threshold_uncertainty_score":0.45646226},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0004172743,0.00001688042,0.9967291,0.0017434392,0.00017752047,0.00016672479,0.000007070581,0.0004860833,0.00025592654],"genre_scores_gemma":[0.36637414,0.000011741016,0.6232785,0.010292915,0.000026640655,0.000006695351,0.0000063123944,0.0000021133897,9.57281e-7],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986985,0.00002613495,0.000287038,0.00030612136,0.0004522355,0.00023000476],"domain_scores_gemma":[0.99889493,0.000050228846,0.0001319532,0.00041595864,0.00022426098,0.0002826543],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00031021313,0.0001278308,0.00012916644,0.00017637959,0.0003615248,0.0005250746,0.0013775635,0.000036589765,0.0000045992524],"category_scores_gemma":[0.000077379606,0.00010737239,0.000024244759,0.0008045044,0.00021111203,0.015078999,0.0012265211,0.00013937749,0.00003246311],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000055751505,0.00022189875,0.00074494246,0.0002947701,0.0000091881775,0.000011973047,0.009952059,0.03481896,0.0126381805,0.05412284,0.02592195,0.8612075],"study_design_scores_gemma":[0.0003042804,0.00006240611,0.002655465,0.000021674354,5.9352107e-7,0.0000033549652,0.000007751267,0.9721163,0.008353817,0.00017547571,0.01615394,0.00014493374],"about_ca_topic_score_codex":0.000002055548,"about_ca_topic_score_gemma":5.459111e-8,"teacher_disagreement_score":0.93729734,"about_ca_system_score_codex":0.000018998066,"about_ca_system_score_gemma":0.00009103327,"threshold_uncertainty_score":0.99869657},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0007533085,0.000075728996,0.985932,0.01231265,0.00013854343,0.00008501483,0.000004199395,0.00012151792,0.00057702366],"genre_scores_gemma":[0.60414326,0.00003348298,0.39527023,0.0004155266,0.00011690388,0.0000018977437,0.000002055173,0.0000058055557,0.0000108077675],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99874514,0.00008853225,0.00046014905,0.00018565197,0.00039364045,0.00012689485],"domain_scores_gemma":[0.99851626,0.000091435744,0.0006572486,0.00032544337,0.00022523933,0.0001843832],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029224242,0.00010083281,0.00019244227,0.00009483856,0.000056064593,0.00009315892,0.0009555002,0.00005666293,0.000009913984],"category_scores_gemma":[0.00013683797,0.000085079126,0.00007366733,0.0003087582,0.00004868972,0.0010328698,0.00009379042,0.00024796615,0.000011922615],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005364776,0.00014787547,0.00010044298,0.000023796161,0.00004341926,0.000058385936,0.0021753605,0.00028379212,0.08616811,0.1658786,0.013139379,0.7319272],"study_design_scores_gemma":[0.0016559303,0.00066742924,0.006789507,0.00012300724,0.000032988522,0.0001621027,0.00029926244,0.8238884,0.08612233,0.041727487,0.0379998,0.0005317175],"about_ca_topic_score_codex":7.1149174e-7,"about_ca_topic_score_gemma":1.6684255e-7,"teacher_disagreement_score":0.82360464,"about_ca_system_score_codex":0.000040196406,"about_ca_system_score_gemma":0.00009262183,"threshold_uncertainty_score":0.3469426},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00018363222,0.00013753149,0.99337965,0.004835171,0.00007376374,0.00036507202,0.00009854306,0.0005791215,0.00034749357],"genre_scores_gemma":[0.49422136,0.00033474882,0.50497013,0.00030893696,0.000006882366,0.00007039993,0.000010081445,0.000013332606,0.000064106585],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998285,0.00038288767,0.00047688826,0.00034936436,0.00026479535,0.00024104901],"domain_scores_gemma":[0.9965013,0.00045752103,0.00023470586,0.0024410868,0.0002112608,0.00015406942],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013848655,0.00018974896,0.00025910238,0.00019285729,0.0003850239,0.00006351862,0.003259404,0.00009032678,0.00004159831],"category_scores_gemma":[0.00003372698,0.0001912156,0.00009556574,0.0010796743,0.00020060947,0.00070388534,0.000045131263,0.00042048626,0.000032482454],"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.00017244938,0.0020281326,0.000042236832,0.00007031216,0.00025710036,0.000017260909,0.0018686,0.07807079,0.6999377,0.14233574,0.0064857854,0.06871388],"study_design_scores_gemma":[0.0009548779,0.0004083972,0.000095943826,0.0000824519,0.000049657992,0.000014804647,0.000057834855,0.56701857,0.41987428,0.0034737454,0.0074802246,0.00048917864],"about_ca_topic_score_codex":0.00009968862,"about_ca_topic_score_gemma":0.0000036048607,"teacher_disagreement_score":0.49403772,"about_ca_system_score_codex":0.000045930865,"about_ca_system_score_gemma":0.00017166536,"threshold_uncertainty_score":0.77975464},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.026155315,0.018656343,0.7771367,0.00680803,0.009214838,0.025614075,0.005567111,0.069032,0.061815586],"genre_scores_gemma":[0.6580419,0.003461757,0.2975267,0.0060982145,0.0016442769,0.0025810206,0.0017133382,0.0019378375,0.026994973],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9633738,0.0020458908,0.0074524274,0.010057091,0.0073361374,0.009734684],"domain_scores_gemma":[0.9670106,0.0018527857,0.0051610647,0.020510722,0.002133904,0.0033308927],"candidate_categories":["metaepi_narrow","sts","scholarly_communication","open_science","research_integrity","insufficient_payload"],"consensus_categories":["metaepi_narrow","open_science","research_integrity","insufficient_payload"],"category_scores_codex":[0.0052420497,0.0063908286,0.0067576314,0.0058757863,0.002314265,0.0037694774,0.02174015,0.0054278662,0.002420641],"category_scores_gemma":[0.0017398774,0.006709063,0.002960504,0.012176954,0.002098708,0.008558858,0.013567398,0.0074225636,0.011733107],"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.0008509641,0.0056718807,0.0030850796,0.004026581,0.0017825153,0.0017289907,0.0015224703,0.00050581904,0.06084291,0.4986996,0.28906965,0.13221352],"study_design_scores_gemma":[0.005548535,0.0031444514,0.0031069696,0.0050703706,0.00070063426,0.0017813577,0.00029805157,0.09892604,0.0805876,0.043367594,0.7468679,0.010600523],"about_ca_topic_score_codex":0.0011163494,"about_ca_topic_score_gemma":0.000052017844,"teacher_disagreement_score":0.63188654,"about_ca_system_score_codex":0.0038093717,"about_ca_system_score_gemma":0.0025125332,"threshold_uncertainty_score":0.9989846},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00016052424,0.00035348395,0.9928206,0.0047254027,0.00013027256,0.00053374394,0.000028148937,0.0004223585,0.00082542317],"genre_scores_gemma":[0.11782576,0.00003900399,0.88029337,0.0015116975,0.00012140628,0.00004585124,0.000014324003,0.0000126275045,0.00013596179],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99873495,0.00006588495,0.0002791306,0.00045032575,0.00022345546,0.00024626753],"domain_scores_gemma":[0.9985824,0.00028186967,0.0001988716,0.00049845217,0.00029866077,0.0001397357],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00008801326,0.00017063435,0.00028465953,0.00003619583,0.00010490802,0.000046744786,0.0012877956,0.00008072115,0.00001933642],"category_scores_gemma":[0.000099304,0.00012444098,0.00006468211,0.0007578388,0.000060591814,0.0005760285,0.00060158485,0.0001505129,0.000004860166],"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.00024824624,0.00010554213,0.00024436854,0.00011660386,0.000037270078,0.000012419319,0.0013518217,0.016871853,0.020440886,0.3369462,0.5344703,0.08915445],"study_design_scores_gemma":[0.00019982195,0.00046416727,0.00008255485,0.00008632353,0.0000064247997,0.0000027008077,0.00007252883,0.50018936,0.3776644,0.012754404,0.10817433,0.00030301462],"about_ca_topic_score_codex":0.0000011902714,"about_ca_topic_score_gemma":8.275423e-7,"teacher_disagreement_score":0.4833175,"about_ca_system_score_codex":0.000010735998,"about_ca_system_score_gemma":0.000036949114,"threshold_uncertainty_score":0.5074556},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000113814494,0.000048024398,0.9869285,0.0018477163,0.00024075343,0.00072186696,0.00006496686,0.0024643368,0.007570022],"genre_scores_gemma":[0.022903306,0.000099944584,0.97475016,0.00086962373,0.00013573885,0.00013216268,0.0005882392,0.00005695367,0.00046387815],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99654025,0.00036725143,0.0005066346,0.0015274134,0.00064771186,0.00041073127],"domain_scores_gemma":[0.9964853,0.000188008,0.0005581548,0.0021325503,0.00041294988,0.00022304576],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.00031287322,0.00052457035,0.00054285215,0.0001894057,0.00021026211,0.0006462833,0.0029531836,0.00028878916,0.00008549026],"category_scores_gemma":[0.00014486522,0.00040456752,0.000053559306,0.00038116192,0.00007873345,0.0013562877,0.009219516,0.000985895,0.00006345159],"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.00067590707,0.00065180846,0.00043665996,0.0015696773,0.0003724872,0.00069066,0.0026919574,0.053845905,0.11040881,0.6143657,0.17411773,0.040172677],"study_design_scores_gemma":[0.001649715,0.00064045173,0.001182596,0.0022571262,0.00008639275,0.000042032738,0.00006276867,0.43126148,0.17442651,0.3617917,0.023683565,0.0029156595],"about_ca_topic_score_codex":0.0001456088,"about_ca_topic_score_gemma":0.000009017709,"teacher_disagreement_score":0.37741557,"about_ca_system_score_codex":0.00007644908,"about_ca_system_score_gemma":0.00024998153,"threshold_uncertainty_score":0.9998406},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00027133603,0.00001097069,0.7511384,0.00018086095,0.000047976464,0.0003095978,0.0000070678093,0.00055362337,0.2474802],"genre_scores_gemma":[0.02304754,0.000023448363,0.86984575,0.00025261997,0.000036895373,0.000008797981,0.000008806718,0.000029884011,0.10674627],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9986157,0.000089580186,0.00013109985,0.00054708647,0.0002584221,0.00035814647],"domain_scores_gemma":[0.99882406,0.000079529964,0.00012863603,0.000659345,0.0001379377,0.00017048062],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00005546849,0.00022000814,0.00021598309,0.00013963826,0.00020908097,0.00026289665,0.0013454309,0.000070064925,0.010864007],"category_scores_gemma":[0.000010286314,0.00019642651,0.00005085323,0.00058783265,0.00014580699,0.0033591497,0.0009192273,0.00020831704,0.00013113255],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00040826763,0.00033763025,0.0012124091,0.00008711068,0.00024274134,0.00073987315,0.0014382638,0.00085460505,0.015918238,0.05841596,0.036732603,0.8836123],"study_design_scores_gemma":[0.009385298,0.0014964929,0.0030007337,0.00068377424,0.0001237706,0.00015567464,0.0026128846,0.16765532,0.08221685,0.010469991,0.7193831,0.0028160855],"about_ca_topic_score_codex":0.0000708724,"about_ca_topic_score_gemma":0.000006986936,"teacher_disagreement_score":0.8807962,"about_ca_system_score_codex":0.00012063827,"about_ca_system_score_gemma":0.00005230714,"threshold_uncertainty_score":0.9900402},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00013500599,0.0022997374,0.99045885,0.006364333,0.000034958055,0.00037977687,0.000048452173,0.00026913092,0.000009752017],"genre_scores_gemma":[0.6640656,0.000040802643,0.3333911,0.0022309085,0.0001627013,0.00007254116,0.000019229827,0.000014878626,0.0000022208453],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978717,0.00013756445,0.00042335136,0.00053800276,0.00073139253,0.00029799636],"domain_scores_gemma":[0.99810493,0.00071752747,0.00021849554,0.0002521944,0.00015539487,0.00055144954],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005765609,0.00020953025,0.00041487374,0.000056251156,0.00029249585,0.00017435517,0.00094682834,0.00016300932,0.000023898088],"category_scores_gemma":[0.00014381255,0.00012799392,0.00005647144,0.00022877434,0.00071022136,0.00041007556,0.00020213425,0.00025514932,4.9840304e-7],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014830728,0.00011562655,0.000012869376,0.0001280799,0.000013745892,0.000010207486,0.000083151055,0.0000062708855,0.007478224,0.000079248515,0.00049679005,0.9914275],"study_design_scores_gemma":[0.0036034884,0.00042458926,0.000034739434,0.0002237337,0.000028636654,0.0000103366765,0.000041421114,0.98683935,0.0058675725,0.00071042666,0.0020426593,0.00017306159],"about_ca_topic_score_codex":0.000016150707,"about_ca_topic_score_gemma":4.778852e-7,"teacher_disagreement_score":0.9912544,"about_ca_system_score_codex":0.000011334793,"about_ca_system_score_gemma":0.00020030353,"threshold_uncertainty_score":0.52194405},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00036058985,0.00047856904,0.99326396,0.004843833,0.00002037316,0.0004839129,0.000012516809,0.00030514854,0.00023110358],"genre_scores_gemma":[0.43727782,0.000020378622,0.5595251,0.0029814763,0.00006427465,0.00008688991,0.000010417441,0.000024361332,0.000009289623],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978407,0.00034653925,0.0003529948,0.00073292287,0.00037261724,0.00035425153],"domain_scores_gemma":[0.9987778,0.00037057308,0.00021252854,0.00031319907,0.00014688938,0.00017897526],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004223308,0.00029608994,0.0002953424,0.000110282796,0.00034736347,0.00043417202,0.00078861945,0.0000816789,0.000053334614],"category_scores_gemma":[0.00007800671,0.00019125796,0.0000485619,0.0005803741,0.0001782611,0.0018092368,0.00028621315,0.00049068074,0.000007739613],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012900897,0.00010262375,0.0000065461018,0.000065679524,0.0000034642806,0.00018453847,0.0006436846,0.00013051208,0.12607644,0.00024956267,0.00116769,0.87124026],"study_design_scores_gemma":[0.00050872687,0.00022153948,0.00010324395,0.0006257048,0.000004977254,0.0000044819217,0.000066799934,0.6645322,0.3300044,0.0032118526,0.00047653227,0.00023959206],"about_ca_topic_score_codex":0.000009378919,"about_ca_topic_score_gemma":1.8232139e-7,"teacher_disagreement_score":0.87100065,"about_ca_system_score_codex":0.000027588352,"about_ca_system_score_gemma":0.00011053823,"threshold_uncertainty_score":0.7799273},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0041913595,0.000094716735,0.9930591,0.0011759596,0.000009233038,0.00012927329,0.0000020949126,0.0005029737,0.0008352945],"genre_scores_gemma":[0.09039209,0.000026150428,0.9086803,0.000837826,0.0000162763,0.0000027539918,0.0000011465013,0.000008625322,0.000034795576],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991897,0.00002119296,0.000112622714,0.00036603192,0.0001654729,0.00014497653],"domain_scores_gemma":[0.99945813,0.00003207145,0.000042021235,0.00027451728,0.00003565435,0.00015761676],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000041342086,0.0001113771,0.000121239034,0.000031170912,0.000079970945,0.00008930597,0.00040785965,0.000029652381,0.000043375298],"category_scores_gemma":[0.000009062851,0.00007688402,0.000014807447,0.000179846,0.00004724901,0.0009476952,0.00026919582,0.00009952535,0.0000072495886],"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.000098559016,0.000090904956,0.00037787957,0.00012238424,0.000022685646,0.00019145709,0.0040471503,0.00014483709,0.5786855,0.010437609,0.004805872,0.40097514],"study_design_scores_gemma":[0.00071612606,0.00043922756,0.00035652248,0.00017173296,0.000011259408,0.00007467109,0.00011857409,0.6016031,0.37472856,0.003382142,0.017856197,0.0005418977],"about_ca_topic_score_codex":0.00001723143,"about_ca_topic_score_gemma":5.3814546e-7,"teacher_disagreement_score":0.60145825,"about_ca_system_score_codex":0.00000898345,"about_ca_system_score_gemma":0.000027518132,"threshold_uncertainty_score":0.31352392},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0011700384,0.000267392,0.9953247,0.00013044155,0.00019277605,0.00093947566,0.000018746166,0.00063642923,0.0013200364],"genre_scores_gemma":[0.01684714,0.0013248343,0.9542569,0.00040372947,0.00021120158,0.0004987501,0.00079910527,0.00016618271,0.025492184],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9979446,0.000027891623,0.0003544668,0.00090853474,0.00037528243,0.000389236],"domain_scores_gemma":[0.99866575,0.00008911371,0.00027687158,0.0006097395,0.00018316714,0.00017533476],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00012408088,0.00044151035,0.00047337296,0.00025255917,0.00030878402,0.00019018979,0.0006524444,0.00024148721,0.000020325375],"category_scores_gemma":[0.00001972093,0.00033510616,0.00009302005,0.00020542782,0.000046042052,0.0009487388,0.00011372037,0.00027216252,0.0000037923783],"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.0012759118,0.00063447084,0.000008741087,0.0039436775,0.00025117677,0.00016966875,0.017856883,0.00032288165,0.18851095,0.0152887385,0.11835617,0.65338075],"study_design_scores_gemma":[0.0027190044,0.0009478663,0.00029696448,0.0030110304,0.0000619632,0.00018598403,0.000510034,0.16706993,0.7584315,0.007651805,0.056643,0.0024709185],"about_ca_topic_score_codex":0.000025737925,"about_ca_topic_score_gemma":0.000006838211,"teacher_disagreement_score":0.65090984,"about_ca_system_score_codex":0.000036678157,"about_ca_system_score_gemma":0.00007372992,"threshold_uncertainty_score":0.9999101},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008067515,0.000101708174,0.9901818,0.00052561914,0.000029938701,0.0008195011,0.000040248106,0.00021832713,0.000015323707],"genre_scores_gemma":[0.6170072,0.000006307078,0.3827977,0.000077113065,0.000027589513,0.00006871284,0.00000805012,0.000006379903,9.354853e-7],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9989056,0.0000747714,0.00030335717,0.00032560132,0.00021836652,0.0001723164],"domain_scores_gemma":[0.9993784,0.000121324374,0.00016958974,0.0001622745,0.00007720088,0.00009123503],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019402297,0.00012640325,0.0001934016,0.00005133977,0.000082900995,0.00005240877,0.0004147197,0.000026014994,0.000014140891],"category_scores_gemma":[0.0000049178334,0.00011108764,0.00003724972,0.0001118222,0.000034176494,0.00045826327,0.00016411838,0.000047393987,8.664955e-7],"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.00014476608,0.00006884319,0.00017410396,0.0003979503,0.000037040434,0.0000071847094,0.0017842127,0.0006397416,0.88682824,0.026886266,0.003394119,0.079637505],"study_design_scores_gemma":[0.0011905935,0.0005069822,0.00036069728,0.00007390279,0.00001508224,0.000005675831,0.00042351897,0.08860658,0.9077409,0.00058686745,0.00032822622,0.00016099615],"about_ca_topic_score_codex":0.000006274377,"about_ca_topic_score_gemma":1.5941556e-7,"teacher_disagreement_score":0.6089397,"about_ca_system_score_codex":0.000025693455,"about_ca_system_score_gemma":0.000027452288,"threshold_uncertainty_score":0.45300224},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00047535816,0.00013133067,0.9872562,0.0007551068,0.00019565971,0.0000788564,0.000005682064,0.0011467391,0.0099550625],"genre_scores_gemma":[0.20319909,0.000012510176,0.7936735,0.0022493422,0.000027696591,0.000018039487,0.000021861633,0.000009633675,0.00078832393],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9986803,0.00009964942,0.00019541084,0.00049662724,0.0003028692,0.00022517802],"domain_scores_gemma":[0.9982111,0.00016707093,0.000059045196,0.0013301772,0.00012860273,0.00010401822],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000114138216,0.0001281736,0.00015183589,0.000068525565,0.00010896594,0.00012768432,0.0009098064,0.000030911935,0.00030500258],"category_scores_gemma":[0.00008879428,0.00010729795,0.0000606274,0.0002916171,0.00002474474,0.0006509869,0.0008197438,0.00013109078,0.000089715904],"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.000017316033,0.00044988265,0.0005413196,0.000050218372,0.000016908329,0.00079604716,0.00005057904,0.0005870885,0.2634458,0.08034705,0.29820886,0.3554889],"study_design_scores_gemma":[0.00019392346,0.000020026388,0.00024814802,0.00004727406,0.0000012445076,0.000027660724,0.0000027353922,0.071305715,0.8443299,0.00772959,0.075928345,0.00016542857],"about_ca_topic_score_codex":0.0000069209805,"about_ca_topic_score_gemma":0.0000018053353,"teacher_disagreement_score":0.5808841,"about_ca_system_score_codex":0.000025900945,"about_ca_system_score_gemma":0.000108417444,"threshold_uncertainty_score":0.43754834},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000482586,0.00024355685,0.99797446,0.0005984689,0.000056357763,0.00020578562,0.00001538309,0.00037832558,0.000045109853],"genre_scores_gemma":[0.05718445,0.0004966408,0.9411385,0.0006581281,0.00010158727,0.000018384879,0.00035179482,0.000014419344,0.00003607842],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991165,0.0000506,0.0001491752,0.00048159368,0.000096032796,0.00010612316],"domain_scores_gemma":[0.9993501,0.0001118092,0.0000805977,0.00033859388,0.000047316345,0.00007163588],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017359627,0.00008368393,0.00009645379,0.00004379538,0.000107885244,0.0001540515,0.0003042389,0.000035803798,0.00000604332],"category_scores_gemma":[0.00023097695,0.00007901989,0.000009204695,0.00013002486,0.000024504214,0.0016026696,0.0005257628,0.000060997434,0.0000010754824],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000048060334,0.000014382794,0.00013180643,0.00006285473,0.0000051515817,0.0000013052021,0.00014450567,0.000101948295,0.011317433,0.003292538,0.0015458126,0.9833342],"study_design_scores_gemma":[0.0002119952,0.00012826659,0.00021712582,0.00001735122,0.000004726301,0.0000042038496,0.000024101531,0.9566996,0.01279867,0.0013763669,0.028385285,0.00013231998],"about_ca_topic_score_codex":0.000005139994,"about_ca_topic_score_gemma":0.0000014322594,"teacher_disagreement_score":0.98320186,"about_ca_system_score_codex":0.0000069337107,"about_ca_system_score_gemma":0.00001565006,"threshold_uncertainty_score":0.32223377},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.050726302,0.000044653276,0.94750667,0.00019000762,0.00036398228,0.00014467072,0.000028613316,0.00033102123,0.0006640721],"genre_scores_gemma":[0.7569307,0.00004465052,0.24263361,0.00018007465,0.00011798627,0.0000050532576,0.0000066030957,0.000013988237,0.00006732905],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998305,0.000038585924,0.00039147332,0.00053922395,0.00042444267,0.0003012366],"domain_scores_gemma":[0.99900585,0.00006484139,0.00023944944,0.00021814145,0.0003396726,0.00013204107],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001547076,0.0002419762,0.00019236188,0.00025275134,0.00024048552,0.0006944351,0.00070181076,0.000113270304,0.000068149544],"category_scores_gemma":[0.00005691917,0.00022964778,0.00004519284,0.00019132462,0.00011749761,0.0012272951,0.00013016906,0.00042192018,0.0000060930392],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004680465,0.00014012052,0.000075530304,0.00003020458,0.00002993276,0.00005413171,0.0003537897,0.0019661447,0.6930744,0.001394055,0.00012349294,0.30271137],"study_design_scores_gemma":[0.00026078054,0.00014858505,0.000026788437,0.00027001786,0.0000095743835,0.00008623922,0.000037113638,0.93670464,0.05840743,0.0037877667,0.00004118745,0.00021987909],"about_ca_topic_score_codex":0.000013011153,"about_ca_topic_score_gemma":8.712501e-7,"teacher_disagreement_score":0.9347385,"about_ca_system_score_codex":0.0001070418,"about_ca_system_score_gemma":0.000056793342,"threshold_uncertainty_score":0.9364764},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0015655333,0.00007914549,0.9956035,0.00026203628,0.00009428837,0.00022802282,0.00006147821,0.00033032295,0.0017756504],"genre_scores_gemma":[0.812516,0.000025684285,0.18710904,0.00014795235,0.000015098101,0.00002913602,0.000021686914,0.000013880387,0.00012152653],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9985176,0.0000765121,0.00027406603,0.0004716006,0.00035808657,0.00030215172],"domain_scores_gemma":[0.99858314,0.000095948366,0.0002139096,0.0008331952,0.00017688307,0.000096950454],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019055944,0.0002183755,0.00026123648,0.000071857605,0.00016304832,0.000068899884,0.00070043124,0.00009266817,0.000007560262],"category_scores_gemma":[0.00005108679,0.00017118665,0.00005509031,0.00034199076,0.00009491598,0.0006411889,0.0001676536,0.00020599458,0.000004397105],"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.000092021815,0.00020676499,0.00046924702,0.000058679878,0.000047209604,0.000013879799,0.0013122897,0.04211844,0.12932375,0.81735086,0.0053574275,0.0036493933],"study_design_scores_gemma":[0.00064676465,0.0003240828,0.00010888341,0.00024064368,0.000027858472,0.000035816334,0.00004509183,0.29484424,0.66839653,0.024034454,0.010696955,0.0005986679],"about_ca_topic_score_codex":0.0000063306975,"about_ca_topic_score_gemma":0.0000029956427,"teacher_disagreement_score":0.81095046,"about_ca_system_score_codex":0.00008718963,"about_ca_system_score_gemma":0.00011295921,"threshold_uncertainty_score":0.69807893},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0035626208,0.0019971768,0.99081844,0.0031585789,0.00014923334,0.00018921134,0.000016253452,0.00004878359,0.00005972074],"genre_scores_gemma":[0.12243923,0.001955131,0.87502736,0.00030971778,0.00007483946,0.000007368163,0.00014885118,0.000011534511,0.000025987565],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981604,0.00046307102,0.0006283168,0.00028325783,0.00032482986,0.00014010961],"domain_scores_gemma":[0.99621385,0.0005462606,0.00078407937,0.0016306747,0.0007191245,0.00010598252],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047032195,0.00011964308,0.00026427684,0.00011502386,0.00021131597,0.0003430875,0.0012929791,0.00006780613,0.000011017953],"category_scores_gemma":[0.0008844168,0.000107574306,0.000065629705,0.00026527254,0.00007462221,0.0024925005,0.0019052475,0.00027250036,0.0000013496395],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00035130378,0.0015304497,0.00050580146,0.0001936891,0.00015511725,0.00004403074,0.0022963148,0.00018616725,0.2978598,0.028322984,0.042409617,0.62614477],"study_design_scores_gemma":[0.0031719878,0.0003978728,0.0032587503,0.00096508226,0.000083382496,0.00048152663,0.0016244332,0.63481873,0.25730944,0.07619878,0.021148158,0.0005418649],"about_ca_topic_score_codex":0.0000055779656,"about_ca_topic_score_gemma":0.0000014125526,"teacher_disagreement_score":0.6346325,"about_ca_system_score_codex":0.000033427867,"about_ca_system_score_gemma":0.00010265466,"threshold_uncertainty_score":0.43867528},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03751192,0.000045153447,0.9594147,0.00014303999,0.0007548411,0.00066706474,0.00009398357,0.00078820024,0.00058105245],"genre_scores_gemma":[0.9189158,0.00023462148,0.07839671,0.0000972825,0.00008849131,0.000010873793,0.00059581763,0.00002934346,0.0016310617],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99731123,0.0002811885,0.00030482534,0.0016321585,0.00012544298,0.00034517018],"domain_scores_gemma":[0.99651635,0.000251781,0.00041194842,0.0021442056,0.00048597605,0.00018975968],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00022161737,0.00035243027,0.00037981968,0.00031671958,0.00038596263,0.00021576493,0.001978595,0.00033606243,0.00007602394],"category_scores_gemma":[0.00009584726,0.00042611914,0.00029277732,0.00054142706,0.00012520062,0.0013612115,0.0029616128,0.0005140012,0.000020894324],"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.00035152838,0.0010676173,0.0025301438,0.00062094355,0.00035030924,0.0008597205,0.0017069736,0.5915077,0.018820629,0.33343625,0.034125987,0.014622231],"study_design_scores_gemma":[0.0012064236,0.00010126642,0.003032799,0.0005038309,0.0001260364,0.000010150592,0.0006161942,0.9106377,0.0060157757,0.0709251,0.0056639556,0.0011608114],"about_ca_topic_score_codex":0.00013364531,"about_ca_topic_score_gemma":0.00003300812,"teacher_disagreement_score":0.88140386,"about_ca_system_score_codex":0.00043427883,"about_ca_system_score_gemma":0.0002588464,"threshold_uncertainty_score":0.99981904},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00001115143,0.00015699925,0.99104327,0.0003238136,0.00029300287,0.001784803,0.00018577545,0.0011814855,0.0050197206],"genre_scores_gemma":[0.0022029858,0.000093531075,0.9910437,0.00055759057,0.000113870396,0.003464825,0.00029471857,0.000033688866,0.0021951308],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975269,0.000108306616,0.0004176655,0.001339796,0.00025077723,0.0003565831],"domain_scores_gemma":[0.9959013,0.00040632565,0.00028607526,0.002686708,0.0005956466,0.00012396954],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00044942863,0.00033565235,0.00043866422,0.00013455236,0.0001709803,0.00041485744,0.0026435305,0.00030123,0.00006178111],"category_scores_gemma":[0.000044453005,0.00031979172,0.00012576464,0.0003688745,0.000050675157,0.0004959103,0.0050831703,0.00047512984,0.000018508426],"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.000012411475,0.00026569446,0.0000050741323,0.00021483884,0.000099714256,0.000009979384,0.00010554025,0.0018173307,0.0058259466,0.80325377,0.027135206,0.16125451],"study_design_scores_gemma":[0.00024104967,0.00004127447,0.000009772564,0.00025365557,0.000026079619,0.000011651407,0.00004773872,0.4636385,0.10507842,0.34142467,0.08837486,0.0008523033],"about_ca_topic_score_codex":0.00006855772,"about_ca_topic_score_gemma":0.000011425672,"teacher_disagreement_score":0.4618291,"about_ca_system_score_codex":0.000098000724,"about_ca_system_score_gemma":0.00042143068,"threshold_uncertainty_score":0.99992543},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.031065663,0.0000874639,0.9679104,0.00028325862,0.00014391834,0.00021872054,0.000021601394,0.00010307135,0.00016586912],"genre_scores_gemma":[0.49594787,0.0000091198435,0.50379753,0.00007358785,0.000007273685,0.000025199162,0.000036912355,0.000004128987,0.00009838099],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99909705,0.000041396874,0.00026812856,0.00028452667,0.00017451664,0.00013435469],"domain_scores_gemma":[0.9991899,0.0000851946,0.000105162435,0.00045755043,0.00012541481,0.00003674636],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000077348355,0.00008435851,0.00014940505,0.00009980712,0.000030203484,0.000022941827,0.0003882463,0.000041200212,0.000022011202],"category_scores_gemma":[0.000047800826,0.00007126964,0.000033963464,0.00026800757,0.000016692647,0.00052005006,0.00027768489,0.00006154628,4.63438e-7],"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.000046650253,0.00037341527,0.0032143898,0.00017467843,0.000013641609,0.000020792178,0.0012424813,0.0009983343,0.5219787,0.34297308,0.01950923,0.109454595],"study_design_scores_gemma":[0.00047662808,0.00007203718,0.0012093502,0.000082736144,0.0000012537278,0.0000038893277,0.000105108425,0.03011293,0.86390746,0.09836044,0.0055385274,0.00012964869],"about_ca_topic_score_codex":0.000011619442,"about_ca_topic_score_gemma":0.00001704302,"teacher_disagreement_score":0.4648822,"about_ca_system_score_codex":0.000029558872,"about_ca_system_score_gemma":0.00003514907,"threshold_uncertainty_score":0.29062918},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0034116295,0.000020908516,0.99358463,0.0012409643,0.00008973539,0.00041684863,0.00001970857,0.00059144193,0.0006241219],"genre_scores_gemma":[0.12889571,0.000004544072,0.8693726,0.0011304182,0.00006547172,0.00002025736,0.000022026908,0.00001729906,0.00047163735],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987005,0.000051900806,0.00025992168,0.00046865668,0.00020384903,0.0003151999],"domain_scores_gemma":[0.99894696,0.00008811213,0.00009227104,0.00066434115,0.000108996064,0.00009929722],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024242212,0.00018730738,0.00016698937,0.0001349157,0.00015912611,0.00016925628,0.0007411735,0.00009690458,0.000056109206],"category_scores_gemma":[0.000035045832,0.00015704562,0.00006452565,0.00018809632,0.00004083619,0.0026430758,0.00026158118,0.00011619799,0.000024245073],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004424953,0.00013716487,0.000008543579,0.00004932314,0.000020434754,0.000008661822,0.0010125466,0.17716545,0.089943916,0.060048506,0.025745561,0.6458157],"study_design_scores_gemma":[0.0002029928,0.000026229161,0.0000104074725,0.000036370468,0.000003863133,0.000017677903,0.000014796628,0.91343987,0.068446904,0.016393602,0.0011960077,0.00021127303],"about_ca_topic_score_codex":0.000013897524,"about_ca_topic_score_gemma":0.000008545869,"teacher_disagreement_score":0.7362744,"about_ca_system_score_codex":0.00007987839,"about_ca_system_score_gemma":0.00004860581,"threshold_uncertainty_score":0.64041346},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00001197103,0.00077097176,0.9140326,0.00030198973,0.0010999533,0.0005332073,0.000014138587,0.0014674055,0.08176779],"genre_scores_gemma":[0.0017834749,0.000422837,0.96634537,0.0011669946,0.00036732102,0.000050251543,0.00002183632,0.00007303357,0.029768877],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9938156,0.00007154318,0.00091917475,0.0026252237,0.0017028725,0.0008655903],"domain_scores_gemma":[0.994315,0.00025343508,0.00054002623,0.004130716,0.00044822914,0.00031258288],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":["open_science"],"category_scores_codex":[0.001102046,0.00075245544,0.0008608235,0.0013312065,0.00036594068,0.00069904333,0.008238022,0.0003982654,0.00011894986],"category_scores_gemma":[0.000049898597,0.000722038,0.00017784518,0.00080000545,0.00091168564,0.002176956,0.009193801,0.0011791443,0.00010819132],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000027367976,0.000052891373,0.0000070484334,0.000036947647,0.0000048878815,0.00029461048,0.00008930296,0.000050475228,0.00090965634,0.25640237,0.0058415243,0.73630756],"study_design_scores_gemma":[0.00052191206,0.00038504147,0.00023473545,0.0064256135,0.000014503554,0.00041794448,0.0000017071644,0.07178311,0.06432502,0.31242782,0.5402783,0.0031842918],"about_ca_topic_score_codex":0.000009336655,"about_ca_topic_score_gemma":0.000007913975,"teacher_disagreement_score":0.73312324,"about_ca_system_score_codex":0.00045879712,"about_ca_system_score_gemma":0.000747479,"threshold_uncertainty_score":0.99952304},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00045265953,0.00007121072,0.9967482,0.00064346654,0.0002875317,0.0004172266,0.00001467895,0.00091977854,0.0004452574],"genre_scores_gemma":[0.10839639,0.000019643638,0.88985956,0.00041454623,0.0000648174,0.00010351339,0.000014426474,0.000015065994,0.0011120203],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988404,0.000044136526,0.00022927544,0.00042652505,0.00018857882,0.00027111484],"domain_scores_gemma":[0.9989201,0.00014548814,0.00009504082,0.0006453499,0.00011603553,0.00007798651],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015786279,0.00013403813,0.00013660581,0.00009294999,0.00013353229,0.00010644794,0.0007116529,0.000049125993,0.00010926199],"category_scores_gemma":[0.00009674344,0.000111018584,0.000054611166,0.00028721933,0.000023564653,0.00024623383,0.00022353776,0.00006035589,0.00008794424],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016155504,0.00050577946,0.000036236917,0.00004145811,0.000022223941,0.000009411051,0.00042210927,0.0077731055,0.06843812,0.66700166,0.07337941,0.1823543],"study_design_scores_gemma":[0.00024882532,0.00006812958,0.000046632867,0.000011533365,0.0000020560572,0.0000022884046,0.0000032800328,0.89583564,0.08631441,0.0019338733,0.015383091,0.00015027175],"about_ca_topic_score_codex":0.00000444948,"about_ca_topic_score_gemma":8.06312e-7,"teacher_disagreement_score":0.8880625,"about_ca_system_score_codex":0.000036980768,"about_ca_system_score_gemma":0.000008230462,"threshold_uncertainty_score":0.45272064},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.001543612,0.00002029037,0.9972277,0.00016604528,0.000074832606,0.0005310421,0.00007501272,0.00030978132,0.000051655596],"genre_scores_gemma":[0.1815662,0.0000019036554,0.81796163,0.00018145636,0.000048322596,0.00005500533,0.00016444676,0.000008709877,0.000012311435],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987776,0.00006424532,0.0003661568,0.0003415636,0.00029221515,0.0001581969],"domain_scores_gemma":[0.9989223,0.00015247121,0.00024125949,0.00032420317,0.00029479456,0.0000649839],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017912735,0.0001197554,0.00015350507,0.00012688075,0.000106972955,0.000042917876,0.0004869817,0.0000363507,0.000044498855],"category_scores_gemma":[0.000010715765,0.00010900668,0.000042510143,0.00019567454,0.000029398507,0.001777715,0.00015886275,0.00004800115,0.000003936319],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013070127,0.00010656358,0.000017296694,0.000005595893,0.000007701154,2.4978806e-7,0.00013360904,0.0078106923,0.0025771381,0.06472846,0.0014312579,0.92316836],"study_design_scores_gemma":[0.00054720853,0.00028017885,0.0006636582,0.000015475156,0.000003311946,0.00000271474,0.000058814134,0.879958,0.10714931,0.009240641,0.0019552633,0.0001254605],"about_ca_topic_score_codex":0.000031896252,"about_ca_topic_score_gemma":0.000013910746,"teacher_disagreement_score":0.9230429,"about_ca_system_score_codex":0.000045241333,"about_ca_system_score_gemma":0.00005693726,"threshold_uncertainty_score":0.44451633},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000024059882,0.008472566,0.79308504,0.00034039488,0.00008120069,0.0014569212,0.001165617,0.00038272055,0.1949915],"genre_scores_gemma":[0.756142,0.0063016717,0.22790141,0.0008958593,0.00016304775,0.00051688723,0.0019793238,0.00019124919,0.0059085316],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979832,0.00019303134,0.0006050035,0.0005015252,0.00052273256,0.00019447289],"domain_scores_gemma":[0.9914078,0.00046529382,0.0007556844,0.0070304056,0.00022518741,0.00011563016],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006899508,0.0003083333,0.00036749555,0.000072076204,0.00022784613,0.000080107675,0.0044427477,0.00017719135,0.0000023396274],"category_scores_gemma":[0.00003080639,0.00023022457,0.00004146915,0.000052884974,0.00025643117,0.00033242238,0.0020426936,0.00039392264,0.000011608311],"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.00001176138,0.000014750664,0.0000017851752,0.000021518672,0.000018647637,2.3746603e-7,0.00013129153,0.000004549565,0.000060689144,0.86586577,0.0015510826,0.13231792],"study_design_scores_gemma":[0.00032870323,0.00007040727,0.00006726981,0.0015068735,0.00006315346,0.000025434572,0.000030770894,0.009745765,0.0008678549,0.5770723,0.40965617,0.00056530104],"about_ca_topic_score_codex":0.000108482556,"about_ca_topic_score_gemma":0.000029016115,"teacher_disagreement_score":0.75611794,"about_ca_system_score_codex":0.00009092332,"about_ca_system_score_gemma":0.00008031058,"threshold_uncertainty_score":0.9388286},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0005961526,0.0003505121,0.9933023,0.0016362016,0.00002110785,0.00023729872,0.000008095358,0.0005754801,0.0032728377],"genre_scores_gemma":[0.12450451,0.00037298846,0.87438697,0.00024884427,0.000017372296,0.000032727366,0.000016440152,0.000011859575,0.0004082656],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990676,0.000037275237,0.00021086413,0.00028359322,0.00020811275,0.00019256293],"domain_scores_gemma":[0.99945843,0.000045717217,0.000059034555,0.00029140615,0.000042891883,0.000102502614],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00009564148,0.00012814223,0.000119990305,0.00006708471,0.00013294119,0.00009523087,0.0003804758,0.00005555327,0.00012522718],"category_scores_gemma":[0.000010052306,0.000100099576,0.000025470677,0.00016371568,0.000044650915,0.0018587401,0.000069686896,0.000117814925,0.000017701865],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000046843943,0.0000754835,0.0000040653986,0.000036433543,0.0000040384443,0.000011825019,0.00103522,0.0000010155749,0.05205496,0.009096301,0.020454872,0.9172211],"study_design_scores_gemma":[0.00046476547,0.000119719116,0.000017307568,0.00008258211,0.0000034982609,0.000046453373,0.00003125431,0.5455075,0.399902,0.002085054,0.051459394,0.00028047644],"about_ca_topic_score_codex":0.0000035093935,"about_ca_topic_score_gemma":1.8715753e-7,"teacher_disagreement_score":0.9169406,"about_ca_system_score_codex":0.000013789848,"about_ca_system_score_gemma":0.0000038070036,"threshold_uncertainty_score":0.40819424},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000073720636,0.00061134633,0.98836416,0.000081001686,0.0017792898,0.0012218375,0.00008727293,0.001533459,0.006247918],"genre_scores_gemma":[0.000102865,0.00004524375,0.9727859,0.0001813957,0.00023720763,0.00014596595,0.001323591,0.00007254422,0.025105296],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.996651,0.000044601784,0.00069174176,0.0012337699,0.0007418128,0.00063710654],"domain_scores_gemma":[0.99685067,0.0003177661,0.0004698557,0.0016216814,0.00040736236,0.0003326625],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00029335168,0.0005752005,0.0005861266,0.00055970304,0.00026567542,0.000269517,0.0028440482,0.00043835054,0.00008627268],"category_scores_gemma":[0.000042188374,0.0004919556,0.00024549992,0.00053142756,0.000031773958,0.0005231703,0.0005095388,0.00043835706,0.00007251019],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000040595718,0.00015309047,2.1118187e-7,0.00010236358,0.000021400836,0.00003931535,0.000182564,0.00004028451,0.0072475034,0.009075749,0.1471764,0.8359205],"study_design_scores_gemma":[0.0016359395,0.00040827788,0.00012987407,0.0011933792,0.00005448729,0.000024596877,0.0002111984,0.38839722,0.44002393,0.012804747,0.15304692,0.0020694286],"about_ca_topic_score_codex":0.000068606176,"about_ca_topic_score_gemma":0.000009138011,"teacher_disagreement_score":0.8338511,"about_ca_system_score_codex":0.000111779,"about_ca_system_score_gemma":0.00030606266,"threshold_uncertainty_score":0.99975324},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005775592,0.000029242477,0.9888417,0.0006148428,0.00026909143,0.00044854017,0.00011200047,0.0006158658,0.0032931105],"genre_scores_gemma":[0.75436014,0.000045763783,0.24520075,0.00003314182,0.000025076863,0.000037872698,0.000019030576,0.00001903327,0.00025918183],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99831903,0.00015755296,0.00043510043,0.00042740096,0.0003200409,0.00034085123],"domain_scores_gemma":[0.9961392,0.00033865703,0.0001828253,0.0030873572,0.00014459359,0.00010733973],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.00012734749,0.0002502144,0.0002438021,0.00039192915,0.0013254051,0.00018287628,0.0019819362,0.00010112028,0.00013859387],"category_scores_gemma":[0.000004178143,0.00026755474,0.00016050515,0.0007490205,0.0002625953,0.00046097633,0.000058484035,0.00044420102,0.00015883174],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000030880256,0.00231776,0.000018768085,0.000017754102,0.00008518552,0.0000080214,0.00049866125,0.41023082,0.52891785,0.045364723,0.0021383918,0.010371191],"study_design_scores_gemma":[0.00037527617,0.000043002052,0.00007959722,0.000071630995,0.00004011696,0.000028133494,0.000037584603,0.9291696,0.06764302,0.00096478476,0.0012093873,0.00033786177],"about_ca_topic_score_codex":0.00012838653,"about_ca_topic_score_gemma":0.000037440397,"teacher_disagreement_score":0.74858457,"about_ca_system_score_codex":0.00022443144,"about_ca_system_score_gemma":0.000095227515,"threshold_uncertainty_score":0.99997765},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00577593,0.00002659207,0.9891397,0.00014587128,0.00011828741,0.00017501994,0.0000027642532,0.00039530944,0.004220525],"genre_scores_gemma":[0.54205424,0.000010065845,0.45764747,0.00014314395,0.0000045893153,0.000010035786,0.0000040700384,0.0000041992575,0.00012217184],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9989509,0.00010400841,0.0002277744,0.00033399227,0.00016667438,0.0002166332],"domain_scores_gemma":[0.9992575,0.000080426056,0.00006528814,0.00048381355,0.000048853977,0.00006409671],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020918109,0.000108758446,0.00013184124,0.000102547514,0.00004067803,0.00005904767,0.00047999262,0.000052517484,0.00016092857],"category_scores_gemma":[0.00012620026,0.00009841842,0.0000246619,0.00033618612,0.000047750273,0.00062032527,0.0001181811,0.00010596879,0.000040927887],"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.0000031640827,0.00008499153,0.0010897829,0.0000047863045,0.0000018996988,0.000012157534,0.00006632581,0.00033540247,0.011514468,0.982719,0.0008891793,0.003278842],"study_design_scores_gemma":[0.0012029028,0.000114438524,0.0024111255,0.000042430933,0.0000024003266,0.000030700852,0.000044158565,0.26478016,0.67948,0.028622663,0.022719746,0.0005492713],"about_ca_topic_score_codex":0.0000126970435,"about_ca_topic_score_gemma":0.000005489487,"teacher_disagreement_score":0.9540963,"about_ca_system_score_codex":0.000036640497,"about_ca_system_score_gemma":0.000057595524,"threshold_uncertainty_score":0.4013387},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00000921216,0.00094409485,0.9519444,0.00025675708,0.0018258538,0.00038258484,0.00001642874,0.00073428,0.043886367],"genre_scores_gemma":[0.00096466905,0.00031000824,0.96264654,0.00086384395,0.00036792617,0.000023080698,0.000023160503,0.00005825988,0.034742493],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9940191,0.000056224897,0.0008274645,0.0025089101,0.0017558492,0.00083248876],"domain_scores_gemma":[0.99485123,0.00023620208,0.00045376754,0.0037133943,0.000413311,0.00033210922],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":["open_science"],"category_scores_codex":[0.0008859033,0.0006686379,0.0007605104,0.0010297202,0.00034185365,0.0007234633,0.007883754,0.00033374495,0.00012454172],"category_scores_gemma":[0.000039463284,0.00064062764,0.00015459195,0.0007165265,0.00085906126,0.0020021396,0.008940695,0.0010600017,0.00016559767],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000002314196,0.00006075644,0.0000059637314,0.00003230761,0.000005803077,0.00047830274,0.00012428878,0.00032817587,0.00034569416,0.27930632,0.0038150442,0.71549505],"study_design_scores_gemma":[0.00071527855,0.000258273,0.00022341342,0.003811515,0.000010243517,0.0003970981,0.0000016286522,0.42383027,0.0098486645,0.277835,0.28053033,0.0025382782],"about_ca_topic_score_codex":0.000009184081,"about_ca_topic_score_gemma":0.0000054504258,"teacher_disagreement_score":0.7129567,"about_ca_system_score_codex":0.00036058348,"about_ca_system_score_gemma":0.000680481,"threshold_uncertainty_score":0.9996045},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5808294,0.00015185455,0.38142928,0.011730498,0.0017966413,0.0017985934,0.0002530207,0.00052874396,0.021481972],"genre_scores_gemma":[0.9898662,0.000120781166,0.009358427,0.00039411752,0.00006150059,0.00005479047,0.000014934319,0.000019484785,0.00010976265],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9978643,0.00002301713,0.00077575544,0.0005263282,0.000530313,0.00028029238],"domain_scores_gemma":[0.99789375,0.00006168561,0.00075711095,0.00031373446,0.00090058445,0.00007313555],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031098555,0.0002604292,0.000327113,0.00045122817,0.00007781813,0.00012584633,0.0021769544,0.00012115674,0.00006945765],"category_scores_gemma":[0.00026868875,0.00022046069,0.00012419558,0.0004576396,0.0001866961,0.0009978145,0.00041838476,0.00036960636,0.000022694929],"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.00070373033,0.0028173074,0.037033685,0.000664156,0.00024704688,0.000052302108,0.003720094,0.00018627364,0.0900798,0.3918433,0.008423143,0.46422917],"study_design_scores_gemma":[0.003578516,0.0003597631,0.009491436,0.007305712,0.00002145366,0.00014634286,0.00027627274,0.0022097928,0.594852,0.38035592,0.0006379296,0.0007648902],"about_ca_topic_score_codex":0.00011481874,"about_ca_topic_score_gemma":0.000032635984,"teacher_disagreement_score":0.5047722,"about_ca_system_score_codex":0.00022850186,"about_ca_system_score_gemma":0.00012342566,"threshold_uncertainty_score":0.89901257},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06974434,0.000055476572,0.9285294,0.000028783978,0.000059212824,0.00020319216,0.0000024874223,0.00015139411,0.0012257507],"genre_scores_gemma":[0.5526464,0.00009943821,0.44714546,0.00003014902,0.0000034631491,0.000008327697,0.0000053256153,0.0000065240224,0.000054943237],"study_design_codex":"observational","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9990017,0.000054663204,0.00028790612,0.0003124277,0.00018534265,0.00015796562],"domain_scores_gemma":[0.99931484,0.000035362762,0.00006692942,0.00047358478,0.000046071127,0.000063223044],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017425619,0.000109819564,0.00016218812,0.00016332942,0.000025474832,0.00003577572,0.00031238695,0.000056604888,0.000042640335],"category_scores_gemma":[0.000044298842,0.000096646734,0.00001978052,0.000237305,0.00005611143,0.0006201021,0.00021196785,0.00008288889,7.308678e-7],"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.00002930622,0.00071133155,0.76745814,0.00025440007,0.00003884467,0.00014716518,0.0010993064,0.018659256,0.04972736,0.05386103,0.0015499769,0.10646388],"study_design_scores_gemma":[0.0008505553,0.00025504784,0.107205406,0.00026136302,0.000009246002,0.00007751003,0.000037366775,0.11786356,0.7702129,0.0024990633,0.0001088527,0.00061917567],"about_ca_topic_score_codex":0.0000053202616,"about_ca_topic_score_gemma":0.000009622206,"teacher_disagreement_score":0.7204855,"about_ca_system_score_codex":0.00002568536,"about_ca_system_score_gemma":0.000025743317,"threshold_uncertainty_score":0.39411393},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015083848,0.00032341454,0.97960836,0.00014817648,0.0005834272,0.0026084143,0.000054199416,0.00071644824,0.0008737425],"genre_scores_gemma":[0.18112905,0.00011520643,0.80175835,0.00028376075,0.000086422544,0.001884715,0.0014386288,0.00007807552,0.013225802],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99756825,0.00005313566,0.00049928145,0.0010253817,0.00042370782,0.00043025825],"domain_scores_gemma":[0.9978713,0.00018146657,0.00047539666,0.00087372266,0.00041655477,0.00018155335],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00017774427,0.0004436186,0.00046810514,0.00021404383,0.000279951,0.00031281827,0.0007835451,0.00024263322,0.000040206567],"category_scores_gemma":[0.00012712867,0.0003505454,0.00006287754,0.0001729551,0.00005467856,0.0012616304,0.00017579274,0.00025878518,0.000011525781],"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.0013667429,0.0006940152,0.00044464518,0.0024431767,0.00034348312,0.00003995394,0.010251867,0.0002688242,0.19088295,0.15893437,0.22399606,0.41033393],"study_design_scores_gemma":[0.007873002,0.0033830723,0.0064396695,0.0062937294,0.00026378536,0.00008984275,0.008344314,0.29806757,0.5105843,0.024286179,0.12875906,0.005615445],"about_ca_topic_score_codex":0.00014810127,"about_ca_topic_score_gemma":0.0003024189,"teacher_disagreement_score":0.40471846,"about_ca_system_score_codex":0.00011988968,"about_ca_system_score_gemma":0.00013513817,"threshold_uncertainty_score":0.9998947},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000054413624,0.0004553253,0.99193513,0.00027559555,0.00091538526,0.00031924417,0.000028594313,0.0017966226,0.0042196847],"genre_scores_gemma":[0.0066599706,0.00006543015,0.991919,0.00033247014,0.00018244753,0.000100638026,0.000057555102,0.00002634275,0.00065616344],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9972438,0.0001325476,0.0004221749,0.0013319891,0.00049124705,0.0003782185],"domain_scores_gemma":[0.996669,0.00015202354,0.00028308245,0.0024731436,0.0002764798,0.000146285],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.00025947453,0.00037321422,0.00044450196,0.00014506666,0.00010611948,0.00044922225,0.0028520562,0.00027257585,0.00010741158],"category_scores_gemma":[0.00008113492,0.000349514,0.00016763405,0.0002711096,0.000046879064,0.0006550748,0.0139323305,0.00092290336,0.00003515922],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000017569952,0.00008864613,0.00001085041,0.000044089476,0.00005240163,0.00019620528,0.00032495763,0.00013790562,0.00047330448,0.024554288,0.004417993,0.9696976],"study_design_scores_gemma":[0.00024804345,0.00010130419,0.00042818376,0.000929819,0.000019966612,0.00006579201,0.00017111356,0.8658012,0.06466786,0.057112254,0.008880293,0.0015741573],"about_ca_topic_score_codex":0.00014094007,"about_ca_topic_score_gemma":0.000006468115,"teacher_disagreement_score":0.96812344,"about_ca_system_score_codex":0.00012121249,"about_ca_system_score_gemma":0.00024203116,"threshold_uncertainty_score":0.9998957},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000012264203,0.00080227247,0.92790836,0.00032918088,0.0010500406,0.0005523412,0.000014326326,0.0014912003,0.06784004],"genre_scores_gemma":[0.0021256637,0.00043196467,0.96972734,0.0013879713,0.0003734729,0.000056426852,0.000022757944,0.00007822944,0.025796192],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9937227,0.00007374227,0.0009452786,0.0026779752,0.0017190935,0.0008612444],"domain_scores_gemma":[0.99419,0.00028843028,0.00053618086,0.004213412,0.00045491793,0.00031706915],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":["open_science"],"category_scores_codex":[0.0011462893,0.00075542263,0.00085575075,0.001365261,0.00036048924,0.0007401762,0.008338032,0.0004001098,0.00012260172],"category_scores_gemma":[0.000057708814,0.0007247051,0.00017716597,0.00080990774,0.00090601534,0.0023428167,0.009304545,0.0011742845,0.00010695367],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000029738442,0.000053428976,0.000006394801,0.000037650178,0.000004641714,0.00028556984,0.00008811122,0.000048448488,0.0011650992,0.26340783,0.0057060025,0.72919387],"study_design_scores_gemma":[0.0005045321,0.00036382096,0.0001821447,0.006397197,0.000013529804,0.00038569575,0.0000016677209,0.062985845,0.08716496,0.3353774,0.5036143,0.003008911],"about_ca_topic_score_codex":0.000010804726,"about_ca_topic_score_gemma":0.000008257207,"teacher_disagreement_score":0.7261849,"about_ca_system_score_codex":0.00043752883,"about_ca_system_score_gemma":0.00071341713,"threshold_uncertainty_score":0.9995204},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00616452,0.000084779385,0.9911633,0.0008303911,0.00009884698,0.00034125493,0.000023468181,0.00040783218,0.0008855939],"genre_scores_gemma":[0.8001285,0.000011073987,0.1995287,0.00011175872,0.000061915845,0.000047789214,0.000012634819,0.000011732703,0.000085863714],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9982035,0.000008458079,0.00040060183,0.00052513555,0.00052957574,0.00033271857],"domain_scores_gemma":[0.99832916,0.0001890072,0.00033861323,0.00030554298,0.00073034107,0.000107349675],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019088254,0.00020199224,0.0003258103,0.00029883135,0.000103713945,0.00012326887,0.0016392203,0.00015440486,0.000023303906],"category_scores_gemma":[0.00062863505,0.00017811812,0.000072128954,0.0007372785,0.00015796079,0.0006559565,0.00025244663,0.0001835104,0.000001084032],"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.00009525633,0.00021462426,0.015852546,0.0007315164,0.000021330268,0.000013060276,0.00020645393,0.00001640665,0.16583441,0.4862378,0.06770724,0.26306936],"study_design_scores_gemma":[0.0013808843,0.00026199632,0.004817662,0.00055296527,0.000015214359,0.00002370684,0.000037586964,0.21402289,0.6644552,0.109380625,0.004490506,0.0005607871],"about_ca_topic_score_codex":0.000018205768,"about_ca_topic_score_gemma":0.000002834127,"teacher_disagreement_score":0.793964,"about_ca_system_score_codex":0.00003989382,"about_ca_system_score_gemma":0.00020239083,"threshold_uncertainty_score":0.72634465},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00046424265,0.000229569,0.983684,0.00012277391,0.00010457091,0.00013257559,0.0000038235125,0.00032089697,0.0149375675],"genre_scores_gemma":[0.11475239,0.00009744823,0.88197434,0.00023004782,0.000014528182,0.000012607405,0.0000023630853,0.000012356112,0.002903918],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99889296,0.00006194353,0.00024032882,0.0003368382,0.00025524665,0.00021270268],"domain_scores_gemma":[0.9990094,0.00006116353,0.000079636404,0.00069542875,0.000063763146,0.00009066084],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017204165,0.00013101054,0.00017069957,0.00010406922,0.00005205071,0.000035852092,0.0007160349,0.00005771062,0.000516499],"category_scores_gemma":[0.000027203307,0.00010141171,0.000056200144,0.0002980321,0.000040321123,0.0008069369,0.000117423784,0.00009442246,0.000015664078],"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.00002568819,0.0006082489,0.0002455741,0.00010965255,0.000027195205,0.00003919759,0.0006699653,0.0033648931,0.31728005,0.23569752,0.11175377,0.33017823],"study_design_scores_gemma":[0.00025374247,0.00006715429,0.00017072038,0.000056155677,0.000002378179,0.000010121156,0.0000069822213,0.0072411783,0.90402913,0.010976801,0.07697753,0.00020812654],"about_ca_topic_score_codex":0.000015081009,"about_ca_topic_score_gemma":3.392716e-7,"teacher_disagreement_score":0.586749,"about_ca_system_score_codex":0.000018978835,"about_ca_system_score_gemma":0.000050653434,"threshold_uncertainty_score":0.5655302},"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":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[1.0698087e-8,0.0001103399,0.484566,0.00014003494,0.00018110232,0.000117164935,0.000012813695,0.0006867464,0.5141858],"genre_scores_gemma":[0.000012363552,0.00015452116,0.42486778,0.00015585462,0.000073943695,0.000006686527,0.000022045873,0.000027093376,0.57467973],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99834394,0.000010392899,0.00027916345,0.0007299177,0.00041160523,0.00022497876],"domain_scores_gemma":[0.99538857,0.0000615967,0.00041254575,0.0038847842,0.0001223133,0.00013022238],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.000102653845,0.00035794987,0.0003738936,0.00014313275,0.0002557354,0.00032771987,0.0041268375,0.00027611994,0.00060391414],"category_scores_gemma":[0.000024042998,0.00028975817,0.00012758056,0.0000060083207,0.0001272237,0.0010945515,0.0031354683,0.00043606933,0.00087600347],"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.0000016245787,0.0000063435605,1.6269229e-7,0.000013419768,0.0000072683843,0.000057829788,0.000006356608,9.619256e-8,0.00055378134,0.7182042,0.1657275,0.115421414],"study_design_scores_gemma":[0.0000673644,0.000020787846,0.0000024246772,0.00023111663,0.0000033067486,0.0000132638215,1.0021837e-7,0.0009006898,0.002038467,0.26456618,0.7318432,0.00031309415],"about_ca_topic_score_codex":0.0000052808537,"about_ca_topic_score_gemma":0.0000017765224,"teacher_disagreement_score":0.5661157,"about_ca_system_score_codex":0.000037643582,"about_ca_system_score_gemma":0.00005258456,"threshold_uncertainty_score":0.9999555},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002483202,0.00009406543,0.9910533,0.00005809674,0.0010959636,0.00095050887,0.00004523935,0.00081850175,0.0034011519],"genre_scores_gemma":[0.02367192,0.00004925622,0.9684557,0.00012176151,0.0001242399,0.00013926078,0.0048412704,0.000059537615,0.0025370973],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975232,0.00008975472,0.00071786257,0.00086415897,0.0003107831,0.00049425487],"domain_scores_gemma":[0.9977576,0.00039293474,0.00069787056,0.0006970684,0.00036193253,0.00009260491],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00032567958,0.00040503292,0.00049541437,0.0006974404,0.00028320536,0.00038013468,0.0010302877,0.00032805564,0.000058948674],"category_scores_gemma":[0.00022916363,0.0004001865,0.0001668091,0.00070840755,0.000011846395,0.0010497953,0.0001335129,0.00028813488,0.0000067897618],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015720504,0.00034978118,0.0001824526,0.000920588,0.0001300477,0.000009539727,0.00047005454,0.00075863855,0.032756466,0.083627746,0.042128336,0.83850914],"study_design_scores_gemma":[0.0015480595,0.000140272,0.00042669364,0.00088815694,0.00010717722,0.000012411492,0.0002135833,0.5787866,0.32014817,0.044605587,0.051167242,0.00195603],"about_ca_topic_score_codex":0.0003148681,"about_ca_topic_score_gemma":0.00008676129,"teacher_disagreement_score":0.8365531,"about_ca_system_score_codex":0.00023751649,"about_ca_system_score_gemma":0.00019460809,"threshold_uncertainty_score":0.999845},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000054413624,0.0004553253,0.99193513,0.00027559555,0.00091538526,0.00031924417,0.000028594313,0.0017966226,0.0042196847],"genre_scores_gemma":[0.0066599706,0.00006543015,0.991919,0.00033247014,0.00018244753,0.000100638026,0.000057555102,0.00002634275,0.00065616344],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9972438,0.0001325476,0.0004221749,0.0013319891,0.00049124705,0.0003782185],"domain_scores_gemma":[0.996669,0.00015202354,0.00028308245,0.0024731436,0.0002764798,0.000146285],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.00025947453,0.00037321422,0.00044450196,0.00014506666,0.00010611948,0.00044922225,0.0028520562,0.00027257585,0.00010741158],"category_scores_gemma":[0.00008113492,0.000349514,0.00016763405,0.0002711096,0.000046879064,0.0006550748,0.0139323305,0.00092290336,0.00003515922],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000017569952,0.00008864613,0.00001085041,0.000044089476,0.00005240163,0.00019620528,0.00032495763,0.00013790562,0.00047330448,0.024554288,0.004417993,0.9696976],"study_design_scores_gemma":[0.00024804345,0.00010130419,0.00042818376,0.000929819,0.000019966612,0.00006579201,0.00017111356,0.8658012,0.06466786,0.057112254,0.008880293,0.0015741573],"about_ca_topic_score_codex":0.00014094007,"about_ca_topic_score_gemma":0.000006468115,"teacher_disagreement_score":0.96812344,"about_ca_system_score_codex":0.00012121249,"about_ca_system_score_gemma":0.00024203116,"threshold_uncertainty_score":0.9998957},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[2.7976201e-8,0.0001567272,0.48421997,0.00010897613,0.00010287,0.000095672,0.0000064618216,0.0008341002,0.51447517],"genre_scores_gemma":[0.0000067128776,0.0007561047,0.4194305,0.00055883225,0.000044299442,0.000003862938,0.000011652961,0.000023150516,0.5791649],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9985334,0.0000064369915,0.00025349206,0.0006022217,0.00040387784,0.00020051404],"domain_scores_gemma":[0.9979846,0.00005737431,0.00014700774,0.0016283067,0.00008142127,0.000101319514],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000050253522,0.00028815318,0.0002791235,0.00016603181,0.000078888894,0.000048768423,0.0018503396,0.00023541888,0.0004666962],"category_scores_gemma":[0.000009526188,0.00025323068,0.000102968304,0.000029404355,0.000082398234,0.00039480568,0.0010270094,0.00034277805,0.0007616171],"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":[8.0974047e-7,0.0000044724043,1.4264701e-7,0.000004258326,0.000007828817,0.00012525496,0.000011205382,7.901027e-7,0.000024615832,0.530218,0.36003834,0.1095643],"study_design_scores_gemma":[0.000048408518,0.000024426572,6.0681015e-7,0.000041513133,0.0000018961643,0.00010107946,2.0591669e-7,0.00036224467,0.0018601057,0.082564995,0.914681,0.0003134961],"about_ca_topic_score_codex":0.000004811709,"about_ca_topic_score_gemma":0.0000023098835,"teacher_disagreement_score":0.5546427,"about_ca_system_score_codex":0.000048994534,"about_ca_system_score_gemma":0.000068510526,"threshold_uncertainty_score":0.999992},"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":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[1.3609871e-9,0.00008321272,0.50001,0.000024639097,0.00015348653,0.00006487173,0.0000028116347,0.0012527864,0.49840817],"genre_scores_gemma":[0.000001216106,0.00008500821,0.43536597,0.00026615168,0.000027390264,0.000008212563,0.0000037971847,0.000078178884,0.5641641],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9991663,0.000016012915,0.00011056978,0.00035319742,0.00017352107,0.00018041192],"domain_scores_gemma":[0.9987553,0.000014706354,0.000099667224,0.0010628777,0.000011040496,0.00005643924],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00005455766,0.0001632913,0.0001652621,0.00017735106,0.00002419734,0.000053040643,0.0011112428,0.00013672897,0.0021051161],"category_scores_gemma":[0.000012236775,0.00012703442,0.000035540375,0.00014319905,0.000018174342,0.00015073227,0.00038320353,0.00012601043,0.00038048712],"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":[4.8300457e-8,0.0000046870796,3.9447724e-7,0.0000058040914,0.000002543838,0.000003856716,0.0000018387149,2.7821537e-8,0.000016571159,0.16643514,0.814882,0.018647095],"study_design_scores_gemma":[0.000037782607,0.0000073614187,2.7474462e-7,0.00007046033,8.5427934e-7,0.0000067391143,6.4224304e-7,0.0002044012,0.001980236,0.004360394,0.9931496,0.00018129009],"about_ca_topic_score_codex":0.000016841717,"about_ca_topic_score_gemma":0.0000053045633,"teacher_disagreement_score":0.17826757,"about_ca_system_score_codex":0.000023494289,"about_ca_system_score_gemma":0.000022532444,"threshold_uncertainty_score":0.9988071},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00018211009,0.000146587,0.9748225,0.00074285676,0.00046187066,0.0004251898,0.000012873815,0.0013145589,0.021891458],"genre_scores_gemma":[0.040342223,0.000050262784,0.9435635,0.0016023285,0.00023668542,0.00019500114,0.0017985881,0.00008965325,0.012121723],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99777865,0.000026968286,0.00044808476,0.00076969806,0.00061541796,0.00036115656],"domain_scores_gemma":[0.9982708,0.00015917877,0.0002223385,0.0010440535,0.00017557335,0.00012807363],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00013109561,0.00038674357,0.00035740226,0.00030287026,0.00018894814,0.00011219948,0.0015212019,0.00031546102,0.0001586438],"category_scores_gemma":[0.000025652635,0.0003376045,0.00016447205,0.00030259602,0.000025221369,0.00066585775,0.000067899295,0.00044155223,0.000061815044],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000847456,0.0001857278,0.000012338918,0.00015183394,0.000033638335,0.0000903979,0.00011648954,0.00021648512,0.0010879538,0.11693053,0.060928643,0.8201612],"study_design_scores_gemma":[0.0016024841,0.00030383677,0.00072516326,0.0019044668,0.00005478581,0.000059949143,0.000045555968,0.47272098,0.3342336,0.05234271,0.13292879,0.0030776614],"about_ca_topic_score_codex":0.00002796796,"about_ca_topic_score_gemma":0.00039016656,"teacher_disagreement_score":0.81708354,"about_ca_system_score_codex":0.000101292004,"about_ca_system_score_gemma":0.00026801584,"threshold_uncertainty_score":0.9999076},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00001115143,0.00015699925,0.99104327,0.0003238136,0.00029300287,0.001784803,0.00018577545,0.0011814855,0.0050197206],"genre_scores_gemma":[0.0022029858,0.000093531075,0.9910437,0.00055759057,0.000113870396,0.003464825,0.00029471857,0.000033688866,0.0021951308],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975269,0.000108306616,0.0004176655,0.001339796,0.00025077723,0.0003565831],"domain_scores_gemma":[0.9959013,0.00040632565,0.00028607526,0.002686708,0.0005956466,0.00012396954],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00044942863,0.00033565235,0.00043866422,0.00013455236,0.0001709803,0.00041485744,0.0026435305,0.00030123,0.00006178111],"category_scores_gemma":[0.000044453005,0.00031979172,0.00012576464,0.0003688745,0.000050675157,0.0004959103,0.0050831703,0.00047512984,0.000018508426],"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.000012411475,0.00026569446,0.0000050741323,0.00021483884,0.000099714256,0.000009979384,0.00010554025,0.0018173307,0.0058259466,0.80325377,0.027135206,0.16125451],"study_design_scores_gemma":[0.00024104967,0.00004127447,0.000009772564,0.00025365557,0.000026079619,0.000011651407,0.00004773872,0.4636385,0.10507842,0.34142467,0.08837486,0.0008523033],"about_ca_topic_score_codex":0.00006855772,"about_ca_topic_score_gemma":0.000011425672,"teacher_disagreement_score":0.4618291,"about_ca_system_score_codex":0.000098000724,"about_ca_system_score_gemma":0.00042143068,"threshold_uncertainty_score":0.99992543},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0006191608,0.000097361844,0.9971198,0.00072405627,0.000102956714,0.0004288547,0.00012770235,0.00047924227,0.00030090022],"genre_scores_gemma":[0.22184467,0.00001500774,0.77755994,0.00016662663,0.00009226029,0.000030889958,0.00017139234,0.000006331421,0.00011291283],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986623,0.000045960824,0.00040264532,0.00045989058,0.00020492054,0.00022429587],"domain_scores_gemma":[0.9970316,0.00025105345,0.00018264588,0.002363523,0.00010541664,0.00006573019],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037356882,0.000116191644,0.00020036717,0.0000501645,0.00011733298,0.000038184404,0.0024520012,0.000054331605,0.000039902465],"category_scores_gemma":[0.000072475756,0.00009526399,0.000031829884,0.00023751559,0.00004411607,0.0013636644,0.0013149088,0.00008154731,0.000007034443],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016509459,0.00022899102,0.0000152645,0.000030933916,0.0000108373415,3.129719e-7,0.000046224544,0.02903626,0.0009886092,0.15354705,0.24642947,0.5696495],"study_design_scores_gemma":[0.0002773922,0.00003600358,0.00015705568,0.000044721757,0.0000046074274,0.0000017920767,0.0000037439852,0.90595365,0.010549497,0.011929386,0.0708964,0.00014574103],"about_ca_topic_score_codex":0.000008475726,"about_ca_topic_score_gemma":0.000014354515,"teacher_disagreement_score":0.8769174,"about_ca_system_score_codex":0.000016111298,"about_ca_system_score_gemma":0.00003590507,"threshold_uncertainty_score":0.4556469},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000008184667,0.0007019763,0.9106559,0.00023769443,0.0012731155,0.00034757008,0.00005665064,0.00067326304,0.08604562],"genre_scores_gemma":[0.0007355046,0.00027973644,0.9814809,0.0006055304,0.00023640152,0.00001795861,0.000019400288,0.00005404564,0.016570497],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99356055,0.0000590329,0.0007816712,0.0022528616,0.0025702866,0.00077558367],"domain_scores_gemma":[0.99468815,0.00020322434,0.0004272454,0.0035490873,0.0008272883,0.00030500977],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":["open_science"],"category_scores_codex":[0.0014280519,0.0006248363,0.000738333,0.00094823266,0.00033911693,0.0008808112,0.0070102517,0.00027173662,0.00019094354],"category_scores_gemma":[0.00007626349,0.0005947795,0.0001463617,0.0006220079,0.00096588413,0.0023663575,0.008576466,0.0009791597,0.00007797121],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005997025,0.000067151515,0.000004293972,0.00006356334,0.0000071878553,0.00066616404,0.00018630778,0.00012518118,0.0013684419,0.3369915,0.014490349,0.64602387],"study_design_scores_gemma":[0.0008430837,0.00029305313,0.0001495871,0.004417217,0.000010780687,0.0002853445,0.0000020628606,0.2353858,0.011226248,0.25643063,0.48841918,0.0025370095],"about_ca_topic_score_codex":0.0000064314395,"about_ca_topic_score_gemma":0.000006794175,"teacher_disagreement_score":0.64348686,"about_ca_system_score_codex":0.0006293399,"about_ca_system_score_gemma":0.00131432,"threshold_uncertainty_score":0.99965036},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00440093,0.00009487436,0.9598909,0.00026922591,0.00047895138,0.0007572226,0.000094482755,0.000730221,0.033283178],"genre_scores_gemma":[0.56752855,0.00014046385,0.42995095,0.0014630934,0.00013495005,0.000081596125,0.00003306045,0.000059138332,0.0006082039],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99537075,0.00005262071,0.00078425766,0.0014933483,0.0014655145,0.00083348696],"domain_scores_gemma":[0.99414164,0.000057537447,0.00070450245,0.00037220138,0.004284258,0.00043987835],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0005409041,0.0007634436,0.00058674277,0.00050929136,0.00050125556,0.001200862,0.0016568167,0.00030335304,0.0002737538],"category_scores_gemma":[0.0007082327,0.00066896924,0.000059238475,0.0009933298,0.00042191768,0.0018946903,0.00016489219,0.00095663307,0.000050154304],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010889024,0.0021516373,0.0053080693,0.0007706786,0.00032014697,0.0006368589,0.0010208342,0.000665704,0.09712636,0.74518305,0.05438635,0.09134141],"study_design_scores_gemma":[0.0016281673,0.00051535346,0.0002068205,0.0007917264,0.00003513901,0.00017493506,0.00024136684,0.9344953,0.051382158,0.0026843476,0.0067723757,0.0010723418],"about_ca_topic_score_codex":0.000013763912,"about_ca_topic_score_gemma":0.0000049118867,"teacher_disagreement_score":0.93382955,"about_ca_system_score_codex":0.00020530827,"about_ca_system_score_gemma":0.00089343905,"threshold_uncertainty_score":0.99983597},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000014094171,0.000044679557,0.99536234,0.0003086528,0.00012243792,0.0008070974,0.000036578684,0.00074893783,0.002555174],"genre_scores_gemma":[0.061031573,0.00000649754,0.9359372,0.00035216083,0.000017561131,0.0007221619,0.000008284324,0.000012962034,0.0019115995],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988625,0.00006761132,0.00020594697,0.00034434203,0.00024184426,0.00027773948],"domain_scores_gemma":[0.9991584,0.000251636,0.000065429165,0.0004143429,0.000044962457,0.00006526776],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039873688,0.00011937861,0.00013883533,0.000100133475,0.00044169187,0.000048738104,0.0010986573,0.000021927315,0.00012473027],"category_scores_gemma":[0.0000113836495,0.000110997134,0.000067044246,0.00018535687,0.000020235888,0.0006914437,0.00045772037,0.00013788977,0.000005533499],"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.00015422278,0.00008281371,0.0000059101235,0.000011115239,0.000017153765,0.000013482603,0.0004850979,0.0044522383,0.0032077457,0.82822233,0.03252293,0.13082497],"study_design_scores_gemma":[0.00068990275,0.0008045537,0.0000063551493,0.000009291889,0.00000670093,0.000045989167,0.00013701394,0.678701,0.105697095,0.06984867,0.14363933,0.00041410077],"about_ca_topic_score_codex":0.000006446763,"about_ca_topic_score_gemma":0.0000012845195,"teacher_disagreement_score":0.7583736,"about_ca_system_score_codex":0.00008206308,"about_ca_system_score_gemma":0.0000784895,"threshold_uncertainty_score":0.45263317},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00045469278,0.000019000212,0.98158044,0.0015020415,0.00017202455,0.0001802414,0.000010668449,0.0008278532,0.015253012],"genre_scores_gemma":[0.2786149,0.000005020201,0.7186639,0.001610027,0.000022263832,0.00009397732,0.00001586358,0.000008478078,0.0009655633],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99863833,0.00017203203,0.00015041437,0.00037805043,0.00046635422,0.00019480905],"domain_scores_gemma":[0.9990025,0.00030353875,0.000075504024,0.0004852599,0.00005484257,0.000078351106],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021873249,0.000092562055,0.00010354609,0.00008169219,0.00033000484,0.000056937788,0.00073937734,0.000018914365,0.0008903371],"category_scores_gemma":[0.000092284754,0.00008155282,0.000031903346,0.0003022912,0.000029825296,0.0007217205,0.0031181886,0.00031452463,0.00006479801],"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.000057099518,0.0006388858,0.00023550497,0.000006899528,0.000016109432,0.00044194286,0.00021163763,0.0000322111,0.007951992,0.39973757,0.32586586,0.26480427],"study_design_scores_gemma":[0.0012421304,0.0007072581,0.0006750348,0.000045091296,0.000011663008,0.001114548,0.00053545163,0.11440441,0.27371004,0.07392517,0.5327003,0.0009289174],"about_ca_topic_score_codex":0.000008908365,"about_ca_topic_score_gemma":4.0651486e-7,"teacher_disagreement_score":0.3258124,"about_ca_system_score_codex":0.00003899014,"about_ca_system_score_gemma":0.00005182397,"threshold_uncertainty_score":0.97485673},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.040195998,0.00096154975,0.95822537,0.000049418653,0.00032086563,0.00009425202,0.00004326634,0.000015568614,0.00009373791],"genre_scores_gemma":[0.66485465,0.000044125623,0.3350239,0.000010295262,0.000043740358,9.2438705e-7,0.0000064901337,0.0000058288606,0.000010065486],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998205,0.00022620376,0.0006915409,0.00015556598,0.00060755963,0.000114142385],"domain_scores_gemma":[0.9966759,0.00096953206,0.0013190762,0.0002144514,0.0007620632,0.000058942915],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005120412,0.00011046818,0.0003810906,0.00030036594,0.000096312506,0.000026457783,0.00046834664,0.00003527697,0.0000047694007],"category_scores_gemma":[0.0030075123,0.00009960544,0.000059257258,0.00071519153,0.00012586215,0.00010595842,0.00022585587,0.00027480986,1.4456758e-7],"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.00096055184,0.0013709861,0.06306204,0.0007205993,0.00055226166,0.00018444212,0.015538298,0.03709419,0.04370728,0.77531344,0.0055489293,0.055947006],"study_design_scores_gemma":[0.003441672,0.0099181,0.18326691,0.0008057193,0.00041892772,0.00020176003,0.002207306,0.10238166,0.19657883,0.48652282,0.013002809,0.0012534758],"about_ca_topic_score_codex":0.00001354854,"about_ca_topic_score_gemma":6.4042854e-7,"teacher_disagreement_score":0.62465864,"about_ca_system_score_codex":0.000042181833,"about_ca_system_score_gemma":0.00008143046,"threshold_uncertainty_score":0.4061792},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0071730935,0.00008774485,0.9905083,0.00049715675,0.00021121652,0.0005318436,0.00021155305,0.0003348843,0.00044416095],"genre_scores_gemma":[0.65894604,0.000007337105,0.33987075,0.0006939507,0.00006588647,0.00007460161,0.0002881206,0.000020021225,0.00003327464],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99720764,0.00013556244,0.00045397005,0.0008123804,0.00094768865,0.00044277948],"domain_scores_gemma":[0.9982864,0.00008847294,0.0001639463,0.0013050582,0.00003872092,0.00011738104],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00087773846,0.00023475738,0.00022646856,0.00018186525,0.0005669362,0.00014027716,0.0029991367,0.000017302405,0.0015811765],"category_scores_gemma":[0.000008431901,0.00024050871,0.00005859249,0.0003008269,0.00003727172,0.001191815,0.0011078808,0.0002442354,0.0000061589963],"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.00017273606,0.0012980145,0.00015716389,0.00010691611,0.00009817054,0.00038780665,0.0004385094,0.009535589,0.3355072,0.0051183985,0.026418848,0.6207606],"study_design_scores_gemma":[0.00074110826,0.00022521346,0.00001684179,0.000037982005,0.000016379347,0.000035549085,0.000016799391,0.5615535,0.37766278,0.0023645067,0.056974694,0.00035469534],"about_ca_topic_score_codex":0.000029756142,"about_ca_topic_score_gemma":0.0000019462832,"teacher_disagreement_score":0.651773,"about_ca_system_score_codex":0.00023400092,"about_ca_system_score_gemma":0.00014830419,"threshold_uncertainty_score":0.99933153},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23945512,0.000029114297,0.7588934,0.00047544684,0.0002750675,0.00031104224,0.00012594805,0.00041826445,0.000016641367],"genre_scores_gemma":[0.62895,0.0000015098369,0.3693504,0.0014466743,0.000110182664,0.00007850549,0.000030901705,0.000018003575,0.000013817226],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9961431,0.00042061694,0.0006690053,0.0008452099,0.0014276175,0.0004944592],"domain_scores_gemma":[0.9983156,0.0003163381,0.00025151338,0.00069538207,0.00007346706,0.0003477173],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0013969678,0.00024863088,0.00032895026,0.00016892423,0.0005784438,0.00017350326,0.0018685121,0.000062356616,0.0010603815],"category_scores_gemma":[0.000092397764,0.00025263973,0.00008576848,0.00046736991,0.000054134925,0.00072352996,0.0023414032,0.00042627854,0.000017309561],"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.00013313393,0.0008637421,0.0014912677,0.00006932011,0.000061547515,0.0001755087,0.0019308315,0.004386341,0.854881,0.008182372,0.0013008481,0.12652408],"study_design_scores_gemma":[0.0020481346,0.0002894745,0.004271366,0.0001835523,0.000025003053,0.000019771358,0.00026498217,0.8403007,0.14642884,0.0029343413,0.0022542698,0.0009796148],"about_ca_topic_score_codex":0.0012298019,"about_ca_topic_score_gemma":0.000051041647,"teacher_disagreement_score":0.8359143,"about_ca_system_score_codex":0.0002819143,"about_ca_system_score_gemma":0.00017371563,"threshold_uncertainty_score":0.9999926},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.049406692,0.0001433164,0.94843745,0.0006524231,0.00024711428,0.0004909222,0.00032217518,0.00019374014,0.0001061522],"genre_scores_gemma":[0.8807016,0.00003782506,0.118658796,0.00011555652,0.00007612494,0.00006155617,0.00031687805,0.000015090636,0.000016568989],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981916,0.00017755541,0.00034166136,0.0005994,0.00043532765,0.0002544315],"domain_scores_gemma":[0.99907935,0.00003628467,0.00010269722,0.00068932795,0.000016456315,0.00007585792],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00061806705,0.00015429729,0.00017255626,0.00017666798,0.0003046358,0.00007539803,0.0011646104,0.000025120213,0.00010670302],"category_scores_gemma":[0.000004671313,0.00014841989,0.000022008899,0.00029899142,0.00004727124,0.0014187027,0.0014368067,0.00025218396,7.717572e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00028853264,0.00080707914,0.0007975106,0.00012821471,0.000043885368,0.00013837624,0.002726629,0.008119987,0.41128862,0.0066339774,0.011762891,0.55726427],"study_design_scores_gemma":[0.0014147288,0.0002643556,0.0020179995,0.00011582548,0.000014569998,0.00015635541,0.00021171528,0.93298006,0.020182068,0.003937255,0.038202696,0.00050237414],"about_ca_topic_score_codex":0.00006543527,"about_ca_topic_score_gemma":0.000006428853,"teacher_disagreement_score":0.92486006,"about_ca_system_score_codex":0.00009511306,"about_ca_system_score_gemma":0.00003883793,"threshold_uncertainty_score":0.60523874},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.042906832,0.0000093752005,0.95203185,0.0006716469,0.001200064,0.0002689042,0.000009925852,0.0002682954,0.0026331344],"genre_scores_gemma":[0.9938745,0.000020188189,0.0010008528,0.004788229,0.00007225096,0.00010959473,0.000026394962,0.000008483582,0.0000995391],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99761677,0.0009246872,0.0005142145,0.0001355754,0.00059356954,0.00021519192],"domain_scores_gemma":[0.9983303,0.00052009115,0.00045368797,0.0004363423,0.00019936876,0.000060234244],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020897717,0.00014445251,0.00011425556,0.00055060035,0.0008135969,0.00019788182,0.0008403228,0.00004272998,0.00048762158],"category_scores_gemma":[0.0003775007,0.000105119645,0.000053286076,0.0009834566,0.000027482107,0.002326742,0.00009806847,0.0010133571,0.00012353642],"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.0010018313,0.00024189983,0.000055226523,0.000007286118,0.00002766335,0.000009894878,0.0023752018,0.05131926,0.0022024338,0.6963533,0.07148478,0.17492121],"study_design_scores_gemma":[0.0018006312,0.0021424533,0.012483693,0.00017292176,0.000014845854,0.00045454604,0.0013548991,0.052761357,0.008035014,0.83121836,0.08873815,0.00082310196],"about_ca_topic_score_codex":0.0000014939803,"about_ca_topic_score_gemma":4.7528715e-7,"teacher_disagreement_score":0.95103097,"about_ca_system_score_codex":0.0005516108,"about_ca_system_score_gemma":0.00010705261,"threshold_uncertainty_score":0.62576115},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06705406,0.00003868989,0.93113023,0.00048543978,0.00005015709,0.00023997675,0.000010659613,0.0006168387,0.00037396103],"genre_scores_gemma":[0.3258625,0.000013495069,0.672727,0.00013596949,0.000014326204,0.00007831181,0.000031107404,0.000010991059,0.0011262879],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985798,0.00014239024,0.00017324921,0.00052369625,0.00038540794,0.00019544289],"domain_scores_gemma":[0.999146,0.00003399451,0.00010855185,0.00058298424,0.00005509651,0.00007337483],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002142946,0.00013126952,0.00013083298,0.000115959454,0.0005281096,0.00009695375,0.0005414663,0.000029259028,0.00010809646],"category_scores_gemma":[0.0000075975977,0.00010689946,0.000018771529,0.00023696892,0.00006977045,0.00092043536,0.0016484793,0.00023963262,0.0000052936375],"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.00021123175,0.00077756646,0.006130291,0.00003743374,0.000021147542,0.00005674554,0.0009486832,0.0015878186,0.7570328,0.0044985022,0.017786391,0.21091141],"study_design_scores_gemma":[0.0033008219,0.0011144547,0.03137615,0.000095642834,0.000016720596,0.00021175556,0.0006548781,0.8415175,0.10320979,0.0056928745,0.01182676,0.0009826458],"about_ca_topic_score_codex":0.0000491173,"about_ca_topic_score_gemma":0.000012405589,"teacher_disagreement_score":0.8399297,"about_ca_system_score_codex":0.000043870463,"about_ca_system_score_gemma":0.000017683918,"threshold_uncertainty_score":0.43592334},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0013287256,0.00024903874,0.9892899,0.003628777,0.00047761723,0.000812179,0.0006761122,0.00053509907,0.0030025642],"genre_scores_gemma":[0.9829335,0.0011775371,0.013628119,0.00040921854,0.00010671756,0.0006960421,0.00033339896,0.000038587677,0.0006768392],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9962617,0.00010197525,0.0006833017,0.00073015306,0.0017283076,0.00049457065],"domain_scores_gemma":[0.9969836,0.00071293756,0.00039957394,0.0008160768,0.0009020722,0.00018576556],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000704574,0.0002705274,0.00042289298,0.00042681317,0.0001957239,0.000108298926,0.002337374,0.00013946273,0.0001261884],"category_scores_gemma":[0.00022385242,0.00025221411,0.00012067215,0.0004380212,0.00013638654,0.00028407256,0.00029198226,0.00052076764,0.000069038],"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.00020524029,0.00045700397,0.00022075088,0.00006413857,0.000106182444,0.0000049842247,0.000110499794,0.00053818076,0.013854122,0.5055929,0.08088674,0.39795926],"study_design_scores_gemma":[0.0011595441,0.0006775857,0.00017514626,0.00039435245,0.000014483311,0.0000069933144,0.000028725863,0.6061066,0.13766299,0.10895634,0.14432153,0.0004957304],"about_ca_topic_score_codex":0.000014366634,"about_ca_topic_score_gemma":0.000027423117,"teacher_disagreement_score":0.9816048,"about_ca_system_score_codex":0.0002527941,"about_ca_system_score_gemma":0.0009204144,"threshold_uncertainty_score":0.999993},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0033118,0.0012824361,0.96390283,0.030690739,0.00007499512,0.00033634197,0.000042287415,0.00030959415,0.00004898762],"genre_scores_gemma":[0.9728572,0.00018995286,0.024445979,0.0021591175,0.0001396138,0.000103629194,0.000019346315,0.000020675585,0.00006449077],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99747884,0.00027595574,0.00050050963,0.0005610033,0.0007663644,0.0004173328],"domain_scores_gemma":[0.99793804,0.0009610232,0.0001891181,0.00044268157,0.000112184476,0.0003569354],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008411682,0.00023211051,0.00039708812,0.00008450215,0.0005273225,0.00025987497,0.0014543885,0.00018159341,0.000021503398],"category_scores_gemma":[0.00030099723,0.00011896928,0.000061100836,0.0006910444,0.0014055216,0.00041150206,0.0009610351,0.00049125345,0.000006278346],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020916655,0.00022899179,0.000030123978,0.00010416831,0.000060835388,0.000067316316,0.0012794537,0.0000060277966,0.033001527,0.0033703689,0.060065523,0.9015765],"study_design_scores_gemma":[0.004429394,0.00048058445,0.0002878825,0.0011640721,0.000059368453,0.00018301744,0.00055173744,0.9114707,0.0057309787,0.023245847,0.051819164,0.0005772732],"about_ca_topic_score_codex":0.00005215598,"about_ca_topic_score_gemma":0.0000010740596,"teacher_disagreement_score":0.9695454,"about_ca_system_score_codex":0.000015157185,"about_ca_system_score_gemma":0.000118231976,"threshold_uncertainty_score":0.5178703},"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":"codex-gemma-dda1882f352a","genre_candidate":"review","genre_consensus":"review","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[4.6278137e-9,0.50540465,0.49153325,0.0003231473,0.00013925413,0.0017576612,0.00005855996,0.00069463364,0.00008884163],"genre_scores_gemma":[2.576037e-7,0.83921486,0.1566031,0.00008810961,0.000114387774,0.002250259,0.0001875773,0.00006784263,0.0014735799],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99698955,0.00018543369,0.0008919065,0.0012741658,0.00024054734,0.00041839955],"domain_scores_gemma":[0.99610853,0.0009052862,0.00088446826,0.0017503048,0.00022427308,0.0001271607],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008915689,0.00052838627,0.0013466064,0.00034732601,0.00023555521,0.00021331513,0.0015671308,0.00037140364,0.000010336411],"category_scores_gemma":[0.0003677527,0.0004611624,0.00035165175,0.0011068385,0.00010102498,0.0007149185,0.00047755093,0.0005793311,0.00013813961],"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.0000012434476,0.00002695541,3.0684557e-8,0.032184467,0.000014773255,0.0000051866446,0.000014991588,3.6201618e-7,0.00007421567,0.0061196615,0.022451954,0.93910617],"study_design_scores_gemma":[0.000008259507,0.00006222446,3.9263483e-8,0.070672974,0.00011053886,0.00007800717,0.000010034469,0.0050393254,0.0028364244,0.0020858804,0.91867363,0.00042267438],"about_ca_topic_score_codex":0.0000032603593,"about_ca_topic_score_gemma":0.0000012984686,"teacher_disagreement_score":0.9386835,"about_ca_system_score_codex":0.00013151464,"about_ca_system_score_gemma":0.00012991256,"threshold_uncertainty_score":0.999784},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0043020537,0.00005045347,0.99357426,0.00010697671,0.0000957175,0.0003502373,0.000028938624,0.0014253377,0.00006602193],"genre_scores_gemma":[0.728551,0.00006815566,0.27090058,0.00001401072,0.000049566144,0.00025876163,0.00007848356,0.00002662285,0.000052860818],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99842584,0.00006334974,0.00048402164,0.00045540172,0.00029492012,0.0002764686],"domain_scores_gemma":[0.9978215,0.00063263794,0.00016281847,0.00095418765,0.00032659262,0.000102241],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025906065,0.00018103347,0.00023952073,0.00032812834,0.00014248266,0.00007164563,0.0014346807,0.000071419665,0.000014480087],"category_scores_gemma":[0.00018652329,0.00019270073,0.000063706095,0.0019040332,0.00009667751,0.00034403297,0.0006427872,0.0002824972,0.0003212724],"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.00001675503,0.00019655513,0.00025997558,0.00013004613,0.000039104132,0.000011233166,0.0005231424,0.42812338,0.24499041,0.15546478,0.0017934178,0.1684512],"study_design_scores_gemma":[0.000016712764,0.000054990818,0.0017306074,0.00005889585,0.0000028800798,0.0000037658333,0.000051157804,0.7717093,0.21400364,0.006112069,0.0059886244,0.00026735433],"about_ca_topic_score_codex":0.00004159378,"about_ca_topic_score_gemma":0.000002572513,"teacher_disagreement_score":0.7242489,"about_ca_system_score_codex":0.000025983012,"about_ca_system_score_gemma":0.000031056206,"threshold_uncertainty_score":0.78581077},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0018011176,0.000017071308,0.99356735,0.0020202398,0.00034320337,0.00039348018,0.00006448669,0.0013999316,0.00039312415],"genre_scores_gemma":[0.022824328,0.00007504667,0.9751424,0.00015891998,0.00006530985,0.00008554582,0.0005144891,0.0000142386525,0.00111969],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983746,0.000049157723,0.00028621985,0.0007598545,0.0002460811,0.000284083],"domain_scores_gemma":[0.9976589,0.0001689499,0.00008728425,0.0019512993,0.000074615535,0.000058964473],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005689991,0.00012352387,0.00016304181,0.00017325171,0.00009915763,0.000053111384,0.001652285,0.00006116419,0.000010067574],"category_scores_gemma":[0.00021934329,0.00010928594,0.000029141846,0.0007561276,0.000045447712,0.0015407716,0.0014142719,0.000108426924,0.000041087027],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014307215,0.0005537961,0.00007396371,0.00021913213,0.00003888044,0.000029858924,0.0005886521,0.008410384,0.07265953,0.1633609,0.499975,0.25394684],"study_design_scores_gemma":[0.00033159726,0.000039070852,0.0002316283,0.00008056111,0.0000016310553,0.000003832597,0.00005143429,0.8602992,0.077566564,0.05079131,0.010386004,0.00021712632],"about_ca_topic_score_codex":0.000030200188,"about_ca_topic_score_gemma":0.000010410998,"teacher_disagreement_score":0.85188884,"about_ca_system_score_codex":0.000038586786,"about_ca_system_score_gemma":0.000076666365,"threshold_uncertainty_score":0.4456551},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00028546303,0.000013585705,0.9956337,0.00044705503,0.00009005811,0.0002915308,0.0000072987873,0.0027463206,0.00048495503],"genre_scores_gemma":[0.033421595,0.000022115859,0.9624577,0.00021191755,0.000020193533,0.000084686566,0.000027573566,0.000013576917,0.0037406257],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990217,0.00002990277,0.00017128329,0.00035109642,0.00014577516,0.0002802042],"domain_scores_gemma":[0.99914163,0.00022480082,0.00006494113,0.00040645787,0.00009380062,0.000068361165],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029450687,0.00009972407,0.00012420047,0.00011895812,0.00018157328,0.000114761875,0.0007580785,0.000032837106,0.000011008145],"category_scores_gemma":[0.00024361156,0.000084475716,0.000053542764,0.00028317104,0.0000251009,0.000696062,0.0006971021,0.000106823616,0.00011680807],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015078386,0.000059321545,0.00050524453,0.000040306993,0.000021674217,0.000028974597,0.00032132093,0.00032538717,0.69911146,0.0599689,0.05457015,0.18503214],"study_design_scores_gemma":[0.000492716,0.000074235744,0.001105147,0.00004115378,0.0000020253344,0.00000319067,0.00008497932,0.86081815,0.096264064,0.0014764491,0.039414022,0.00022385771],"about_ca_topic_score_codex":0.000020098183,"about_ca_topic_score_gemma":0.0000026786852,"teacher_disagreement_score":0.86049277,"about_ca_system_score_codex":0.00002001729,"about_ca_system_score_gemma":0.000013257194,"threshold_uncertainty_score":0.34448197},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0523863,0.000058736092,0.946477,0.00004743316,0.00013978517,0.0001774918,0.0000063052644,0.0004952376,0.00021170599],"genre_scores_gemma":[0.46757317,0.0000021135995,0.53237474,0.000013315307,0.000008020772,0.0000049703735,0.0000093213675,0.000008236301,0.0000060799025],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99807006,0.00009141513,0.0006950357,0.00041393377,0.0003843579,0.00034518685],"domain_scores_gemma":[0.9984296,0.0005325511,0.00036320757,0.0004954128,0.00012031061,0.000058913898],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006581596,0.00016940717,0.00035537643,0.0004899023,0.00011390728,0.000024794,0.0010240496,0.00006242943,0.000002385019],"category_scores_gemma":[0.00011885168,0.00016450323,0.000056339555,0.0012703507,0.00006805017,0.00026358647,0.0011748093,0.00017121468,0.000005506663],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008172537,0.00013747596,0.0026893292,0.00021682293,0.000008689099,0.000025187428,0.0013772866,0.006932014,0.096777946,0.00077240815,0.0005472814,0.8905074],"study_design_scores_gemma":[0.00047244498,0.00003256007,0.0047844,0.0010211328,0.0000015794686,0.0000019754816,0.00009328287,0.49579477,0.49504378,0.0020390304,0.0004926479,0.00022240264],"about_ca_topic_score_codex":0.000017132083,"about_ca_topic_score_gemma":0.0000023963248,"teacher_disagreement_score":0.89028496,"about_ca_system_score_codex":0.000055883313,"about_ca_system_score_gemma":0.00015230148,"threshold_uncertainty_score":0.6708247},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.028356317,0.000015757854,0.96418315,0.0008547788,0.00019128292,0.0001796157,0.000008361952,0.0029099353,0.0033008086],"genre_scores_gemma":[0.19519445,0.0000148772715,0.8037696,0.00026658163,0.0000650982,0.000022276048,0.000021175574,0.000018596302,0.0006273878],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986705,0.000057669233,0.00021496166,0.00046348912,0.00026221224,0.00033116064],"domain_scores_gemma":[0.99868304,0.00011130213,0.00006868357,0.0009680552,0.00006854325,0.00010039805],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00010722587,0.00012752415,0.00013218472,0.00021083973,0.00023626491,0.00015939084,0.0009794057,0.00003864667,0.000049993145],"category_scores_gemma":[0.000046735655,0.000109303044,0.000059719136,0.0008917019,0.00004626743,0.0014077928,0.0010359704,0.00013468594,0.0001096837],"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.0000041238304,0.000037501482,0.0002813724,0.0000067990227,0.0000063218586,0.000061305494,0.00018498157,0.0011976724,0.9110371,0.048413195,0.026544884,0.012224762],"study_design_scores_gemma":[0.00018508408,0.000024308993,0.0028921743,0.00001765824,0.0000029623768,0.000045675803,0.000082836625,0.82694405,0.1508534,0.017592847,0.0011289275,0.0002300725],"about_ca_topic_score_codex":0.00007590048,"about_ca_topic_score_gemma":0.0000017122597,"teacher_disagreement_score":0.82574636,"about_ca_system_score_codex":0.0000324603,"about_ca_system_score_gemma":0.000021706388,"threshold_uncertainty_score":0.4457249},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0009377848,0.0013094716,0.99117666,0.0029771994,0.00118472,0.0009690022,0.00006141167,0.001141501,0.00024224704],"genre_scores_gemma":[0.2675811,0.04290103,0.67041945,0.00063455896,0.0034257495,0.0012619135,0.00056925043,0.0006112201,0.012595756],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99327236,0.00023992623,0.0009155428,0.0012002098,0.0008110238,0.0035609263],"domain_scores_gemma":[0.99697226,0.0003063807,0.0007094059,0.0014230954,0.00038015813,0.00020870836],"candidate_categories":["metaepi_narrow","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.0026339118,0.00060425233,0.0007127695,0.00047704738,0.00059645163,0.0004737241,0.0041944375,0.00047527862,0.000012327238],"category_scores_gemma":[0.00021532335,0.0005373358,0.0004466311,0.000303447,0.0000929232,0.0010037809,0.0011828423,0.006389816,0.00005270498],"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.0005665823,0.00036236254,0.000008293029,0.00037397712,0.0006547867,0.00003755507,0.0010779384,0.0014631766,0.14672437,0.3193571,0.020296631,0.50907725],"study_design_scores_gemma":[0.0009060161,0.0003761252,0.000019187504,0.00040365447,0.000038371327,0.000086569504,0.00012736149,0.0034752844,0.07282873,0.9169211,0.0041503957,0.0006671945],"about_ca_topic_score_codex":0.000033822136,"about_ca_topic_score_gemma":0.00011618841,"teacher_disagreement_score":0.597564,"about_ca_system_score_codex":0.0009802409,"about_ca_system_score_gemma":0.00345762,"threshold_uncertainty_score":0.9997078},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8451493,0.0002460022,0.15333034,0.00077570503,0.0002484171,0.00016429524,0.0000096571575,0.000031430598,0.000044895114],"genre_scores_gemma":[0.922702,0.00022871126,0.0769365,0.00003140933,0.000071845156,0.000004315157,8.515664e-7,0.000005530636,0.00001883889],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99500364,0.00031297046,0.0003658656,0.00034476997,0.0036801454,0.00029258028],"domain_scores_gemma":[0.99591964,0.00027702056,0.0002798151,0.00023665091,0.0030951665,0.00019169513],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0111448,0.000093041446,0.00014025015,0.0018712197,0.00034796254,0.0003557945,0.0014891138,0.000048954502,0.0000031355457],"category_scores_gemma":[0.0019263375,0.00007215642,0.000030409314,0.0010486394,0.0012106311,0.0026017732,0.0005914342,0.00034467285,0.0000014441528],"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.00010498657,0.0001870972,0.0017237538,0.0000144067435,0.000027302078,0.000064250315,0.0030424516,0.0050259917,0.8433413,0.0010443559,0.0002891728,0.14513497],"study_design_scores_gemma":[0.0006894124,0.0002329166,0.02021135,0.00035083864,0.000004873328,0.00010549916,0.00093949103,0.9016899,0.073517025,0.0020282893,0.00013725058,0.000093152536],"about_ca_topic_score_codex":0.000070755945,"about_ca_topic_score_gemma":0.0000042818747,"teacher_disagreement_score":0.8966639,"about_ca_system_score_codex":0.00024689824,"about_ca_system_score_gemma":0.00041595448,"threshold_uncertainty_score":0.44606206},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00034463656,0.00010601985,0.9925265,0.0031166244,0.00010072156,0.0017385946,0.00009504724,0.0018287195,0.00014314082],"genre_scores_gemma":[0.1270074,0.0004705132,0.87019885,0.00016315831,0.00007195937,0.0016500349,0.00035559462,0.00002968026,0.000052830863],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99811584,0.00013910109,0.0005186874,0.0005912034,0.00023314031,0.00040200664],"domain_scores_gemma":[0.9934006,0.0021862248,0.00023364453,0.0038088684,0.00020811717,0.00016256014],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.00051036477,0.00024597952,0.00025682716,0.00027016454,0.0019004244,0.00018012681,0.0027692188,0.0001075485,0.0000039553497],"category_scores_gemma":[0.000049765476,0.0002510167,0.000101241,0.0010551659,0.00021268931,0.0004152002,0.00045865326,0.00035567008,0.00005811542],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001019967,0.00034835978,0.000025373738,0.00004762611,0.00003469076,3.5143395e-7,0.00038105616,0.005023171,0.0043730615,0.021848865,0.0014183131,0.96648896],"study_design_scores_gemma":[0.00052430795,0.000059179867,0.00065541384,0.00009416842,0.000019912604,0.000007456128,0.000062764775,0.9233363,0.0019074894,0.017947042,0.05507336,0.00031257406],"about_ca_topic_score_codex":0.000013156686,"about_ca_topic_score_gemma":0.000005791257,"teacher_disagreement_score":0.96617633,"about_ca_system_score_codex":0.000053031763,"about_ca_system_score_gemma":0.000041711242,"threshold_uncertainty_score":0.9999942},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0063626296,0.00016681426,0.99211496,0.00020627212,0.00016318346,0.0003988787,0.000004307997,0.00038059414,0.00020238175],"genre_scores_gemma":[0.25255984,0.0009977876,0.7460492,0.00014080941,0.0000438232,0.000078020494,0.000013366332,0.000016063295,0.00010105561],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984899,0.000121519704,0.00058620836,0.00031323635,0.00017157846,0.0003175298],"domain_scores_gemma":[0.998848,0.00039380253,0.00016823832,0.00045812814,0.00006529228,0.00006649927],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00087994634,0.00014888922,0.0002992442,0.000473866,0.00015597946,0.00020505456,0.0005068723,0.000058636437,0.000010955448],"category_scores_gemma":[0.00028581254,0.00014563042,0.000050649473,0.0009880894,0.00009497614,0.0019656974,0.0005157124,0.0001567883,0.00008343842],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001693785,0.000033144835,0.000080400336,0.0001057651,0.000010466569,0.000049396018,0.0029828916,0.05407359,0.0071139913,0.021237578,0.0003086682,0.91383475],"study_design_scores_gemma":[0.0008208581,0.000011379644,0.000027239916,0.00014775505,0.0000028678821,0.000022749306,0.00017779136,0.92438716,0.061193068,0.012596881,0.00045001868,0.0001622355],"about_ca_topic_score_codex":0.000044940112,"about_ca_topic_score_gemma":5.410158e-7,"teacher_disagreement_score":0.9136725,"about_ca_system_score_codex":0.000047023637,"about_ca_system_score_gemma":0.00002230174,"threshold_uncertainty_score":0.59386355},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5714288,0.00007666146,0.42775396,0.00026920316,0.00003120915,0.0002454645,0.000074447365,0.00008820002,0.000032049833],"genre_scores_gemma":[0.97459006,0.00011017062,0.025078207,0.00004097343,0.000009641784,0.000041449504,0.000116119896,0.000006869695,0.0000065062804],"study_design_codex":"bench_or_experimental","study_design_gemma":"observational","domain_scores_codex":[0.9986835,0.000107416156,0.00035846993,0.00039445207,0.00020728892,0.00024887885],"domain_scores_gemma":[0.9994477,0.0001736897,0.000118469026,0.00016768805,0.000029977555,0.00006249776],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023065954,0.00013686255,0.00022907168,0.00033024733,0.00006334421,0.00005252184,0.00023593464,0.000050694707,0.000010754426],"category_scores_gemma":[0.000015481135,0.00013408963,0.000019357925,0.0003467053,0.00012305174,0.0009899178,0.00042998246,0.00013921467,0.0000019314664],"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.00044070222,0.0009573828,0.0973916,0.0003319205,0.00003961348,0.00079393334,0.005060041,0.0028809907,0.45830062,0.010299087,0.0017440268,0.42176008],"study_design_scores_gemma":[0.0068246084,0.0013529081,0.41555697,0.0019729715,0.000019226181,0.00011930625,0.00043942544,0.2606211,0.18040037,0.13099676,0.0006917121,0.0010046344],"about_ca_topic_score_codex":0.000008405972,"about_ca_topic_score_gemma":0.000008806528,"teacher_disagreement_score":0.42075545,"about_ca_system_score_codex":0.000034842014,"about_ca_system_score_gemma":0.000013775744,"threshold_uncertainty_score":0.5468016},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0013177369,0.0007203815,0.9964654,0.00045636937,0.00022620666,0.00027688406,0.00015430397,0.0003555877,0.000027162836],"genre_scores_gemma":[0.95111626,0.00074785744,0.047699094,0.00018574999,0.000030059076,0.00007650255,0.000018123366,0.000023087367,0.00010324206],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99797744,0.000085265936,0.0004381818,0.00089872605,0.00029412043,0.0003062421],"domain_scores_gemma":[0.9985732,0.00046291522,0.00008818116,0.00061986945,0.0000914809,0.00016436983],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00028823476,0.00030079274,0.0004078467,0.00047814878,0.00044738437,0.000746231,0.0005677052,0.00009396106,0.00004980221],"category_scores_gemma":[0.0000073575475,0.0002519891,0.00018096642,0.0007785519,0.00017496581,0.00072698994,0.000035160323,0.00034889413,0.0000090720205],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003304562,0.0000756744,0.000037363403,0.00016061925,0.00028106864,0.000034882396,0.00052307115,0.008722333,0.0029099681,0.00072345993,0.00007414611,0.9864244],"study_design_scores_gemma":[0.00009433612,0.00008906527,0.00007669886,0.00015475885,0.0002215623,0.000021632428,0.000033712,0.8095044,0.18786691,0.001328407,0.0003270123,0.0002814953],"about_ca_topic_score_codex":0.00025172753,"about_ca_topic_score_gemma":0.00024963345,"teacher_disagreement_score":0.9861429,"about_ca_system_score_codex":0.000048181995,"about_ca_system_score_gemma":0.000029543418,"threshold_uncertainty_score":0.9999932},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03660827,0.011573673,0.9466709,0.0031002483,0.0003200491,0.0004788051,0.000026885395,0.00012506437,0.0010960896],"genre_scores_gemma":[0.8114499,0.008778767,0.17925729,0.000097354256,0.00010843033,0.0000104502105,0.000030740655,0.000037837875,0.00022926874],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9960428,0.00094439316,0.0014028351,0.00046514173,0.0008799214,0.00026490865],"domain_scores_gemma":[0.9949523,0.0011182528,0.001519891,0.0012685749,0.0009364854,0.00020446318],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009815126,0.00034317886,0.0006335996,0.0005929025,0.00027466888,0.00066197396,0.0013275373,0.00015806682,0.00012511123],"category_scores_gemma":[0.00031525397,0.00026195348,0.00018049104,0.0007353249,0.00034650735,0.0044372324,0.0011246143,0.00089627784,0.0000059997164],"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.0010422115,0.0013236877,0.0005666036,0.001673569,0.00021703471,0.00013677886,0.00488027,0.00014206248,0.6186764,0.004857207,0.009820333,0.35666385],"study_design_scores_gemma":[0.0013332295,0.0017594129,0.0027648495,0.007343315,0.00013476856,0.00027516735,0.001214483,0.07136662,0.90440863,0.004396343,0.0045194975,0.00048367158],"about_ca_topic_score_codex":0.00006947686,"about_ca_topic_score_gemma":0.0000067210144,"teacher_disagreement_score":0.7748416,"about_ca_system_score_codex":0.000070966074,"about_ca_system_score_gemma":0.00016424371,"threshold_uncertainty_score":0.99998325},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00035982652,0.000035105186,0.7097691,0.003997167,0.0009612978,0.007727332,0.2742965,0.001817999,0.0010356491],"genre_scores_gemma":[0.0034754365,0.00003439442,0.7735921,0.0026405854,0.00060303364,0.0657657,0.13864535,0.00014629804,0.015097103],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9928773,0.000109503795,0.0022799012,0.002086523,0.00091710716,0.0017296816],"domain_scores_gemma":[0.99208665,0.0018042864,0.0009039495,0.002230147,0.0020421797,0.0009327839],"candidate_categories":["metaepi_narrow","sts","scholarly_communication","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00069175917,0.0012088027,0.0011794671,0.0018031449,0.0014920513,0.001810739,0.0026000747,0.000645904,0.010963874],"category_scores_gemma":[0.0020825313,0.0011866314,0.0008330932,0.0012489238,0.00010423615,0.00279289,0.004095628,0.0007567005,0.0042884625],"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.00007632773,0.0001296458,0.0000014467755,0.00040457162,0.00014292928,0.0000028579136,0.0012977482,0.020930905,0.0013235062,0.041616812,0.93044674,0.0036264963],"study_design_scores_gemma":[0.0004327799,0.00038821402,0.00003188695,0.0010444628,0.00013833289,0.000030279525,0.00063596986,0.07727896,0.009948639,0.073005006,0.8353847,0.0016807788],"about_ca_topic_score_codex":0.0003313633,"about_ca_topic_score_gemma":0.0007475401,"teacher_disagreement_score":0.13565114,"about_ca_system_score_codex":0.0006464801,"about_ca_system_score_gemma":0.0013484854,"threshold_uncertainty_score":0.9998079},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011445284,0.000059637052,0.98166203,0.004454721,0.00068270054,0.00074594317,0.000075438766,0.0008454523,0.000028766925],"genre_scores_gemma":[0.18689258,0.0000054291922,0.7922726,0.019806929,0.00015717636,0.00040121004,0.0004235877,0.000024399005,0.000016064676],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998111,0.00015499603,0.00042416193,0.00064652564,0.00020141242,0.00046192392],"domain_scores_gemma":[0.9985842,0.00035625746,0.00025022644,0.0005573823,0.00017347788,0.000078444675],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00028430173,0.00024569797,0.00023454848,0.00020107158,0.00032536846,0.00018623154,0.00069387467,0.000088354645,0.000016708917],"category_scores_gemma":[0.00009849223,0.00025015045,0.00012652983,0.0003212301,0.0000693076,0.0008498896,0.00029371542,0.00024250199,0.00003187173],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000060183498,0.00017955598,0.0032039715,0.0002320502,0.000035278183,0.00001835336,0.000056191635,0.0011542081,0.35904455,0.000042032247,0.05591863,0.580055],"study_design_scores_gemma":[0.0017110304,0.000042851283,0.001901035,0.00060148665,0.000015844184,0.0000037736486,0.0000058136006,0.93748295,0.053097077,0.0006063373,0.004118254,0.00041357236],"about_ca_topic_score_codex":0.000016123082,"about_ca_topic_score_gemma":0.0000033876363,"teacher_disagreement_score":0.9363287,"about_ca_system_score_codex":0.000077571036,"about_ca_system_score_gemma":0.00002771615,"threshold_uncertainty_score":0.99999505},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002267627,0.0050731925,0.9556835,0.03308259,0.00060012453,0.0015056697,0.0000366346,0.0009362349,0.0008144101],"genre_scores_gemma":[0.5861216,0.007538652,0.404051,0.00048891985,0.00015471426,0.0014112524,0.00006989783,0.00007235066,0.000091612754],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9965804,0.0012688963,0.0008012161,0.00044864646,0.00040596962,0.0004948697],"domain_scores_gemma":[0.9886391,0.004811302,0.00036343405,0.005332982,0.0006784007,0.00017476654],"candidate_categories":["sts","open_science"],"consensus_categories":[],"category_scores_codex":[0.0011429648,0.0003173399,0.000337042,0.00045934913,0.001325255,0.0009664569,0.0081601925,0.00009424045,0.000008172143],"category_scores_gemma":[0.0007857354,0.00023122132,0.00015769058,0.0017748734,0.00044357203,0.0017996986,0.0008636991,0.0017144636,0.00002795401],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00036901468,0.0034283455,0.0002518429,0.00029776443,0.00051747175,0.00020666103,0.00858402,0.0013268591,0.2296118,0.4927785,0.047085997,0.21554172],"study_design_scores_gemma":[0.0018024211,0.00049369445,0.001190808,0.007980152,0.00011546401,0.00084045186,0.00058304373,0.6852892,0.11297154,0.09751749,0.08987798,0.0013377306],"about_ca_topic_score_codex":0.000005229166,"about_ca_topic_score_gemma":0.000024565818,"teacher_disagreement_score":0.68396235,"about_ca_system_score_codex":0.00027925102,"about_ca_system_score_gemma":0.00023700934,"threshold_uncertainty_score":0.9999749},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00004805473,0.00025362603,0.98257166,0.0011434277,0.0016177004,0.00089634774,0.00024304958,0.0044853413,0.008740784],"genre_scores_gemma":[0.0027502414,0.00006413152,0.99442303,0.0007360664,0.00019050423,0.00033417903,0.00024561322,0.00007783684,0.0011783873],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9957776,0.0000964903,0.00073848176,0.0018757434,0.00088580576,0.0006258948],"domain_scores_gemma":[0.995017,0.00016983699,0.00032418885,0.0039425655,0.00025311913,0.00029329737],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.00039567286,0.00074795954,0.000689856,0.0005382084,0.00016114514,0.0009032407,0.004704264,0.00050717324,0.00016109648],"category_scores_gemma":[0.000032231026,0.00060043554,0.00033318708,0.0004597391,0.000119130906,0.0005487512,0.018879272,0.0019154934,0.0005058624],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015648015,0.00039057145,0.000005749886,0.00101383,0.000074287185,0.00059830886,0.00026592216,0.0008304381,0.0093870275,0.00846035,0.17368571,0.80527216],"study_design_scores_gemma":[0.0002037617,0.000056304834,0.000012203696,0.0011350322,0.000015829697,0.000010463406,0.000007311467,0.77393746,0.10136513,0.1054491,0.01708574,0.00072165666],"about_ca_topic_score_codex":0.00018921745,"about_ca_topic_score_gemma":0.0000059967224,"teacher_disagreement_score":0.80455047,"about_ca_system_score_codex":0.00019659166,"about_ca_system_score_gemma":0.0004401534,"threshold_uncertainty_score":0.9996447},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013780464,0.00065694214,0.9818307,0.00060826057,0.00007194787,0.00036736857,0.000024121095,0.0014885953,0.0011716033],"genre_scores_gemma":[0.805515,0.00003273953,0.19322386,0.00017637546,0.000028886236,0.00005363306,0.000007446423,0.00002731404,0.0009347788],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980152,0.00007549902,0.00022062269,0.00091627653,0.00040565318,0.00036674613],"domain_scores_gemma":[0.99887955,0.00013466939,0.00005650446,0.0006276339,0.00013634894,0.00016531312],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019382719,0.0002667301,0.00024318427,0.0001826929,0.00020193515,0.00031720445,0.0005562034,0.000079043886,0.00000975955],"category_scores_gemma":[0.000024660287,0.00018605094,0.00002996242,0.00036330576,0.00014206521,0.00061607093,0.00084413646,0.0003247575,0.000022926686],"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.00078635267,0.0010144864,0.000069117435,0.0004781752,0.0002518329,0.000856603,0.01158968,0.2461378,0.18649755,0.24225518,0.12642151,0.18364172],"study_design_scores_gemma":[0.00030200896,0.00015942946,0.000040166782,0.00021803823,0.000006916136,0.000044388675,0.000048645503,0.9204804,0.07050141,0.007672718,0.00025671895,0.00026918383],"about_ca_topic_score_codex":0.000063295054,"about_ca_topic_score_gemma":0.000014196776,"teacher_disagreement_score":0.7917345,"about_ca_system_score_codex":0.00006047937,"about_ca_system_score_gemma":0.000099196186,"threshold_uncertainty_score":0.7586937},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0013027498,0.00006441615,0.995692,0.000297615,0.00042871461,0.00066998234,0.0004783939,0.0007786636,0.0002874503],"genre_scores_gemma":[0.3064229,0.000045191675,0.69306606,0.000038684502,0.000039060622,0.000041918145,0.00022721801,0.000020435045,0.000098503486],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998168,0.00003953335,0.00044249528,0.000735975,0.00034312665,0.00027086557],"domain_scores_gemma":[0.99842083,0.00017054906,0.00010699313,0.0011006714,0.00010723677,0.00009372963],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021603647,0.00022889998,0.00027118102,0.00020299116,0.00010310009,0.0001216958,0.001363244,0.0000819172,0.000041681524],"category_scores_gemma":[0.000015345599,0.00016325929,0.000094119656,0.00024922722,0.00007669876,0.0015523516,0.0005203797,0.0001815195,0.000017299126],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013557244,0.0002593452,0.000035537887,0.0004982532,0.00005637258,0.000049143495,0.00016591842,0.00024823254,0.15609686,0.2537942,0.009320405,0.57934016],"study_design_scores_gemma":[0.00045018227,0.00020873066,0.000061259365,0.00038143582,0.000015316178,0.000052935902,0.000024114961,0.76350844,0.21952932,0.007414643,0.008101351,0.0002522471],"about_ca_topic_score_codex":0.00001156124,"about_ca_topic_score_gemma":0.0000040537275,"teacher_disagreement_score":0.76326025,"about_ca_system_score_codex":0.000044897293,"about_ca_system_score_gemma":0.00004929963,"threshold_uncertainty_score":0.66575205},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000704322,0.00021169602,0.9974978,0.00019113012,0.00011472612,0.00047975034,0.000041266023,0.0003624587,0.0003968531],"genre_scores_gemma":[0.43499038,0.000032959797,0.5646497,0.00007985787,0.000011548203,0.000029161703,0.000006021353,0.000008075536,0.0001922862],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99905217,0.000019196139,0.0003027604,0.00029407625,0.00015837153,0.0001734567],"domain_scores_gemma":[0.9992481,0.0002439723,0.000056248504,0.00028223768,0.00012833124,0.00004111466],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020532522,0.00011991228,0.00019262904,0.00012750542,0.000056789904,0.000073688345,0.0003791837,0.000055366007,0.000009240854],"category_scores_gemma":[0.000043425356,0.00008850511,0.00010658643,0.00019806124,0.00002845836,0.0015171524,0.0000953479,0.0000747916,6.8129316e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006735157,0.00012211165,0.000046131627,0.00033523893,0.000091822185,0.000009303882,0.001097174,0.014769303,0.18822579,0.45607322,0.002977741,0.33557865],"study_design_scores_gemma":[0.00038178536,0.00007245125,0.0000023930484,0.000091601825,0.000008262591,0.0000035664862,0.000020000187,0.7912951,0.19944951,0.008486805,0.00009011717,0.000098415396],"about_ca_topic_score_codex":0.000034800138,"about_ca_topic_score_gemma":0.0000061668884,"teacher_disagreement_score":0.7765258,"about_ca_system_score_codex":0.000017758997,"about_ca_system_score_gemma":0.0000706379,"threshold_uncertainty_score":0.36091337},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.029877087,0.00047054703,0.9592338,0.00024618194,0.0006916649,0.00036483782,0.00008773154,0.0012469016,0.0077812416],"genre_scores_gemma":[0.9455221,0.0007354305,0.049986247,0.0001062482,0.000087933906,0.0000021313676,0.00003869051,0.000030007233,0.0034911863],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9976119,0.000092142924,0.00019943716,0.0016363169,0.00011893991,0.00034126293],"domain_scores_gemma":[0.9975317,0.000101412166,0.00016262522,0.0019243626,0.00007545377,0.0002044126],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0001944741,0.0003747453,0.00034623285,0.00032076667,0.00012962073,0.00025670248,0.00220808,0.00027039807,0.00003480911],"category_scores_gemma":[0.000031447817,0.0003905928,0.0001322081,0.0004980751,0.00015802079,0.0004993203,0.014332175,0.00093531306,0.000081194434],"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.000032966174,0.00007709353,0.000772756,0.00050023425,0.00017584897,0.0030340229,0.00034010276,0.0051438226,0.0004520476,0.9443004,0.016787792,0.02838291],"study_design_scores_gemma":[0.00017879372,0.000051480336,0.00037096284,0.0004363998,0.00006392927,0.000029133196,0.000020260459,0.20221718,0.0016051801,0.7841877,0.010100766,0.0007382239],"about_ca_topic_score_codex":0.0000722031,"about_ca_topic_score_gemma":0.000014648096,"teacher_disagreement_score":0.91564506,"about_ca_system_score_codex":0.00013173865,"about_ca_system_score_gemma":0.000117100106,"threshold_uncertainty_score":0.9998546},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0089703165,0.00018286552,0.988686,0.00019559497,0.00070380745,0.00034830678,0.0000307174,0.000732499,0.00014988026],"genre_scores_gemma":[0.8185114,0.000020476462,0.18115382,0.000088024346,0.00007535398,0.00001911091,0.00003010512,0.000010092555,0.00009161851],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99888045,0.000046555113,0.0001965582,0.0005641976,0.00017724872,0.00013501315],"domain_scores_gemma":[0.99898475,0.00007376484,0.00004700306,0.0007975683,0.000031817508,0.00006506259],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000205636,0.0001006503,0.00009515396,0.00013335758,0.00009281198,0.0004966182,0.000506693,0.000036757454,0.00000214136],"category_scores_gemma":[0.000021667001,0.00008998429,0.000008666432,0.00029368667,0.00001530473,0.0018998776,0.000699148,0.000080345984,0.000011985651],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000064293695,0.000010904902,0.000036258934,0.000086343025,0.000009198718,0.0000061101946,0.000108401946,0.0004382568,0.77201265,0.015055089,0.0007445643,0.21148582],"study_design_scores_gemma":[0.000057908062,0.000038177168,0.000080902326,0.000086842156,0.000004122755,0.000025194358,0.000026715905,0.93523276,0.057683535,0.0008666705,0.0057839653,0.00011322753],"about_ca_topic_score_codex":0.000089095345,"about_ca_topic_score_gemma":0.000019046971,"teacher_disagreement_score":0.9347945,"about_ca_system_score_codex":0.00006758284,"about_ca_system_score_gemma":0.0000238291,"threshold_uncertainty_score":0.47889006},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015152108,0.00089455175,0.96529067,0.015717197,0.00033942718,0.00025966662,0.000040456434,0.002006904,0.00029901875],"genre_scores_gemma":[0.8646386,0.0005036772,0.1329608,0.0014339875,0.000045107143,0.00014985877,0.000062347026,0.0000335889,0.00017200665],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982814,0.00017553329,0.00040043818,0.00051120494,0.00031222007,0.0003191726],"domain_scores_gemma":[0.9955278,0.0003527435,0.00007701441,0.0038281078,0.000086170694,0.0001281519],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021684336,0.00022774845,0.00020069956,0.00022087737,0.0004071831,0.00055210514,0.004837078,0.00009022811,0.000015664717],"category_scores_gemma":[0.000008674606,0.00020920605,0.00012692623,0.0005380035,0.00029187577,0.0015820824,0.00065299287,0.00052140024,0.000094077564],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009609876,0.00018831475,0.00024032872,0.00008803262,0.000060057755,0.00004891849,0.00081649795,0.00028294063,0.33152667,0.049251366,0.02074116,0.5967461],"study_design_scores_gemma":[0.00059712294,0.00007551917,0.0010289765,0.0011073047,0.00002742321,0.00009884838,0.00006153961,0.5605195,0.17227665,0.0030046336,0.26010507,0.0010974021],"about_ca_topic_score_codex":0.00005413161,"about_ca_topic_score_gemma":0.000005348431,"teacher_disagreement_score":0.84948653,"about_ca_system_score_codex":0.000102379214,"about_ca_system_score_gemma":0.000065801236,"threshold_uncertainty_score":0.8988575},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.001764907,0.00017035293,0.9937348,0.00043307358,0.0013834891,0.00038884225,0.000027385395,0.0005990078,0.0014981463],"genre_scores_gemma":[0.8453033,0.00033123555,0.15102628,0.0023196402,0.00043923198,0.00015108309,0.00012642541,0.000048243328,0.00025455517],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99799305,0.00021102444,0.0007623964,0.00021381993,0.00048054627,0.00033916175],"domain_scores_gemma":[0.99797463,0.00085748325,0.00026807538,0.0004151599,0.00034896508,0.00013569093],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011706132,0.00021712197,0.00022739856,0.0008905982,0.00025257413,0.00069724175,0.0009548102,0.00011807032,0.000039480685],"category_scores_gemma":[0.00027505786,0.00016648226,0.00009084415,0.0008246368,0.00003777293,0.005230452,0.00010713059,0.00066025974,0.0001091269],"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.00036536192,0.00013087178,0.000012514416,0.00012659353,0.000031603442,0.000030363806,0.0012408306,0.004060506,0.004571709,0.32504082,0.08119724,0.5831916],"study_design_scores_gemma":[0.001278522,0.00073423097,0.00054412824,0.002811317,0.000010949119,0.00054104027,0.00008553925,0.3794203,0.04392299,0.30786237,0.2621743,0.00061431236],"about_ca_topic_score_codex":7.305569e-7,"about_ca_topic_score_gemma":4.5515114e-7,"teacher_disagreement_score":0.8435384,"about_ca_system_score_codex":0.00024579672,"about_ca_system_score_gemma":0.0001591406,"threshold_uncertainty_score":0.678895},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0001878484,0.0005030601,0.995957,0.0001315319,0.00024924398,0.00090423337,0.00017631809,0.00047065914,0.001420104],"genre_scores_gemma":[0.3935523,0.00017223143,0.6060933,0.000008842055,0.000020982296,0.000068444686,0.000028022327,0.000017371172,0.000038529215],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980379,0.000027019985,0.0007521256,0.0006435211,0.0003426091,0.00019684191],"domain_scores_gemma":[0.99824077,0.00015164418,0.00036942647,0.00075698877,0.00043725193,0.000043929536],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036473255,0.00025505794,0.00048461775,0.00038947357,0.000042275355,0.00006479118,0.0013034343,0.00019858865,0.000008335162],"category_scores_gemma":[0.0000324154,0.00022437591,0.00020098599,0.00028519004,0.00004210099,0.0004024524,0.0015169755,0.00030085264,0.0000010710248],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018099682,0.00031232025,0.000005844541,0.0070839156,0.0003027485,0.0000080922455,0.0029686019,0.1645685,0.0774406,0.55266684,0.0018286918,0.19263285],"study_design_scores_gemma":[0.00006615024,0.000047408037,1.5727497e-7,0.0005203023,0.000023028702,0.0000011196739,0.000026108017,0.63364744,0.1502756,0.21522556,0.000023651104,0.0001434433],"about_ca_topic_score_codex":0.00011262731,"about_ca_topic_score_gemma":0.000007222293,"teacher_disagreement_score":0.46907896,"about_ca_system_score_codex":0.00004630561,"about_ca_system_score_gemma":0.000118733675,"threshold_uncertainty_score":0.9149784},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0028905913,0.00065788795,0.9952616,0.00028110115,0.00003476807,0.00024011267,0.00001622552,0.0002539909,0.00036371656],"genre_scores_gemma":[0.2988153,0.00020393764,0.70062155,0.000051016887,0.000006997479,0.00001801131,0.0000013710259,0.0000066938856,0.0002751352],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9992816,0.000019376377,0.00014477114,0.00031595366,0.00010094515,0.00013736925],"domain_scores_gemma":[0.99943,0.00024735084,0.000028542829,0.00019424234,0.000028901868,0.000070944276],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017210915,0.00009365335,0.00012950355,0.000090502916,0.00005122708,0.00006666276,0.0002239541,0.000043211236,0.0000061477294],"category_scores_gemma":[0.000016624888,0.00007392023,0.000028594653,0.00012220249,0.00004620334,0.0005210182,0.00015908133,0.00005792163,2.6813987e-7],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000027369737,0.000015047228,0.000027994545,0.00015364839,0.000014647789,0.0000062249783,0.0006637534,0.0000071785953,0.06852604,0.04894861,0.0040274905,0.877582],"study_design_scores_gemma":[0.00025517814,0.00028496172,0.0002164821,0.0004491565,0.000013974029,0.000045051358,0.000030965537,0.26299158,0.6806495,0.039580166,0.015291215,0.00019175689],"about_ca_topic_score_codex":0.000013300073,"about_ca_topic_score_gemma":6.943382e-7,"teacher_disagreement_score":0.87739027,"about_ca_system_score_codex":0.000016032829,"about_ca_system_score_gemma":0.000026357202,"threshold_uncertainty_score":0.30143794},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00012450443,0.0003851802,0.99676156,0.0006132675,0.00016651792,0.00049150287,0.00009358462,0.0010070627,0.00035680106],"genre_scores_gemma":[0.02706737,0.000054005,0.9704836,0.00021000732,0.00006364233,0.00010246221,0.0006484818,0.000014297937,0.0013561201],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986779,0.000038004724,0.0001847132,0.00077681604,0.00014398868,0.00017858915],"domain_scores_gemma":[0.99852884,0.000101467565,0.00003173338,0.0012268377,0.00004439558,0.000066713204],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027412697,0.00013232087,0.0001165203,0.000118741504,0.00010631419,0.00034022424,0.001048192,0.00005895431,0.0000051252973],"category_scores_gemma":[0.000051090134,0.00010486053,0.000018236511,0.00024956674,0.000033701548,0.0015000791,0.0012987916,0.00009057536,0.000004161518],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016846907,0.00026865874,0.000009256013,0.00022661778,0.00006131366,0.000015880087,0.00020652892,0.00053940725,0.16142768,0.31690452,0.21514632,0.30517697],"study_design_scores_gemma":[0.00020000046,0.000044179393,0.0000043441087,0.000015684995,0.0000052756423,0.000005961446,0.000009663187,0.93347293,0.011485568,0.0005533474,0.05406856,0.00013450986],"about_ca_topic_score_codex":0.000010208682,"about_ca_topic_score_gemma":0.000004500945,"teacher_disagreement_score":0.9329335,"about_ca_system_score_codex":0.000025981333,"about_ca_system_score_gemma":0.000043437743,"threshold_uncertainty_score":0.42760885},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0043940865,0.00017505634,0.9920442,0.0004615978,0.00060752325,0.0004818259,0.00007084269,0.0014873145,0.0002775636],"genre_scores_gemma":[0.64378816,0.000019193601,0.35517412,0.00023480064,0.00019884529,0.000085586056,0.00023572153,0.000022024904,0.0002415502],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982912,0.00009946061,0.00033778907,0.0006497798,0.00036233413,0.00025944805],"domain_scores_gemma":[0.99907774,0.00014566955,0.00006859291,0.0004543155,0.00015193925,0.00010175193],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036292174,0.00020628152,0.00017378497,0.00021297664,0.00030186088,0.00028899027,0.0004987703,0.0001269226,0.00024705872],"category_scores_gemma":[0.000036212357,0.0001765791,0.00013040776,0.00028333833,0.000063320134,0.0020641878,0.00014093495,0.00018121052,0.00006246297],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000039271574,0.00012787379,0.000046127054,0.00015708705,0.000031007276,0.000010482225,0.000421379,0.001153348,0.7483104,0.058008566,0.04506781,0.14662664],"study_design_scores_gemma":[0.0003203215,0.00010305443,0.0017376135,0.00032217422,0.000023720164,0.000043927743,0.0000646955,0.9128323,0.014071146,0.040390212,0.029651491,0.000439328],"about_ca_topic_score_codex":0.000014401844,"about_ca_topic_score_gemma":0.0000025190548,"teacher_disagreement_score":0.91167897,"about_ca_system_score_codex":0.00025253932,"about_ca_system_score_gemma":0.00008846524,"threshold_uncertainty_score":0.72006863},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.026791375,0.00091569795,0.97059953,0.00018980361,0.000093045615,0.00030174205,0.000027856,0.0009078629,0.00017310334],"genre_scores_gemma":[0.72802913,0.00020793124,0.2713744,0.000028634893,0.000019257357,0.000060313538,0.0000046804817,0.000032369677,0.00024324995],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983445,0.000043193028,0.00030501062,0.00074054615,0.00023397608,0.00033278365],"domain_scores_gemma":[0.9991532,0.0000622108,0.00009602605,0.00039795545,0.00015996808,0.00013061933],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00017934525,0.00031033804,0.00025479757,0.00025192476,0.000638905,0.0007796497,0.00029248817,0.00009336873,0.0000036208635],"category_scores_gemma":[0.0000044403014,0.0002453747,0.00002405737,0.0004129129,0.00023475762,0.0047773984,0.000028308965,0.0004485109,0.0000066864386],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012399959,0.0000710925,0.0000028427664,0.0005127648,0.000015210677,0.000006170932,0.0009107847,0.006469174,0.10742078,0.00008392356,0.00006786696,0.8843154],"study_design_scores_gemma":[0.00037022284,0.00012408469,0.00003330292,0.0007246099,0.000018654022,0.000037354508,0.000040537085,0.74634355,0.25159484,0.00041078927,0.00005482541,0.00024721876],"about_ca_topic_score_codex":0.000017778055,"about_ca_topic_score_gemma":0.000010898605,"teacher_disagreement_score":0.8840682,"about_ca_system_score_codex":0.00006946394,"about_ca_system_score_gemma":0.00013109749,"threshold_uncertainty_score":0.9999998},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0027954525,0.00012802491,0.99445546,0.00033424402,0.00030126175,0.0011838354,0.000017401615,0.00072673266,0.000057599762],"genre_scores_gemma":[0.6624225,0.0000041892813,0.33705518,0.00009806039,0.00002279387,0.00032984582,0.000030826614,0.00001677679,0.000019875795],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980962,0.00011679051,0.00046492764,0.0006125525,0.00038409335,0.00032542704],"domain_scores_gemma":[0.9991068,0.00029021586,0.00008967747,0.00037127067,0.00006773683,0.00007426804],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00077887264,0.00021973332,0.00019697304,0.0003295448,0.00009610033,0.0002445865,0.00058961153,0.00007515747,0.000062980114],"category_scores_gemma":[0.000037132497,0.00018555678,0.00007413824,0.00038387178,0.00003641932,0.0007504432,0.00021052526,0.00016604496,0.000024827847],"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.00016256681,0.0007654037,0.00001480093,0.000374739,0.000028138653,0.00003837189,0.0017508728,0.44262052,0.09336228,0.05601886,0.010089183,0.39477426],"study_design_scores_gemma":[0.00036477743,0.00013754152,0.00007875409,0.0005102025,0.0000048255993,0.0000045915585,0.000009572874,0.89889693,0.092332125,0.0063657155,0.0011016544,0.00019331693],"about_ca_topic_score_codex":0.0000027458557,"about_ca_topic_score_gemma":4.3412447e-7,"teacher_disagreement_score":0.659627,"about_ca_system_score_codex":0.00015978278,"about_ca_system_score_gemma":0.000042712865,"threshold_uncertainty_score":0.7566786},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000014316147,0.0008185481,0.99365616,0.0012131244,0.00022562461,0.0006159368,0.000021182233,0.0025203777,0.00091471267],"genre_scores_gemma":[0.079980925,0.00003784702,0.918428,0.0004402791,0.00009398915,0.0007042636,0.000012217269,0.000014672339,0.00028780635],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99887097,0.000026451518,0.00020015897,0.0005233225,0.00016598134,0.00021312587],"domain_scores_gemma":[0.9981131,0.00078551425,0.000038615202,0.0009299212,0.00006244556,0.00007040806],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017668086,0.0001226938,0.00013461517,0.00009757899,0.0001276111,0.00024118387,0.00097208313,0.000056645473,0.000020407722],"category_scores_gemma":[0.000054198503,0.00009700037,0.00006382511,0.00043546653,0.000029401815,0.00049740885,0.00038597843,0.00014001744,0.00008084411],"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.0000016836004,0.000019758423,0.00002136901,0.000066833854,0.0000052175897,0.0000018923731,0.000023253671,0.000017671093,0.0013593829,0.8982472,0.020353213,0.07988253],"study_design_scores_gemma":[0.00003944122,0.000021096406,0.00004741681,0.00013386295,0.000001505557,0.000007837991,0.000003004735,0.1253522,0.008215009,0.48630124,0.3797264,0.00015096023],"about_ca_topic_score_codex":0.0000035984929,"about_ca_topic_score_gemma":0.0000015299202,"teacher_disagreement_score":0.41194594,"about_ca_system_score_codex":0.000023459408,"about_ca_system_score_gemma":0.00003456982,"threshold_uncertainty_score":0.39555603},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00004541472,0.00022799335,0.9935713,0.00024791146,0.0002842012,0.0008734381,0.000043750537,0.0033515699,0.0013544476],"genre_scores_gemma":[0.08399879,0.000007696185,0.91448253,0.00014381434,0.0000746896,0.00032159188,0.000010956528,0.000034035675,0.00092588697],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9982753,0.00007129899,0.00027241852,0.000708385,0.00032504328,0.00034756394],"domain_scores_gemma":[0.9983621,0.00037146866,0.00006579355,0.0009237991,0.00014958368,0.00012725378],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029080527,0.00024071931,0.00023817473,0.00014972725,0.00019068434,0.00060165196,0.0012958824,0.00007676354,0.000026124373],"category_scores_gemma":[0.000016146092,0.00015626881,0.00006181723,0.00034916503,0.000047540558,0.0017249804,0.00048074796,0.00014712263,0.00006407089],"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.00013671942,0.00014825365,0.000008286316,0.0012230577,0.00008403789,0.00018874128,0.00041041704,0.00021903416,0.14117387,0.35135338,0.33554536,0.16950886],"study_design_scores_gemma":[0.00043442816,0.00029043105,0.000024083041,0.0011168068,0.000014331336,0.0000769273,0.00006527445,0.35537884,0.606174,0.0048608547,0.0310786,0.0004854213],"about_ca_topic_score_codex":0.000007692218,"about_ca_topic_score_gemma":8.450825e-7,"teacher_disagreement_score":0.46500015,"about_ca_system_score_codex":0.00008231102,"about_ca_system_score_gemma":0.00012336901,"threshold_uncertainty_score":0.6372457},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00026423862,0.000075514894,0.99254006,0.0031084507,0.00016892927,0.0006241073,0.000048764632,0.0020495635,0.0011203921],"genre_scores_gemma":[0.84260404,0.00011077925,0.15530625,0.00037604236,0.000019913597,0.0006956944,0.000024414794,0.000031069107,0.00083180703],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99839497,0.00025791203,0.00033438124,0.000536615,0.00024060904,0.00023550319],"domain_scores_gemma":[0.9960109,0.00057606626,0.000069084665,0.0030734614,0.00012367297,0.00014683748],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004530023,0.00021873118,0.00016255635,0.00041289482,0.0006783285,0.0002581504,0.001815014,0.000082935134,0.00003252562],"category_scores_gemma":[0.000011400514,0.00020106236,0.000082526385,0.0010442542,0.0001697267,0.00083989254,0.000028906654,0.0004640674,0.00030845145],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003782963,0.0002772151,0.0000024806259,0.000029525123,0.000055785345,0.000002013341,0.0015886826,0.013619538,0.019577153,0.06224318,0.00080388045,0.9017627],"study_design_scores_gemma":[0.000669068,0.0005822298,0.00029333073,0.0009705146,0.00014796278,0.0001292593,0.00077199197,0.755184,0.062134482,0.023688037,0.15390363,0.0015255088],"about_ca_topic_score_codex":0.000028655779,"about_ca_topic_score_gemma":0.00005330165,"teacher_disagreement_score":0.9002372,"about_ca_system_score_codex":0.00022174684,"about_ca_system_score_gemma":0.000104275576,"threshold_uncertainty_score":0.8199085},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0009865004,0.021491915,0.97118866,0.0017085769,0.0016766106,0.00032964637,0.000018034216,0.0011254055,0.0014746313],"genre_scores_gemma":[0.62414926,0.04191896,0.32613856,0.0007012177,0.0025301315,0.0001906824,0.00011980964,0.00035367763,0.0038976856],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99414176,0.00025805,0.00069632975,0.0011077246,0.0008748693,0.0029212635],"domain_scores_gemma":[0.9971268,0.00007234723,0.00049148046,0.0018759654,0.00022163396,0.0002117664],"candidate_categories":["metaepi_narrow","open_science","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.0018910205,0.0005620206,0.0005479052,0.00050354557,0.0002827385,0.00091887306,0.0047756587,0.0003882859,0.00002524294],"category_scores_gemma":[0.00007480981,0.00047714234,0.00040871982,0.00034042404,0.00008341117,0.0006087884,0.008594113,0.01341558,0.00019940447],"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.000020749934,0.00015859997,0.000015526128,0.00024806394,0.00037011653,0.00029638165,0.00023230618,0.0002947274,0.01220272,0.71934235,0.011980356,0.2548381],"study_design_scores_gemma":[0.0001689794,0.000091656075,0.0000095007645,0.0005854231,0.000036114518,0.0010389433,0.00003980978,0.009783136,0.0033923676,0.97310525,0.011222407,0.00052643736],"about_ca_topic_score_codex":0.000027384769,"about_ca_topic_score_gemma":0.0000118942535,"teacher_disagreement_score":0.6450501,"about_ca_system_score_codex":0.001604694,"about_ca_system_score_gemma":0.0040954114,"threshold_uncertainty_score":0.999768},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.086791635,0.0051886127,0.8818384,0.0008831649,0.0090218345,0.00142552,0.00023471835,0.014466262,0.00014985063],"genre_scores_gemma":[0.8669695,0.00041586126,0.13134296,0.00023039994,0.00058337674,0.0002985347,4.7411217e-7,0.00013886084,0.000019997551],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9957661,0.0001824897,0.0006789161,0.002008598,0.00067201286,0.0006918638],"domain_scores_gemma":[0.9962516,0.000116675306,0.0004176717,0.0025118813,0.00039528805,0.00030689774],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00069954805,0.0007200938,0.0006504397,0.0006592948,0.00023540498,0.00083799456,0.0018819002,0.00055920397,0.000019140247],"category_scores_gemma":[0.00024979844,0.0007512923,0.00019300859,0.0011580741,0.00008902202,0.000580338,0.005647455,0.001599869,0.00021969904],"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.000015445607,0.0001694099,0.00015166622,0.00069509627,0.00010501698,0.00024183014,0.000017662785,0.00006016986,0.9773251,0.016859226,0.004215607,0.00014377756],"study_design_scores_gemma":[0.00024572635,0.000103961414,0.0038261432,0.0021921885,0.000055870234,1.00521e-7,8.4107506e-7,0.01797215,0.96112376,0.00026590296,0.012823929,0.0013893936],"about_ca_topic_score_codex":0.000058051,"about_ca_topic_score_gemma":0.0000031936856,"teacher_disagreement_score":0.7801779,"about_ca_system_score_codex":0.0005052881,"about_ca_system_score_gemma":0.0005132151,"threshold_uncertainty_score":0.99949384},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.031938937,0.000333015,0.95516056,0.0001490618,0.0011489498,0.0004924618,0.00004546801,0.0026423896,0.008089169],"genre_scores_gemma":[0.9877933,0.0009940247,0.006820081,0.00013738565,0.00012575094,0.0000050905683,0.000070891874,0.00006714181,0.0039862944],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99595547,0.0003170031,0.00037418294,0.002409924,0.00032196744,0.0006214844],"domain_scores_gemma":[0.99596214,0.00078904646,0.0004075911,0.0023951463,0.00013944955,0.00030661677],"candidate_categories":["metaepi_narrow","open_science","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.00036668585,0.000664909,0.00057643343,0.0025157693,0.0003058463,0.0004202274,0.0037024776,0.0004920226,0.000024598596],"category_scores_gemma":[0.00036922644,0.00067283586,0.0003838557,0.0039183446,0.000108436885,0.00055718614,0.013394768,0.0027109433,0.00043976327],"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.00006507467,0.00025200646,0.0005866817,0.00033147156,0.00012997829,0.0014972851,0.00021961427,0.13040012,0.00014061827,0.84433097,0.002159449,0.019886704],"study_design_scores_gemma":[0.00036914158,0.00023859907,0.00025692215,0.0007937533,0.00007448341,0.0000054524608,0.00004572988,0.77066296,0.0005793293,0.22058573,0.005463524,0.0009243877],"about_ca_topic_score_codex":0.00006740452,"about_ca_topic_score_gemma":0.0000036589965,"teacher_disagreement_score":0.9558544,"about_ca_system_score_codex":0.0004594377,"about_ca_system_score_gemma":0.00011538945,"threshold_uncertainty_score":0.99958986},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00008256061,0.00087467965,0.99482805,0.0010148652,0.0004287353,0.00054564234,0.000024409715,0.0006210507,0.0015800094],"genre_scores_gemma":[0.021556085,0.00020347707,0.9767082,0.0006170104,0.00015056685,0.00003504796,0.000017531365,0.00006427198,0.000647818],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9954928,0.000039597562,0.00052235904,0.0022495987,0.0010114968,0.00068413914],"domain_scores_gemma":[0.9972735,0.0002569191,0.00030168274,0.0017067252,0.00021643814,0.00024475317],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00056057406,0.00069785916,0.0006334131,0.00082395435,0.00032488882,0.00074277073,0.0025005664,0.00032909034,0.000016488306],"category_scores_gemma":[0.000029554327,0.0005482036,0.000080940714,0.00044676533,0.0012033964,0.0013768905,0.0029848625,0.001205469,0.00003299494],"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.0000699873,0.00006804753,0.0000129647615,0.0002941297,0.000033774257,0.000470526,0.0010731259,0.026714947,0.012688723,0.3811313,0.00037151584,0.57707095],"study_design_scores_gemma":[0.00021071076,0.00012594777,0.0000050812755,0.000729994,0.000006287141,0.00009878382,1.7409899e-7,0.58558166,0.0047032596,0.4066102,0.0014672364,0.00046069807],"about_ca_topic_score_codex":0.000009959268,"about_ca_topic_score_gemma":0.000013558614,"teacher_disagreement_score":0.57661027,"about_ca_system_score_codex":0.00029078676,"about_ca_system_score_gemma":0.00037389068,"threshold_uncertainty_score":0.99969697},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00001399303,0.00023814295,0.9935955,0.0008446213,0.00023130527,0.00006265528,0.00000988942,0.001483761,0.0035201563],"genre_scores_gemma":[0.2755795,0.000036437457,0.72314805,0.00030984636,0.000031966636,0.000011227558,0.0000498546,0.000007873654,0.00082522776],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992443,0.00001898509,0.00009680311,0.00039671783,0.00014890259,0.000094309435],"domain_scores_gemma":[0.99856704,0.00007379855,0.000009792729,0.0013051762,0.000010548133,0.000033642722],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013266243,0.00005539571,0.000044057368,0.000058604568,0.00003002032,0.00017179205,0.0014134448,0.000017969644,0.00008723402],"category_scores_gemma":[0.000013605734,0.000042689953,0.000009701668,0.00018896698,0.000024913892,0.0016009167,0.0011705414,0.0000601086,0.00026944437],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[4.0863864e-7,0.000008006002,0.0000010195253,0.000009107487,0.000002660077,0.000014833304,0.000021434573,0.000012527952,0.0008689137,0.20805264,0.042360164,0.7486483],"study_design_scores_gemma":[0.00002664381,0.000015248291,0.000011885477,0.000050084673,0.0000021757683,0.000020377745,0.0000098498285,0.79602075,0.024089063,0.027852554,0.15180744,0.0000939378],"about_ca_topic_score_codex":0.000009469103,"about_ca_topic_score_gemma":0.0000017535135,"teacher_disagreement_score":0.7960082,"about_ca_system_score_codex":0.000019868812,"about_ca_system_score_gemma":0.000025976138,"threshold_uncertainty_score":0.34632522},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008698465,0.000082108694,0.9872621,0.00057871663,0.00045598086,0.0004635168,0.000019242272,0.0020485355,0.00039131977],"genre_scores_gemma":[0.49098206,0.00000981605,0.5085829,0.0001604296,0.00003994546,0.000033974437,0.000024744886,0.000012848304,0.00015331677],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983627,0.00006240508,0.00038637803,0.00060995587,0.00032509924,0.0002534523],"domain_scores_gemma":[0.99875814,0.00031543945,0.00007460102,0.0006675452,0.000112245885,0.00007200296],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005425641,0.00015384899,0.0001652984,0.00013810671,0.00015701183,0.00026426584,0.0006032146,0.00006251991,0.000014765282],"category_scores_gemma":[0.00009052297,0.000120709294,0.0000733708,0.00036555872,0.000021587972,0.00082721876,0.00055549026,0.00010026379,0.000016251352],"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.000005217639,0.00006470024,0.0000014011625,0.000092968,0.0000036051415,0.0000017621287,0.0001900406,0.013975953,0.034210235,0.87175965,0.0013117999,0.07838263],"study_design_scores_gemma":[0.00010275582,0.000028727278,0.000018740311,0.00012406879,0.000001996802,0.0000014201911,0.000011241174,0.779721,0.113524124,0.10581739,0.0005012251,0.00014730285],"about_ca_topic_score_codex":0.00003833926,"about_ca_topic_score_gemma":0.0000025385652,"teacher_disagreement_score":0.7659423,"about_ca_system_score_codex":0.00007070018,"about_ca_system_score_gemma":0.000041862335,"threshold_uncertainty_score":0.4922382},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0027736672,0.00063317426,0.98776215,0.0012274602,0.00027664876,0.00014467121,0.000012552767,0.0011141783,0.0060554743],"genre_scores_gemma":[0.5166625,0.00003747847,0.47912732,0.00032667269,0.000039204933,0.000018133003,0.0000037977507,0.000015719932,0.0037692199],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99874955,0.000035843834,0.00026851636,0.00045714114,0.00025833133,0.00023059791],"domain_scores_gemma":[0.9988377,0.00015624281,0.000055838103,0.0008188158,0.00005617816,0.00007521174],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018600374,0.00014857798,0.00018380157,0.00019919357,0.000050802046,0.00014401897,0.0011180602,0.000055779863,0.0003253444],"category_scores_gemma":[0.00002893336,0.00011328351,0.000077255325,0.00039827227,0.000051103532,0.0011646359,0.00075588946,0.00013725845,0.00011298775],"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.000013878593,0.00011907818,0.00064435456,0.00023250178,0.00007663132,0.000109376706,0.004678882,0.000033248067,0.060156155,0.42478937,0.3042013,0.20494522],"study_design_scores_gemma":[0.00011408589,0.00008111081,0.00025753537,0.00036531527,0.000007393886,0.000020427635,0.00006942801,0.078644305,0.7373805,0.090646744,0.0920781,0.00033507193],"about_ca_topic_score_codex":0.000035333982,"about_ca_topic_score_gemma":0.000003868751,"teacher_disagreement_score":0.67722434,"about_ca_system_score_codex":0.000024521085,"about_ca_system_score_gemma":0.000041261927,"threshold_uncertainty_score":0.46195674},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013403338,0.00021112723,0.9824464,0.00009524445,0.00089502544,0.00061731366,0.00004678463,0.0014220686,0.00086273055],"genre_scores_gemma":[0.89761984,0.00006892612,0.10159274,0.00003428083,0.00006943888,0.0000051706365,0.000033061824,0.000048082802,0.0005284808],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9966521,0.00023178266,0.00055026944,0.0017845887,0.00024512864,0.0005361104],"domain_scores_gemma":[0.99614644,0.00040298066,0.00066684437,0.0023085794,0.0002507581,0.00022439363],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.00036390903,0.0005702004,0.000692264,0.0004361922,0.00017052682,0.00017198939,0.003335748,0.0004635509,0.000043034528],"category_scores_gemma":[0.00009955135,0.00057662925,0.00029618945,0.0009367305,0.00020904337,0.00058191654,0.01253756,0.0014537432,0.000049884056],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00047833906,0.0018846861,0.003256757,0.009256823,0.001253668,0.0062976484,0.003404978,0.17558044,0.01579868,0.3302842,0.008094799,0.44440898],"study_design_scores_gemma":[0.00051849877,0.0001365701,0.00015747815,0.0043928125,0.00014294493,0.000024313105,0.00015840899,0.8550289,0.01538305,0.11887851,0.003942014,0.0012364544],"about_ca_topic_score_codex":0.00015010049,"about_ca_topic_score_gemma":0.000017713402,"teacher_disagreement_score":0.8842165,"about_ca_system_score_codex":0.00022230593,"about_ca_system_score_gemma":0.0001895627,"threshold_uncertainty_score":0.99966854},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.047419123,0.00018863368,0.95072025,0.0004815889,0.0004969062,0.00014377729,0.000008959169,0.00047191317,0.00006885406],"genre_scores_gemma":[0.31920648,0.0001299421,0.68047476,0.00010064593,0.000027734906,1.5908833e-7,4.885922e-7,0.00001076558,0.000049007656],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99847895,0.000054831446,0.00021052765,0.0007087212,0.00024092043,0.00030605978],"domain_scores_gemma":[0.99918604,0.00018629048,0.000041041796,0.00040695205,0.000047646812,0.00013203052],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016646496,0.00017376969,0.0001487488,0.00030404568,0.0007475523,0.0005649077,0.00021423746,0.00005777353,0.0000018817666],"category_scores_gemma":[0.000008546869,0.00014946974,0.000049065584,0.00058046513,0.00023084028,0.0013664486,0.000021596798,0.000307422,0.0000021853812],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000035858154,0.000007852752,2.952164e-7,0.000016181748,0.0000038391445,0.000027397282,0.0003392692,0.0005716518,0.30572703,0.00017002484,0.0000069540515,0.6931259],"study_design_scores_gemma":[0.000073612566,0.00003644184,0.00007267574,0.0002255405,0.000011117553,0.0005205737,0.00009820142,0.9316463,0.06453401,0.0024848562,0.00011793423,0.00017872443],"about_ca_topic_score_codex":0.0003076507,"about_ca_topic_score_gemma":0.0000101971655,"teacher_disagreement_score":0.9310747,"about_ca_system_score_codex":0.000040250896,"about_ca_system_score_gemma":0.000039546958,"threshold_uncertainty_score":0.6095199},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.035660435,0.0011791912,0.96112305,0.00027478326,0.0016123974,0.000052541734,0.000033339533,0.000048511367,0.000015724081],"genre_scores_gemma":[0.43069038,0.00038787094,0.5686085,0.00007445758,0.00022545166,2.4400038e-7,0.0000059310864,0.000004812391,0.0000023562175],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99821216,0.000038289952,0.00037596715,0.00047398263,0.0006711502,0.00022843857],"domain_scores_gemma":[0.9986234,0.00019132897,0.00023370887,0.00040911345,0.0003926972,0.00014978052],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0016508432,0.00012504398,0.00017783223,0.00021590923,0.00033937083,0.0019229811,0.0028255524,0.000033236243,0.0000027299595],"category_scores_gemma":[0.00012708185,0.00009622687,0.000024169478,0.00041341738,0.00037741693,0.008729431,0.0047116554,0.00028730748,4.6095255e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021992504,0.000028791495,0.0005558733,0.00001450166,0.000030651023,0.00022072723,0.000270222,0.00023050701,0.069536075,0.0017741986,0.0009706333,0.9263458],"study_design_scores_gemma":[0.00012157644,0.00004165721,0.00040457674,0.0007314832,0.0000069333723,0.0006520229,0.0000224355,0.9893705,0.0032407055,0.0033802057,0.0019118671,0.00011600469],"about_ca_topic_score_codex":0.000018802599,"about_ca_topic_score_gemma":9.491294e-7,"teacher_disagreement_score":0.98914003,"about_ca_system_score_codex":0.00007420036,"about_ca_system_score_gemma":0.00015169499,"threshold_uncertainty_score":0.99911314},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0030670648,0.0010038567,0.9936107,0.00023783039,0.00014059828,0.00023473757,0.000006332375,0.00037983214,0.0013190772],"genre_scores_gemma":[0.28783053,0.000046663892,0.7119395,0.00003307263,0.000017424823,0.000012041753,0.0000062978347,0.0000068536997,0.00010761142],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991292,0.000027322487,0.0003115245,0.00025165308,0.00014270897,0.0001376057],"domain_scores_gemma":[0.9987049,0.00023188094,0.0000752713,0.00085558556,0.000092995695,0.000039355968],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016827074,0.000095338946,0.00014106979,0.00009871652,0.000090696674,0.00011111736,0.00084820477,0.00004799615,0.000013580115],"category_scores_gemma":[0.000013333986,0.00007997466,0.000054474738,0.00016621927,0.00003913428,0.00096975465,0.00041414326,0.000103104474,0.0000030890146],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022117634,0.00023317392,0.000031758445,0.00124711,0.000057476213,0.000019213889,0.0010757466,0.05761001,0.22383247,0.5006342,0.006493892,0.20874283],"study_design_scores_gemma":[0.00006675875,0.000015789517,0.000006573154,0.00034269964,0.000003642842,0.000005183816,0.0000065422996,0.8553825,0.10807465,0.03261938,0.003391783,0.00008451872],"about_ca_topic_score_codex":0.000045949855,"about_ca_topic_score_gemma":0.0000012134271,"teacher_disagreement_score":0.79777247,"about_ca_system_score_codex":0.000026798592,"about_ca_system_score_gemma":0.000041396306,"threshold_uncertainty_score":0.3261272},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003958237,0.00025120133,0.9918073,0.0015530196,0.00011524147,0.00025748042,0.0000027482063,0.0005920826,0.0014626919],"genre_scores_gemma":[0.15662779,0.000009571558,0.8418938,0.0011899624,0.000024522984,0.000020732532,0.0000061833907,0.000008486241,0.00021893617],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99856037,0.0001502436,0.00025099627,0.00057458784,0.00018514556,0.0002786339],"domain_scores_gemma":[0.9987615,0.00019117675,0.000097464246,0.00080357864,0.000075424956,0.00007085914],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016968841,0.00017296639,0.00029103362,0.00012491607,0.00022862875,0.00021796704,0.0005738176,0.00005527642,0.000043491524],"category_scores_gemma":[0.000043941833,0.00013520366,0.000083185114,0.0005241269,0.00005980445,0.0009717508,0.00065528345,0.00015504652,0.0000017901986],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016031419,0.00023620641,0.001495019,0.00009534008,0.00045113332,0.000085743355,0.00015524613,0.031383444,0.6400196,0.22436056,0.033106428,0.06845094],"study_design_scores_gemma":[0.0003159708,0.000027446875,0.00094208337,0.00001558524,0.00013252793,0.000009869193,0.000013509905,0.89136845,0.084962845,0.021368863,0.0006568442,0.00018597732],"about_ca_topic_score_codex":0.00008945786,"about_ca_topic_score_gemma":0.0000032022906,"teacher_disagreement_score":0.85998505,"about_ca_system_score_codex":0.000030262567,"about_ca_system_score_gemma":0.000030812982,"threshold_uncertainty_score":0.5513445},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004591941,0.000016053003,0.98119885,0.00074464345,0.00017392328,0.00023372857,0.0000021723267,0.0003716501,0.012667069],"genre_scores_gemma":[0.95146036,0.0000033511533,0.043868374,0.0038681792,0.00001229148,0.00006488148,0.0000022359175,0.0000042597,0.0007160402],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9989498,0.00011031602,0.00018494678,0.00034711164,0.00023429509,0.00017350522],"domain_scores_gemma":[0.9985215,0.00030970018,0.00004496287,0.0010647887,0.000037622816,0.000021405016],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034055833,0.000109474386,0.00009475444,0.00018613043,0.000115771756,0.0002309884,0.0012761111,0.000052521696,0.000029729033],"category_scores_gemma":[0.00007448712,0.00007148365,0.00003665521,0.00060186296,0.00003909752,0.00049365073,0.00024302746,0.00017817007,0.000018428747],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000078410725,0.00038386788,0.0014210965,0.00003326427,0.0000061766173,0.000046637644,0.00017187191,0.0014611152,0.008546638,0.07182442,0.0045174337,0.9115091],"study_design_scores_gemma":[0.00083037437,0.00018982789,0.013538204,0.00013073169,0.000002382735,0.000005799095,0.000032375832,0.3944029,0.51598525,0.023353966,0.051252995,0.0002751939],"about_ca_topic_score_codex":0.000052002346,"about_ca_topic_score_gemma":0.000074642885,"teacher_disagreement_score":0.9468684,"about_ca_system_score_codex":0.000052388994,"about_ca_system_score_gemma":0.000031949374,"threshold_uncertainty_score":0.29150188},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0017537704,0.00007626205,0.9939163,0.000458513,0.00007564622,0.0007627305,0.000008625744,0.00055279967,0.0023954045],"genre_scores_gemma":[0.5583151,0.000026873335,0.4403211,0.0005621612,0.0000035132168,0.00043483987,0.000027522723,0.0000040796463,0.0003048303],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9992301,0.00004312732,0.00021789233,0.00025104487,0.00009625188,0.00016162466],"domain_scores_gemma":[0.9984761,0.00030877694,0.00008123458,0.0009931118,0.00010206854,0.000038714155],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016545462,0.00011088696,0.00015220502,0.00010589228,0.00018635904,0.00009396536,0.00082606205,0.000053695905,0.000009109402],"category_scores_gemma":[0.000046056502,0.0000982524,0.00003353728,0.00017864349,0.00004970816,0.00050037715,0.0005181526,0.00007662767,0.000002833355],"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.00017371794,0.00026474535,0.00014107702,0.00017322485,0.000026019841,5.536938e-7,0.00033861422,0.00021720535,0.047487263,0.19179446,0.032314863,0.72706825],"study_design_scores_gemma":[0.0012214443,0.00026032436,0.00023972653,0.00008429867,0.000005297649,3.4616858e-7,0.000026062527,0.20363289,0.7478761,0.03054759,0.0159149,0.00019101077],"about_ca_topic_score_codex":0.000028129478,"about_ca_topic_score_gemma":0.00002131566,"teacher_disagreement_score":0.7268773,"about_ca_system_score_codex":0.000033468954,"about_ca_system_score_gemma":0.000053178726,"threshold_uncertainty_score":0.40066165},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.086500615,0.000060061662,0.86626816,0.01037474,0.0016822118,0.0018394643,0.000019377478,0.0009545306,0.032300834],"genre_scores_gemma":[0.9735661,0.000016854747,0.025720015,0.00029550513,0.000028979353,0.000043353535,5.84924e-7,0.000007815583,0.00032079796],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979905,0.000021457266,0.00063019805,0.0005836334,0.00042791344,0.00034628977],"domain_scores_gemma":[0.9981723,0.00013447204,0.00036871727,0.0005599971,0.0006995866,0.0000649548],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032444752,0.00023953996,0.000282324,0.0001813371,0.00026090737,0.00027140824,0.0034780933,0.000083013314,0.00004535955],"category_scores_gemma":[0.0009741757,0.00017202731,0.000102636746,0.00087716576,0.00029664894,0.0005801372,0.001128162,0.0003135822,0.000022095264],"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.000019056397,0.000030159577,0.000069329,0.00003942513,0.0000070333044,2.509364e-7,0.00014459324,0.000040553707,0.06309585,0.90379065,0.0006798517,0.032083236],"study_design_scores_gemma":[0.000014230651,0.00003798078,0.00007955032,0.00024805323,0.0000051005927,0.0000018545636,0.000044568966,0.06115948,0.46810913,0.47003508,0.00015189336,0.00011307798],"about_ca_topic_score_codex":0.000017548748,"about_ca_topic_score_gemma":0.0000022457239,"teacher_disagreement_score":0.8870655,"about_ca_system_score_codex":0.000082643244,"about_ca_system_score_gemma":0.00011974898,"threshold_uncertainty_score":0.70150703},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008303439,0.000026534382,0.98270005,0.0033660335,0.00036850307,0.0011716314,0.000041023417,0.00028276324,0.003739993],"genre_scores_gemma":[0.90587,0.00004847353,0.09310152,0.00036213646,0.00003224775,0.00018778136,0.0000036241584,0.000019784955,0.0003744152],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99747264,0.000022332935,0.0008309769,0.0007577269,0.00043952052,0.00047681606],"domain_scores_gemma":[0.99750596,0.00015462487,0.00034937917,0.0005756375,0.0013216928,0.0000926737],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00043206135,0.00034502347,0.0004330589,0.00022821817,0.0003650535,0.00034570217,0.003204151,0.00013250725,0.000027243257],"category_scores_gemma":[0.00028470854,0.00025419,0.00021287272,0.00056330115,0.0002667544,0.0012900636,0.0005125274,0.0003672161,0.000015335503],"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.0001581431,0.00013374207,0.000010760621,0.00013412679,0.000016495898,3.0246795e-7,0.00035216616,0.000050847506,0.46982923,0.46101183,0.00055253564,0.06774984],"study_design_scores_gemma":[0.000052696523,0.00007170697,0.0000051463376,0.0005366049,0.000010920783,9.4441924e-7,0.00029974023,0.30704227,0.55527496,0.13639402,0.00014537912,0.00016558226],"about_ca_topic_score_codex":0.000034411896,"about_ca_topic_score_gemma":0.000005032233,"teacher_disagreement_score":0.89756656,"about_ca_system_score_codex":0.00006604279,"about_ca_system_score_gemma":0.00011583153,"threshold_uncertainty_score":0.99999106},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8068162,0.0002428103,0.18953407,0.0014916201,0.00033539013,0.0003906337,0.000012019962,0.00021285926,0.00096436794],"genre_scores_gemma":[0.8664873,3.0936255e-7,0.13314609,0.000080420716,0.000023992592,0.000017650485,0.0000016318209,0.000004788283,0.00023776789],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989114,0.00008226744,0.00030074528,0.00032588857,0.00014146669,0.00023827037],"domain_scores_gemma":[0.9992326,0.00013799565,0.00014147468,0.00042131433,0.00003010621,0.000036491932],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022955313,0.00012686662,0.00020415145,0.00002938327,0.00009319209,0.00004584357,0.0014482834,0.000084447376,0.000007558939],"category_scores_gemma":[0.00003983752,0.00009675514,0.00018826622,0.00029922652,0.000100016056,0.00025914313,0.000881757,0.00027310403,0.0000032274254],"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.000020560483,0.00017609722,0.0193536,0.000025626689,0.00003428661,9.146466e-8,0.00016826799,0.949894,0.00033714483,0.0026130031,0.0107693905,0.01660792],"study_design_scores_gemma":[0.0002665492,0.000024977458,0.12439104,0.00006195282,0.0000067904716,4.9050684e-9,0.000018571653,0.8626738,0.008391967,0.00047417296,0.0035921433,0.00009800266],"about_ca_topic_score_codex":0.00017243846,"about_ca_topic_score_gemma":0.000025633204,"teacher_disagreement_score":0.10503744,"about_ca_system_score_codex":0.00017409372,"about_ca_system_score_gemma":0.000049645136,"threshold_uncertainty_score":0.39455602},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00015147784,0.0005949771,0.99684364,0.000121828634,0.00029807695,0.0013152893,0.00008581836,0.0005322303,0.000056680445],"genre_scores_gemma":[0.41834208,0.0000348781,0.57995725,0.000020105368,0.000017670276,0.0015421229,0.000013229388,0.0000138778005,0.00005879736],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983388,0.000023106631,0.000626031,0.00053134904,0.00020540795,0.00027529345],"domain_scores_gemma":[0.99784386,0.0004919697,0.00021594674,0.0010569384,0.00032358262,0.000067677756],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022371009,0.0002052916,0.00032213147,0.00026132085,0.00014715036,0.00007798817,0.0013416804,0.000091942245,0.0000011837808],"category_scores_gemma":[0.000061729355,0.00021580046,0.00008424056,0.00076035503,0.00006857504,0.0003627873,0.000180918,0.00015892964,0.000006154176],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009198491,0.00008273725,0.000001518083,0.000085644155,0.000018522533,3.4944108e-7,0.000027611797,0.070041984,0.046227764,0.26219586,0.00009307723,0.62121576],"study_design_scores_gemma":[0.00005523289,0.000026368574,0.00002038993,0.00021567318,0.000008889308,9.3967117e-7,0.0000244275,0.90122783,0.081590384,0.010903362,0.00574762,0.00017886843],"about_ca_topic_score_codex":0.000012269398,"about_ca_topic_score_gemma":0.0000017742403,"teacher_disagreement_score":0.8311859,"about_ca_system_score_codex":0.000091363574,"about_ca_system_score_gemma":0.00005358449,"threshold_uncertainty_score":0.88000876},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0007015311,0.00018885381,0.99632406,0.00018586038,0.0010871643,0.0005661822,0.000030492298,0.0007158747,0.00019996725],"genre_scores_gemma":[0.9389008,0.00030109278,0.059787743,0.00014033729,0.00001621307,0.000193331,0.00001951613,0.000017477878,0.00062349014],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982652,0.00009139095,0.0005952339,0.0005284493,0.0003053147,0.0002144003],"domain_scores_gemma":[0.9989511,0.00016630215,0.00013833518,0.00051100587,0.00013879665,0.00009445472],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020896761,0.00022422972,0.00024585502,0.0004467753,0.00028535858,0.00017207407,0.00040732828,0.0000877414,0.000015479889],"category_scores_gemma":[0.0000027089877,0.00022521232,0.00007745022,0.00054554886,0.000049252998,0.00059705484,0.0000014243659,0.00021060048,0.000010993703],"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.00002541424,0.000098945646,0.000021165271,0.00007546478,0.00003800646,0.0000033061349,0.00044622982,0.95154524,0.0015926406,0.016597543,0.00010691446,0.029449154],"study_design_scores_gemma":[0.00055696233,0.00008704178,0.00007741897,0.0005759858,0.000045176523,0.000009340349,0.00036643824,0.883549,0.1086228,0.00035519904,0.0053526503,0.00040200545],"about_ca_topic_score_codex":0.00011109015,"about_ca_topic_score_gemma":0.000017808936,"teacher_disagreement_score":0.9381993,"about_ca_system_score_codex":0.00008552227,"about_ca_system_score_gemma":0.000039048093,"threshold_uncertainty_score":0.9183892},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006414088,0.0006264241,0.98638916,0.004583958,0.000276369,0.00046542802,0.0000058840465,0.0004046108,0.0008340555],"genre_scores_gemma":[0.99214876,0.000058705977,0.0056623076,0.0017301918,0.00006987096,0.0000513702,0.0000071212294,0.000009628491,0.00026207528],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99855286,0.00017833227,0.0001981018,0.0005515819,0.00019516675,0.0003239787],"domain_scores_gemma":[0.9988087,0.00015229174,0.00013792748,0.00070557866,0.000116483454,0.000079044396],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013566155,0.0002316724,0.00021937277,0.000045167526,0.00032348343,0.00021163479,0.00083796075,0.00008818234,0.000004132838],"category_scores_gemma":[0.00001350248,0.00014048569,0.000050367737,0.00039768682,0.000189233,0.00062792347,0.0009898709,0.00036513,0.0000037052746],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007844242,0.00020149839,0.0014741844,0.000042823096,0.00011929525,0.00009027046,0.00029231256,0.009549512,0.0018990997,0.019670058,0.12935409,0.8365224],"study_design_scores_gemma":[0.0007318302,0.00022151948,0.0041484307,0.00028948733,0.000019582407,0.00003594131,0.00007732808,0.98483646,0.00063802983,0.0029503675,0.005785234,0.00026576163],"about_ca_topic_score_codex":0.000041199626,"about_ca_topic_score_gemma":0.00006120879,"teacher_disagreement_score":0.98573464,"about_ca_system_score_codex":0.00003580654,"about_ca_system_score_gemma":0.000013473416,"threshold_uncertainty_score":0.572884},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02092848,0.0001859624,0.9772906,0.00029899977,0.0003131487,0.00047623305,0.00002184071,0.00040643034,0.00007836008],"genre_scores_gemma":[0.8044717,0.000029315628,0.19520542,0.00019049172,0.000013517877,0.000028314971,0.000003946861,0.000009768704,0.00004755257],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99868524,0.00005442838,0.00027766256,0.0005686981,0.00014163065,0.00027231505],"domain_scores_gemma":[0.9989378,0.0003668481,0.00008437581,0.00042015474,0.00009338933,0.00009742951],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003037549,0.00019673847,0.00022076245,0.00022086164,0.00056375074,0.00022885206,0.0003344342,0.00009658079,0.0000025865693],"category_scores_gemma":[0.0000120326895,0.00018623803,0.000042363597,0.000314034,0.000046627953,0.0004797815,0.000024199275,0.00020340027,0.0000014112904],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000051024028,0.00015676359,0.000008118896,0.00012280644,0.000023697492,0.000004789337,0.0004857125,0.12094339,0.0009757879,0.008470535,0.00013175656,0.86862564],"study_design_scores_gemma":[0.0005285407,0.00011882839,0.00004629023,0.0001575908,0.00001735271,0.00001579602,0.0000405389,0.96595466,0.02707536,0.005410871,0.00044679444,0.00018737526],"about_ca_topic_score_codex":0.000020294015,"about_ca_topic_score_gemma":0.000016613909,"teacher_disagreement_score":0.86843824,"about_ca_system_score_codex":0.00003121176,"about_ca_system_score_gemma":0.000040437433,"threshold_uncertainty_score":0.75945663},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017129011,0.00003430355,0.9795679,0.00016676691,0.00044068712,0.000526819,0.000018806833,0.0016120337,0.00050367886],"genre_scores_gemma":[0.86717725,0.000012282149,0.13199511,0.00037058233,0.000017186157,0.00014334195,0.000008562484,0.00001882369,0.000256848],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99801666,0.00015986213,0.00039680366,0.0007102563,0.00028312192,0.0004332935],"domain_scores_gemma":[0.99833184,0.0005102007,0.00013742896,0.0007369266,0.00017056428,0.00011302473],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00022092868,0.00026927667,0.0002618302,0.00031730137,0.0011907299,0.00030786003,0.0006385282,0.00008888251,0.000022518341],"category_scores_gemma":[0.000014271974,0.00024782185,0.00008840853,0.0010765101,0.00007846685,0.0005111439,0.000024750754,0.00056019786,0.000036762125],"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.00005095927,0.00036471282,0.00019962253,0.00003336036,0.00006293751,0.000020979152,0.0003248847,0.7687801,0.002774829,0.000618184,0.0014107042,0.22535872],"study_design_scores_gemma":[0.00089973735,0.00039910685,0.00016301202,0.00043883955,0.000022055434,0.000029245624,0.00015444671,0.902824,0.08345217,0.0003004176,0.010859009,0.00045795288],"about_ca_topic_score_codex":0.00003307475,"about_ca_topic_score_gemma":0.000032638593,"teacher_disagreement_score":0.85004824,"about_ca_system_score_codex":0.0001259123,"about_ca_system_score_gemma":0.000105511026,"threshold_uncertainty_score":0.9999974},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000051164738,0.00006141062,0.9572761,0.00041601816,0.00032849063,0.0002051054,0.0000016521288,0.0020866224,0.03957343],"genre_scores_gemma":[0.4328275,0.000013506497,0.5628921,0.0006164517,0.000021046031,0.0000715746,0.00000647573,0.0000065075697,0.0035448696],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991032,0.000070554,0.00023949315,0.00031513028,0.00013238845,0.00013925917],"domain_scores_gemma":[0.99895763,0.00010567833,0.000057001736,0.0007692017,0.00007506271,0.000035438916],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018492511,0.000097890115,0.00015619471,0.00015642557,0.000079275516,0.000115897936,0.0009882104,0.000047626054,0.000014844685],"category_scores_gemma":[0.00006072903,0.00007786338,0.000040581308,0.00040935157,0.000018755885,0.00062494184,0.0006226294,0.00007801656,0.000043912012],"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.000012873233,0.000021220882,0.000039434985,0.000036268157,0.000009311695,0.000003478529,0.000039880328,0.00005698878,0.0015929958,0.90450567,0.0218347,0.07184718],"study_design_scores_gemma":[0.0018763687,0.000040505583,0.00016849545,0.00055161543,0.000010900469,0.000011763905,0.000081462975,0.7867418,0.109937154,0.021076472,0.07915751,0.0003459684],"about_ca_topic_score_codex":0.000011335596,"about_ca_topic_score_gemma":0.0000015963245,"teacher_disagreement_score":0.88342917,"about_ca_system_score_codex":0.00007067876,"about_ca_system_score_gemma":0.000036494384,"threshold_uncertainty_score":0.31751764},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0003688099,0.0006862813,0.99447924,0.00071970496,0.0008359291,0.000944971,0.000059154478,0.0015536984,0.00035219468],"genre_scores_gemma":[0.96731305,0.00006565587,0.030842638,0.0002756419,0.000013639212,0.00094048685,0.0000042128013,0.000023418657,0.0005212756],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983002,0.00006290181,0.00042168426,0.000679408,0.00016201519,0.00037376655],"domain_scores_gemma":[0.9982742,0.00028521992,0.00013869451,0.0010521484,0.00017774975,0.00007196932],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023187579,0.0002413676,0.0003993172,0.0009332456,0.00048112965,0.00013836611,0.0008668358,0.00026696545,0.000004164185],"category_scores_gemma":[0.00002197449,0.00021876801,0.000085744185,0.0007528442,0.0001450994,0.0004105349,0.000013544139,0.00030504502,0.000007973289],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000080747515,0.0006800067,0.00005483173,0.0008004322,0.0001410136,0.000030343104,0.000078237164,0.01214964,0.20236349,0.13020042,0.0073604006,0.64606047],"study_design_scores_gemma":[0.0019828498,0.00036146215,0.000009291479,0.0006874109,0.00004162578,0.000046774774,0.000079429985,0.51485264,0.41091117,0.01781958,0.052684642,0.0005230805],"about_ca_topic_score_codex":0.00002268433,"about_ca_topic_score_gemma":0.000007943228,"teacher_disagreement_score":0.9669442,"about_ca_system_score_codex":0.00008379507,"about_ca_system_score_gemma":0.00007489321,"threshold_uncertainty_score":0.89211005},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.076681435,0.00007015534,0.9172782,0.004489077,0.0006920247,0.0004031842,0.0000029226935,0.00034817363,0.000034876604],"genre_scores_gemma":[0.10871217,0.000065582535,0.8872838,0.0037675125,0.000069685295,9.552412e-8,0.0000040542764,0.000012839824,0.00008426695],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99785644,0.000101439815,0.0003257983,0.00094469154,0.00027713127,0.0004944951],"domain_scores_gemma":[0.9988041,0.00023209314,0.00015938202,0.0005740504,0.00011154295,0.00011885454],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005077782,0.00026291053,0.00028666342,0.00033176676,0.00073417457,0.00035867176,0.0003574464,0.0000971465,2.3441513e-7],"category_scores_gemma":[0.000106215964,0.00023283402,0.000057597346,0.00041645858,0.00039265514,0.0009166992,0.0004025994,0.0002453081,0.0000013003357],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000069361276,0.0000020069185,0.0000017570347,0.000033905726,0.000002227342,0.000011215332,0.0002339961,0.000015255101,0.4588115,0.000005916138,0.00045139986,0.54042387],"study_design_scores_gemma":[0.00031310247,0.000035227073,0.00034766016,0.00074202265,0.000011814136,0.00013852764,0.00006861452,0.9595274,0.034196023,0.002707183,0.0016032082,0.000309241],"about_ca_topic_score_codex":0.00027766827,"about_ca_topic_score_gemma":0.0000059136555,"teacher_disagreement_score":0.9595121,"about_ca_system_score_codex":0.0000646595,"about_ca_system_score_gemma":0.000039647366,"threshold_uncertainty_score":0.94946957},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000022110738,0.00020227957,0.82884955,0.00082958274,0.00015175129,0.00077843387,0.000012955149,0.0005380395,0.16861527],"genre_scores_gemma":[0.0021782534,0.016447948,0.97866255,0.00020072862,0.000021373993,0.00009229607,0.00011579893,0.000010752553,0.0022703244],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978262,0.000059324557,0.00095833157,0.0004472023,0.00044496646,0.00026393047],"domain_scores_gemma":[0.9964539,0.00018866172,0.0003625767,0.0025711718,0.00032784924,0.000095830845],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010626363,0.0002810686,0.0003478241,0.0021614495,0.00030832808,0.0003174921,0.0041396716,0.0002338661,0.000008653543],"category_scores_gemma":[0.00002824369,0.0002826002,0.000044493558,0.0008314226,0.000631253,0.008866118,0.0025874523,0.0006100498,0.000019996305],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000029548119,0.000020835982,0.0000048902807,0.000028159619,0.0000013507289,5.1426287e-7,0.0007149554,0.000015201188,0.00024497893,0.11909957,0.00056572835,0.87930083],"study_design_scores_gemma":[0.00040287763,0.00008926536,0.00045895242,0.0024044074,0.000005823796,0.00003321077,0.00001506375,0.8101474,0.0023355675,0.038683828,0.14465751,0.0007660923],"about_ca_topic_score_codex":0.00003707427,"about_ca_topic_score_gemma":0.0000025498825,"teacher_disagreement_score":0.8785348,"about_ca_system_score_codex":0.00025663266,"about_ca_system_score_gemma":0.00035712656,"threshold_uncertainty_score":0.9999626},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0049673202,0.00076146197,0.98419076,0.008079796,0.000044898312,0.00023434778,0.000006895471,0.0014793762,0.00023514246],"genre_scores_gemma":[0.7200737,0.00023521084,0.27905527,0.00036667765,0.0000020311534,0.0001379311,0.0000019993593,0.000009789104,0.00011742673],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9989978,0.000055499408,0.00020155599,0.00042693107,0.00012480715,0.00019339875],"domain_scores_gemma":[0.9983768,0.000056719484,0.00007448476,0.0013700571,0.000088629924,0.00003332367],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00011466607,0.00015466416,0.00017991744,0.0006841952,0.00032619355,0.000080909995,0.00082332717,0.00012119729,0.0000051203865],"category_scores_gemma":[0.000006384217,0.00013362082,0.000030478866,0.00081950345,0.00024270047,0.00037453155,0.000031754786,0.0004494845,0.0000055660544],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000029137906,0.0001941804,0.00008362593,0.000034016055,0.00006432605,0.00003018298,0.00018316215,0.00077587937,0.036386672,0.023579646,0.00039302572,0.93824613],"study_design_scores_gemma":[0.001388441,0.00025864237,0.0005795252,0.00084290974,0.000058471964,0.00021083187,0.00026845644,0.10315363,0.8004846,0.05940637,0.032684527,0.0006635844],"about_ca_topic_score_codex":0.0000135094315,"about_ca_topic_score_gemma":0.000013348503,"teacher_disagreement_score":0.93758255,"about_ca_system_score_codex":0.00004731318,"about_ca_system_score_gemma":0.000026468122,"threshold_uncertainty_score":0.5448899},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0016637977,0.000043426844,0.9920761,0.00055683136,0.00012209403,0.00026255363,0.000004141888,0.0009464307,0.0043246243],"genre_scores_gemma":[0.3691535,0.0000061893566,0.6297154,0.0004521272,0.0000096283975,0.0000232878,0.0000072544,0.000007053282,0.00062557496],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989015,0.0000895832,0.0001819719,0.0004303455,0.00019896669,0.00019764752],"domain_scores_gemma":[0.9988719,0.0001381524,0.00009085801,0.00067459955,0.00017220696,0.000052241172],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00008306103,0.00015250847,0.00014916857,0.00012710696,0.0001478376,0.00012727514,0.0007518668,0.000043258362,0.000016890343],"category_scores_gemma":[0.000033214135,0.00010746812,0.00002335556,0.0005352392,0.000058256217,0.0013690784,0.0005047237,0.00014045043,0.000018515935],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002639233,0.00034862632,0.0009838012,0.00006477745,0.000046635,0.00006297979,0.00030997515,0.0014017015,0.12206616,0.73600423,0.017239057,0.12120814],"study_design_scores_gemma":[0.0005018937,0.00012890702,0.00339213,0.0001448878,0.000006744954,0.0000044428048,0.000027770358,0.81971675,0.17028017,0.0030516963,0.002509515,0.00023506164],"about_ca_topic_score_codex":0.000034795838,"about_ca_topic_score_gemma":0.000009650075,"teacher_disagreement_score":0.8183151,"about_ca_system_score_codex":0.000028917508,"about_ca_system_score_gemma":0.0000378802,"threshold_uncertainty_score":0.4382423},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0043828,0.000014428634,0.985236,0.00027516004,0.00012601998,0.00020421259,0.0000182687,0.00040225443,0.009340869],"genre_scores_gemma":[0.7480287,0.0000026709024,0.25128883,0.00038651607,0.0000039090396,0.000008745011,0.000011689992,0.0000031287232,0.00026578284],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998869,0.000079149766,0.00023099162,0.00036983553,0.0002703638,0.00018064941],"domain_scores_gemma":[0.99871194,0.00010988375,0.00009759171,0.00093266554,0.000103580845,0.000044337947],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019155072,0.00011948139,0.0001752462,0.00020379406,0.000100629084,0.000023975534,0.00080609217,0.00006864868,0.000021932174],"category_scores_gemma":[0.000023072755,0.00009939145,0.00006513864,0.00029963313,0.0000255658,0.0005228984,0.0005655168,0.0001203876,0.00000633601],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015914172,0.0019495899,0.0015494458,0.00015913956,0.00002431255,0.000017157055,0.00009533666,0.048548482,0.043981783,0.8011824,0.023425056,0.07890816],"study_design_scores_gemma":[0.00043744102,0.00003913519,0.0019418913,0.00014126427,0.0000024012254,2.3218952e-7,0.000003865937,0.9214462,0.06524181,0.009995449,0.00065988,0.00009043124],"about_ca_topic_score_codex":0.0000328518,"about_ca_topic_score_gemma":0.000004327743,"teacher_disagreement_score":0.8728977,"about_ca_system_score_codex":0.000033379158,"about_ca_system_score_gemma":0.00003372397,"threshold_uncertainty_score":0.40530658},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000039038474,0.0005067128,0.98611236,0.0065811505,0.00020860313,0.00038018645,0.00003730742,0.002016649,0.004117978],"genre_scores_gemma":[0.24310562,0.00022677344,0.7542905,0.0003509443,0.00003099864,0.00028816264,0.00007848206,0.000014819125,0.0016136798],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99898076,0.00006598229,0.0002420393,0.0003938675,0.00013668771,0.00018065286],"domain_scores_gemma":[0.99644315,0.001112611,0.00003732286,0.0022358587,0.00011388626,0.000057196296],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025558655,0.000100913145,0.00011611998,0.00014469841,0.00019088761,0.00027704486,0.001670537,0.00003747974,0.000036374684],"category_scores_gemma":[0.00016227324,0.00008747311,0.00006762887,0.0005734402,0.00005961218,0.0008067488,0.0007166291,0.000105678984,0.00007356993],"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.000002688242,0.000051216397,0.00019475116,0.000049390444,0.000025071555,0.0000035949124,0.0001723986,0.00004083365,0.003909863,0.7866232,0.13044503,0.07848199],"study_design_scores_gemma":[0.00012702134,0.000032825406,0.0006558738,0.00006894525,0.0000047426474,0.0000151488175,0.000017064283,0.5277239,0.007129148,0.08042639,0.38358295,0.0002159767],"about_ca_topic_score_codex":0.000022251872,"about_ca_topic_score_gemma":0.000036079833,"teacher_disagreement_score":0.7061968,"about_ca_system_score_codex":0.000026100992,"about_ca_system_score_gemma":0.000046029625,"threshold_uncertainty_score":0.356705},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0032961054,0.000086669126,0.99418104,0.00056288746,0.00015765458,0.00041819405,0.000004267501,0.0004552706,0.00083790714],"genre_scores_gemma":[0.5083385,0.000037463164,0.49040887,0.00084132893,0.00002384005,0.00010552569,0.000011051446,0.0000054109105,0.00022799631],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986222,0.00012433369,0.000314954,0.000452108,0.00029756897,0.00018886794],"domain_scores_gemma":[0.9989922,0.00047028137,0.000101514466,0.00023715175,0.00011860933,0.00008023127],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00065824424,0.00012016885,0.0001671491,0.00012887728,0.00024188089,0.00008349541,0.0003654257,0.00008323655,0.000014294978],"category_scores_gemma":[0.0001938781,0.00009667216,0.000029693714,0.00035316608,0.00004489924,0.0006133002,0.00029183857,0.00011944176,0.0000012066557],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001618869,0.00025116632,0.0030113228,0.00016250878,0.000032444885,0.0000016292958,0.000355565,0.000293995,0.097259544,0.36453918,0.011546236,0.5223845],"study_design_scores_gemma":[0.00082896213,0.0001433996,0.0021175663,0.00019224563,0.0000059156205,0.000004228744,0.00005570754,0.74906766,0.21968223,0.026567683,0.0011373473,0.00019706086],"about_ca_topic_score_codex":0.00005920887,"about_ca_topic_score_gemma":0.000026064528,"teacher_disagreement_score":0.74877363,"about_ca_system_score_codex":0.00005382268,"about_ca_system_score_gemma":0.00009647344,"threshold_uncertainty_score":0.39421764},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0020840054,0.00011839303,0.9945252,0.0004254206,0.0003510962,0.0011726428,0.000004798771,0.0011451163,0.00017334234],"genre_scores_gemma":[0.58316183,0.000073515606,0.41621056,0.00013754284,0.000013933245,0.00018900083,0.000017621935,0.000018552711,0.00017740883],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99777263,0.0003070106,0.000618021,0.0006883624,0.00027158976,0.00034236308],"domain_scores_gemma":[0.997559,0.0007558171,0.00019667241,0.0010825441,0.00032026993,0.00008566624],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00056410703,0.00024672554,0.00029032637,0.0003892875,0.0010605268,0.00016680219,0.00090960995,0.00011792763,0.000011596341],"category_scores_gemma":[0.00003888645,0.00025659386,0.00016661228,0.0009373386,0.00007053663,0.0007947053,0.000029237895,0.0005132301,0.000010530726],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000055101813,0.00024837424,0.000010451423,0.000077643956,0.00003742562,0.00000301343,0.00056312745,0.18092759,0.06564278,0.0012831973,0.00034136663,0.7508099],"study_design_scores_gemma":[0.0005915199,0.00012422701,0.000043001222,0.0004125752,0.000022041886,0.000007810359,0.00006491021,0.7867558,0.2078302,0.0015535908,0.0023878217,0.00020649291],"about_ca_topic_score_codex":0.00004934626,"about_ca_topic_score_gemma":0.0000050306257,"teacher_disagreement_score":0.75060344,"about_ca_system_score_codex":0.00012642269,"about_ca_system_score_gemma":0.00006785583,"threshold_uncertainty_score":0.9999886},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00042125222,0.0006935283,0.9927085,0.0044120364,0.000048151313,0.00082066376,0.00003702766,0.00047387785,0.0003849799],"genre_scores_gemma":[0.4982371,0.0006956372,0.50045407,0.00019707468,0.0000027173455,0.00026890455,0.000017611177,0.000015224219,0.00011164844],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984638,0.0003130093,0.00042484913,0.00041509807,0.00016320028,0.00022003753],"domain_scores_gemma":[0.9953983,0.0008904628,0.00015843853,0.0032416258,0.00023094659,0.00008027003],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0003383932,0.00021255303,0.00023389654,0.0003968295,0.0013330352,0.00014426207,0.0020680425,0.00012569915,0.0000028584454],"category_scores_gemma":[0.000010654853,0.00022608964,0.00009016996,0.0007005673,0.0002692733,0.0008565757,0.00005335982,0.00037642932,0.000002598026],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008638029,0.0006725319,0.0000029964342,0.000092213406,0.000101488615,4.504054e-7,0.00096508727,0.0020368448,0.054538008,0.09803905,0.0006245218,0.84284043],"study_design_scores_gemma":[0.0005589725,0.000070584196,0.000025501788,0.00048673275,0.00006747628,0.0000071891022,0.00013372359,0.89438766,0.086465046,0.009361307,0.008163184,0.0002726307],"about_ca_topic_score_codex":0.0000616606,"about_ca_topic_score_gemma":0.000033028766,"teacher_disagreement_score":0.8923508,"about_ca_system_score_codex":0.00012306095,"about_ca_system_score_gemma":0.00010204538,"threshold_uncertainty_score":0.9999671},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0034939921,0.0037816009,0.9910886,0.00007463923,0.00026262697,0.00034031607,0.000013997983,0.0006005911,0.0003435925],"genre_scores_gemma":[0.079633154,0.0022833785,0.91739684,0.00015336016,0.000060354552,0.00006926004,0.000051260762,0.000026058931,0.00032635577],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9980133,0.00010475586,0.0005004873,0.0005318874,0.0003685104,0.00048101618],"domain_scores_gemma":[0.99839103,0.0001240045,0.00021855244,0.0009992598,0.0001892043,0.00007792135],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019831625,0.0002213705,0.0002968571,0.00025392996,0.00012874245,0.00006107894,0.0010639424,0.00014103692,0.000018354152],"category_scores_gemma":[0.000064275184,0.00022347776,0.00007321054,0.00071966596,0.000042736367,0.00047962787,0.00044945008,0.00027518658,0.000003793124],"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.00008035479,0.0005754456,0.000301026,0.00021947845,0.00023420583,0.000033667082,0.0007115323,0.033302736,0.3224368,0.036324404,0.008479683,0.59730065],"study_design_scores_gemma":[0.00033750967,0.00012626685,0.000062788735,0.00008260026,0.000011270792,0.0000052691494,0.0000026552289,0.42714587,0.55857366,0.010257895,0.0032391024,0.00015512427],"about_ca_topic_score_codex":0.0000039503743,"about_ca_topic_score_gemma":0.00000678415,"teacher_disagreement_score":0.5971455,"about_ca_system_score_codex":0.00020190871,"about_ca_system_score_gemma":0.00038679366,"threshold_uncertainty_score":0.91131586},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000957084,0.0009853601,0.9689326,0.003707205,0.001728216,0.0013484681,0.000110706904,0.0021898877,0.020040467],"genre_scores_gemma":[0.46818173,0.0004416724,0.5116766,0.0019292823,0.00013768107,0.00010918423,0.000042309963,0.000056082892,0.01742546],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9910656,0.0007213772,0.0020399261,0.003156541,0.0013367693,0.0016797562],"domain_scores_gemma":[0.99183625,0.00071597676,0.00083008205,0.00510578,0.0010443755,0.00046753648],"candidate_categories":["metaepi_narrow","open_science","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00093993964,0.0012386658,0.0013846117,0.0007452042,0.0012582531,0.0009555076,0.006315106,0.0005967548,0.0010130252],"category_scores_gemma":[0.00048001588,0.0011459048,0.00033669072,0.0025931213,0.0006931858,0.0035509458,0.007739006,0.0013083031,0.0008548316],"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.0001436945,0.0005570607,0.000031398093,0.0002367303,0.00007913464,0.000044905562,0.00021982695,0.00019412489,0.4314095,0.042226467,0.06210967,0.46274748],"study_design_scores_gemma":[0.0017073267,0.0002484676,0.0015658787,0.0018610874,0.000052888692,0.000016039708,0.000077533514,0.17235032,0.7717923,0.030330688,0.0186739,0.0013235956],"about_ca_topic_score_codex":0.00040301186,"about_ca_topic_score_gemma":0.000044986886,"teacher_disagreement_score":0.46722466,"about_ca_system_score_codex":0.00028934516,"about_ca_system_score_gemma":0.00049392716,"threshold_uncertainty_score":0.9999231},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.053192183,0.00042532166,0.9433311,0.0005835177,0.000267982,0.00086502166,0.00021379194,0.0008968902,0.00022414514],"genre_scores_gemma":[0.13353898,0.000461714,0.8639129,0.00040372994,0.000054554537,0.0002882743,0.00016835946,0.000041295087,0.0011302097],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99627715,0.00025725737,0.00061655464,0.0017861738,0.00047564416,0.0005871971],"domain_scores_gemma":[0.99642164,0.00015149267,0.0005539118,0.0023454763,0.00030086964,0.00022659167],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003685572,0.0006658395,0.0007285374,0.00030432953,0.00034836764,0.00020563431,0.0019642306,0.00043247483,0.000018719975],"category_scores_gemma":[0.00008791878,0.0005768209,0.000106765016,0.00024387758,0.00028607177,0.0008825812,0.0059532113,0.0012275523,0.000026173226],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0019752793,0.004335018,0.079613626,0.0060383575,0.0013204387,0.00095189566,0.0074756574,0.04103134,0.4048902,0.075203516,0.03469139,0.34247327],"study_design_scores_gemma":[0.001898334,0.000105261955,0.011742711,0.0014503477,0.000044202752,0.00002276582,0.0000287853,0.938445,0.031932216,0.010896717,0.0023347018,0.0010990038],"about_ca_topic_score_codex":0.00007322483,"about_ca_topic_score_gemma":0.000012605648,"teacher_disagreement_score":0.8974136,"about_ca_system_score_codex":0.00018464783,"about_ca_system_score_gemma":0.00033648105,"threshold_uncertainty_score":0.9996683},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0018039407,0.00052643055,0.9890696,0.0020145043,0.0012462027,0.0010873991,0.00002503967,0.00045590536,0.0037709703],"genre_scores_gemma":[0.62338763,0.00039137207,0.36671522,0.002673559,0.00009798042,0.00034083103,0.000025477906,0.000028144788,0.0063397908],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9969419,0.00017863612,0.00089249713,0.0010798577,0.00020912789,0.0006979397],"domain_scores_gemma":[0.99684244,0.0016350531,0.00022203487,0.0010045788,0.00019169468,0.00010417902],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00090688834,0.00039469005,0.00050930976,0.00061877404,0.00036094984,0.0006685783,0.0019048991,0.0001721625,0.000112592155],"category_scores_gemma":[0.0010795135,0.0003727974,0.0001322762,0.0013910334,0.00012276878,0.002050365,0.001956541,0.00032891444,0.000015117739],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011672387,0.00028837568,0.0008378586,0.00020765631,0.000019856856,0.000011660233,0.00015382022,0.000087293,0.01114519,0.33339432,0.016455276,0.63728195],"study_design_scores_gemma":[0.0010687857,0.00016550827,0.0010959842,0.0005944842,0.000009860131,0.0000025976128,0.000033709424,0.79862964,0.06901928,0.07317503,0.055716775,0.0004883783],"about_ca_topic_score_codex":0.00011287394,"about_ca_topic_score_gemma":0.0000753978,"teacher_disagreement_score":0.7985423,"about_ca_system_score_codex":0.00015875662,"about_ca_system_score_gemma":0.0003651714,"threshold_uncertainty_score":0.9998724},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00011680211,0.00019797967,0.93424886,0.004852337,0.00097450754,0.0009543676,0.000058929087,0.0012184985,0.057377707],"genre_scores_gemma":[0.06185548,0.00011567917,0.9249872,0.0056464677,0.00008720597,0.000074308155,0.000025642124,0.00004672583,0.007161283],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9938545,0.0006717255,0.0010064339,0.0023018538,0.0011160298,0.0010494047],"domain_scores_gemma":[0.9941582,0.0007728699,0.00034733294,0.004003955,0.0003548536,0.00036275672],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008188651,0.0008736903,0.0008521245,0.0009243369,0.00076654565,0.0005644002,0.0037408345,0.0004267314,0.00044280873],"category_scores_gemma":[0.00021651427,0.0007364503,0.0003652118,0.0014152436,0.00022674978,0.0013846435,0.0028346046,0.0010817912,0.00009585786],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005266473,0.0023103058,0.000036189012,0.00020865415,0.0000390188,0.0000645764,0.0002503547,0.10066485,0.17933914,0.27957588,0.121487536,0.31549683],"study_design_scores_gemma":[0.0010812595,0.00021758262,0.00006174489,0.00081393326,0.000027197817,0.0000024072592,0.00002061054,0.7933105,0.17077854,0.029322578,0.0037689472,0.0005946704],"about_ca_topic_score_codex":0.000065289125,"about_ca_topic_score_gemma":0.0000039735924,"teacher_disagreement_score":0.69264567,"about_ca_system_score_codex":0.0003375803,"about_ca_system_score_gemma":0.0004864151,"threshold_uncertainty_score":0.9995087},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00016998964,0.0018767177,0.9638268,0.0023815467,0.0003542495,0.0010248481,0.000026208125,0.0002754961,0.030064182],"genre_scores_gemma":[0.6955024,0.0007567596,0.30003113,0.0018910535,0.00000956974,0.00037576607,0.00002209992,0.000012600601,0.0013986008],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9971233,0.00040451583,0.00079871924,0.00083488505,0.00028893678,0.00054966944],"domain_scores_gemma":[0.9932961,0.0010663216,0.00023782146,0.0050612283,0.00022799971,0.00011051277],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.00053591403,0.000327102,0.00043985844,0.0007858563,0.00042428385,0.00022699342,0.0054771234,0.00017685679,0.00016222779],"category_scores_gemma":[0.00017252672,0.00034829305,0.00012586912,0.0025018991,0.00036712518,0.00095244526,0.00434005,0.0006699658,0.00007060032],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007664828,0.0018949232,0.0034316056,0.00025014617,0.00007749284,0.000042119744,0.0016605038,0.003337293,0.02467725,0.51478577,0.040985994,0.40878028],"study_design_scores_gemma":[0.0013222519,0.00017536801,0.0011718383,0.0015503156,0.000022767388,0.0000023869966,0.00056817784,0.73706883,0.18416949,0.009510256,0.06371366,0.00072464923],"about_ca_topic_score_codex":0.00022792902,"about_ca_topic_score_gemma":0.00013913064,"teacher_disagreement_score":0.73373157,"about_ca_system_score_codex":0.00037500844,"about_ca_system_score_gemma":0.000643101,"threshold_uncertainty_score":0.99990374},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00037738014,0.0004482078,0.9924835,0.0031343848,0.0010633472,0.000461831,0.000015187556,0.0001107838,0.0019054082],"genre_scores_gemma":[0.50122654,0.00049191766,0.49657395,0.00050801155,0.0007318576,0.00006353201,0.000015834717,0.000019641659,0.0003687263],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9966504,0.00023376745,0.001214391,0.0005556335,0.0010672398,0.00027854927],"domain_scores_gemma":[0.99395746,0.0006112334,0.0013120737,0.00061783777,0.003353661,0.00014774661],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00048586793,0.00030883463,0.0004563869,0.0009854481,0.00029045108,0.000624467,0.0032845493,0.00011412146,0.000032289634],"category_scores_gemma":[0.000054064498,0.00028420528,0.00020958188,0.0011157718,0.00019435093,0.0018733059,0.00097440527,0.00085408834,0.000019163306],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00025509158,0.00044169105,0.0014612442,0.000019972364,0.0007441148,0.00006893037,0.00060237345,0.02323047,0.0011807417,0.21350645,0.00464877,0.75384015],"study_design_scores_gemma":[0.0038989699,0.0011696328,0.0067775846,0.0030549553,0.00025961726,0.0010668717,0.00040474872,0.700465,0.019346526,0.04871854,0.21383823,0.000999283],"about_ca_topic_score_codex":0.000012639033,"about_ca_topic_score_gemma":0.000002337829,"teacher_disagreement_score":0.7528409,"about_ca_system_score_codex":0.00032499462,"about_ca_system_score_gemma":0.00050944096,"threshold_uncertainty_score":0.999961},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0044426583,0.000058704896,0.99122566,0.0029845901,0.00015876534,0.0005657625,0.000028402903,0.00047257612,0.00006286103],"genre_scores_gemma":[0.5580108,0.00003725592,0.44090274,0.0008685974,0.000054854172,0.000042861375,0.00005683861,0.000019399602,0.000006653399],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99737334,0.00012990355,0.0005806555,0.00097615493,0.00048994884,0.0004499835],"domain_scores_gemma":[0.9978406,0.0003051958,0.0003632553,0.0006145903,0.0006333203,0.00024307144],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00043692524,0.00037854465,0.000368894,0.00058824144,0.00074341666,0.0013729131,0.00079719035,0.00017782518,0.000018112594],"category_scores_gemma":[0.000101430465,0.00035343453,0.00008854703,0.00064151344,0.00025738846,0.0016990296,0.00017117527,0.00038672448,0.0000096350195],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000028156095,0.00020577168,0.000029441111,0.00021066048,0.0000073617794,0.000012988861,0.00042369403,0.000046345624,0.0009884504,0.025707064,0.0010457181,0.97129434],"study_design_scores_gemma":[0.0008755866,0.00040308046,0.0010565168,0.0007432362,0.000007033853,0.000017666169,0.0000056129375,0.9609855,0.0060998034,0.028963597,0.0004146872,0.0004277114],"about_ca_topic_score_codex":0.0000035998673,"about_ca_topic_score_gemma":0.0000021280725,"teacher_disagreement_score":0.9708666,"about_ca_system_score_codex":0.00004151326,"about_ca_system_score_gemma":0.00008615095,"threshold_uncertainty_score":0.99989176},"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":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[1.9440137e-8,0.00017571557,0.49132034,0.0001344434,0.00011049586,0.00023667752,0.000027144399,0.0018959699,0.50609916],"genre_scores_gemma":[0.00002564889,0.0002170702,0.36025187,0.0009856737,0.000065979766,0.000028571285,0.00006141991,0.000066515524,0.63829726],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9974605,0.000016884185,0.0005385899,0.0010321821,0.0006108851,0.00034096368],"domain_scores_gemma":[0.99682343,0.000118463715,0.000344795,0.0023642196,0.00016271418,0.0001863834],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00011464358,0.00058183196,0.0005220935,0.00031604894,0.00012816735,0.0004137305,0.0023726462,0.00047570065,0.0003660347],"category_scores_gemma":[0.000030747677,0.00048552165,0.00019189846,0.00006160034,0.00011698135,0.0016337382,0.0017408964,0.00058940874,0.0003002869],"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.0000018640883,0.000014366172,5.915774e-7,0.000011644098,0.000008968288,0.000027864275,0.000003628275,1.8697897e-7,0.00013916711,0.518185,0.17769818,0.30390853],"study_design_scores_gemma":[0.000048777405,0.00005592309,3.0900208e-7,0.0002659265,0.000003691522,0.000037864724,3.276936e-7,0.0000838381,0.0124538,0.20371641,0.78283745,0.0004956741],"about_ca_topic_score_codex":0.0000010518941,"about_ca_topic_score_gemma":3.9211912e-7,"teacher_disagreement_score":0.60513926,"about_ca_system_score_codex":0.00009288009,"about_ca_system_score_gemma":0.000052702275,"threshold_uncertainty_score":0.9997597},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0004955325,0.0004450063,0.9785333,0.018603852,0.00003714326,0.0005928103,0.0000793178,0.00016023616,0.0010527828],"genre_scores_gemma":[0.5988388,0.00043327842,0.39849395,0.0019050774,0.000009374739,0.00021442628,0.000025164216,0.000013356373,0.00006658197],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982426,0.0004075652,0.0006016099,0.00024121038,0.00024204313,0.0002649656],"domain_scores_gemma":[0.9895753,0.0010808047,0.00032701864,0.008505201,0.00041581612,0.00009582987],"candidate_categories":["open_science"],"consensus_categories":[],"category_scores_codex":[0.0006818055,0.00016115197,0.00029139736,0.00011559126,0.00035287775,0.00004589593,0.0083399275,0.0000800226,0.00010373007],"category_scores_gemma":[0.00012727651,0.000130183,0.0001393905,0.00078339624,0.00021291434,0.00041337736,0.000996479,0.00029502512,0.000008159431],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007723193,0.0014961845,0.000085914675,0.000028070419,0.00017173294,4.4612645e-7,0.0003739136,0.20867577,0.009885081,0.34623203,0.02419696,0.40877667],"study_design_scores_gemma":[0.00043684058,0.00019659089,0.0015580057,0.0001127798,0.00002281065,0.0000020316963,0.000021598704,0.9154424,0.021489693,0.009284326,0.05113366,0.0002992815],"about_ca_topic_score_codex":0.00011008562,"about_ca_topic_score_gemma":0.000050988867,"teacher_disagreement_score":0.7067666,"about_ca_system_score_codex":0.000012911001,"about_ca_system_score_gemma":0.00007845256,"threshold_uncertainty_score":0.99702543},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00039403292,0.000064573964,0.9496909,0.0003023463,0.00032256037,0.00010029285,0.00006129625,0.00067459163,0.0483894],"genre_scores_gemma":[0.13640055,0.000039326547,0.8619019,0.0005353919,0.00010749872,0.000030626386,0.000058773236,0.000009363145,0.0009166139],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99927735,0.000023427485,0.00010059532,0.00013907498,0.00019276244,0.00026677322],"domain_scores_gemma":[0.99913275,0.00006554003,0.00004797591,0.00062108325,0.000024618808,0.000108018714],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00010817927,0.000076815704,0.00007491167,0.000051314644,0.00008985331,0.000032808504,0.00071917294,0.000037807855,0.0015965208],"category_scores_gemma":[0.00003689578,0.000056964196,0.000028058139,0.00013830906,0.000018220318,0.0018380494,0.0006643061,0.00009051539,0.00063235254],"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.0000020689426,0.000033777815,0.000071513634,0.0000045675674,0.000001445534,0.0000011519741,0.00012295599,5.545858e-7,0.009185327,0.014883976,0.86643046,0.10926219],"study_design_scores_gemma":[0.00007955346,0.00002232422,0.00033447938,0.000018023433,9.4295694e-7,0.000009092637,0.00000736076,0.0025227498,0.043531954,0.010776296,0.9425846,0.00011265236],"about_ca_topic_score_codex":0.0000011397478,"about_ca_topic_score_gemma":9.552551e-8,"teacher_disagreement_score":0.13600652,"about_ca_system_score_codex":0.000028195249,"about_ca_system_score_gemma":0.000010288675,"threshold_uncertainty_score":0.99931616},"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":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00007265752,0.00026388705,0.09122437,0.00041243198,0.0003142396,0.0007340103,0.00056561484,0.0013631114,0.9050497],"genre_scores_gemma":[0.0080301305,0.0006799374,0.036358293,0.0002340446,0.00034550976,7.023296e-7,0.0019688695,0.0076169334,0.94476557],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99751514,0.0001750117,0.00035081027,0.000879961,0.0005312745,0.00054777804],"domain_scores_gemma":[0.9981987,0.000014481037,0.0001686051,0.001328423,0.00013522123,0.00015456577],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0005323354,0.00029089168,0.00025380345,0.00081285473,0.00041983172,0.0006997767,0.003274929,0.00013348075,0.08514298],"category_scores_gemma":[0.00011705412,0.0002948721,0.000048552505,0.00089399907,0.00011937418,0.00033083998,0.0051045762,0.0005449926,0.062425412],"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.0000051410952,0.000046892197,0.0000066838943,0.00014254249,0.000013351577,0.000050215087,0.00017213624,0.000009359335,0.0002195603,0.0032479782,0.94596326,0.050122876],"study_design_scores_gemma":[0.00019822564,0.00013052984,0.00007004214,0.0003735281,0.0000048557918,0.000097338285,0.000014203025,0.0013878086,0.00038881283,0.00026458985,0.9967532,0.0003168361],"about_ca_topic_score_codex":0.00012706692,"about_ca_topic_score_gemma":0.000008588654,"teacher_disagreement_score":0.05486608,"about_ca_system_score_codex":0.00033628134,"about_ca_system_score_gemma":0.000012429494,"threshold_uncertainty_score":0.99995035},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004187919,0.003137765,0.8785148,0.0025162478,0.00022387576,0.0032698384,0.0046463665,0.004034276,0.09946887],"genre_scores_gemma":[0.85093445,0.004198615,0.06388598,0.0005371657,0.000716217,0.000008798939,0.010769014,0.009891503,0.059058283],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9978778,0.00027123472,0.00034272857,0.0008619196,0.00028815083,0.0003581899],"domain_scores_gemma":[0.9988345,0.000053116655,0.000117395124,0.0006615074,0.00012833173,0.0002051402],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00039710072,0.00025107755,0.00029357505,0.0008171521,0.00040275083,0.0009292452,0.0007454571,0.00015789678,0.00092812954],"category_scores_gemma":[0.0004414843,0.0002634437,0.000031702402,0.0010559853,0.00010010882,0.00048304614,0.0023321768,0.00047239792,0.0006854714],"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.000023703242,0.00012455214,0.00010987424,0.0004632,0.000035172317,0.00006189745,0.0005400259,0.000031361495,0.0003005241,0.0064798384,0.7585296,0.23330025],"study_design_scores_gemma":[0.00038822563,0.0001845706,0.004580133,0.0015744099,0.000016171256,0.00006990992,0.00002481278,0.002481096,0.00007607526,0.0052877553,0.98492795,0.00038887214],"about_ca_topic_score_codex":0.00013638404,"about_ca_topic_score_gemma":0.00004283686,"teacher_disagreement_score":0.8467465,"about_ca_system_score_codex":0.00020081406,"about_ca_system_score_gemma":0.000008279972,"threshold_uncertainty_score":0.99998516},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8255408,0.00048919604,0.1672762,0.0027472991,0.000187369,0.000818527,0.000119916156,0.0005682291,0.0022524956],"genre_scores_gemma":[0.9949633,0.00017523968,0.0044530057,0.000041466275,0.000013632579,3.2619656e-8,0.00012193262,0.00014244652,0.00008895211],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9982654,0.00030695627,0.00041543457,0.0003984633,0.00037080087,0.0002429361],"domain_scores_gemma":[0.9986337,0.000082490245,0.00016788337,0.0006675998,0.00034255986,0.000105803614],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033031747,0.00011185115,0.00020969701,0.0001933201,0.0001915327,0.00011880969,0.0012512266,0.000045776964,0.00074306584],"category_scores_gemma":[0.0008633751,0.00012353699,0.000026372256,0.00097488443,0.0000555622,0.0006548324,0.0017109441,0.00018182871,0.000040956013],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","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.00077593455,0.0018978666,0.011548932,0.0027986143,0.00008559121,0.001074026,0.00787614,0.0023111657,0.45389342,0.022498608,0.20414896,0.29109073],"study_design_scores_gemma":[0.002592131,0.0006043665,0.20871484,0.005481877,0.000015086974,0.0003509861,0.0004136906,0.013590036,0.4322161,0.002021881,0.3330211,0.0009778774],"about_ca_topic_score_codex":0.048186563,"about_ca_topic_score_gemma":0.019041227,"teacher_disagreement_score":0.29011285,"about_ca_system_score_codex":0.00019615168,"about_ca_system_score_gemma":0.00012356369,"threshold_uncertainty_score":0.9988587},"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":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[9.004077e-7,0.0006857776,0.1678923,0.00034877306,0.0013226953,0.0005728842,0.0006429749,0.002821058,0.8257126],"genre_scores_gemma":[0.000054957036,0.00117822,0.06219189,0.00026453912,0.00019369552,0.000002576482,0.000026292111,0.00031305721,0.9357748],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9971123,0.00017864403,0.00021331382,0.0012935147,0.0005850168,0.0006172196],"domain_scores_gemma":[0.9955087,0.00011849934,0.00046137284,0.0036122196,0.00003368952,0.00026554486],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.00004344486,0.00066434534,0.0006817673,0.0006849113,0.00015816498,0.00018972109,0.0058915024,0.0006023644,0.00052947097],"category_scores_gemma":[0.000017066237,0.0006631242,0.0002260599,0.00061307754,0.00013020939,0.002905136,0.00518208,0.0006465231,0.00023603506],"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.000023860433,0.00006714013,0.000012226344,0.000089251764,0.00006925789,0.0002124586,0.00011019719,0.00001011286,0.000009447403,0.0057524666,0.99226147,0.0013821197],"study_design_scores_gemma":[0.00091989787,0.00008487418,0.000017608614,0.0003646764,0.00003009873,0.0000033562408,0.000044855165,0.00031814555,0.0005201795,0.00081634044,0.99602854,0.0008514333],"about_ca_topic_score_codex":0.0011525955,"about_ca_topic_score_gemma":0.031454757,"teacher_disagreement_score":0.110062145,"about_ca_system_score_codex":0.0000760771,"about_ca_system_score_gemma":0.00023840585,"threshold_uncertainty_score":0.999582},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000099840625,0.00021983606,0.9936573,0.0003380416,0.00010481754,0.0006676783,0.0010031615,0.0023777196,0.001531637],"genre_scores_gemma":[0.16373168,0.00019409474,0.82339305,0.00008216726,0.00021525323,0.0000015286357,0.010357584,0.0016744088,0.0003502618],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99835724,0.00016329826,0.00030848567,0.0005300137,0.00036137237,0.00027959904],"domain_scores_gemma":[0.99831903,0.000059619284,0.00012729259,0.0006337699,0.00075036305,0.00010992177],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003921604,0.0001449374,0.00016275355,0.00024881941,0.00079376076,0.0008383935,0.00165977,0.00006266047,0.00034816746],"category_scores_gemma":[0.0002656564,0.00013695392,0.00006224448,0.000715699,0.00012344585,0.0010525795,0.0017834852,0.00016862027,0.00022592596],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014104717,0.000106289626,1.8612144e-7,0.00014805055,0.000021387756,0.000009202728,0.00030422676,0.000065269705,0.020544987,0.017856948,0.08982256,0.8711068],"study_design_scores_gemma":[0.00025217596,0.00018011549,0.000017082873,0.00018771473,0.0000076066003,0.000040635827,0.000022923756,0.38498,0.027951526,0.0042000916,0.5820044,0.00015574123],"about_ca_topic_score_codex":0.0000020182197,"about_ca_topic_score_gemma":1.475568e-8,"teacher_disagreement_score":0.87095106,"about_ca_system_score_codex":0.000084138366,"about_ca_system_score_gemma":0.0000071556437,"threshold_uncertainty_score":0.8084648},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000020865077,0.00011388723,0.38936007,0.00020290796,0.00014977978,0.00056789373,0.0003032965,0.004875371,0.6044247],"genre_scores_gemma":[0.0010614586,0.00054121116,0.078517474,0.00049716845,0.00046358554,3.189649e-7,0.003533204,0.016557692,0.8988279],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9976591,0.00030789908,0.00026864288,0.0008766211,0.0004994271,0.0003883481],"domain_scores_gemma":[0.99692595,0.000030290716,0.00022521666,0.002415106,0.00023524777,0.00016818952],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0004237967,0.00025167962,0.00025773124,0.00037977463,0.00078534015,0.00074095617,0.0044902544,0.00019091,0.018814629],"category_scores_gemma":[0.00047322267,0.00024696067,0.000074112424,0.00053788035,0.00011421132,0.00035376553,0.0059399195,0.00045296477,0.020192998],"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.0000034621648,0.000073450276,1.2590868e-7,0.000054819364,0.000013385101,0.0000058454207,0.0000552717,0.0000028772515,0.0004626053,0.011109476,0.8786422,0.10957649],"study_design_scores_gemma":[0.00016825635,0.00007696939,0.0000112895295,0.00013389769,0.0000044577437,0.00003393035,0.000009988969,0.000450737,0.00031089727,0.0006825049,0.9978341,0.00028300774],"about_ca_topic_score_codex":0.000013187468,"about_ca_topic_score_gemma":8.748822e-8,"teacher_disagreement_score":0.31084257,"about_ca_system_score_codex":0.00012579407,"about_ca_system_score_gemma":0.000008076372,"threshold_uncertainty_score":0.9999983},"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":"dataset","genre_gemma":"dataset","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"dataset","genre_consensus":"dataset","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009878718,0.00018217367,0.0028128407,0.00016249219,0.000038764363,0.00031572822,0.9865489,0.00005759249,0.0000027714277],"genre_scores_gemma":[0.007917078,0.0009257399,0.0285721,0.00046979255,0.00003876773,0.000021062173,0.96204567,0.000009259631,5.506826e-7],"study_design_codex":"not_applicable","study_design_gemma":"observational","domain_scores_codex":[0.99756944,0.00021029309,0.00058196124,0.0010066461,0.0003975038,0.00023414001],"domain_scores_gemma":[0.9960347,0.0006444457,0.00047736173,0.0026775734,0.00005518778,0.00011073835],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00008902634,0.00033989316,0.00073858077,0.00015085413,0.000022331698,0.0000364104,0.0041931677,0.0004022676,0.000020976036],"category_scores_gemma":[0.00074209494,0.00025702876,0.000036262314,0.00018826454,0.00013732562,0.00024948793,0.0041426187,0.00058225746,9.1131983e-7],"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.000057325924,0.000073212286,0.0020063824,0.00009529215,0.000017828921,0.00015977724,0.000011849466,0.00009635063,0.00041458744,0.000082974315,0.9952182,0.0017661944],"study_design_scores_gemma":[0.000371279,0.0003791164,0.62523884,0.00041577508,0.000027170088,0.000015056299,0.0000026918012,0.00023482027,0.0013355232,0.0038927102,0.3677339,0.000353111],"about_ca_topic_score_codex":0.009583439,"about_ca_topic_score_gemma":0.008758266,"teacher_disagreement_score":0.6274843,"about_ca_system_score_codex":0.000020100713,"about_ca_system_score_gemma":0.000064630105,"threshold_uncertainty_score":0.9999882},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00506785,0.000063581014,0.98487717,0.00034946066,0.00007784448,0.0003502495,0.00004943266,0.006255027,0.0029093728],"genre_scores_gemma":[0.8580849,0.00045318395,0.1375033,0.00044305238,0.0002778518,2.6386508e-7,0.0011981375,0.0017663655,0.00027291797],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99827343,0.00027402112,0.00022809063,0.0005320905,0.00030537622,0.0003869862],"domain_scores_gemma":[0.9987001,0.000039948663,0.000110101646,0.00072905957,0.00026149536,0.00015933767],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.00050612685,0.00015373131,0.00014797607,0.00030669026,0.0017446526,0.0010082794,0.0016340024,0.00004630796,0.00027398355],"category_scores_gemma":[0.00019264937,0.000152863,0.00003135871,0.0006703491,0.00015342615,0.0010644894,0.005495081,0.0002814742,0.00019328482],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000025046087,0.000060463146,0.00000420501,0.00004688143,0.000012791366,0.00009418878,0.00023923526,0.0004911511,0.057523068,0.005543901,0.18262343,0.75333565],"study_design_scores_gemma":[0.00018040897,0.00011353359,0.00012897156,0.00006674574,0.000003950926,0.00024223381,0.000025041676,0.63750225,0.013623006,0.0016640775,0.34619886,0.0002509113],"about_ca_topic_score_codex":0.0000074718037,"about_ca_topic_score_gemma":2.3297472e-8,"teacher_disagreement_score":0.8530171,"about_ca_system_score_codex":0.000056539106,"about_ca_system_score_gemma":0.0000016892218,"threshold_uncertainty_score":0.99955493},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0004410979,0.001320566,0.94602203,0.017434191,0.000846217,0.0021005047,0.00723705,0.0012259498,0.023372384],"genre_scores_gemma":[0.17883603,0.0016835649,0.7961704,0.0015227947,0.0030399754,0.00069566944,0.009529313,0.00027243554,0.008249832],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99197626,0.00015518675,0.00082846807,0.0020269025,0.0037262628,0.0012869199],"domain_scores_gemma":[0.9929999,0.0008958523,0.0003283933,0.0033089991,0.0018990149,0.00056784],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science","insufficient_payload"],"consensus_categories":["scholarly_communication"],"category_scores_codex":[0.0022697311,0.00052650715,0.00048647047,0.0049363594,0.0011153201,0.0036108415,0.0083210515,0.00029737476,0.00020955934],"category_scores_gemma":[0.0030642364,0.00048725773,0.00017507609,0.0069381287,0.0008490467,0.02268579,0.0075738137,0.00085654214,0.0007814332],"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.00009965745,0.0008236966,0.0000053647327,0.000059172373,0.000038667455,0.000021189897,0.00008611825,0.00039387474,0.005457014,0.16377515,0.7998106,0.029429486],"study_design_scores_gemma":[0.0010042194,0.00016207904,0.000030829357,0.00021409763,0.000005500494,0.000043646007,0.000038002054,0.060995504,0.009594335,0.0064005507,0.92097384,0.00053742423],"about_ca_topic_score_codex":0.000018598845,"about_ca_topic_score_gemma":0.000020986623,"teacher_disagreement_score":0.17839493,"about_ca_system_score_codex":0.00044133962,"about_ca_system_score_gemma":0.0006943973,"threshold_uncertainty_score":0.9999966},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08008977,0.0007991516,0.8458111,0.00047990482,0.004447358,0.016021973,0.005383529,0.0075334827,0.03943371],"genre_scores_gemma":[0.2231532,0.00013383456,0.77168995,0.0006240303,0.000107137326,0.0011057673,0.00096424524,0.00016155129,0.0020602609],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99619335,0.00013121779,0.0007946766,0.0016447186,0.0006272363,0.0006087966],"domain_scores_gemma":[0.9964085,0.0006890903,0.0006108009,0.0013787246,0.0005837327,0.00032915443],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00076862937,0.00061399664,0.0006140373,0.000370505,0.00096452766,0.0002806781,0.0015463916,0.0006426096,0.00002825372],"category_scores_gemma":[0.0014910881,0.0006902948,0.00011591463,0.0008771788,0.000023507848,0.0019022154,0.00040379798,0.00067927607,0.00006286955],"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.000054097407,0.000066875116,0.000001918604,0.00016787721,0.000022806556,0.0000017602148,0.0000063261236,0.000059523736,0.1575571,0.6011556,0.00003150948,0.24087462],"study_design_scores_gemma":[0.00078533345,0.0002794576,0.0004333771,0.0007568723,0.00008887515,0.000023890834,0.000049107275,0.0062664966,0.54913944,0.1842015,0.25623274,0.0017428835],"about_ca_topic_score_codex":0.000059499693,"about_ca_topic_score_gemma":0.00013212662,"teacher_disagreement_score":0.4169541,"about_ca_system_score_codex":0.00042537545,"about_ca_system_score_gemma":0.000054374526,"threshold_uncertainty_score":0.9995548},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0038475548,0.0019220691,0.9429615,0.008799918,0.0012533736,0.003016425,0.008579458,0.0010774253,0.028542276],"genre_scores_gemma":[0.9160515,0.000645446,0.07019058,0.0002897617,0.0016455955,0.0007110613,0.0019241645,0.00023506433,0.008306793],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9881127,0.00040436003,0.0012779279,0.0023429296,0.0049216156,0.0029404734],"domain_scores_gemma":[0.9916761,0.0016077666,0.0005534216,0.0020505558,0.0031821835,0.0009299675],"candidate_categories":["metaepi_narrow","sts","scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.0037856316,0.0009403263,0.0008107467,0.008455902,0.0020194887,0.006980539,0.0057621207,0.00076027896,0.0002292501],"category_scores_gemma":[0.0033772702,0.0009817138,0.0005579593,0.012793755,0.0015853764,0.00896271,0.00381018,0.001669875,0.00035472494],"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.00026487582,0.0016191798,0.00017807799,0.0002512803,0.00008999105,0.000113910435,0.00027378532,0.005597288,0.005947265,0.5263487,0.45074412,0.008571539],"study_design_scores_gemma":[0.0014678701,0.0005616172,0.00070798566,0.0008042734,0.000024977395,0.00018856762,0.0001669001,0.0766049,0.010385428,0.070827916,0.83705133,0.0012082043],"about_ca_topic_score_codex":0.00024868036,"about_ca_topic_score_gemma":0.00007121981,"teacher_disagreement_score":0.91220397,"about_ca_system_score_codex":0.0018562928,"about_ca_system_score_gemma":0.0029262495,"threshold_uncertainty_score":0.99961716},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05430044,0.00004416334,0.93992543,0.001292764,0.00017116609,0.0009323022,0.0015767775,0.00071619503,0.0010407693],"genre_scores_gemma":[0.4813443,0.000033617187,0.51476306,0.00003959226,0.000031224765,7.5762735e-8,0.00027325613,0.000020146439,0.0034947186],"study_design_codex":"qualitative","study_design_gemma":"qualitative","domain_scores_codex":[0.99733675,0.00011636911,0.00025170148,0.0012662181,0.00047847696,0.0005505165],"domain_scores_gemma":[0.99540573,0.00037579853,0.0006164077,0.0029451281,0.00027132453,0.0003856257],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.00027511705,0.00037811918,0.00062773045,0.0006645021,0.00081839284,0.00004220862,0.007847571,0.00030317114,0.00031652543],"category_scores_gemma":[0.000016320733,0.0005550606,0.00028506416,0.001089929,0.00096137874,0.0034541737,0.0049284934,0.00055739254,0.000025336725],"study_design_candidate":"qualitative","study_design_consensus":"qualitative","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0028735113,0.006464092,0.0129341325,0.0026505045,0.0019519343,0.0010270679,0.4340881,0.0032657962,0.1927573,0.029412339,0.027977472,0.28459775],"study_design_scores_gemma":[0.0063629397,0.00038681916,0.0018565202,0.00031029817,0.0004361162,0.000026852953,0.6464083,0.046219744,0.014414547,0.0058132326,0.2758638,0.0019008014],"about_ca_topic_score_codex":0.002890247,"about_ca_topic_score_gemma":0.0018001539,"teacher_disagreement_score":0.42704388,"about_ca_system_score_codex":0.00007527978,"about_ca_system_score_gemma":0.0009669315,"threshold_uncertainty_score":0.9996901},"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":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[5.35359e-7,0.00028068357,0.00955438,0.00062640203,0.00030447775,0.0008903372,0.00044606975,0.0009035732,0.98699355],"genre_scores_gemma":[0.00005370203,0.00011622453,0.14661406,0.00053862017,0.00018227141,0.00008349988,0.0003154484,0.00010203055,0.85199416],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99801093,0.000076460004,0.00063681864,0.00043141213,0.0005094602,0.00033489292],"domain_scores_gemma":[0.99813455,0.00014273882,0.0007705196,0.00060527987,0.00017930358,0.00016758902],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0002037259,0.00041253612,0.00048296855,0.00011165903,0.00008702776,0.000111543806,0.0011164283,0.00037743268,0.045513466],"category_scores_gemma":[0.00023006,0.0004097085,0.00020133163,0.0000123795535,0.0001005947,0.0000012127592,0.0003952617,0.00026484992,0.0018449981],"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.00003439106,0.000030005953,5.970923e-7,0.00034447887,0.000023694323,0.000008761343,0.00013634482,0.000026328911,0.0000016204343,0.0005811766,0.98977023,0.00904234],"study_design_scores_gemma":[0.00048342257,0.00019211802,0.0000012663282,0.00035146502,0.000021518059,0.000044019675,0.000033125485,0.002088821,0.000090473666,0.0000928787,0.9961775,0.00042340154],"about_ca_topic_score_codex":0.0009526219,"about_ca_topic_score_gemma":0.0002589437,"teacher_disagreement_score":0.13705967,"about_ca_system_score_codex":0.000062681356,"about_ca_system_score_gemma":0.000050603023,"threshold_uncertainty_score":0.9998355},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0006372751,0.00028892784,0.9610683,0.0032166447,0.000806895,0.001339709,0.003323046,0.0008222016,0.028497027],"genre_scores_gemma":[0.39806795,0.00029632944,0.5938591,0.0002956333,0.0010167799,0.00017421406,0.0048380382,0.00013407454,0.0013179121],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9921497,0.000100829064,0.0007964744,0.0018142649,0.0037753063,0.0013634242],"domain_scores_gemma":[0.9927717,0.0013083837,0.00029704688,0.003015769,0.0020487322,0.00055838417],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":["scholarly_communication"],"category_scores_codex":[0.004817593,0.00043680836,0.00039939108,0.005870732,0.0010310697,0.0029894984,0.007916162,0.0002751536,0.00006685913],"category_scores_gemma":[0.0043458277,0.00039923415,0.00015579404,0.009164831,0.0008021228,0.015385593,0.007319415,0.00078303705,0.00024639125],"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.00018366677,0.00064680603,0.000031264404,0.000077832316,0.000044375698,0.0000633097,0.000074462165,0.0000944516,0.016080067,0.54359806,0.4001526,0.03895312],"study_design_scores_gemma":[0.00075557566,0.00018446804,0.00024844895,0.00021143185,0.000004481311,0.000050492814,0.000058106736,0.018646868,0.011690934,0.038511142,0.92909133,0.00054674345],"about_ca_topic_score_codex":0.00001976868,"about_ca_topic_score_gemma":0.000025928142,"teacher_disagreement_score":0.5289387,"about_ca_system_score_codex":0.0003705137,"about_ca_system_score_gemma":0.0005766549,"threshold_uncertainty_score":0.999846},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00038699433,0.0014644527,0.9310007,0.024502238,0.00084737095,0.0021556858,0.0076363375,0.0011787029,0.030827506],"genre_scores_gemma":[0.09747377,0.001762275,0.87004584,0.0019168514,0.0040540975,0.00072157633,0.0092848055,0.0003106359,0.014430143],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9916557,0.00014263492,0.0008599228,0.0020789432,0.0037793422,0.0014834759],"domain_scores_gemma":[0.9931735,0.000825049,0.0003305067,0.003351884,0.0017028915,0.00061616104],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science","insufficient_payload"],"consensus_categories":["scholarly_communication"],"category_scores_codex":[0.0024507092,0.00055534224,0.00049592444,0.0048811794,0.0010400373,0.0035510361,0.007923625,0.00031912,0.00035948862],"category_scores_gemma":[0.0025206541,0.000512099,0.00018401505,0.005999569,0.0008063044,0.024013137,0.0074686133,0.0008888693,0.0009828763],"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.00008674114,0.0008494604,0.00000395364,0.00005004786,0.0000397558,0.000017494574,0.00006374036,0.00049617153,0.0057961443,0.11691422,0.8558047,0.019877585],"study_design_scores_gemma":[0.0010617833,0.000113733935,0.000025044728,0.00020347131,0.000005840953,0.000042507003,0.000030369882,0.058958538,0.010821393,0.0047062226,0.9234641,0.0005669988],"about_ca_topic_score_codex":0.000020561394,"about_ca_topic_score_gemma":0.00003927053,"teacher_disagreement_score":0.112208,"about_ca_system_score_codex":0.0004880607,"about_ca_system_score_gemma":0.000724223,"threshold_uncertainty_score":0.99979496},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05098686,0.00013431224,0.9445612,0.00004305533,0.00025304803,0.00067701406,0.000057508692,0.0006806377,0.0026063805],"genre_scores_gemma":[0.9087786,0.0010626378,0.06837376,0.000056591805,0.00013585534,0.000021173139,0.00068316545,0.00014821731,0.020739978],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99785924,0.00011825306,0.0003258118,0.0008065899,0.00052995025,0.00036014017],"domain_scores_gemma":[0.99791276,0.00005069475,0.00065798964,0.0009064124,0.00033362224,0.0001384928],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000100682446,0.00041555916,0.00049684435,0.0010551029,0.00035969933,0.00006441628,0.0012884204,0.0003165975,0.000022282244],"category_scores_gemma":[0.000033821972,0.00042370785,0.00015035197,0.0011300766,0.00013593516,0.0011922558,0.00026376147,0.00054204994,0.00001454647],"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.008578636,0.004606739,0.04127873,0.006592028,0.0024002767,0.010467752,0.00632922,0.037622526,0.009930144,0.025293423,0.1218819,0.7250186],"study_design_scores_gemma":[0.0027587868,0.0013187063,0.0007802972,0.0027991028,0.00019641237,7.0747996e-7,0.014920902,0.009437501,0.8338351,0.0017666665,0.1293166,0.0028691832],"about_ca_topic_score_codex":0.0003034638,"about_ca_topic_score_gemma":0.003288699,"teacher_disagreement_score":0.87618744,"about_ca_system_score_codex":0.00018856344,"about_ca_system_score_gemma":0.00023427268,"threshold_uncertainty_score":0.9998215},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00083777553,0.0018659721,0.93228585,0.029158918,0.0017673759,0.0042704497,0.006028124,0.0014456353,0.02233989],"genre_scores_gemma":[0.4940949,0.004017813,0.4459124,0.002793317,0.004851554,0.0031346271,0.01739631,0.0005826185,0.02721647],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99162835,0.00017236867,0.0008451752,0.0020907493,0.0038922396,0.0013710975],"domain_scores_gemma":[0.9918707,0.0009000188,0.00035167058,0.003604014,0.002615573,0.000658026],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science","insufficient_payload"],"consensus_categories":["scholarly_communication","open_science"],"category_scores_codex":[0.0018075239,0.00056020793,0.0005314373,0.0048725405,0.0010832441,0.0041653053,0.0094594825,0.00034514428,0.00041448043],"category_scores_gemma":[0.0018083676,0.00049827364,0.0001725172,0.007125494,0.0008425043,0.023866672,0.0091325315,0.0008394589,0.0012975469],"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.00004677021,0.0003774975,0.000021089874,0.00008232425,0.000042579148,0.000013100145,0.000058632457,0.00025312966,0.0026678934,0.12115604,0.84660894,0.028672017],"study_design_scores_gemma":[0.0006403461,0.00016980382,0.00015447159,0.00025432103,0.000005073036,0.000031561973,0.00004239333,0.03828731,0.003333081,0.030193543,0.92629635,0.0005917468],"about_ca_topic_score_codex":0.0002470256,"about_ca_topic_score_gemma":0.000035278288,"teacher_disagreement_score":0.4932571,"about_ca_system_score_codex":0.000334638,"about_ca_system_score_gemma":0.0006045228,"threshold_uncertainty_score":0.9997469},"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":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000005468966,0.00024328253,0.00091337814,0.0005203004,0.0005757983,0.0010058072,0.00009023796,0.0027476996,0.99389803],"genre_scores_gemma":[0.00006411438,0.0007698071,0.05245201,0.0007701548,0.00017146618,0.000078595214,0.000099768804,0.000262743,0.94533134],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9970721,0.00019310128,0.0010211964,0.00056901615,0.00068815955,0.0004564096],"domain_scores_gemma":[0.99722034,0.00016410623,0.00093349395,0.0013009832,0.00009917421,0.00028189196],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00059987477,0.00048028337,0.0006515305,0.00029660395,0.00012210848,0.00014920693,0.0014031165,0.00043811763,0.010873958],"category_scores_gemma":[0.00030624765,0.00048099546,0.00017125013,0.00006532524,0.000059161044,0.00000428575,0.00037655942,0.00046001363,0.0050863926],"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.000014290245,0.000030546387,5.7514154e-7,0.0003126777,0.000023124836,0.000014686223,0.00019296558,0.000090538684,0.000004034336,0.00017345487,0.95999545,0.039147686],"study_design_scores_gemma":[0.0002058362,0.00017727136,0.000013379845,0.0012357364,0.000023470737,0.00005510216,0.000027310036,0.00019157153,0.00007746428,0.00003993416,0.9974364,0.00051654596],"about_ca_topic_score_codex":0.001442594,"about_ca_topic_score_gemma":0.00071022636,"teacher_disagreement_score":0.05153863,"about_ca_system_score_codex":0.000134877,"about_ca_system_score_gemma":0.000047884598,"threshold_uncertainty_score":0.99976414},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9925682,0.0005105719,0.005643601,0.00077034853,0.00006308491,0.00017814562,0.00019583221,0.000004105703,0.00006612759],"genre_scores_gemma":[0.9984366,0.00021025832,0.0011694678,0.00015541102,0.000004501587,8.493688e-7,0.000017435088,0.000003087951,0.0000023616924],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.99881506,0.0004469233,0.00040576403,0.000059199916,0.0001303753,0.0001426942],"domain_scores_gemma":[0.99895144,0.00006487179,0.00045247242,0.00025031812,0.00010232803,0.00017858476],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005199469,0.00008799637,0.00026569486,0.0002018023,0.00029847195,0.00001505567,0.0005087266,0.000040355597,0.0000037255559],"category_scores_gemma":[0.000016429227,0.00006246248,0.000048664915,0.00017433146,0.0001837275,0.00015087734,0.00009139546,0.00030760543,2.1376735e-8],"study_design_candidate":"observational","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.0011652309,0.004363111,0.13859187,0.00064232544,0.00045621188,0.000028135473,0.20770986,0.0021317878,0.0018143565,0.027179856,0.02368046,0.5922368],"study_design_scores_gemma":[0.0028774217,0.009468214,0.95539427,0.0014423305,0.000049872113,0.00016527226,0.00957464,0.003399993,0.0071576205,0.010112275,0.000043327957,0.00031477818],"about_ca_topic_score_codex":0.010156747,"about_ca_topic_score_gemma":0.0019406388,"teacher_disagreement_score":0.8168024,"about_ca_system_score_codex":0.00016930592,"about_ca_system_score_gemma":0.00047448472,"threshold_uncertainty_score":0.9964347},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.027200192,0.000033651522,0.9681353,0.00017504493,0.0001159326,0.000071928065,0.0000021046797,0.00016034898,0.004105516],"genre_scores_gemma":[0.8443596,0.0000152021,0.15438247,0.00015937393,0.0000060232346,0.0000049251157,5.0864094e-7,0.0000019011608,0.0010700177],"study_design_codex":"not_applicable","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99949074,0.000025917287,0.000110316876,0.00012783599,0.0001637827,0.00008142783],"domain_scores_gemma":[0.9992156,0.000016911921,0.000055659002,0.00064528914,0.000045179582,0.000021339654],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000050917144,0.000046097543,0.000057830915,0.000029847391,0.00007879505,0.000008368377,0.00085099775,0.00001956001,0.000019434263],"category_scores_gemma":[0.000021066719,0.000027121505,0.000025231038,0.00021083486,0.00004900201,0.00039690666,0.00040488614,0.000054126536,0.0000067743654],"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.000006839183,0.00027248418,0.03545241,0.000030996824,0.000023245364,0.000023567747,0.0017991433,0.00013140703,0.16824059,0.2896031,0.41715154,0.08726465],"study_design_scores_gemma":[0.00020969257,0.000047020407,0.07055456,0.00004019938,0.0000019237107,0.000075968135,0.0000073874826,0.011191387,0.8477255,0.03639362,0.03355615,0.0001966055],"about_ca_topic_score_codex":0.00017469538,"about_ca_topic_score_gemma":0.000020950369,"teacher_disagreement_score":0.8171594,"about_ca_system_score_codex":0.00001229938,"about_ca_system_score_gemma":0.00002878438,"threshold_uncertainty_score":0.15813798},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0006011665,0.00016069991,0.9736325,0.00090135355,0.0003033771,0.00015290033,0.000006555156,0.0007196247,0.023521816],"genre_scores_gemma":[0.30510506,0.000043299213,0.6848915,0.00487607,0.00014494294,0.000013729747,0.00001450251,0.000023732458,0.0048871324],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9982971,0.000026844144,0.00030655036,0.00044957772,0.00046038112,0.00045955626],"domain_scores_gemma":[0.9983,0.00015007798,0.00008995099,0.0011541051,0.00007416189,0.0002316895],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033525724,0.00016966686,0.00016984968,0.00009505591,0.00009565412,0.00005533936,0.0015981393,0.00005007083,0.00017296786],"category_scores_gemma":[0.000058555182,0.00014353992,0.000035405228,0.00039623774,0.00003251335,0.00060853036,0.0006157668,0.00016966967,0.00004297441],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","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.000007838901,0.000057206118,0.00082534645,0.000016535327,0.000011143763,0.00020365862,0.000053521806,0.000016808313,0.0033041749,0.1669968,0.506235,0.32227194],"study_design_scores_gemma":[0.0001601408,0.000033326447,0.0027865677,0.000026975524,0.000002128274,0.00003537254,0.00001451013,0.0020030104,0.08464995,0.0034593297,0.9064732,0.00035547654],"about_ca_topic_score_codex":0.11760673,"about_ca_topic_score_gemma":0.1478149,"teacher_disagreement_score":0.4002382,"about_ca_system_score_codex":0.00014663374,"about_ca_system_score_gemma":0.00026894434,"threshold_uncertainty_score":0.8882692},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005241769,0.000028576314,0.9852134,0.0050434526,0.0007369645,0.000646167,0.00006563777,0.00034910074,0.002674941],"genre_scores_gemma":[0.49226275,0.000020646587,0.49489635,0.00075616874,0.00012844603,0.00008655284,0.00006536076,0.00003189939,0.011751821],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99721074,0.00006782007,0.00051242654,0.0009277827,0.0006762381,0.0006050015],"domain_scores_gemma":[0.9981696,0.00022590405,0.00030284555,0.0005820124,0.00042928584,0.00029035241],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00031844855,0.00035667187,0.000351755,0.0003537852,0.0002553336,0.00090800907,0.0015964427,0.00013690224,0.0004589441],"category_scores_gemma":[0.00015397993,0.00031376208,0.000042471125,0.000285326,0.000119415214,0.0026526144,0.00063706917,0.00036711126,0.000007976059],"study_design_candidate":"not_applicable","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.00006909185,0.00019129658,0.0010803796,0.00012246374,0.00003687884,0.000039475628,0.0006830297,0.00043567482,0.014659679,0.030033186,0.84593815,0.1067107],"study_design_scores_gemma":[0.0021420678,0.00020599092,0.001697505,0.0006768269,0.000024130431,0.00005008106,0.0015186054,0.6169918,0.0069157346,0.033365317,0.33465955,0.00175239],"about_ca_topic_score_codex":0.04671737,"about_ca_topic_score_gemma":0.19856925,"teacher_disagreement_score":0.6165561,"about_ca_system_score_codex":0.00035152337,"about_ca_system_score_gemma":0.00052394095,"threshold_uncertainty_score":0.99993145},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0007225364,0.00038001736,0.99411607,0.0017774575,0.00012327151,0.00013011797,0.000001369111,0.0004788735,0.0022702892],"genre_scores_gemma":[0.23711081,0.00022526522,0.7496019,0.00060345104,0.00011543588,0.00008665975,0.000011879693,0.000008791189,0.012235778],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99938506,0.000045167613,0.0001158503,0.00018352331,0.00015932851,0.00011109235],"domain_scores_gemma":[0.99917614,0.000042892556,0.00006849927,0.00065678183,0.00003903516,0.000016628148],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00011753543,0.00006107641,0.000051213843,0.00003517455,0.00012333736,0.00030978408,0.00072746543,0.000022877932,0.000028662154],"category_scores_gemma":[0.0000074247478,0.000037583613,0.000034784887,0.00013323226,0.000023182232,0.002045729,0.00030095738,0.000067240246,0.000044838747],"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.0000017933844,0.00011109729,0.0003235005,0.0000032382095,0.000004208642,0.0000035931578,0.000017545839,0.000296293,0.0031354001,0.7302957,0.043649014,0.22215858],"study_design_scores_gemma":[0.0003703001,0.00009808806,0.013809988,0.00016217623,0.00000767765,0.000034625205,0.000281908,0.029803604,0.13341483,0.5860633,0.23548463,0.00046884886],"about_ca_topic_score_codex":0.000012676713,"about_ca_topic_score_gemma":0.000014031285,"teacher_disagreement_score":0.24451414,"about_ca_system_score_codex":0.000015280779,"about_ca_system_score_gemma":0.000008924132,"threshold_uncertainty_score":0.2987255},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0017843739,0.0010736102,0.9942646,0.0014400667,0.00008008861,0.0010660274,0.00014503575,0.00007593145,0.000070238486],"genre_scores_gemma":[0.48807332,0.00060167635,0.5109879,0.00010359803,0.0000029624164,0.00019005917,0.00001626359,0.0000042622337,0.000019971674],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9986973,0.00008189661,0.00045640933,0.0003601891,0.00017687683,0.0002273315],"domain_scores_gemma":[0.99786294,0.00066319,0.00027442127,0.00092354213,0.00024097408,0.000034930355],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042224815,0.0001432219,0.00024836414,0.00031135167,0.0006699914,0.00010269163,0.0018225862,0.000043298973,0.0000023661858],"category_scores_gemma":[0.000004717222,0.00013107811,0.0000970267,0.0005127146,0.00036688076,0.0005650011,0.00012275529,0.00009893257,1.1168792e-7],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000055500284,0.0005811389,0.00006708937,0.0001686823,0.00007141633,3.1627707e-8,0.00026269062,0.00058205833,0.022658572,0.2396463,0.000556683,0.73534983],"study_design_scores_gemma":[0.0017506345,0.0024943638,0.00023993404,0.00042621835,0.00005832261,0.000003167953,0.00033760103,0.2616259,0.6778951,0.041674707,0.013166408,0.00032759662],"about_ca_topic_score_codex":0.000022222108,"about_ca_topic_score_gemma":0.000024255165,"teacher_disagreement_score":0.73502225,"about_ca_system_score_codex":0.000045136683,"about_ca_system_score_gemma":0.00018403606,"threshold_uncertainty_score":0.534521},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0004729302,0.004117284,0.99290365,0.00079213636,0.0010445204,0.00057769,0.000008743421,0.000055161156,0.000027867563],"genre_scores_gemma":[0.11823625,0.00013512166,0.8806407,0.00023931527,0.0005644623,0.00001939549,0.0000043295636,0.000032906562,0.00012754067],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976779,0.00007369928,0.0008635758,0.0004948155,0.00022571081,0.00066429196],"domain_scores_gemma":[0.9974126,0.00039195005,0.00032514246,0.00045497259,0.00043191054,0.000983414],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003193223,0.00036336822,0.0006090328,0.0011376984,0.0002473843,0.0005416785,0.00101458,0.00021185182,0.0000106149255],"category_scores_gemma":[0.00028525508,0.0003621716,0.00020109299,0.0011010248,0.000052601124,0.0008234601,0.00017950944,0.00065801427,7.055248e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014453765,0.0000961638,0.0002624934,0.00039268518,0.00027140148,0.0005569028,0.0003917819,0.010243595,0.0960957,0.0418466,0.064601615,0.7850965],"study_design_scores_gemma":[0.001108493,0.0007309511,0.0012197889,0.0018166209,0.00008120646,0.00041537898,0.0000022059774,0.8507287,0.09491512,0.006653733,0.041762438,0.00056534173],"about_ca_topic_score_codex":0.00039193884,"about_ca_topic_score_gemma":0.00003297426,"teacher_disagreement_score":0.8404851,"about_ca_system_score_codex":0.0002720143,"about_ca_system_score_gemma":0.0014004676,"threshold_uncertainty_score":0.999883},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99113643,0.000306444,0.0057908157,0.0004289977,0.00007574423,0.001435892,0.000038039005,0.000058657424,0.0007290072],"genre_scores_gemma":[0.99948597,0.000032451087,0.00021578844,0.0000063864004,0.00001445757,0.00015392524,0.0000012949157,0.000013132243,0.00007658249],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9946862,0.0021818571,0.0005454413,0.0004026942,0.0018713577,0.00031246696],"domain_scores_gemma":[0.9843423,0.012630633,0.00030072904,0.0023730448,0.00028936518,0.000063945474],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019483642,0.00015833633,0.00039411915,0.00016368678,0.00019638393,0.000057511472,0.0032190573,0.000046218454,0.000022109578],"category_scores_gemma":[0.006742809,0.000080919686,0.00010666902,0.00089334516,0.0005557475,0.0003979539,0.002244122,0.0004949231,0.000013406223],"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.00073100795,0.013177191,0.27431673,0.0014388107,0.00026757654,0.000089957626,0.023494046,0.00063785934,0.10246112,0.010494529,0.14065406,0.43223712],"study_design_scores_gemma":[0.0013897785,0.005419288,0.07278491,0.0009182498,0.000010867315,0.0000029215757,0.0010171563,0.0017956431,0.9114055,0.0045301975,0.00044301787,0.00028245014],"about_ca_topic_score_codex":0.000057479607,"about_ca_topic_score_gemma":0.0000019908618,"teacher_disagreement_score":0.8089444,"about_ca_system_score_codex":0.000038424772,"about_ca_system_score_gemma":0.000018944798,"threshold_uncertainty_score":0.80722594},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0012042287,0.0026649116,0.9766937,0.0026647176,0.0020649063,0.0022963074,0.000084627565,0.0014031631,0.010923429],"genre_scores_gemma":[0.5226452,0.0013496922,0.4651835,0.0036602125,0.00011569451,0.000077711746,0.000084438754,0.00006091103,0.0068226573],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9933574,0.0005877829,0.0015801515,0.002498972,0.00080546865,0.0011701868],"domain_scores_gemma":[0.99168926,0.0026867166,0.00074198295,0.0038835532,0.0007011675,0.00029730808],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011541239,0.0009117494,0.0011778579,0.00068319024,0.00085288356,0.00076056726,0.0037368953,0.00045085867,0.000090359434],"category_scores_gemma":[0.0006117265,0.0007967882,0.00038096844,0.0017770906,0.00023993757,0.0010843206,0.0019622382,0.0005726798,0.000097609525],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004300558,0.000366747,0.00040554508,0.000675867,0.0000938629,0.000017291115,0.00013143475,0.00015648306,0.010609203,0.024856573,0.019430524,0.9428264],"study_design_scores_gemma":[0.0029685085,0.00083420315,0.018980682,0.0064234436,0.00006852523,0.000017467702,0.00012127333,0.5401705,0.14257611,0.025424598,0.2605051,0.0019096062],"about_ca_topic_score_codex":0.00008060444,"about_ca_topic_score_gemma":0.00012396967,"teacher_disagreement_score":0.94091684,"about_ca_system_score_codex":0.00021294794,"about_ca_system_score_gemma":0.0002887599,"threshold_uncertainty_score":0.9994483},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00064194214,0.0006499282,0.99218065,0.0019564186,0.0010359583,0.0009592812,0.00003078911,0.00063703366,0.0019080063],"genre_scores_gemma":[0.1618218,0.00038566618,0.8339618,0.0012240009,0.00012770866,0.000065196255,0.00042409092,0.000038377835,0.0019514007],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99501354,0.00042278532,0.0014583091,0.0018471658,0.0005878021,0.0006704306],"domain_scores_gemma":[0.9934618,0.00023342765,0.00048297783,0.005426401,0.00029837838,0.000097005024],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":["open_science"],"category_scores_codex":[0.0013993849,0.0004314355,0.00048506938,0.00085943454,0.0003284456,0.00053536595,0.0058190175,0.00025962785,0.00008838315],"category_scores_gemma":[0.001014958,0.00045541133,0.000046732748,0.0030901162,0.000087427456,0.0047865007,0.009021967,0.00039959818,0.000025573503],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000052399213,0.0006639203,0.0033658918,0.00072954275,0.00005874657,0.00003835484,0.0007392024,0.008371896,0.18247773,0.2668168,0.026548907,0.5101366],"study_design_scores_gemma":[0.0004907955,0.000027069165,0.00042593403,0.0008507316,0.000013404783,0.0000034832171,0.000025682199,0.8225119,0.15185122,0.015831616,0.0075738537,0.00039430594],"about_ca_topic_score_codex":0.00031668454,"about_ca_topic_score_gemma":0.001262732,"teacher_disagreement_score":0.81414,"about_ca_system_score_codex":0.00024675208,"about_ca_system_score_gemma":0.00035681901,"threshold_uncertainty_score":0.9997898},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002926991,0.00075972837,0.9784726,0.00038822394,0.0016066454,0.0019473549,0.00007834189,0.00083797146,0.012982137],"genre_scores_gemma":[0.028082786,0.00047374127,0.9418165,0.0011290942,0.00016967465,0.0004934394,0.000695617,0.00021181587,0.026927346],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9934056,0.00068670616,0.0011036588,0.0023433943,0.0011605092,0.0013001551],"domain_scores_gemma":[0.9939439,0.0005936739,0.0016790237,0.002473323,0.00080861466,0.0005014355],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":["metaepi_narrow"],"category_scores_codex":[0.00081824244,0.0013185487,0.00130511,0.00064126856,0.00081362284,0.0006070732,0.0031241388,0.0007889742,0.0015692735],"category_scores_gemma":[0.0005854143,0.0014228891,0.00039709246,0.0013950475,0.00024665988,0.0013231406,0.00048488393,0.0015799877,0.0006298724],"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.0022369479,0.002636181,0.00005868105,0.001828509,0.00040246206,0.0015111032,0.029256862,0.0005856156,0.28803012,0.084686175,0.2518763,0.33689103],"study_design_scores_gemma":[0.0016242582,0.00095834886,0.00023504886,0.002294505,0.00012865794,0.00002962309,0.002801741,0.53228897,0.40038958,0.0018136607,0.05437952,0.0030561057],"about_ca_topic_score_codex":0.00009785776,"about_ca_topic_score_gemma":0.0000316417,"teacher_disagreement_score":0.53170335,"about_ca_system_score_codex":0.00035430893,"about_ca_system_score_gemma":0.0009091582,"threshold_uncertainty_score":0.9999566},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00009424614,0.0008198135,0.9936815,0.0007460825,0.0020270278,0.00086790125,0.000027835798,0.00052775024,0.0012078768],"genre_scores_gemma":[0.13930406,0.00004815462,0.85815054,0.0015455298,0.0007009744,0.000026199856,0.000020184472,0.00007542357,0.00012896469],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9930039,0.00009961342,0.0011567262,0.002657968,0.001976644,0.0011051383],"domain_scores_gemma":[0.99527,0.00058878557,0.0005540035,0.0025993765,0.0006190836,0.00036873136],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0018141719,0.0009599288,0.0011230508,0.0017606447,0.00020333244,0.00066590816,0.005875996,0.00052238826,0.000019918936],"category_scores_gemma":[0.00015164251,0.00083913445,0.00017101789,0.0010709676,0.0007399893,0.0010066874,0.003863383,0.0013545939,0.000060911527],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020405547,0.000081639344,0.000022925604,0.000032524265,0.0000053007925,0.00019745744,0.0002482277,0.17710261,0.0002491751,0.0047181738,0.00024318152,0.81707835],"study_design_scores_gemma":[0.0008887909,0.00033540474,0.00014526726,0.0011676286,0.0000058062656,0.00008085874,1.9907806e-7,0.9255184,0.0008865738,0.06637188,0.003648486,0.0009507249],"about_ca_topic_score_codex":0.000055144526,"about_ca_topic_score_gemma":0.000069533955,"teacher_disagreement_score":0.81612766,"about_ca_system_score_codex":0.0008050947,"about_ca_system_score_gemma":0.0007940031,"threshold_uncertainty_score":0.9995027},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005848357,0.00006134293,0.99284536,0.00020516415,0.00022414379,0.0001893747,0.000018637525,0.00043668083,0.00017095848],"genre_scores_gemma":[0.36936772,0.0000113518745,0.6300782,0.000029673969,0.00032952355,0.000017870385,0.000023067509,0.00001128205,0.00013132028],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99903405,0.000014195891,0.00022400983,0.00037700366,0.00013841238,0.00021234354],"domain_scores_gemma":[0.9992362,0.0000916145,0.00011918293,0.0004184621,0.00006398872,0.0000705074],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016606542,0.00012781599,0.00013011266,0.000087350905,0.0002856138,0.00014903532,0.0004343536,0.000050913768,0.000002642463],"category_scores_gemma":[0.000052674994,0.00012738859,0.000034522935,0.00009538488,0.00002338006,0.0012040071,0.00034925248,0.00014018231,0.0000024008843],"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.000006633816,0.00006726925,0.00009126763,0.000024118033,0.000013134571,0.000002915117,0.00031210523,0.00014209829,0.5006724,0.010678911,0.0015152909,0.48647383],"study_design_scores_gemma":[0.0010485718,0.00019600087,0.0019777368,0.0003563989,0.000012463613,0.000052735708,0.000060736187,0.14413276,0.7178949,0.007987448,0.12569012,0.0005900917],"about_ca_topic_score_codex":0.000036123933,"about_ca_topic_score_gemma":0.0000031967782,"teacher_disagreement_score":0.48588374,"about_ca_system_score_codex":0.000088264715,"about_ca_system_score_gemma":0.00000693252,"threshold_uncertainty_score":0.5194756},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5107125,0.00019028565,0.41922683,0.00027976287,0.00017235932,0.0002907755,0.00024087475,0.0002726664,0.06861395],"genre_scores_gemma":[0.96738833,0.000065702436,0.031150108,0.000041856656,0.000053278338,7.740592e-7,0.000045240125,0.0000094119205,0.0012452826],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9983599,0.0000755199,0.00034876543,0.0004153512,0.0005513255,0.00024913633],"domain_scores_gemma":[0.9985202,0.00016391177,0.00024878018,0.00076992705,0.00018843362,0.00010875084],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013497412,0.00021425115,0.00030536143,0.0001248681,0.0004725215,0.0000825574,0.0014113067,0.00006121199,0.000050919884],"category_scores_gemma":[0.00002173475,0.00018318562,0.00018535551,0.00023720073,0.00062872574,0.001861679,0.00037679073,0.00021065745,0.00004666665],"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.0016837447,0.0019668771,0.012995369,0.00047925438,0.0007241581,0.0017492655,0.005426169,0.03567619,0.016474891,0.6451842,0.031580795,0.24605906],"study_design_scores_gemma":[0.008306187,0.0015710882,0.1762081,0.003328349,0.00022994791,0.0052327653,0.0011677734,0.008587312,0.14565355,0.22670159,0.41884777,0.004165587],"about_ca_topic_score_codex":0.0001961169,"about_ca_topic_score_gemma":0.0000058176533,"teacher_disagreement_score":0.45667586,"about_ca_system_score_codex":0.00007640536,"about_ca_system_score_gemma":0.00017114158,"threshold_uncertainty_score":0.7470093},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0001884796,0.00042574632,0.99385226,0.0007602081,0.0010859994,0.00085507374,0.000029855075,0.000298465,0.0025039238],"genre_scores_gemma":[0.26041523,0.00024517532,0.73703027,0.001670955,0.0001605309,0.00007468731,0.000012558103,0.00004651345,0.00034409357],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9942363,0.00022937462,0.0010612337,0.001955359,0.0017123169,0.000805447],"domain_scores_gemma":[0.9944248,0.0011065889,0.0006666332,0.0032936917,0.0003278022,0.00018045827],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0019999698,0.00070914166,0.0008817724,0.0006740188,0.00034359194,0.00049266365,0.0074317562,0.00032705738,0.00003721817],"category_scores_gemma":[0.00014536652,0.00047125592,0.00014457916,0.00056703755,0.0011566476,0.0007563372,0.004630822,0.0017029616,0.000010978339],"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.000023025517,0.00006127984,0.0007074537,0.000037468097,0.000006598777,0.000063130974,0.00053685583,0.00063418725,0.0010473833,0.08714211,0.00003236496,0.90970814],"study_design_scores_gemma":[0.00074660976,0.000412444,0.020259306,0.0021968493,0.0000082985825,0.000048031638,0.0000011020026,0.06286529,0.0151715325,0.8935525,0.0032179074,0.0015201267],"about_ca_topic_score_codex":0.00016020623,"about_ca_topic_score_gemma":0.00029219902,"teacher_disagreement_score":0.908188,"about_ca_system_score_codex":0.0005715865,"about_ca_system_score_gemma":0.0005685476,"threshold_uncertainty_score":0.9997739},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000010316479,0.00066161033,0.980504,0.00040998872,0.0013325532,0.0010255454,0.0011382082,0.0011372506,0.013780543],"genre_scores_gemma":[0.0009049049,0.0028024167,0.8638462,0.0033069279,0.0030718106,0.0004510289,0.0029269452,0.00062604,0.122063756],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9936479,0.00013559654,0.0012069226,0.0017958408,0.0021919427,0.0010218146],"domain_scores_gemma":[0.99372846,0.0013207119,0.0006067591,0.0023355484,0.00024449718,0.0017640099],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007940945,0.0012735695,0.0016086664,0.0005141463,0.00032719827,0.00024186748,0.0030439922,0.0007500228,0.0005910955],"category_scores_gemma":[0.00010550937,0.0010898814,0.00042662155,0.00025291735,0.0007355759,0.0007076849,0.0010743629,0.002043418,0.000048026624],"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.00041382082,0.001630908,0.0000029802352,0.0010392705,0.0008198733,0.0013765655,0.00023194363,0.0013319886,0.005607207,0.17842926,0.48835704,0.32075915],"study_design_scores_gemma":[0.0023118125,0.00022332155,0.0000066444504,0.00135159,0.000062562445,0.00018276587,0.0000015165808,0.2734058,0.00071755855,0.0023041784,0.7181762,0.0012560928],"about_ca_topic_score_codex":0.000022468788,"about_ca_topic_score_gemma":0.000009097951,"teacher_disagreement_score":0.31950307,"about_ca_system_score_codex":0.00011782138,"about_ca_system_score_gemma":0.00022807789,"threshold_uncertainty_score":0.99915516},"labels":[],"label_agreement":null}]}