{"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"},"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005857817,0.0001572223,0.0002484372,0.0001948578,0.0002752897,0.00004870715,0.0007831282,0.00007056534,0.00001826436],"category_scores_gemma":[0.0001764809,0.0001573662,0.0001039005,0.0004463698,0.00009376313,0.0004621812,0.0002933594,0.0001446108,0.00001380856],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006889078,"about_ca_system_score_gemma":0.0001049613,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002182634,"about_ca_topic_score_gemma":0.000002422498,"domain_scores_codex":[0.9981598,0.00002964166,0.0006623243,0.0004127148,0.0004179181,0.000317645],"domain_scores_gemma":[0.9974328,0.00145873,0.0003169815,0.0002442752,0.0004513249,0.00009586081],"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.00004636739,0.0002606798,0.0024582,0.00004982309,0.00003159111,0.000004792742,0.001522192,0.7044297,0.0001648723,0.05598568,0.001629918,0.2334162],"study_design_scores_gemma":[0.00008695997,0.0001438308,0.003233389,0.00007145864,0.000005128103,0.00002058327,0.0003410083,0.9785797,0.006031372,0.0105494,0.0007570047,0.0001801918],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.008285223,0.0003766968,0.9899333,0.00006419216,0.0007913525,0.0002249443,0.0000256515,0.00009608454,0.0002025926],"genre_scores_gemma":[0.4964353,0.00000129833,0.5033786,0.00002140549,0.00007664957,0.000006974063,0.00003774072,0.000005811813,0.00003622923],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.4881501,"threshold_uncertainty_score":0.6417205,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002221542,0.000199398,0.0001756221,0.000193586,0.0001469955,0.0004928233,0.001390935,0.00006832909,0.000004911677],"category_scores_gemma":[0.0001312113,0.0001746663,0.00006075074,0.0004074946,0.00004906302,0.0003793347,0.000172693,0.0002073521,0.0000337702],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008822134,"about_ca_system_score_gemma":0.00005142755,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001216541,"about_ca_topic_score_gemma":0.00001331121,"domain_scores_codex":[0.9984486,0.00005695668,0.0003319596,0.0005124497,0.0003354645,0.0003146091],"domain_scores_gemma":[0.998742,0.0004278522,0.0001116268,0.0003576811,0.0002656098,0.0000952171],"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.00002146367,0.00006049754,0.00003135792,0.00005248826,0.00001044359,0.00001354621,0.001350343,0.1631854,0.001139524,0.7171731,0.0004349163,0.116527],"study_design_scores_gemma":[0.00003454912,0.0001506999,0.0001543801,0.0001218715,0.000003726015,0.00006899454,0.0001001324,0.5909629,0.02168376,0.386256,0.0001453164,0.0003176142],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01882472,0.00300366,0.9758797,0.0005367231,0.0006321956,0.0004436093,0.00001276138,0.0006393412,0.00002727298],"genre_scores_gemma":[0.5142078,2.293722e-7,0.4852959,0.0002503327,0.0001267842,0.00004269331,0.00001827999,0.000008519217,0.00004948853],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.4953831,"threshold_uncertainty_score":0.7122683,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002416423,0.0001394831,0.0001088562,0.0001585138,0.0002640945,0.0001231067,0.0007073323,0.00003755094,0.000009522638],"category_scores_gemma":[0.0001379939,0.0001464683,0.00003726394,0.001162069,0.00005874566,0.0002324048,0.0001720178,0.00009167643,0.0001307245],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00009694132,"about_ca_system_score_gemma":0.0002495577,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001642015,"about_ca_topic_score_gemma":0.000004855761,"domain_scores_codex":[0.9985542,0.00001546133,0.0003355384,0.000431333,0.0003320654,0.0003314021],"domain_scores_gemma":[0.9986148,0.0004913331,0.00008513444,0.0002473401,0.0003905398,0.0001708485],"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.00000269475,0.00007899966,0.000031477,0.00001407464,0.00000737298,0.00000545827,0.0002904836,0.86461,0.00005850394,0.03629244,0.00001901703,0.09858952],"study_design_scores_gemma":[0.00002821898,0.00005149375,0.001828255,0.00005028712,0.000005694605,0.0000872467,0.00006653079,0.9524823,0.0006963152,0.04397098,0.0004868583,0.0002457608],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.005396289,0.0002687619,0.993334,0.0002640503,0.0001075559,0.0003676737,0.000001890909,0.0001547157,0.000105053],"genre_scores_gemma":[0.4771781,0.000001089479,0.5226056,0.0001136581,0.0000525202,0.00002379899,0.000001188347,0.000006082056,0.0000179663],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.4717818,"threshold_uncertainty_score":0.5972802,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001949052,0.0001162247,0.0001378941,0.0003846046,0.00008518037,0.0001652744,0.001096639,0.00005800874,0.00004567443],"category_scores_gemma":[0.0007598399,0.00009243,0.00004172352,0.00202347,0.0001291953,0.0004864533,0.0001798526,0.0002483315,0.00002518904],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004693618,"about_ca_system_score_gemma":0.0002108087,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002948582,"about_ca_topic_score_gemma":0.000006987616,"domain_scores_codex":[0.9976975,0.0001846424,0.0005500537,0.0003262798,0.0009622897,0.0002792299],"domain_scores_gemma":[0.9972576,0.001448905,0.0000800086,0.0003492552,0.0007947412,0.00006942603],"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.000009619754,0.0001107954,0.0003635177,0.00001723883,0.000004863943,0.00001173599,0.0007396237,0.9263908,0.000007402893,0.06216871,0.00007596659,0.01009969],"study_design_scores_gemma":[0.00005521204,0.00005950176,0.00250671,0.00002203018,0.000001452547,0.00002297315,0.00008005562,0.9931454,0.0008008765,0.003142284,0.00007208972,0.00009140359],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.001569236,0.00007022234,0.9969085,0.0006596221,0.00009144006,0.0003473874,0.000003280394,0.00003326639,0.0003169871],"genre_scores_gemma":[0.4040934,0.00003445451,0.5955049,0.0002434181,0.00003114873,0.000007155993,0.00001724569,0.00000667842,0.0000615445],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.4025242,"threshold_uncertainty_score":0.3769186,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004393306,0.00012482,0.0001062807,0.0001153803,0.0002731914,0.0001404377,0.0001666617,0.0001092597,0.000005149872],"category_scores_gemma":[0.00003670184,0.0001225156,0.00003344287,0.0002280287,0.00005449172,0.001015585,0.00006589856,0.0001291315,0.000001325749],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002765703,"about_ca_system_score_gemma":0.00002438996,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000007744243,"about_ca_topic_score_gemma":0.000003982163,"domain_scores_codex":[0.9990492,0.00008146716,0.0002004296,0.0003343073,0.000138817,0.0001957052],"domain_scores_gemma":[0.9993419,0.0001498972,0.0001000374,0.0001441487,0.000137451,0.0001265469],"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.000108077,0.0002511273,0.000280045,0.00008594838,0.00001544497,2.094095e-7,0.000747879,0.04227941,0.006349287,0.02693598,0.00002679333,0.9229198],"study_design_scores_gemma":[0.0001193095,0.0003395064,0.002513175,0.00001031823,0.000006873556,0.00001730784,0.00002872547,0.970068,0.00632763,0.02021811,0.0002035932,0.0001474154],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04172446,0.0004030916,0.9570694,0.00005798068,0.0002459113,0.0003675321,0.000001967761,0.00009317048,0.00003647825],"genre_scores_gemma":[0.7486515,0.00001005931,0.2510067,0.0001343183,0.0001315832,0.0000370102,0.00001508269,0.000005869032,0.000007872917],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9277886,"threshold_uncertainty_score":0.4996042,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007300494,0.0001623094,0.0001297309,0.0002607421,0.0001746882,0.0002178619,0.0008655245,0.00006580619,0.00002235318],"category_scores_gemma":[0.0002054409,0.0001602546,0.00004778654,0.0008047275,0.00004066555,0.0004347894,0.0002545888,0.0001758162,0.0001201625],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001146248,"about_ca_system_score_gemma":0.00008584237,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000212107,"about_ca_topic_score_gemma":0.0000127433,"domain_scores_codex":[0.9984301,0.00003970004,0.0003285265,0.0004741887,0.0004314432,0.0002960958],"domain_scores_gemma":[0.998924,0.0002372105,0.00009142002,0.0002959814,0.0003181528,0.0001332572],"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.00002023479,0.000099066,0.0001314226,0.00002822377,0.0000190901,0.00006664228,0.003192155,0.0648808,0.0160253,0.4068553,0.0014241,0.5072577],"study_design_scores_gemma":[0.00007093025,0.0002842167,0.0004758093,0.00008770373,0.000005186661,0.0001114407,0.0000604688,0.6435819,0.223682,0.1300288,0.001017547,0.0005938501],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.007603152,0.0006093052,0.9897102,0.0006706159,0.0002881487,0.0002253627,9.677028e-7,0.0005336306,0.000358583],"genre_scores_gemma":[0.5179051,0.000001567792,0.481244,0.0006561927,0.00009377384,0.000007393063,0.000004902371,0.000006859005,0.00008020435],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.5787011,"threshold_uncertainty_score":0.6534994,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["metaresearch","open_science"],"consensus_categories":["open_science"],"category_scores_codex":[0.00132625,0.0001557177,0.000156811,0.0001514793,0.0001725163,0.000143428,0.03125745,0.00007411221,0.00001531928],"category_scores_gemma":[0.02767868,0.0001213691,0.00005251816,0.0005416989,0.0001683471,0.001010063,0.02295644,0.000180243,0.000008854794],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004626221,"about_ca_system_score_gemma":0.0000971674,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001680605,"about_ca_topic_score_gemma":0.000008633438,"domain_scores_codex":[0.9981132,0.00003651614,0.0004950358,0.0005534195,0.0004690265,0.0003328065],"domain_scores_gemma":[0.9846897,0.008586766,0.0001931923,0.006233726,0.000248924,0.0000477024],"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.00006877117,0.0001752637,0.0001031091,0.00008346982,0.00008080457,0.000008760794,0.0006262251,0.02259948,0.00008863293,0.2786005,0.1864635,0.5111015],"study_design_scores_gemma":[0.00003798928,0.00005523268,0.0001983604,0.00005496883,0.000003093061,0.000004732249,0.00002666889,0.6449152,0.004307476,0.3473729,0.002926107,0.00009717341],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.005125476,0.00005101873,0.9808574,0.01289104,0.0002030381,0.0004413069,0.0001041051,0.0001781039,0.0001485483],"genre_scores_gemma":[0.292348,0.000009328795,0.7071635,0.0003544211,0.00002311136,0.00001110031,0.00006290198,0.000009586303,0.0000180354],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.6223158,"threshold_uncertainty_score":0.9849457,"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)","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001073191,0.0001444045,0.0002398139,0.000151781,0.00008400348,0.0001027607,0.0006505192,0.00005781458,0.00000576156],"category_scores_gemma":[0.0001457715,0.0001365916,0.00002001401,0.0004202143,0.000216423,0.0005028188,0.0003224749,0.0001413091,0.000002367405],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006621263,"about_ca_system_score_gemma":0.0002173771,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001742642,"about_ca_topic_score_gemma":0.00001971,"domain_scores_codex":[0.9981585,0.0001352319,0.0005929215,0.0004558342,0.0003518337,0.0003056675],"domain_scores_gemma":[0.9978812,0.001261426,0.0001947058,0.0003533019,0.0002115726,0.00009778651],"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.000001362255,0.00006026354,0.001971797,0.000167193,0.00001081714,0.00001584527,0.000783884,0.9011846,0.0003021156,0.04074413,0.00001357832,0.0547444],"study_design_scores_gemma":[0.00009400435,0.00003108321,0.002128422,0.0006175569,0.000003749692,0.00007052576,0.0005970999,0.9821421,0.0001877966,0.01395536,0.00002185589,0.0001504455],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02496479,0.001811658,0.9726859,0.00003252344,0.0001216945,0.0002692954,0.0000158424,0.00003702125,0.00006121629],"genre_scores_gemma":[0.9116572,0.00002080131,0.08822457,0.00005315621,0.00001965109,0.000001622485,0.00001441987,0.000005914589,0.000002691564],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8866924,"threshold_uncertainty_score":0.5570045,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000390379,0.0001224165,0.00009849578,0.0001344736,0.0001732009,0.0001663522,0.0003197869,0.00003403965,0.00002148362],"category_scores_gemma":[0.0001196811,0.0001166026,0.00002590361,0.0003422496,0.00009406503,0.0005402883,0.0001186302,0.000153691,0.0001607359],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003980951,"about_ca_system_score_gemma":0.00003008578,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000008864593,"about_ca_topic_score_gemma":0.000001987835,"domain_scores_codex":[0.9988338,0.00005036854,0.0002649471,0.0004005732,0.0002523782,0.0001979809],"domain_scores_gemma":[0.9988537,0.000535272,0.00009275834,0.0002311759,0.0001723932,0.0001146933],"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.00003918245,0.0001252569,0.001334558,0.00002084374,0.00001171557,0.00002554271,0.0004524518,0.01697802,0.001306696,0.1787951,0.0009598531,0.7999507],"study_design_scores_gemma":[0.0001235741,0.0001115028,0.05295445,0.00007958863,0.000003666806,0.0000441548,0.0000853918,0.79809,0.02480417,0.1195567,0.003793671,0.0003531139],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.003629197,0.000219577,0.9940236,0.001103963,0.0002660708,0.0001054875,0.000002512771,0.0001381792,0.0005114257],"genre_scores_gemma":[0.7358627,0.00001727236,0.263111,0.0007770785,0.00003303072,0.000002212431,0.000006917888,0.000006576209,0.0001832646],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7995976,"threshold_uncertainty_score":0.4754914,"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)","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008855195,0.0001341238,0.0001394734,0.0002582397,0.0001181721,0.00004607566,0.0002648901,0.00003780162,0.000005325568],"category_scores_gemma":[0.0002183123,0.0001352471,0.00007142611,0.0004607524,0.00004835975,0.000444907,0.00003414696,0.00007452943,0.00001569678],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001265764,"about_ca_system_score_gemma":0.00006654816,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000005651103,"about_ca_topic_score_gemma":0.000001255447,"domain_scores_codex":[0.9986827,0.00008447564,0.0003412951,0.0003484599,0.0003656636,0.0001773695],"domain_scores_gemma":[0.9971036,0.002125638,0.0001857433,0.0001824615,0.0003448488,0.00005766009],"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.00006021101,0.00006485092,0.0002011316,0.00006136081,0.000004145541,7.005134e-7,0.00008367818,0.6854531,0.0007004357,0.008041927,0.000006606336,0.3053219],"study_design_scores_gemma":[0.0002031937,0.0001973862,0.01321509,0.0001348962,0.000004106898,0.000002245214,0.0000187879,0.9167253,0.05317535,0.01618596,0.00001558605,0.0001221195],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.002632679,0.000024523,0.9961726,0.00003717721,0.0004211393,0.0004478144,0.000003522393,0.00008638756,0.0001741568],"genre_scores_gemma":[0.5486428,6.50882e-7,0.4512011,0.00009135855,0.00001129587,0.0000132973,0.00003035759,0.000005769673,0.000003357001],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.5460101,"threshold_uncertainty_score":0.5515216,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001070705,0.0001769544,0.0001645148,0.0002145698,0.0001384891,0.0001729751,0.000756344,0.0001094208,0.00003026239],"category_scores_gemma":[0.0003461277,0.0001840552,0.00005373723,0.000661044,0.00009963451,0.0003327771,0.0001486622,0.0004396319,0.00008540141],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008462479,"about_ca_system_score_gemma":0.00007971516,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002006073,"about_ca_topic_score_gemma":0.00001885051,"domain_scores_codex":[0.9980025,0.00007481493,0.0005268855,0.0005270171,0.0003975999,0.0004712318],"domain_scores_gemma":[0.9977874,0.0014756,0.00006774337,0.0002962129,0.0002088087,0.0001642298],"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.000007335884,0.00005933105,0.0002151841,0.000004070911,0.000002020629,0.00003523972,0.0001296819,0.3829326,0.000003767283,0.536542,0.0000733908,0.07999533],"study_design_scores_gemma":[0.00003792191,0.00007239523,0.002142806,0.0000937824,9.876147e-7,0.00001970197,0.00003334891,0.8317774,0.0001530378,0.1654531,0.00003568701,0.0001798315],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0007770294,0.0001020543,0.9909168,0.0008315843,0.0003997722,0.00008395558,7.434367e-7,0.0001240494,0.006764039],"genre_scores_gemma":[0.8107264,0.000005978467,0.1878881,0.001245458,0.00009553996,0.000004241957,0.000005151428,0.000008418629,0.00002073905],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8099494,"threshold_uncertainty_score":0.7505554,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001793673,0.0001176582,0.0001030556,0.00003331245,0.0003301671,0.0002149745,0.000746143,0.00002437573,0.000006091031],"category_scores_gemma":[0.00002146657,0.00007807962,0.00004275621,0.0003500213,0.00002872943,0.0002608134,0.00006407856,0.0001040437,0.0000274926],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002018063,"about_ca_system_score_gemma":0.0001528035,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000004759487,"about_ca_topic_score_gemma":0.000001310967,"domain_scores_codex":[0.9990846,0.0000126902,0.0002263696,0.0002945497,0.0001951112,0.0001867101],"domain_scores_gemma":[0.9990553,0.0004084623,0.00008568383,0.0002397464,0.0001339889,0.00007685699],"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.000003183041,0.00001352758,7.733695e-7,0.00000141857,0.000005321917,4.787056e-7,0.0002597455,0.8133575,0.00004270793,0.1191987,0.0005071792,0.06660949],"study_design_scores_gemma":[0.00005281754,0.00004627019,0.00001457146,0.00001829145,0.000004973287,0.00001397753,0.00001383373,0.945101,0.0003439578,0.05416756,0.0001110419,0.0001116734],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.000328463,0.00007311197,0.9943352,0.004555258,0.00003071432,0.0003897517,0.000002618814,0.00008736208,0.0001974749],"genre_scores_gemma":[0.2589241,0.000002909162,0.7391872,0.00142026,0.0001066965,0.00002698306,0.000006123219,0.000006159323,0.0003195989],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.2585956,"threshold_uncertainty_score":0.3183994,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}