{"meta":{"query_hash":"e71370c2918f","filters":{"venue":"Data Compression Conference"},"cohort_total":5,"direct_labels_cover":0,"predictions_cover":5,"exported":5,"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/e71370c2918f","api":"https://metacan.xera.ac/api/v1/cohort?venue=Data+Compression+Conference"},"results":[{"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":"W2130419021","doi":"10.1109/dcc.2005.20","title":"AXECHOP: A Grammar-based Compressor for XML","year":2005,"lang":"en","type":"article","venue":"Data Compression Conference","topic":"Algorithms and Data Compression","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":"Acadia University","funders":"","keywords":"Computer science; XML validation; Document Structure Description; XML Encryption; Streaming XML; Efficient XML Interchange; XML Schema (W3C); Information retrieval; XML database; Programming language; Well-formed document; XML; XML framework; Database; World Wide Web","score_opus":0.12585986575161315,"score_gpt":0.3360986455891776,"score_spread":0.21023877983756448,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2130419021","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0003518673,0.00037928103,0.9927664,0.0027512352,0.00057925994,0.0006342853,0.0012874011,0.0004862925,0.00076398667],"genre_scores_gemma":[0.2874198,0.0000597811,0.70657694,0.001687742,0.00046557497,0.00015649878,0.0032137358,0.00003646765,0.00038346762],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99673104,0.0001355,0.0005427157,0.001358117,0.00060222804,0.00063040474],"domain_scores_gemma":[0.9941338,0.00050681253,0.00027467607,0.004461652,0.00030487342,0.0003182243],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.00050007796,0.0003754707,0.00041773528,0.0001552809,0.00046351267,0.0006484979,0.0071468977,0.00015394979,0.00017147185],"category_scores_gemma":[0.00014982879,0.0003120625,0.000086835156,0.00028004625,0.00010513851,0.0022401933,0.0030459594,0.00029355116,0.00013429727],"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.00012770716,0.0005822412,0.00010563638,0.00011353656,0.000031852214,0.000011375932,0.000121378805,0.0008444897,0.0060052993,0.031877417,0.23832099,0.7218581],"study_design_scores_gemma":[0.0008765638,0.00004872733,0.00012454412,0.000101898804,0.000008085437,0.0000042768415,0.000005198609,0.56439364,0.0020833109,0.0007386665,0.43134594,0.00026911954],"about_ca_topic_score_codex":0.00005553142,"about_ca_topic_score_gemma":0.000027740383,"teacher_disagreement_score":0.72158897,"about_ca_system_score_codex":0.000036010286,"about_ca_system_score_gemma":0.00025679445,"threshold_uncertainty_score":0.9999331},"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":"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":"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}]}