{"meta":{"query_hash":"fb4ffe577790","filters":{"venue":"Proceedings - International Conference on Tools with Artificial Intelligence, TAI"},"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/fb4ffe577790","api":"https://metacan.xera.ac/api/v1/cohort?venue=Proceedings+-+International+Conference+on+Tools+with+Artificial+Intelligence%2C+TAI"},"results":[{"id":"W1976626555","doi":"10.1109/ictai.2006.66","title":"Improving the Graph-Based Image Segmentation Method","year":2006,"lang":"en","type":"article","venue":"Proceedings - International Conference on Tools with Artificial Intelligence, TAI","topic":"Image Retrieval and Classification 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 Calgary","funders":"","keywords":"Image segmentation; Computer science; Preprocessor; Scale-space segmentation; Segmentation-based object categorization; Artificial intelligence; Segmentation; Computer vision; Graph; Image texture; Image (mathematics); Pattern recognition (psychology); Theoretical computer science","score_opus":0.06000067701810169,"score_gpt":0.3200277335863739,"score_spread":0.2600270565682722,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1976626555","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.009251588,0.00026775678,0.98724097,0.00016393782,0.0000736426,0.000075912845,0.00005449691,0.0018737924,0.0009979598],"genre_scores_gemma":[0.10081456,0.00038364183,0.89437795,0.00020860253,0.00011588842,0.00010426472,0.00039274094,0.00055275514,0.0030495941],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988871,0.00021115683,0.00006987347,0.00027114834,0.000487032,0.00007364979],"domain_scores_gemma":[0.9981939,0.00059069635,0.000113733426,0.00030131603,0.000736176,0.00006416196],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006436942,0.00075015705,0.0011464772,0.0027919328,0.0005561822,0.0009961795,0.0018588807,0.0013198208,0.0034969505],"category_scores_gemma":[0.003043244,0.00043561394,0.0011507022,0.0021790296,0.00063594966,0.0018731724,0.00081902626,0.001041706,0.0016650328],"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.00025135072,0.00019554613,0.0012712554,0.0002876585,0.00015132208,0.00022366726,0.0001830868,0.110673875,0.076028995,0.010720784,0.007052469,0.79296],"study_design_scores_gemma":[0.00003348519,0.0000644975,0.00092720997,0.000011651881,0.00005056725,0.0002094811,0.000034283777,0.97317874,0.015136323,0.004815893,0.005507633,0.000030242263],"about_ca_topic_score_codex":0.008295811,"about_ca_topic_score_gemma":0.0076610185,"teacher_disagreement_score":0.008295811,"about_ca_system_score_codex":0.0007747182,"about_ca_system_score_gemma":0.0011248458,"threshold_uncertainty_score":0.016495049},"labels":[],"label_agreement":null},{"id":"W1997501911","doi":"10.1109/ictai.2006.50","title":"Diagnosability Test for Timed Discrete-Event Systems","year":2006,"lang":"en","type":"article","venue":"Proceedings - International Conference on Tools with Artificial Intelligence, TAI","topic":"Petri Nets in System Modeling","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":"Concordia University","funders":"","keywords":"Computer science; Bounded function; Polynomial; Time complexity; Computation; Event (particle physics); Algorithm; Discrete time and continuous time; Theoretical computer science; Mathematics","score_opus":0.08113246542124572,"score_gpt":0.31805811998771966,"score_spread":0.23692565456647394,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1997501911","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.03455163,0.00006870966,0.9626579,0.00012620151,0.000038052633,0.000106946005,0.00011680641,0.0011420979,0.0011915806],"genre_scores_gemma":[0.66274935,0.00009027756,0.3350727,0.00012748221,0.00004711825,0.00026804226,0.00063612487,0.0001342608,0.0008746363],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99781185,0.00046459562,0.00017649186,0.00042095844,0.00094503845,0.00018100267],"domain_scores_gemma":[0.9880193,0.009757255,0.00058744114,0.00074023806,0.0006710237,0.0002246645],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012388233,0.00057483575,0.0006820295,0.001026546,0.00037603284,0.0010838737,0.0011659518,0.0007101534,0.0028701934],"category_scores_gemma":[0.015475361,0.00020087886,0.000794582,0.00053420867,0.0013239748,0.0021398459,0.00095533184,0.0011499878,0.00031248204],"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.0014682825,0.00041965346,0.0065633515,0.00070259697,0.00018180865,0.0009894391,0.00038059172,0.368881,0.055292998,0.2948669,0.002149137,0.26810429],"study_design_scores_gemma":[0.00013772656,0.0002503951,0.0005231201,0.000030662446,0.000033305423,0.0002559134,0.000042462412,0.84942216,0.024160165,0.122719154,0.0023913998,0.000033496548],"about_ca_topic_score_codex":0.0014718012,"about_ca_topic_score_gemma":0.00075630925,"teacher_disagreement_score":0.0028701934,"about_ca_system_score_codex":0.0011629105,"about_ca_system_score_gemma":0.0013782254,"threshold_uncertainty_score":0.009601772},"labels":[],"label_agreement":null},{"id":"W1998529837","doi":"10.1109/ictai.2006.40","title":"Classifying Business Processes for Domain Engineering","year":2006,"lang":"en","type":"article","venue":"Proceedings - International Conference on Tools with Artificial Intelligence, TAI","topic":"Business Process Modeling and Analysis","field":"Business, Management and Accounting","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é du Québec à Montréal","funders":"","keywords":"Computer science; Business process; Business process modeling; Software engineering; Artifact-centric business process model; Eclipse; Business rule; Business domain; Domain (mathematical analysis); Business Process Model and Notation; Functional software architecture; Systems engineering; Software; Process management; Software architecture; Programming language; Engineering; Work in process; Reference architecture","score_opus":0.07748061799904307,"score_gpt":0.2673079499779543,"score_spread":0.18982733197891125,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1998529837","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.0042788195,0.011279377,0.9400137,0.004618189,0.00070750294,0.0005590211,0.0005807967,0.00085020426,0.037112467],"genre_scores_gemma":[0.08474091,0.010165835,0.88722515,0.0012724051,0.0011979376,0.0011187645,0.0030026718,0.00037740698,0.010898977],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9957333,0.001726527,0.00058902334,0.0006962016,0.00095685694,0.00029817587],"domain_scores_gemma":[0.9933553,0.0030509538,0.00061035197,0.0016288147,0.00095664454,0.00039791217],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0050987247,0.0018714177,0.0011645744,0.008109809,0.0023024608,0.010500937,0.0021578602,0.0033044303,0.0066597103],"category_scores_gemma":[0.010439676,0.0007268431,0.0019977896,0.007876979,0.005245991,0.013259194,0.0038555814,0.0051939883,0.003470732],"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.000007028599,0.000026124928,0.00025968373,0.00016010556,0.000009235819,0.00006511426,0.0005094165,0.001401293,0.00022700425,0.95962864,0.0034689163,0.034237508],"study_design_scores_gemma":[0.000007342612,0.000010039204,0.00019037597,0.00019101884,0.000008426378,0.00012545615,0.00043347946,0.005991971,0.00016961253,0.8681985,0.124662444,0.0000113174865],"about_ca_topic_score_codex":0.003378423,"about_ca_topic_score_gemma":0.0017305771,"teacher_disagreement_score":0.010500937,"about_ca_system_score_codex":0.003191295,"about_ca_system_score_gemma":0.003155648,"threshold_uncertainty_score":0.026964962},"labels":[],"label_agreement":null},{"id":"W2004681822","doi":"10.1109/ictai.2006.106","title":"Software Maintenance: Similarity and Inclusion of Rules in Knowledge Extraction","year":2006,"lang":"en","type":"article","venue":"Proceedings - International Conference on Tools with Artificial Intelligence, TAI","topic":"Software Engineering Research","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":"National Research Council Canada; National Research Council Institute for Biodiagnostics; University of Alberta","funders":"","keywords":"Maintainability; Software maintenance; Computer science; Software engineering; Verification and validation; Software development; Software metric; Software; Software construction; Set (abstract data type); Data mining; Software sizing; Similarity (geometry); Software system; Artificial intelligence; Engineering; Programming language","score_opus":0.05730947791003136,"score_gpt":0.321796407484553,"score_spread":0.26448692957452163,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2004681822","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.31981927,0.002363569,0.6643601,0.00057092245,0.000070875234,0.0011807381,0.001422446,0.0012150385,0.008997003],"genre_scores_gemma":[0.63621974,0.00063880865,0.35845485,0.0001228751,0.00007589453,0.00058318133,0.0028628602,0.00007669262,0.00096512993],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9868706,0.0043498375,0.002385074,0.0017136167,0.004249503,0.00043136597],"domain_scores_gemma":[0.94003415,0.049412824,0.002577809,0.00313623,0.004339576,0.00049940305],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0103999525,0.00055240444,0.0017055975,0.016045822,0.0012435325,0.003917448,0.0017037943,0.0016873048,0.0011304655],"category_scores_gemma":[0.05728283,0.0004123004,0.0016526869,0.010818433,0.0011347012,0.005620047,0.0021265603,0.0014447839,0.0004925635],"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.001209559,0.0016014413,0.058965378,0.001156117,0.0006115202,0.0014246707,0.0036814832,0.024971882,0.009092537,0.02471643,0.0032438932,0.8693251],"study_design_scores_gemma":[0.00023887865,0.0009958732,0.05975556,0.0009619266,0.0011356176,0.0041900766,0.0039655133,0.7528798,0.025090879,0.13656238,0.013991401,0.0002320227],"about_ca_topic_score_codex":0.0026697118,"about_ca_topic_score_gemma":0.0018890558,"teacher_disagreement_score":0.016045822,"about_ca_system_score_codex":0.0009877175,"about_ca_system_score_gemma":0.0013191592,"threshold_uncertainty_score":0.05500084},"labels":[],"label_agreement":null},{"id":"W2056931841","doi":"10.1109/ictai.2006.51","title":"Discover Gene Specific Local Co-regulations Using Progressive Genetic Algorithm","year":2006,"lang":"en","type":"article","venue":"Proceedings - International Conference on Tools with Artificial Intelligence, TAI","topic":"Advanced Multi-Objective Optimization Algorithms","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":"Saint Mary's University; Dalhousie University","funders":"Natural Sciences and Engineering Research Council of Canada; Dalhousie University","keywords":"Genetic algorithm; Position (finance); Window (computing); Computer science; Gene; Population; Algorithm; Data mining; Computational biology; Biology; Genetics; Machine learning; Medicine","score_opus":0.06341183955686304,"score_gpt":0.3179801793595039,"score_spread":0.2545683398026409,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2056931841","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.16882692,0.00021572172,0.82850546,0.00009225296,0.000010214057,0.00013381723,0.00004963914,0.0006603609,0.0015055438],"genre_scores_gemma":[0.52591527,0.00016218789,0.47186747,0.00009643263,0.000012541583,0.00026400312,0.00021030869,0.000056998226,0.0014148175],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99965405,0.00008013546,0.000016093976,0.00011536182,0.00009311198,0.00004130704],"domain_scores_gemma":[0.9993556,0.0003805599,0.00008997583,0.00007289738,0.00007619244,0.000024796364],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009988982,0.00078526995,0.00094119844,0.0012713011,0.0003371133,0.0005250053,0.001166184,0.0007473963,0.00061288924],"category_scores_gemma":[0.0021144454,0.0003568172,0.00078379834,0.0008999222,0.00062228803,0.0005595392,0.0008485569,0.00048668456,0.00013906749],"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.00012971203,0.00014845032,0.0067166192,0.000096510434,0.00015163123,0.00022116755,0.00022462814,0.7909322,0.021057503,0.006008902,0.0005726362,0.17374009],"study_design_scores_gemma":[0.000026383792,0.000067989924,0.0006954788,0.000005563389,0.000031909993,0.00005486707,0.000025016769,0.9921482,0.0026983465,0.0038002122,0.00043916894,0.000006888862],"about_ca_topic_score_codex":0.003331586,"about_ca_topic_score_gemma":0.004090466,"teacher_disagreement_score":0.003331586,"about_ca_system_score_codex":0.0005375643,"about_ca_system_score_gemma":0.0011419811,"threshold_uncertainty_score":0.006624341},"labels":[],"label_agreement":null},{"id":"W2065275668","doi":"10.1109/ictai.2006.34","title":"Ant Colony with Stochastic Local Search for the Quadratic Assignment Problem","year":2006,"lang":"en","type":"article","venue":"Proceedings - International Conference on Tools with Artificial Intelligence, TAI","topic":"Vehicle Routing Optimization Methods","field":"Engineering","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 Regina","funders":"","keywords":"Quadratic assignment problem; Mathematical optimization; Ant colony optimization algorithms; Ant colony; Computer science; Quadratic equation; Local search (optimization); ANT; Quadratic programming; Mathematics; Combinatorial optimization; Computer network","score_opus":0.0709008042347709,"score_gpt":0.3054271221474704,"score_spread":0.2345263179126995,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2065275668","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.013560029,0.00036381834,0.9819645,0.00015533889,0.000028621029,0.0000473708,0.000018930808,0.00039192586,0.0034693878],"genre_scores_gemma":[0.5601136,0.00065213395,0.4319293,0.000116434916,0.000063098494,0.00031209085,0.00013876858,0.00013551289,0.0065389858],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995221,0.00020984662,0.000015558266,0.000046015266,0.00017967835,0.00002672935],"domain_scores_gemma":[0.9995435,0.00027036716,0.000052796146,0.00003676595,0.00007669057,0.000019838813],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007490584,0.00052014575,0.00074317504,0.00043639616,0.00029498778,0.0004743607,0.00070500904,0.0006000861,0.0013506371],"category_scores_gemma":[0.0020515574,0.00024152,0.00055340544,0.00080949126,0.00043671473,0.00052813796,0.00057404296,0.00068795244,0.0002987062],"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.00002913477,0.00003142358,0.0001516017,0.000063962005,0.000022783419,0.000054418353,0.00003260199,0.9561584,0.001522678,0.0076866844,0.0009496285,0.03329667],"study_design_scores_gemma":[0.0000088857,0.000017663608,0.000038784056,0.0000019234292,0.0000038106755,0.000015419466,0.0000027174258,0.9972582,0.00019094242,0.0018971225,0.0005618309,0.0000026537073],"about_ca_topic_score_codex":0.003646366,"about_ca_topic_score_gemma":0.0032277482,"teacher_disagreement_score":0.003646366,"about_ca_system_score_codex":0.00035802103,"about_ca_system_score_gemma":0.0007895183,"threshold_uncertainty_score":0.007250309},"labels":[],"label_agreement":null}]}