{"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0013596157,0.0000079092415,0.9739073,0.006366927,0.00021654245,0.00047354965,0.000010810875,0.00036582485,0.017291531],"genre_scores_gemma":[0.80106753,0.0000083861305,0.19747913,0.000632565,0.00020514696,0.0002238391,0.00002407787,0.000019229145,0.00034011944],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9976185,0.000035104167,0.0005331766,0.0006332409,0.00083979213,0.00034021377],"domain_scores_gemma":[0.99780935,0.00013989818,0.00042299496,0.0002478764,0.0013097925,0.000070072834],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00066671753,0.00027727292,0.00017573881,0.00028398962,0.00033079868,0.0018997283,0.0014570635,0.000083898594,0.00012631649],"category_scores_gemma":[0.0001390999,0.00018920774,0.000097065684,0.00073201885,0.000202068,0.0013193395,0.00010261384,0.00031994423,0.00009203132],"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.000070278285,0.000116309595,0.00006839958,0.00000998881,0.000014086861,0.0000026815062,0.00010232516,0.00002650601,0.08505686,0.80180264,0.00012843039,0.112601504],"study_design_scores_gemma":[0.00005623639,0.00020592462,0.00013768324,0.000044221986,0.000011217118,0.000009336318,0.00038644767,0.1782824,0.72320217,0.09702864,0.00037022162,0.0002655228],"about_ca_topic_score_codex":0.00012550446,"about_ca_topic_score_gemma":0.000011277918,"teacher_disagreement_score":0.7997079,"about_ca_system_score_codex":0.00011653069,"about_ca_system_score_gemma":0.00015648428,"threshold_uncertainty_score":0.9991364},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017137723,0.000037625545,0.9362501,0.0027086763,0.0011555867,0.0014995856,0.00010594908,0.00040775602,0.04069703],"genre_scores_gemma":[0.98743725,0.0000086034315,0.00999897,0.00009130523,0.0006929491,0.0007987495,0.00003644656,0.000031066866,0.0009046751],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9961784,0.000022497885,0.0010262122,0.0010955042,0.0010659245,0.00061148294],"domain_scores_gemma":[0.9965944,0.0005814671,0.0005111984,0.00036633,0.0017853765,0.00016119936],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0008791982,0.00041789582,0.00040545836,0.00031032469,0.00027712426,0.0020075554,0.0019677198,0.00014865489,0.0000702005],"category_scores_gemma":[0.00080620486,0.00034778038,0.00013661083,0.00054521236,0.00017255795,0.0013289752,0.0002070537,0.00029588531,0.00019979564],"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.000114478295,0.0003442373,0.0013032571,0.0000566498,0.000037644175,0.0000048166794,0.00019781242,0.003469371,0.0010845927,0.9795301,0.0007547623,0.013102276],"study_design_scores_gemma":[0.00015517631,0.00066213,0.00021682003,0.00040269413,0.000018581934,0.000031594078,0.00056189863,0.89216834,0.016958175,0.08464172,0.0035159683,0.00066691183],"about_ca_topic_score_codex":0.00013652291,"about_ca_topic_score_gemma":0.00003309675,"teacher_disagreement_score":0.9702995,"about_ca_system_score_codex":0.0003161565,"about_ca_system_score_gemma":0.0002011239,"threshold_uncertainty_score":0.9998974},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.29717964,0.00009649776,0.6081695,0.018791756,0.0013199709,0.0013582758,0.000057488007,0.0011894637,0.07183743],"genre_scores_gemma":[0.9921823,0.000014853382,0.004164671,0.00043275324,0.0024485954,0.0003049187,0.00012990825,0.00006366714,0.00025829306],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99765265,0.0000014186413,0.00061556476,0.00068069546,0.0005530465,0.0004965964],"domain_scores_gemma":[0.99518746,0.00006449785,0.00043152922,0.000114298055,0.0041755117,0.000026720105],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0003129349,0.00041286633,0.0003486766,0.0006566473,0.00032114604,0.0022308212,0.00062864076,0.00012436559,0.00013027992],"category_scores_gemma":[0.00048531682,0.00035086894,0.00009049789,0.0013856484,0.000099111225,0.002194656,0.00008366516,0.0002150377,0.000088217275],"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.00038674218,0.00025008223,0.0020445855,0.00057563884,0.00007724723,0.0000037152174,0.000045821325,0.009182102,0.0031321165,0.9704324,0.00029855256,0.0135710025],"study_design_scores_gemma":[0.0005324806,0.0001073062,0.0013202396,0.0017313336,0.00026912164,0.000016036935,0.0023612832,0.52814466,0.008446552,0.43088818,0.024006838,0.0021759858],"about_ca_topic_score_codex":0.00018173529,"about_ca_topic_score_gemma":0.000075278156,"teacher_disagreement_score":0.6950027,"about_ca_system_score_codex":0.00006873029,"about_ca_system_score_gemma":0.00011537376,"threshold_uncertainty_score":0.9998943},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6284884,0.000074478055,0.36032218,0.0013673321,0.00038389507,0.0004713646,0.00002065407,0.00024245358,0.008629206],"genre_scores_gemma":[0.98386633,0.000045229717,0.015767273,0.000029695904,0.00008728834,0.000052910887,0.00000933666,0.000014751182,0.00012720043],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99789494,0.000015839876,0.0004972138,0.000558993,0.00069094915,0.0003420899],"domain_scores_gemma":[0.998288,0.0003451571,0.0001827155,0.0001548123,0.0009486302,0.00008072948],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006006188,0.00022335273,0.00023276913,0.0005339815,0.00019776679,0.00030424184,0.00091699424,0.000116359144,0.000042735795],"category_scores_gemma":[0.000835307,0.00019712234,0.000038917082,0.00054108986,0.00016969162,0.0010101041,0.0010380957,0.00039707444,0.00001986116],"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.00019013132,0.00039451956,0.016188713,0.00007215573,0.000017207669,0.000014394364,0.001227224,0.00038371744,0.004623299,0.86374694,0.000105712636,0.11303597],"study_design_scores_gemma":[0.00041305975,0.00096304156,0.059062935,0.0013380174,0.000013197853,0.00007520141,0.0007979077,0.25940594,0.120391965,0.55517,0.0013236232,0.0010451276],"about_ca_topic_score_codex":0.00015129766,"about_ca_topic_score_gemma":0.00008248414,"teacher_disagreement_score":0.35537788,"about_ca_system_score_codex":0.0001635415,"about_ca_system_score_gemma":0.00013730515,"threshold_uncertainty_score":0.8038416},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0059979325,0.000039703362,0.9844512,0.00050819776,0.000513279,0.00071407756,0.00006664674,0.00025839254,0.0074506225],"genre_scores_gemma":[0.5153612,0.000022493963,0.48351887,0.00011451599,0.00048968464,0.00011584097,0.00006150678,0.000041896143,0.00027399056],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9963005,0.000027280434,0.00078828825,0.001142537,0.0011330304,0.00060833036],"domain_scores_gemma":[0.99703014,0.0000783083,0.0005384459,0.00031178552,0.0018616283,0.00017967827],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00017811648,0.0004915591,0.00033701956,0.0004995352,0.00041226248,0.0014779505,0.0012490507,0.00014295905,0.00029424438],"category_scores_gemma":[0.000056044333,0.00044301487,0.0001076687,0.0008994155,0.0005003158,0.0020454251,0.00019137637,0.0003690729,0.00017323166],"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.00012699208,0.0005775906,0.00038798546,0.000009398084,0.000085413376,0.000065210734,0.0004072011,0.08871,0.0040905974,0.67278475,0.00011906207,0.2326358],"study_design_scores_gemma":[0.00017152811,0.0002316554,0.0006098123,0.000099774414,0.000014015523,0.00011972747,0.00043984113,0.89974487,0.055208728,0.042179808,0.00055419974,0.00062606885],"about_ca_topic_score_codex":0.000048159556,"about_ca_topic_score_gemma":0.0000065417894,"teacher_disagreement_score":0.81103486,"about_ca_system_score_codex":0.00041352594,"about_ca_system_score_gemma":0.00026517746,"threshold_uncertainty_score":0.9998022},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011583166,0.000014909066,0.9758209,0.0012239099,0.00020097909,0.0011798209,0.000028599934,0.00023887678,0.009708834],"genre_scores_gemma":[0.9722158,0.0000076226484,0.026533157,0.00006838402,0.00026402934,0.00054892944,0.00002565308,0.00005878693,0.00027764007],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99788636,0.00001626538,0.0005053803,0.000414013,0.00071705563,0.00046093683],"domain_scores_gemma":[0.99839616,0.00034623803,0.00013034334,0.00013142088,0.0009055643,0.0000902993],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005659182,0.0003161005,0.0002386637,0.00017196171,0.0002512201,0.0006285136,0.00051272265,0.00009378924,0.0001518971],"category_scores_gemma":[0.00006996701,0.0002131605,0.000051229716,0.0003692768,0.00025799408,0.00032351894,0.000038027425,0.00035039955,0.000039350518],"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.00030236007,0.000084994695,0.000127668,0.000037388443,0.0000828514,0.0000017496568,0.0002849959,0.6926553,0.0010007598,0.28526428,0.0001367948,0.020020848],"study_design_scores_gemma":[0.00013880366,0.00051609863,0.000081956685,0.00018394657,0.00004125851,0.00001579453,0.001684952,0.9704519,0.019852716,0.006476485,0.00022046265,0.0003356314],"about_ca_topic_score_codex":0.000045740722,"about_ca_topic_score_gemma":0.000046626643,"teacher_disagreement_score":0.9606326,"about_ca_system_score_codex":0.0002481045,"about_ca_system_score_gemma":0.00013021307,"threshold_uncertainty_score":0.86924326},"labels":[],"label_agreement":null}]}