{"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06656431,0.0009104007,0.9261245,0.0006883432,0.00012735267,0.00014024701,0.0002745107,0.0015338382,0.0036365653],"genre_scores_gemma":[0.32670888,0.0008014099,0.6558811,0.00049116777,0.00019848869,0.0001827448,0.0006299037,0.00012925036,0.014977135],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9998348,0.000021150205,0.000007082397,0.000023778202,0.00009731422,0.000015936945],"domain_scores_gemma":[0.99970835,0.000064271444,0.00003733763,0.00006387012,0.00010092645,0.000025294641],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023281598,0.0003400941,0.000426444,0.00039631347,0.00031437233,0.00038695306,0.0008851552,0.00043150442,0.0023799504],"category_scores_gemma":[0.00049116585,0.00018549545,0.00020651244,0.00048669658,0.00034036947,0.000835331,0.00040381862,0.00067515945,0.00087593583],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00067850796,0.00022649883,0.0014718839,0.00025185873,0.00007037045,0.00017277888,0.000089003595,0.038389254,0.32231176,0.0086387005,0.007596553,0.6201028],"study_design_scores_gemma":[0.000079108366,0.00036075714,0.0014902799,0.000024481586,0.000051358864,0.00047734572,0.00003371417,0.7162356,0.26257724,0.0010396829,0.017578313,0.00005214263],"about_ca_topic_score_codex":0.0025377388,"about_ca_topic_score_gemma":0.004112352,"teacher_disagreement_score":0.0025377388,"about_ca_system_score_codex":0.0003171503,"about_ca_system_score_gemma":0.00045365226,"threshold_uncertainty_score":0.00796175},"labels":[],"label_agreement":null},{"id":"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008144746,0.00047362418,0.9264295,0.00043117636,0.00035505756,0.00040441853,0.0025119362,0.051576544,0.00967288],"genre_scores_gemma":[0.08429204,0.001190625,0.86067593,0.0006504629,0.00035965285,0.0008732541,0.013307862,0.009844396,0.028805798],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99907994,0.00009792233,0.00009611025,0.00009523108,0.0005773328,0.000053546286],"domain_scores_gemma":[0.9990262,0.00031024904,0.000069899856,0.00030026495,0.00025090232,0.000042435648],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00069170067,0.0007884424,0.00048650414,0.001370728,0.0005317676,0.0012741401,0.0013025661,0.0006840865,0.015941182],"category_scores_gemma":[0.003797003,0.0003677841,0.00051426544,0.0015815129,0.00070865365,0.0015294425,0.0015848374,0.0014321697,0.005440436],"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.0005066281,0.00006198321,0.0006316619,0.00046942005,0.000048204947,0.0008012848,0.00038622908,0.0120119,0.050795246,0.078176565,0.106497094,0.7496138],"study_design_scores_gemma":[0.00023184219,0.00031890982,0.00119282,0.00017261309,0.00006998738,0.0021644884,0.00012801998,0.28203547,0.17625374,0.049541622,0.48776534,0.00012518183],"about_ca_topic_score_codex":0.0010472559,"about_ca_topic_score_gemma":0.0009099767,"teacher_disagreement_score":0.015941182,"about_ca_system_score_codex":0.0004354288,"about_ca_system_score_gemma":0.0007017208,"threshold_uncertainty_score":0.053328514},"labels":[],"label_agreement":null},{"id":"W2148944278","doi":"10.1109/dcc.2005.60","title":"On Global Optimality of Gradient Descent Algorithms for Fixed-Rate Scalar Multiple Description Quantizer Design","year":2005,"lang":"en","type":"article","venue":"Data Compression Conference","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Scalar (mathematics); Mathematics; Regular polygon; Mathematical optimization; Fixed point; Algorithm; Applied mathematics; Mathematical analysis; Geometry","score_opus":0.214356975795677,"score_gpt":0.36711723763990983,"score_spread":0.15276026184423283,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2148944278","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005506469,0.00016336083,0.9923866,0.000095795585,0.00001521846,0.000026142396,0.000027799733,0.00008121813,0.0016974362],"genre_scores_gemma":[0.55127627,0.00079920545,0.44049114,0.00028784038,0.000102779224,0.00035623083,0.00027727906,0.00036108316,0.0060481415],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990221,0.00037498798,0.00005276338,0.00017355524,0.0002693778,0.000107146705],"domain_scores_gemma":[0.9966536,0.002289549,0.00021971515,0.00020398072,0.00056023145,0.0000729835],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00346934,0.0012783068,0.0014166719,0.00055435364,0.00044589903,0.0013756526,0.0009898202,0.0011596644,0.0030869232],"category_scores_gemma":[0.009969719,0.00067381054,0.0005804797,0.0005865817,0.0015516431,0.0022293641,0.001762915,0.0019142821,0.00066081266],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014862369,0.00004258441,0.00046961944,0.00015503177,0.000041211606,0.00007738526,0.0001228767,0.80839616,0.00486505,0.13357563,0.0017814401,0.050324347],"study_design_scores_gemma":[0.000016688662,0.000048363345,0.0000723976,0.000014569401,0.0000056132612,0.000019964382,0.000007571311,0.9778465,0.0014051368,0.020151654,0.00040327164,0.000008274987],"about_ca_topic_score_codex":0.001602954,"about_ca_topic_score_gemma":0.0014174025,"teacher_disagreement_score":0.00346934,"about_ca_system_score_codex":0.001012945,"about_ca_system_score_gemma":0.0013345878,"threshold_uncertainty_score":0.0183478},"labels":[],"label_agreement":null},{"id":"W2164196496","doi":"10.1109/dcc.2005.30","title":"Design of VQ-Based Hybrid Digital-Analog Joint Source-Channel Codes for Image Communication","year":2005,"lang":"en","type":"article","venue":"Data Compression Conference","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Computer science; Vector quantization; Additive white Gaussian noise; Communications system; Quantization (signal processing); Channel (broadcasting); Electronic engineering; Dynamic range; Bandwidth (computing); Noise shaping; Algorithm; Computer vision; Telecommunications; Engineering","score_opus":0.12035509914447806,"score_gpt":0.32568466638822324,"score_spread":0.20532956724374518,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2164196496","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.022054901,0.00044011642,0.97435886,0.0001587385,0.00012182841,0.00012801084,0.000056773217,0.0006710289,0.0020097846],"genre_scores_gemma":[0.6106721,0.0003886179,0.3834129,0.0002545571,0.0001114493,0.0002996971,0.00017150419,0.000043967815,0.0046452316],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994815,0.00013262435,0.000034517372,0.00008131896,0.00022206946,0.000047925827],"domain_scores_gemma":[0.9991105,0.00018048537,0.00012653352,0.00008216929,0.0004596061,0.00004072779],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005383367,0.0004324525,0.0004110677,0.00047626477,0.00052620843,0.00066205574,0.00094069465,0.00066233217,0.0015837506],"category_scores_gemma":[0.0011400806,0.00020384288,0.00018343757,0.00047181008,0.0004068288,0.00063308014,0.00065347884,0.0005598387,0.0006966913],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00067992375,0.00021089277,0.001786488,0.0004085936,0.0001636977,0.00035850398,0.00041588323,0.0680509,0.34246218,0.045691893,0.0064060725,0.53336495],"study_design_scores_gemma":[0.00015279379,0.0008874991,0.00085303816,0.000072659976,0.000078196244,0.0008160694,0.00006673214,0.8016661,0.16904302,0.0061281812,0.020139495,0.000096263415],"about_ca_topic_score_codex":0.001263371,"about_ca_topic_score_gemma":0.0021257023,"teacher_disagreement_score":0.0015837506,"about_ca_system_score_codex":0.0004978668,"about_ca_system_score_gemma":0.0008199817,"threshold_uncertainty_score":0.0052981973},"labels":[],"label_agreement":null},{"id":"W2168632843","doi":"10.1109/dcc.2005.4","title":"A Fast Trellis-Based Rate-Allocation Algorithm for Robust Transmission of Progressively Coded Images over Noisy Channels","year":2005,"lang":"en","type":"article","venue":"Data Compression Conference","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Trellis (graph); Algorithm; Set partitioning in hierarchical trees; Computer science; Viterbi algorithm; Transmission (telecommunications); Channel (broadcasting); Soft output Viterbi algorithm; Binary search algorithm; Set (abstract data type); Decoding methods; Search algorithm; Image compression; Image (mathematics); Image processing; Artificial intelligence; Telecommunications; Sequential decoding; Block code","score_opus":0.06167895276373782,"score_gpt":0.32541282286905715,"score_spread":0.26373387010531935,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2168632843","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0049179248,0.0005492323,0.9923471,0.00009197739,0.000081715465,0.00006804702,0.000050668557,0.0008417222,0.001051601],"genre_scores_gemma":[0.1213766,0.0006466672,0.8713208,0.00012338907,0.00016057018,0.00026901835,0.00035378776,0.00019150936,0.005557705],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99942386,0.00014010655,0.000045926226,0.00008691876,0.00025368592,0.00004958928],"domain_scores_gemma":[0.9988772,0.0005095392,0.000117989905,0.00013328494,0.00032933612,0.000032570555],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011043961,0.00066779833,0.0006881931,0.000855802,0.0005118079,0.0007864768,0.0010422568,0.0008878515,0.0055992627],"category_scores_gemma":[0.002732158,0.00039455833,0.00042274134,0.0008214614,0.0006113307,0.00086459046,0.00060641137,0.0011071682,0.0022765615],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007821474,0.0000853103,0.0004017954,0.00033989138,0.00013594561,0.00026939856,0.00023202223,0.17055331,0.1374161,0.03458597,0.014159739,0.6410383],"study_design_scores_gemma":[0.00010581172,0.00026905953,0.00033279436,0.000043707318,0.000051303577,0.0005124604,0.000018733193,0.9309249,0.05079124,0.0067412527,0.010126205,0.00008254193],"about_ca_topic_score_codex":0.0016944993,"about_ca_topic_score_gemma":0.0028393378,"teacher_disagreement_score":0.0055992627,"about_ca_system_score_codex":0.00079537247,"about_ca_system_score_gemma":0.00086033775,"threshold_uncertainty_score":0.018731415},"labels":[],"label_agreement":null}]}