{"meta":{"query_hash":"a1d3feebd94c","filters":{"venue":"Proceedings of the 2002 ACM symposium on Applied computing - SAC '02"},"cohort_total":6,"direct_labels_cover":0,"predictions_cover":6,"exported":6,"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/a1d3feebd94c","api":"https://metacan.xera.ac/api/v1/cohort?venue=Proceedings+of+the+2002+ACM+symposium+on+Applied+computing+-+SAC+%2702"},"results":[{"id":"W4206604997","doi":"10.1145/508909.508923","title":"Color-based image retrieval using binary signatures","year":2002,"lang":"en","type":"article","venue":"Proceedings of the 2002 ACM symposium on Applied computing - SAC '02","topic":"Image Retrieval and Classification Techniques","field":"Computer Science","cited_by":0,"is_retracted":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 retrieval; Abstraction; Image (mathematics); Artificial intelligence; Signature (topology); Binary number; Binary image; Metric (unit); Similarity (geometry); Pattern recognition (psychology); Computer vision; Information retrieval; Data mining; Image processing; Mathematics","score_opus":0.023512428169255563,"score_gpt":0.24489474924866536,"score_spread":0.2213823210794098,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4206604997","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.040712833,0.0016012753,0.95159686,0.00015077202,0.00012942836,0.00014919507,0.00015047238,0.00282486,0.002684363],"genre_scores_gemma":[0.2848185,0.0015010515,0.7055045,0.0002792119,0.00019307375,0.00016537325,0.0007788556,0.00023575712,0.00652371],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989919,0.00012755433,0.00007593538,0.0001360863,0.00056999625,0.000098563425],"domain_scores_gemma":[0.9988631,0.00017091408,0.00014677168,0.00041778476,0.00033809323,0.000063311825],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006217613,0.0006453924,0.001044665,0.002735482,0.00042128467,0.0015070122,0.001654436,0.0008078372,0.0026752187],"category_scores_gemma":[0.001879461,0.0003034631,0.0008105001,0.0032933126,0.00052623625,0.003427372,0.0015966934,0.0006698393,0.0029657646],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00050062174,0.00016528067,0.00086045853,0.00030249963,0.00008077484,0.00012773972,0.0001158392,0.0072322115,0.25563958,0.010968341,0.0037628885,0.7202437],"study_design_scores_gemma":[0.00016543831,0.0010916274,0.0043515186,0.00005918494,0.0001896168,0.0024035105,0.00020112489,0.43511125,0.49936923,0.022308134,0.034452595,0.00029671795],"about_ca_topic_score_codex":0.0011310898,"about_ca_topic_score_gemma":0.0010216843,"teacher_disagreement_score":0.002735482,"about_ca_system_score_codex":0.00046896978,"about_ca_system_score_gemma":0.00057994766,"threshold_uncertainty_score":0.008949459},"labels":[],"label_agreement":null},{"id":"W4206661547","doi":"10.1145/508797.508812","title":"Our <i>guest</i> agents are welcome to your agent platforms","year":2002,"lang":"en","type":"article","venue":"Proceedings of the 2002 ACM symposium on Applied computing - SAC '02","topic":"Mobile Agent-Based Network Management","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":"Computer Research Institute of Montréal","funders":"","keywords":"Computer science; Middleware (distributed applications); Distributed computing; Multi-agent system; Plug-in; Server; Plug and play; The Internet; Internet of Things; Order (exchange); World Wide Web; Operating system; Artificial intelligence","score_opus":0.03925038300478357,"score_gpt":0.24745921662567968,"score_spread":0.20820883362089612,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4206661547","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016646594,0.0044992142,0.16731419,0.057117566,0.06700079,0.00066799414,0.0011791815,0.027973961,0.65760064],"genre_scores_gemma":[0.03490005,0.0015115542,0.03208717,0.006382951,0.004594123,0.00021883947,0.0009710938,0.0025558637,0.9167783],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99916387,0.00017604652,0.000046757563,0.00013341641,0.00029669164,0.00018319757],"domain_scores_gemma":[0.99367934,0.00045040212,0.00040143405,0.0008858348,0.0014552233,0.003127809],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011977627,0.00071439694,0.00070030557,0.0007894705,0.0024336178,0.0074999575,0.0013606882,0.0022587487,0.17635621],"category_scores_gemma":[0.006099568,0.00063532504,0.0006732383,0.0006066889,0.00067636446,0.0058935545,0.004656747,0.0040732357,0.11388776],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015673535,0.00009947428,0.0010727457,0.00011980468,0.000015730278,0.0003817935,0.0005858012,0.00018612658,0.0047807344,0.02693011,0.85674393,0.10892692],"study_design_scores_gemma":[0.000009701284,0.000032367603,0.00025044175,0.000030837706,0.000006117858,0.00021518162,0.0001512423,0.00039318315,0.0007435847,0.0020526382,0.99609643,0.00001829049],"about_ca_topic_score_codex":0.00078273914,"about_ca_topic_score_gemma":0.0013555604,"teacher_disagreement_score":0.17635621,"about_ca_system_score_codex":0.0007016697,"about_ca_system_score_gemma":0.0007694143,"threshold_uncertainty_score":0.5899703},"labels":[],"label_agreement":null},{"id":"W4239022307","doi":"10.1145/508969.508973","title":"Automated assembly of software components based on XML-coded instructions","year":2002,"lang":"en","type":"article","venue":"Proceedings of the 2002 ACM symposium on Applied computing - SAC '02","topic":"Model-Driven Software Engineering Techniques","field":"Computer Science","cited_by":0,"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; Programming language; Software engineering; Software development; Component-based software engineering; XML; Software construction; Reference architecture; Software architecture; Software; Operating system","score_opus":0.017675676371780424,"score_gpt":0.22294914770641683,"score_spread":0.20527347133463641,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4239022307","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.020489082,0.00021638008,0.9597296,0.00015229931,0.00005006723,0.00021456047,0.00013987599,0.014594093,0.0044139833],"genre_scores_gemma":[0.102120206,0.00035577372,0.8895999,0.00008567688,0.000019085748,0.00018932844,0.0007822515,0.0013613199,0.0054864204],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99916375,0.00021917764,0.000091507405,0.000112500755,0.0003442835,0.000068852954],"domain_scores_gemma":[0.99710745,0.0012500713,0.00031559073,0.00077710353,0.0004973858,0.00005246029],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014112158,0.00076733663,0.00046694995,0.0009674172,0.0005906116,0.0017765699,0.001346461,0.00092283107,0.0032157828],"category_scores_gemma":[0.0045545786,0.0007792409,0.0006989174,0.0008667228,0.0008156166,0.0014841005,0.00085239444,0.0013737286,0.0021792203],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00057260774,0.00034299778,0.0043788576,0.0007843843,0.00010101345,0.0014824381,0.0016146607,0.07285625,0.19967876,0.11257445,0.010735561,0.5948779],"study_design_scores_gemma":[0.00021264257,0.0002468662,0.0013970385,0.00027682213,0.000111645895,0.00092495885,0.00022374614,0.5140786,0.35736513,0.034397494,0.09065536,0.00010966464],"about_ca_topic_score_codex":0.0017917253,"about_ca_topic_score_gemma":0.0021391527,"teacher_disagreement_score":0.0032157828,"about_ca_system_score_codex":0.00055734115,"about_ca_system_score_gemma":0.0014460043,"threshold_uncertainty_score":0.0107578635},"labels":[],"label_agreement":null},{"id":"W4251578544","doi":"10.1145/508936.508939","title":"A mesh update requirement for hierarchical adaptive meshes in mesh-based motion tracking","year":2002,"lang":"en","type":"article","venue":"Proceedings of the 2002 ACM symposium on Applied computing - SAC '02","topic":"Video Coding and Compression Technologies","field":"Computer Science","cited_by":0,"is_retracted":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":"Polygon mesh; Computer science; Benchmark (surveying); Frame (networking); Tracking (education); Volume mesh; Mesh generation; Motion (physics); Triangle mesh; T-vertices; Topology (electrical circuits); Computer vision; Computer graphics (images); Finite element method; Mathematics; Engineering; Computer network","score_opus":0.0393591296662718,"score_gpt":0.25016191895973783,"score_spread":0.21080278929346602,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4251578544","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.04813434,0.0002872982,0.94612885,0.00039142056,0.000084715444,0.00020324213,0.00022388512,0.00090603327,0.0036401832],"genre_scores_gemma":[0.5909061,0.00030747367,0.4037133,0.00027799743,0.00020091655,0.0004439354,0.000785575,0.00054865045,0.0028161313],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9926859,0.0013848282,0.0009027837,0.00086878665,0.003741758,0.00041594857],"domain_scores_gemma":[0.9482064,0.02958109,0.0036958188,0.009148609,0.008422814,0.0009452881],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005048891,0.00069260935,0.0011093308,0.00095169654,0.0010954796,0.0016209293,0.0024210922,0.0017253672,0.003946914],"category_scores_gemma":[0.054226138,0.0007347363,0.0006016745,0.0006348847,0.0012048917,0.0034962161,0.002172975,0.0019280337,0.0013673635],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0020014523,0.0003683483,0.011872538,0.0010093548,0.00008178063,0.00104486,0.0011963384,0.19514959,0.37065634,0.10232586,0.0070100194,0.30728355],"study_design_scores_gemma":[0.00008162647,0.000680424,0.0031543456,0.000079708836,0.00006205741,0.00089595595,0.00016887288,0.8713973,0.09404803,0.019530091,0.009832722,0.000068808],"about_ca_topic_score_codex":0.0017044394,"about_ca_topic_score_gemma":0.0014894656,"teacher_disagreement_score":0.005048891,"about_ca_system_score_codex":0.0008178471,"about_ca_system_score_gemma":0.0008814449,"threshold_uncertainty_score":0.02670139},"labels":[],"label_agreement":null},{"id":"W4252429449","doi":"10.1145/508979.508988","title":"An approach to integrating semi-formal and formal notations in software specification","year":2002,"lang":"en","type":"article","venue":"Proceedings of the 2002 ACM symposium on Applied computing - SAC '02","topic":"Model-Driven Software Engineering 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; Formal specification; Programming language; Unified Modeling Language; Software engineering; Notation; Formal methods; Visual modeling; Software","score_opus":0.01729842992066405,"score_gpt":0.22502193865400394,"score_spread":0.2077235087333399,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4252429449","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.00032965952,0.00021708067,0.9972727,0.00060975185,0.00006274268,0.000043260607,0.000012762043,0.00015264445,0.0012994108],"genre_scores_gemma":[0.023589293,0.0006704615,0.97294927,0.00039965656,0.000107477514,0.0003660714,0.000095058116,0.0001198549,0.0017028197],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9753118,0.01497161,0.0020445555,0.0014879296,0.005580808,0.0006033196],"domain_scores_gemma":[0.9714494,0.01630173,0.002372914,0.006004254,0.003271425,0.00060041563],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.026657121,0.0021001888,0.0013885624,0.003893748,0.0023911018,0.009978307,0.006569619,0.004423046,0.0035869055],"category_scores_gemma":[0.032263257,0.0022833974,0.003562629,0.003928132,0.012381376,0.013831299,0.009091307,0.008759007,0.0014885468],"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.000016812737,0.000029638812,0.00009759542,0.00023575369,0.000026824742,0.00007457666,0.0015041514,0.0037815173,0.0010378471,0.9754891,0.00064413465,0.017062193],"study_design_scores_gemma":[0.00006208795,0.00016081259,0.00009647444,0.00046883407,0.00008049902,0.00028196207,0.0006384765,0.030104637,0.003409601,0.85563225,0.1089599,0.000104502826],"about_ca_topic_score_codex":0.0037060855,"about_ca_topic_score_gemma":0.0035372507,"teacher_disagreement_score":0.026657121,"about_ca_system_score_codex":0.0042936862,"about_ca_system_score_gemma":0.008737955,"threshold_uncertainty_score":0.14097798},"labels":[],"label_agreement":null},{"id":"W4254176277","doi":"10.1145/508820.508827","title":"Optimal algorithms for local vertex quartet cleaning","year":2002,"lang":"en","type":"article","venue":"Proceedings of the 2002 ACM symposium on Applied computing - SAC '02","topic":"Evolution and Genetic Dynamics","field":"Biochemistry, Genetics and Molecular Biology","cited_by":0,"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":"Vertex (graph theory); Merge (version control); Algorithm; Computer science; Set (abstract data type); Tree (set theory); Mathematics; Theoretical computer science; Combinatorics","score_opus":0.012881274767352508,"score_gpt":0.23317991552356235,"score_spread":0.22029864075620983,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4254176277","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.02019551,0.00042331763,0.973264,0.0002223122,0.000056693527,0.00011242932,0.00012007216,0.0035368416,0.0020688188],"genre_scores_gemma":[0.13820283,0.0002486534,0.8572754,0.00012634811,0.00005311331,0.00025182692,0.000841357,0.00059509336,0.0024053429],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979576,0.0004050622,0.00014490093,0.0005521624,0.00058293255,0.0003572971],"domain_scores_gemma":[0.9927395,0.0034923952,0.0005438427,0.0020592413,0.0008821497,0.00028296697],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016151861,0.0012444906,0.0023773783,0.0016534344,0.0013545402,0.0021735034,0.0036351695,0.00215784,0.006646494],"category_scores_gemma":[0.010277911,0.0008941725,0.001471088,0.002640398,0.0010650703,0.0035212513,0.0035933466,0.0023345782,0.0024059194],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005977851,0.00024323222,0.001384328,0.00030889155,0.00008078038,0.000088175744,0.0003769705,0.22171657,0.010457851,0.02202869,0.010220595,0.73249614],"study_design_scores_gemma":[0.00017802039,0.00012117508,0.0005466116,0.00002588676,0.000048149024,0.00016170835,0.0001846026,0.9226132,0.007200158,0.06483356,0.004053115,0.00003379901],"about_ca_topic_score_codex":0.0023616483,"about_ca_topic_score_gemma":0.0035393424,"teacher_disagreement_score":0.006646494,"about_ca_system_score_codex":0.0014942167,"about_ca_system_score_gemma":0.0017935947,"threshold_uncertainty_score":0.022234678},"labels":[],"label_agreement":null}]}