{"meta":{"page":1,"per_page":50,"max_per_page":100,"total":5,"total_is_capped":false,"direct_labels_cover":0,"predictions_cover":5,"direct_label_status":"direct model label, unvalidated","prediction_status":"machine_predicted_unvalidated (Codex and Gemma teacher distillation)","score_status":"score_only:v0-immature-baseline (scores rank; they never assert a category)","snapshot":{"source":"OpenAlex, pinned release, all 482 partitions","release":"2026-06-24","frame_built":"2026-07-12"},"query_hash":"e71370c2918f","filters":{"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.06272314475331624,"gpt":0.3295744468571449,"spread":0.2668513021038286,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0004024882,0.0005314483,0.0005614072,0.0002716269,0.0003482218,0.0007399353,0.01042372,0.0001671756,0.0003345788],"category_scores_gemma":[0.0001635244,0.0004634412,0.00008766597,0.0004289061,0.0003044857,0.003732654,0.004197769,0.0006531103,0.0002527199],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007719327,"about_ca_system_score_gemma":0.0002326914,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004343622,"about_ca_topic_score_gemma":0.00002423966,"domain_scores_codex":[0.9957848,0.0002748627,0.0007026469,0.00172821,0.0007617974,0.0007476626],"domain_scores_gemma":[0.9922395,0.0003669846,0.0003708621,0.006305462,0.0003341941,0.0003829539],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0002362212,0.001792929,0.0003836584,0.0001967655,0.00007827689,0.0001974618,0.0004710873,0.0003972677,0.3701666,0.02424084,0.2719662,0.3298727],"study_design_scores_gemma":[0.001225627,0.00009675609,0.0002166002,0.0004478916,0.00001674784,0.00004730653,0.00002533066,0.4958845,0.2459434,0.001341061,0.2539338,0.0008209845],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.002631944,0.0003368832,0.9883403,0.003098363,0.0003243082,0.0004735698,0.0008059978,0.00141775,0.002570873],"genre_scores_gemma":[0.565676,0.0000567309,0.4325877,0.0007843759,0.0001543706,0.00004824291,0.0005170695,0.00003119104,0.0001443428],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.5630441,"threshold_uncertainty_score":0.9997817,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.1258598657516131,"gpt":0.3360986455891776,"spread":0.2102387798375645,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.000500078,0.0003754707,0.0004177353,0.0001552809,0.0004635127,0.0006484979,0.007146898,0.0001539498,0.0001714719],"category_scores_gemma":[0.0001498288,0.0003120625,0.00008683516,0.0002800463,0.0001051385,0.002240193,0.003045959,0.0002935512,0.0001342973],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003601029,"about_ca_system_score_gemma":0.0002567944,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00005553142,"about_ca_topic_score_gemma":0.00002774038,"domain_scores_codex":[0.996731,0.0001355,0.0005427157,0.001358117,0.000602228,0.0006304047],"domain_scores_gemma":[0.9941338,0.0005068125,0.0002746761,0.004461652,0.0003048734,0.0003182243],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001277072,0.0005822412,0.0001056364,0.0001135366,0.00003185221,0.00001137593,0.0001213788,0.0008444897,0.006005299,0.03187742,0.238321,0.7218581],"study_design_scores_gemma":[0.0008765638,0.00004872733,0.0001245441,0.0001018988,0.000008085437,0.000004276842,0.000005198609,0.5643936,0.002083311,0.0007386665,0.4313459,0.0002691195],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0003518673,0.000379281,0.9927664,0.002751235,0.0005792599,0.0006342853,0.001287401,0.0004862925,0.0007639867],"genre_scores_gemma":[0.2874198,0.0000597811,0.7065769,0.001687742,0.000465575,0.0001564988,0.003213736,0.00003646765,0.0003834676],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.721589,"threshold_uncertainty_score":0.9999331,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.1203550991444781,"gpt":0.3256846663882232,"spread":0.2053295672437452,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0006598941,0.0003100026,0.0004859345,0.0001992925,0.000252923,0.0003715735,0.006318008,0.00008006456,0.00004392888],"category_scores_gemma":[0.0004324807,0.0002741858,0.00006854267,0.0002040391,0.0002403957,0.003235728,0.003368111,0.0002369473,0.00002387485],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003587202,"about_ca_system_score_gemma":0.0001824024,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001613956,"about_ca_topic_score_gemma":0.000002275434,"domain_scores_codex":[0.9973443,0.0002283835,0.0007410944,0.0008493615,0.0004660621,0.0003707806],"domain_scores_gemma":[0.9924254,0.0009393517,0.0006260219,0.005346737,0.000507195,0.0001552454],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000281824,0.001252237,0.00002884722,0.0002606008,0.00007984666,0.000008157658,0.0003872314,0.01510405,0.1339979,0.01271577,0.2389727,0.5969109],"study_design_scores_gemma":[0.0005158406,0.00008148813,0.00001564552,0.0003045415,0.00001092853,0.000005704039,0.00001442032,0.8199078,0.1470093,0.006437488,0.02540355,0.000293243],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0001063966,0.0002343907,0.9957139,0.0008622923,0.00005698318,0.0007593498,0.001594,0.0004742621,0.0001984013],"genre_scores_gemma":[0.4096964,0.00005925452,0.5881843,0.0001875905,0.00002573918,0.00007868453,0.001701562,0.00001916023,0.00004729936],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.8048038,"threshold_uncertainty_score":0.999971,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"McMaster University","funders":"","keywords":"Scalar (mathematics); Mathematics; Regular polygon; Mathematical optimization; Fixed point; Algorithm; Applied mathematics; Mathematical analysis; Geometry","retraction":null,"screen_n_in":null,"score":{"opus":0.214356975795677,"gpt":0.3671172376399098,"spread":0.1527602618442328,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001005868,0.0003712763,0.0004711311,0.0001086552,0.0002407288,0.000202647,0.004327502,0.0001214096,0.00003418759],"category_scores_gemma":[0.0005361048,0.0003154806,0.00008161904,0.0003075836,0.0001455719,0.002023833,0.002221229,0.0002158029,0.00002426774],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001159411,"about_ca_system_score_gemma":0.0001436684,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004999308,"about_ca_topic_score_gemma":0.00001252897,"domain_scores_codex":[0.996535,0.0003989144,0.0007328407,0.001268559,0.0005562716,0.0005084205],"domain_scores_gemma":[0.9948846,0.0006400686,0.0004786577,0.003395739,0.0003700826,0.0002308539],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0008742148,0.002063747,0.0006305902,0.0001752206,0.00007217952,0.00001525709,0.0001701223,0.01033671,0.05782906,0.120618,0.08788299,0.7193319],"study_design_scores_gemma":[0.0009758001,0.0002533956,0.001132504,0.0003736152,0.00001356687,0.000007204817,0.000009123819,0.8963467,0.08105092,0.007465604,0.01199467,0.0003768386],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.002461903,0.0001345869,0.9934371,0.0003519377,0.0003519548,0.001023849,0.001787022,0.0003903397,0.00006136113],"genre_scores_gemma":[0.4369075,0.00005731675,0.5623041,0.0001597855,0.00003559666,0.0000691972,0.000440881,0.00001101109,0.00001459371],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.8860101,"threshold_uncertainty_score":0.9999297,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.06167895276373782,"gpt":0.3254128228690572,"spread":0.2637338701053193,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005979431,0.0004387826,0.0005552683,0.0002664117,0.000259062,0.0002505165,0.004638502,0.000190233,0.0000979649],"category_scores_gemma":[0.000107882,0.0003681607,0.00009391847,0.0004292412,0.0001871696,0.002742401,0.001126569,0.0002791127,0.000009872186],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004368689,"about_ca_system_score_gemma":0.0002861968,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002652311,"about_ca_topic_score_gemma":0.000003503524,"domain_scores_codex":[0.9965087,0.0002514361,0.0008084921,0.001318859,0.0006091157,0.0005034212],"domain_scores_gemma":[0.9952193,0.00045831,0.0006752833,0.002799041,0.0006086678,0.0002394293],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00007591852,0.000387884,0.000009518967,0.00008631605,0.00001610733,0.000003087845,0.00009655266,0.002422436,0.05658924,0.0009851631,0.01198351,0.9273443],"study_design_scores_gemma":[0.001140387,0.0001551029,0.0001256795,0.0005794561,0.00001823042,0.000002881265,0.00001017252,0.7643564,0.2042221,0.0004481209,0.02858784,0.0003536764],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0001954628,0.0003402627,0.9949386,0.0008501898,0.0001999503,0.001198785,0.001705864,0.0004949693,0.00007597101],"genre_scores_gemma":[0.06309972,0.0001101147,0.9336182,0.0002205825,0.0001125469,0.0002391015,0.002393242,0.00003759776,0.0001688218],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9269906,"threshold_uncertainty_score":0.999877,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}