{"meta":{"page":1,"per_page":50,"max_per_page":100,"total":12,"total_is_capped":false,"direct_labels_cover":0,"predictions_cover":12,"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","author_layer_release":"2026-06-26"},"query_hash":"e2aa519c62f5","filters":{"venue":"Computational intelligence"}},"results":[{"id":"W1794091211","doi":"","title":"A comparison of evolutionary algorithms for finding optimal error-correcting codes","year":2007,"lang":"en","type":"article","venue":"Computational intelligence","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Brock University; Simon Fraser University","funders":"","keywords":"Upper and lower bounds; Algorithm; Simulated annealing; Evolutionary algorithm; Mathematics; Hill climbing; Combinatorics; Coding (social sciences); Mathematical optimization; Computer science; Discrete mathematics; Statistics","authors":[{"name":"Wolfgang Haas","is_ca":true},{"name":"Sheridan Houghten","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.1125179554015422,"gpt":0.413086665582463,"spread":0.3005687101809208,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003337318,0.0008478481,0.001260982,0.002950863,0.0006908752,0.0008820091,0.001500023,0.002295542,0.0009460115],"category_scores_gemma":[0.01514255,0.0004027099,0.0008049012,0.002396792,0.0009299886,0.001325871,0.000743169,0.0007911153,0.0001887748],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001531949,"about_ca_system_score_gemma":0.001498418,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004476035,"about_ca_topic_score_gemma":0.003981175,"domain_scores_codex":[0.9979037,0.0008135689,0.000133889,0.0001998046,0.0008058524,0.0001431371],"domain_scores_gemma":[0.9921831,0.005934021,0.0002830137,0.0005050922,0.0009783072,0.0001163851],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0003428581,0.0001572342,0.002484004,0.0001953519,0.0001545226,0.00004668353,0.0001466378,0.804288,0.001508867,0.01547188,0.0008218582,0.1743821],"study_design_scores_gemma":[0.00007915212,0.0001690617,0.0009247582,0.0000408106,0.00003665163,0.00007897921,0.00006687369,0.9907698,0.00152098,0.005168329,0.001124927,0.00001971564],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4338751,0.01300798,0.5306323,0.001384914,0.0002926769,0.0002928175,0.0002230783,0.001239433,0.01905163],"genre_scores_gemma":[0.5765702,0.003534604,0.4168301,0.0002576706,0.00007412208,0.0002906621,0.000332916,0.0001538735,0.001955802],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004476035,"threshold_uncertainty_score":0.01764965,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W56834323","doi":"","title":"An architectural framework for natural language interfaces to agent systems.","year":2006,"lang":"en","type":"article","venue":"Computational intelligence","topic":"Natural Language Processing Techniques","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":true},"ca_institutions":"University of Manitoba","funders":"","keywords":"Computer science; Natural language; Natural language user interface; Human–computer interaction; Artificial intelligence; Ambiguity; Universal Networking Language; Natural language processing; Programming language","authors":[{"name":"Christel Kemke","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01855455023083028,"gpt":0.3387013832656849,"spread":0.3201468330348546,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009626962,0.001306678,0.0009039079,0.002963359,0.002388077,0.008011589,0.004131731,0.003549855,0.006308951],"category_scores_gemma":[0.008195677,0.001685192,0.003408354,0.002186262,0.006984978,0.009656043,0.00462867,0.005081637,0.002009669],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.004219934,"about_ca_system_score_gemma":0.005193059,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.01032322,"about_ca_topic_score_gemma":0.01067689,"domain_scores_codex":[0.9949195,0.002141301,0.0008081947,0.0006360607,0.001142866,0.0003521709],"domain_scores_gemma":[0.9964057,0.001467152,0.0002558831,0.000698925,0.0008095576,0.000362729],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000020535,0.00003790829,0.0001769378,0.0001944886,0.00003369772,0.0001929094,0.001145035,0.007353142,0.00122498,0.9615982,0.003040877,0.02498125],"study_design_scores_gemma":[0.00006194391,0.00006858658,0.0001965197,0.0003303418,0.00007827592,0.0004346461,0.0006331126,0.09154259,0.00215299,0.7297372,0.1747012,0.00006279925],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.001275296,0.0007920832,0.9878345,0.00194213,0.00009131357,0.0002329995,0.00008458165,0.001154066,0.006593118],"genre_scores_gemma":[0.03767256,0.0009798664,0.9543529,0.0003626851,0.00008783394,0.00070015,0.0004030549,0.000252117,0.005188807],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.01032322,"threshold_uncertainty_score":0.05091292,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2155832050","doi":"","title":"Using genetic programming to synthesize monotonic stochastic processes","year":2007,"lang":"en","type":"article","venue":"Computational intelligence","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Brock University","funders":"","keywords":"Genetic programming; Computer science; Monotonic function; Set (abstract data type); Programming language; Series (stratigraphy); Interpreter; Stochastic process; Theoretical computer science; Process calculus; Stochastic calculus; Genetic algorithm; Mathematical optimization; Artificial intelligence; Mathematics; Machine learning","authors":[{"name":"Brian J. Ross","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.05219381325565875,"gpt":0.3324311843105771,"spread":0.2802373710549184,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009487281,0.000556512,0.0003774473,0.0004913152,0.0003606575,0.0005456746,0.0006508711,0.0005916618,0.0008316549],"category_scores_gemma":[0.004666635,0.0003427496,0.0005498294,0.0004016579,0.001076345,0.0004500118,0.0005905902,0.0006922866,0.0001512529],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006290813,"about_ca_system_score_gemma":0.0008103286,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001434991,"about_ca_topic_score_gemma":0.001531126,"domain_scores_codex":[0.9995219,0.0001325105,0.00002885268,0.0001070148,0.0001660014,0.00004380735],"domain_scores_gemma":[0.9985261,0.001096,0.0001262546,0.0001133636,0.0001017836,0.00003641221],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00006400422,0.00008096286,0.001027419,0.00009755616,0.00004221514,0.0002577762,0.0002177978,0.8601613,0.02241426,0.05920081,0.0002471602,0.05618872],"study_design_scores_gemma":[0.00003084617,0.00005282785,0.0001189012,0.00001205963,0.0000181633,0.00004498268,0.00001517314,0.9609091,0.009279427,0.02798752,0.001519836,0.00001115237],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.08543838,0.0001339228,0.9104877,0.0001109159,0.00003222353,0.00008207703,0.00002301125,0.0005852078,0.003106572],"genre_scores_gemma":[0.5781585,0.0002103304,0.4193904,0.00005892445,0.00001282969,0.0002190458,0.00008150371,0.0001496349,0.001718814],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.001434991,"threshold_uncertainty_score":0.0050174,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2283584817","doi":"","title":"Use of line search in the Luus-Jaakola optimization procedure","year":2007,"lang":"en","type":"article","venue":"Computational intelligence","topic":"Metaheuristic Optimization Algorithms Research","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":"University of Toronto","funders":"","keywords":"Line search; Convergence (economics); Line (geometry); Point (geometry); Mathematical optimization; Set (abstract data type); Mathematics; Local search (optimization); Simple (philosophy); Rate of convergence; Algorithm; Variable (mathematics); Computer science; Telecommunications","authors":[{"name":"Rein Luus","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.1185418977793435,"gpt":0.3683868306764853,"spread":0.2498449328971418,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002341168,0.001129099,0.00134927,0.001063848,0.0009903635,0.001124304,0.001401471,0.001467808,0.005083302],"category_scores_gemma":[0.006299614,0.0005807481,0.000617484,0.001161978,0.0009349497,0.0009659915,0.001085256,0.001745583,0.002200444],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000591608,"about_ca_system_score_gemma":0.001334504,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002390529,"about_ca_topic_score_gemma":0.002701535,"domain_scores_codex":[0.9986155,0.0007931648,0.0000861813,0.0001194889,0.0002948414,0.00009073871],"domain_scores_gemma":[0.9976904,0.001310229,0.0002088336,0.0002067124,0.0005255894,0.00005827929],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0005487837,0.0004992345,0.002113996,0.0006923901,0.0001716518,0.0003172393,0.0005233455,0.5773844,0.0215801,0.04389263,0.004551592,0.3477247],"study_design_scores_gemma":[0.00007435304,0.0002154125,0.0003299418,0.00005495216,0.00003336216,0.00009409482,0.00003793108,0.9747778,0.01339064,0.003537318,0.007408391,0.0000458568],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0159455,0.0002152493,0.9763476,0.0000889261,0.00005040618,0.0002125745,0.00004818855,0.001358773,0.005732793],"genre_scores_gemma":[0.1238269,0.0001323073,0.8719978,0.00009111306,0.00002371462,0.0007103417,0.000112439,0.0003690892,0.002736386],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.005083302,"threshold_uncertainty_score":0.01700532,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1606225312","doi":"","title":"An Improved Approach for Signature and Anomaly based Intrusion Detection and Prevention","year":2012,"lang":"en","type":"article","venue":"Computational intelligence","topic":"Network Security and Intrusion Detection","field":"Computer Science","cited_by":3,"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":"Intrusion detection system; Anomaly-based intrusion detection system; Anomaly detection; Signature (topology); Computer science; Misuse detection; Anomaly (physics); Data mining; Intrusion; Artificial intelligence; Pattern recognition (psychology); Geology; Mathematics","authors":[{"name":"A Shivarkar Sandip","is_ca":true},{"name":"Akshat Ajit","is_ca":false},{"name":"J Dange Bapusaheb","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02219245460922694,"gpt":0.2746945201739298,"spread":0.2525020655647029,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00185309,0.001179927,0.001628112,0.002645914,0.0006813821,0.001212779,0.002498034,0.001555817,0.002313356],"category_scores_gemma":[0.003306898,0.0004682923,0.001548175,0.002217643,0.0007885758,0.002719085,0.001593477,0.002198112,0.001509527],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000884963,"about_ca_system_score_gemma":0.001644535,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003368477,"about_ca_topic_score_gemma":0.002965955,"domain_scores_codex":[0.9962447,0.0005657889,0.0002099974,0.0006250654,0.002150131,0.0002042534],"domain_scores_gemma":[0.9979886,0.0003394832,0.0001224123,0.0004948745,0.0009765253,0.00007814191],"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.0002433663,0.0003274821,0.002489368,0.0002081209,0.0002639306,0.0002949216,0.000129706,0.06755063,0.0336108,0.0410295,0.008973305,0.8448789],"study_design_scores_gemma":[0.00003697946,0.0001736136,0.0008654132,0.00001726185,0.00009842248,0.0006083709,0.00002076375,0.9476616,0.01491976,0.0190906,0.0164452,0.00006204884],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.002928987,0.0002694685,0.9941919,0.000171797,0.0001338182,0.00008776992,0.00006669941,0.001386801,0.0007627099],"genre_scores_gemma":[0.1113596,0.0004418905,0.8807132,0.0004056576,0.0002161824,0.0001836815,0.0003863384,0.0001684694,0.006124976],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003368477,"threshold_uncertainty_score":0.009800196,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2260214588","doi":"","title":"Reordering: a stepping-stone to perfect Thai Sign generation","year":2007,"lang":"en","type":"article","venue":"Computational intelligence","topic":"Natural Language Processing 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":"York University","funders":"","keywords":"Computer science; Sign language; Sentence; Grammar; Sign (mathematics); Natural language processing; Phrase; Matching (statistics); Vocabulary; Artificial intelligence; Code (set theory); Programming language; Speech recognition; Linguistics; Mathematics","authors":[{"name":"Srisavakon Dangsaart","is_ca":false},{"name":"Kanlaya Naruedomkul","is_ca":false},{"name":"Nick Cercone","is_ca":true},{"name":"Booncharoen Sirinaovakul","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.04082978311332475,"gpt":0.3333414736328021,"spread":0.2925116905194774,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001195984,0.0008301155,0.0006708564,0.0009186377,0.0006587605,0.001376878,0.001161082,0.0006690099,0.005485933],"category_scores_gemma":[0.003120665,0.0004401063,0.0006935037,0.0006603682,0.001057555,0.001747014,0.00145597,0.001173903,0.002487158],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003454046,"about_ca_system_score_gemma":0.001180662,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002051319,"about_ca_topic_score_gemma":0.002874999,"domain_scores_codex":[0.9987714,0.0003088478,0.0001205688,0.0002192533,0.0004749405,0.0001049511],"domain_scores_gemma":[0.9981395,0.000336462,0.000116406,0.0005971459,0.0007175467,0.00009301215],"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.0002589413,0.00009084313,0.001461033,0.0003422588,0.00004315606,0.000765831,0.001440572,0.01465227,0.08934616,0.04126844,0.007500476,0.8428301],"study_design_scores_gemma":[0.0001397913,0.0008905015,0.002095597,0.0002075591,0.0001362396,0.002803183,0.0009339614,0.462339,0.2841959,0.04182678,0.2041515,0.0002801227],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01030231,0.000135857,0.9804684,0.0001445824,0.0001371401,0.0002190381,0.00008083438,0.00410735,0.004404409],"genre_scores_gemma":[0.1118066,0.0002118379,0.8782057,0.0001706998,0.00005146074,0.0001215346,0.0005192867,0.001001851,0.007911014],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.005485933,"threshold_uncertainty_score":0.01835221,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W184063531","doi":"","title":"On the use of wavelet transform for privacy preserving data mining","year":2007,"lang":"en","type":"article","venue":"Computational intelligence","topic":"Privacy-Preserving Technologies in Data","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Concordia University","funders":"","keywords":"Data mining; Computer science; Association rule learning; Data stream mining; Discrete wavelet transform; Information privacy; Information sensitivity; Wavelet; Wavelet transform; Artificial intelligence; Computer security","authors":[{"name":"Shahroze Kabir","is_ca":true},{"name":"A. M. Youssef","is_ca":true},{"name":"A.K. Elhakeem","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.2684074708981514,"gpt":0.3660595348005904,"spread":0.09765206390243902,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004422945,0.000453421,0.000770828,0.001052789,0.0005741874,0.001469535,0.0007895307,0.0009744359,0.0004178287],"category_scores_gemma":[0.01484194,0.0002981338,0.0007616742,0.002447415,0.002025013,0.002953941,0.001477139,0.001487175,0.0002719896],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004332477,"about_ca_system_score_gemma":0.0007364549,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0005330345,"about_ca_topic_score_gemma":0.0002580967,"domain_scores_codex":[0.9964295,0.001382084,0.0002294949,0.0003547077,0.00146073,0.0001435273],"domain_scores_gemma":[0.991471,0.00553989,0.0005292347,0.001628785,0.0007222496,0.0001088013],"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.0007848206,0.0001951369,0.003312927,0.0003370027,0.0001742511,0.001132644,0.0007356206,0.1650621,0.0516796,0.2591465,0.003177132,0.5142623],"study_design_scores_gemma":[0.00004940648,0.0002264366,0.000844144,0.00005117832,0.00004952536,0.001227784,0.0001068165,0.8676949,0.02476974,0.09742959,0.007501263,0.00004925227],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01352692,0.0008201405,0.9838886,0.000536229,0.0000487569,0.00002996932,0.00002542212,0.00007542691,0.001048465],"genre_scores_gemma":[0.3993793,0.004502819,0.5935274,0.0003806192,0.0002992752,0.0001083301,0.0001709395,0.00004933869,0.001581906],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.004422945,"threshold_uncertainty_score":0.02339107,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2251263179","doi":"","title":"Fault tolerant systems design in VLSI using data compression under constraints of failure probabilities: overview and status","year":2007,"lang":"en","type":"article","venue":"Computational intelligence","topic":"VLSI and Analog Circuit Testing","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Ottawa","funders":"","keywords":"Very-large-scale integration; Computer science; Combinational logic; Aliasing; System on a chip; Computer engineering; Integration testing; Fault coverage; Automatic test pattern generation; Built-in self-test; Parallel computing; Algorithm; Embedded system; Electronic circuit; Engineering; Logic gate; Software; Filter (signal processing)","authors":[{"name":"Sunil R. Das","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.21652874081121,"gpt":0.3622196979004566,"spread":0.1456909570892466,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007218063,0.000431389,0.0004718661,0.0007623211,0.0001738446,0.001190612,0.0007209521,0.0006547437,0.001108062],"category_scores_gemma":[0.0008984951,0.0002921676,0.0003059997,0.001006078,0.0006729449,0.001898117,0.0004217974,0.0005343321,0.0002472491],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005500155,"about_ca_system_score_gemma":0.0005003409,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00032428,"about_ca_topic_score_gemma":0.0002535477,"domain_scores_codex":[0.99971,0.00006806813,0.00002332939,0.0000383601,0.0001384343,0.00002166036],"domain_scores_gemma":[0.9994573,0.000335305,0.00005029796,0.00004663687,0.00009609944,0.00001428377],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"not_applicable","study_design_scores_codex":[0.0001181509,0.00009856763,0.001321317,0.001394675,0.00007149459,0.000131978,0.0002189922,0.1095062,0.02664444,0.216701,0.001069985,0.6427231],"study_design_scores_gemma":[0.00008032737,0.001062207,0.00176313,0.0003647216,0.0001081125,0.0006706219,0.000199961,0.7410134,0.0457365,0.1370725,0.0718584,0.00007004962],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"review","genre_scores_codex":[0.04192493,0.04805071,0.8896507,0.000922175,0.00007289848,0.0001127762,0.00003782219,0.0005435009,0.01868454],"genre_scores_gemma":[0.6447428,0.0588312,0.2903141,0.0003431841,0.0005069722,0.0002351355,0.0001627126,0.00009414012,0.004769706],"genre_candidate":"review","genre_consensus":null,"teacher_disagreement_score":0.001190612,"threshold_uncertainty_score":0.00399065,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2404558852","doi":"","title":"Rectification on uncalibrated epipolar stereo images and dense disparity map","year":2007,"lang":"en","type":"article","venue":"Computational intelligence","topic":"Advanced Vision and Imaging","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Saskatchewan","funders":"","keywords":"Epipolar geometry; Fundamental matrix (linear differential equation); Artificial intelligence; Computer vision; RANSAC; Parallax; Image rectification; Computer science; Pixel; Computer stereo vision; Stereo image; Stereopsis; Point (geometry); Rectification; Mathematics; Image (mathematics); Geometry; Physics","authors":[{"name":"Kunio Takaya","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03029385935141984,"gpt":0.3224488364877976,"spread":0.2921549771363777,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000377691,0.0003996961,0.0003881155,0.0008069329,0.0002420488,0.0004340672,0.0005033416,0.0003687411,0.002558448],"category_scores_gemma":[0.001933355,0.0003494669,0.0004337748,0.0008802501,0.0003336298,0.001059884,0.0006291209,0.000430057,0.0006294912],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002278364,"about_ca_system_score_gemma":0.0003455337,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001133388,"about_ca_topic_score_gemma":0.00122036,"domain_scores_codex":[0.9995567,0.00006388302,0.00001627435,0.00006292099,0.0002752032,0.00002487002],"domain_scores_gemma":[0.9995745,0.0001145589,0.00005184764,0.0001220474,0.0001259341,0.00001111173],"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.0002170026,0.00005904508,0.0008592423,0.0003359704,0.00008199099,0.000316594,0.0003146132,0.07954009,0.1705195,0.05447132,0.003769182,0.6895156],"study_design_scores_gemma":[0.00005566721,0.0002178018,0.003724852,0.00004711151,0.00004219216,0.001327865,0.0001282905,0.8121841,0.1323191,0.03031503,0.01957753,0.00006047865],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.02522725,0.0001612783,0.9707013,0.00006036735,0.00002954759,0.00004443265,0.00008478694,0.0004352804,0.003255641],"genre_scores_gemma":[0.27323,0.0004903551,0.7210535,0.00005143552,0.00005298785,0.00006873637,0.0003644677,0.0001237502,0.004564718],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.002558448,"threshold_uncertainty_score":0.00855881,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2326337533","doi":"","title":"Effectiveness of video object segmentation based on MPEG like motion vectors for 3D depth estimation","year":2007,"lang":"en","type":"article","venue":"Computational intelligence","topic":"Advanced Vision and Imaging","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Saskatchewan","funders":"","keywords":"Computer vision; Artificial intelligence; Epipolar geometry; Computer science; Motion estimation; RANSAC; Fundamental matrix (linear differential equation); Segmentation; Image segmentation; Block-matching algorithm; Quarter-pixel motion; Segmentation-based object categorization; Motion vector; Scale-space segmentation; Video tracking; Mathematics; Video processing; Image (mathematics)","authors":[{"name":"Kunio Takaya","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02465174157415823,"gpt":0.3437593539744871,"spread":0.3191076124003289,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001843083,0.0006481027,0.0004768685,0.00142935,0.0002934383,0.0006630642,0.0004979622,0.0006450649,0.001320426],"category_scores_gemma":[0.012441,0.0002963552,0.0003598313,0.000600095,0.0004035446,0.001324311,0.0005550481,0.0003257562,0.0003329837],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003493228,"about_ca_system_score_gemma":0.000449278,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002798384,"about_ca_topic_score_gemma":0.002662209,"domain_scores_codex":[0.998377,0.0005019704,0.00006300263,0.0002018553,0.0007528044,0.0001034348],"domain_scores_gemma":[0.9934192,0.004890501,0.0004165163,0.0004776435,0.0006829196,0.0001131842],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.00254467,0.0001872005,0.004615985,0.0003527384,0.000165548,0.0002161949,0.0002539973,0.09078167,0.2076208,0.002834085,0.000897148,0.6895301],"study_design_scores_gemma":[0.0000703814,0.001699007,0.01682612,0.00007344699,0.0002037758,0.000907305,0.000185238,0.7480183,0.2269044,0.001505625,0.003524089,0.000082202],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.4939895,0.003962855,0.4899716,0.0002506907,0.0001299626,0.0001362477,0.0002050413,0.002273985,0.009080152],"genre_scores_gemma":[0.8106788,0.0009331112,0.1867592,0.00006237125,0.00004354945,0.00002651149,0.0002828722,0.0001881171,0.00102546],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.002798384,"threshold_uncertainty_score":0.009747267,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2254392641","doi":"","title":"Critical remarks on belief updating in Bayesian networks","year":2007,"lang":"en","type":"article","venue":"Computational intelligence","topic":"Bayesian Modeling and Causal Inference","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Windsor","funders":"","keywords":"Belief propagation; Bayesian network; Tree (set theory); Node (physics); Computer science; Algorithm; Theoretical computer science; Artificial intelligence; Mathematics; Combinatorics; Engineering","authors":[{"name":"Dan Wu","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02769775973741466,"gpt":0.3256740963406005,"spread":0.2979763366031858,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.02062102,0.001271337,0.001282437,0.002343385,0.002604907,0.004120658,0.003795287,0.006038526,0.01517245],"category_scores_gemma":[0.1031727,0.0006139284,0.0015839,0.002322163,0.0107644,0.01357795,0.003075016,0.01083422,0.002205955],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002908052,"about_ca_system_score_gemma":0.001610771,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003461581,"about_ca_topic_score_gemma":0.001731632,"domain_scores_codex":[0.9888991,0.006306254,0.0004674608,0.00143106,0.002500553,0.0003956424],"domain_scores_gemma":[0.9090524,0.07927283,0.002309214,0.003231794,0.005251226,0.0008824762],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00003368424,0.0000100029,0.0001715533,0.0001336052,0.00002013666,0.0001236898,0.0001811993,0.005009653,0.00004813995,0.9658033,0.01855034,0.009914706],"study_design_scores_gemma":[0.00001685255,0.00000646603,0.00008039867,0.00004890808,0.000006550078,0.00003460087,0.00003267595,0.005780653,0.00005372326,0.9838654,0.0100638,0.000009934174],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.006138486,0.01315065,0.6530697,0.2550368,0.007153367,0.0001637746,0.0005642661,0.0004652317,0.06425778],"genre_scores_gemma":[0.5114016,0.02046107,0.2990627,0.07852898,0.05225344,0.001257445,0.0006145861,0.0008361459,0.03558402],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.02062102,"threshold_uncertainty_score":0.1090556,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2482994569","doi":"","title":"A new approximating model for the time invariant nonlinear operators with fading memory","year":2009,"lang":"en","type":"article","venue":"Computational intelligence","topic":"Neural Networks and Applications","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Canadian Bank Note Company (Canada)","funders":"","keywords":"Mathematics; Nonlinear system; Invariant (physics); Operator theory; Operator (biology); Polynomial; Set (abstract data type); Algebra over a field; Representation (politics); Applied mathematics; Discrete mathematics; Pure mathematics; Computer science; Mathematical analysis","authors":[{"name":"Adrian Budura","is_ca":false},{"name":"Silviu Crisan","is_ca":true},{"name":"Georgeta Budura","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03532033562343716,"gpt":0.281732446227049,"spread":0.2464121106036118,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004713956,0.0004200888,0.0004166827,0.0004540925,0.0003650612,0.0008863017,0.001166167,0.0007917786,0.002341931],"category_scores_gemma":[0.001077977,0.0001665529,0.0005403648,0.0003711755,0.001041322,0.001723315,0.0009589813,0.001136201,0.0002609655],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005270793,"about_ca_system_score_gemma":0.000487686,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0009059639,"about_ca_topic_score_gemma":0.000594069,"domain_scores_codex":[0.9998186,0.0000439245,0.000009218803,0.00003380954,0.00006421144,0.00003028951],"domain_scores_gemma":[0.9997725,0.00007348022,0.00004278986,0.00003342322,0.00004165656,0.00003610015],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00001928029,0.00002536218,0.0001988724,0.00003790276,0.00001083886,0.0001188569,0.0001284074,0.03580857,0.005588467,0.9512412,0.0004735772,0.006348644],"study_design_scores_gemma":[0.00001073748,0.00004388294,0.0001258874,0.0000119287,0.000009668068,0.0001435929,0.00005181762,0.7766798,0.001238275,0.2189399,0.002729308,0.00001531628],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.04684394,0.0002487776,0.9431987,0.0004268174,0.0001001769,0.00003353758,0.00007054973,0.00009029749,0.008987258],"genre_scores_gemma":[0.8395788,0.000614798,0.1427713,0.000268257,0.0002277854,0.0001204581,0.0001251551,0.00006597336,0.01622739],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.002341931,"threshold_uncertainty_score":0.007834494,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}