{"meta":{"query_hash":"e2aa519c62f5","filters":{"venue":"Computational intelligence"},"cohort_total":12,"direct_labels_cover":0,"predictions_cover":12,"exported":12,"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/e2aa519c62f5","api":"https://metacan.xera.ac/api/v1/cohort?venue=Computational+intelligence"},"results":[{"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.022192454609226944,"score_gpt":0.2746945201739298,"score_spread":0.2525020655647029,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1606225312","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0029289874,0.00026946852,0.99419194,0.00017179699,0.00013381822,0.00008776992,0.00006669941,0.0013868015,0.00076270994],"genre_scores_gemma":[0.11135957,0.00044189053,0.88071316,0.00040565763,0.00021618244,0.00018368155,0.00038633845,0.00016846937,0.006124976],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9962447,0.00056578894,0.0002099974,0.0006250654,0.0021501312,0.0002042534],"domain_scores_gemma":[0.9979886,0.0003394832,0.00012241225,0.00049487455,0.0009765253,0.000078141915],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018530901,0.0011799274,0.0016281124,0.002645914,0.0006813821,0.001212779,0.0024980344,0.0015558166,0.0023133557],"category_scores_gemma":[0.0033068983,0.00046829233,0.001548175,0.002217643,0.0007885758,0.0027190852,0.0015934767,0.0021981124,0.001509527],"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.00024336626,0.00032748212,0.0024893682,0.0002081209,0.00026393056,0.00029492157,0.00012970598,0.06755063,0.0336108,0.041029498,0.008973305,0.84487885],"study_design_scores_gemma":[0.00003697946,0.00017361362,0.00086541317,0.000017261851,0.000098422475,0.00060837093,0.000020763746,0.94766164,0.01491976,0.019090598,0.0164452,0.000062048835],"about_ca_topic_score_codex":0.003368477,"about_ca_topic_score_gemma":0.0029659546,"teacher_disagreement_score":0.003368477,"about_ca_system_score_codex":0.000884963,"about_ca_system_score_gemma":0.0016445348,"threshold_uncertainty_score":0.009800196},"labels":[],"label_agreement":null},{"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.1125179554015422,"score_gpt":0.413086665582463,"score_spread":0.3005687101809208,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1794091211","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.43387508,0.01300798,0.5306323,0.0013849136,0.00029267694,0.0002928175,0.00022307833,0.0012394334,0.019051628],"genre_scores_gemma":[0.5765702,0.0035346039,0.41683012,0.00025767065,0.00007412208,0.0002906621,0.00033291598,0.00015387347,0.0019558023],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979037,0.0008135689,0.000133889,0.00019980456,0.00080585235,0.00014313706],"domain_scores_gemma":[0.99218315,0.005934021,0.0002830137,0.0005050922,0.0009783072,0.000116385105],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0033373178,0.00084784813,0.0012609817,0.002950863,0.0006908752,0.0008820091,0.0015000234,0.0022955418,0.0009460115],"category_scores_gemma":[0.01514255,0.0004027099,0.0008049012,0.0023967924,0.00092998863,0.0013258706,0.00074316905,0.00079111534,0.00018877478],"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.00034285808,0.0001572342,0.0024840038,0.00019535185,0.00015452261,0.00004668353,0.0001466378,0.80428797,0.0015088669,0.015471876,0.00082185824,0.1743821],"study_design_scores_gemma":[0.000079152116,0.00016906166,0.0009247582,0.000040810595,0.000036651625,0.00007897921,0.00006687369,0.9907698,0.0015209805,0.005168329,0.0011249267,0.000019715637],"about_ca_topic_score_codex":0.0044760355,"about_ca_topic_score_gemma":0.003981175,"teacher_disagreement_score":0.0044760355,"about_ca_system_score_codex":0.0015319488,"about_ca_system_score_gemma":0.001498418,"threshold_uncertainty_score":0.01764965},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.26840747089815137,"score_gpt":0.3660595348005904,"score_spread":0.09765206390243902,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W184063531","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013526919,0.00082014047,0.9838886,0.000536229,0.000048756898,0.00002996932,0.000025422121,0.00007542691,0.0010484646],"genre_scores_gemma":[0.3993793,0.0045028194,0.59352744,0.00038061917,0.0002992752,0.00010833006,0.00017093953,0.000049338687,0.0015819059],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9964295,0.0013820844,0.00022949488,0.0003547077,0.0014607301,0.00014352729],"domain_scores_gemma":[0.991471,0.0055398904,0.0005292347,0.0016287854,0.0007222496,0.00010880125],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004422945,0.00045342097,0.00077082805,0.0010527892,0.0005741874,0.0014695353,0.0007895307,0.00097443594,0.00041782868],"category_scores_gemma":[0.014841942,0.00029813376,0.0007616742,0.002447415,0.0020250133,0.0029539412,0.001477139,0.0014871745,0.00027198964],"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.00078482064,0.00019513692,0.0033129267,0.00033700274,0.00017425112,0.0011326444,0.0007356206,0.16506213,0.051679596,0.25914645,0.0031771325,0.5142623],"study_design_scores_gemma":[0.00004940648,0.00022643663,0.00084414403,0.00005117832,0.00004952536,0.0012277839,0.00010681646,0.8676949,0.024769742,0.09742959,0.0075012627,0.000049252267],"about_ca_topic_score_codex":0.0005330345,"about_ca_topic_score_gemma":0.00025809673,"teacher_disagreement_score":0.004422945,"about_ca_system_score_codex":0.00043324765,"about_ca_system_score_gemma":0.00073645485,"threshold_uncertainty_score":0.023391068},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.05219381325565875,"score_gpt":0.3324311843105771,"score_spread":0.28023737105491836,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2155832050","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08543838,0.00013392276,0.9104877,0.000110915906,0.00003222353,0.00008207703,0.00002301125,0.0005852078,0.0031065722],"genre_scores_gemma":[0.5781585,0.00021033044,0.41939038,0.00005892445,0.00001282969,0.00021904576,0.000081503706,0.00014963487,0.0017188139],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99952185,0.00013251048,0.000028852679,0.0001070148,0.00016600135,0.00004380735],"domain_scores_gemma":[0.9985261,0.0010959996,0.00012625463,0.0001133636,0.00010178365,0.000036412206],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00094872806,0.00055651204,0.00037744734,0.0004913152,0.00036065746,0.00054567464,0.0006508711,0.00059166184,0.00083165494],"category_scores_gemma":[0.004666635,0.00034274964,0.0005498294,0.0004016579,0.0010763449,0.00045001178,0.00059059024,0.00069228665,0.00015125294],"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.00006400422,0.00008096286,0.0010274195,0.000097556156,0.00004221514,0.00025777618,0.00021779777,0.8601613,0.022414263,0.059200812,0.00024716018,0.056188717],"study_design_scores_gemma":[0.00003084617,0.000052827847,0.000118901204,0.000012059631,0.000018163297,0.000044982677,0.000015173137,0.9609091,0.009279427,0.027987525,0.0015198358,0.000011152369],"about_ca_topic_score_codex":0.0014349909,"about_ca_topic_score_gemma":0.0015311262,"teacher_disagreement_score":0.0014349909,"about_ca_system_score_codex":0.00062908133,"about_ca_system_score_gemma":0.0008103286,"threshold_uncertainty_score":0.0050174},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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)","score_opus":0.21652874081121004,"score_gpt":0.3622196979004566,"score_spread":0.14569095708924656,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2251263179","genre_codex":"methods","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04192493,0.04805071,0.8896507,0.000922175,0.00007289848,0.00011277619,0.00003782219,0.0005435009,0.018684538],"genre_scores_gemma":[0.6447428,0.058831196,0.29031414,0.0003431841,0.0005069722,0.00023513549,0.00016271259,0.000094140116,0.004769706],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99971,0.00006806813,0.000023329394,0.000038360104,0.00013843428,0.00002166036],"domain_scores_gemma":[0.9994573,0.000335305,0.000050297956,0.000046636873,0.00009609944,0.000014283769],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00072180625,0.00043138902,0.00047186608,0.0007623211,0.00017384457,0.0011906123,0.00072095206,0.0006547437,0.0011080619],"category_scores_gemma":[0.00089849514,0.00029216756,0.00030599968,0.0010060775,0.0006729449,0.0018981175,0.00042179742,0.0005343321,0.00024724915],"study_design_candidate":"not_applicable","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.00011815094,0.00009856763,0.0013213168,0.0013946745,0.000071494585,0.00013197797,0.0002189922,0.10950621,0.026644439,0.216701,0.001069985,0.64272314],"study_design_scores_gemma":[0.00008032737,0.0010622074,0.0017631303,0.0003647216,0.0001081125,0.0006706219,0.00019996104,0.7410134,0.045736503,0.13707255,0.0718584,0.00007004962],"about_ca_topic_score_codex":0.00032428,"about_ca_topic_score_gemma":0.00025354768,"teacher_disagreement_score":0.0011906123,"about_ca_system_score_codex":0.0005500155,"about_ca_system_score_gemma":0.0005003409,"threshold_uncertainty_score":0.00399065},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.02769775973741466,"score_gpt":0.3256740963406005,"score_spread":0.29797633660318584,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2254392641","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006138486,0.013150645,0.6530697,0.2550368,0.007153367,0.0001637746,0.00056426605,0.00046523171,0.06425778],"genre_scores_gemma":[0.5114016,0.020461073,0.29906273,0.07852898,0.052253436,0.0012574454,0.0006145861,0.00083614595,0.035584018],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.98889905,0.006306254,0.00046746078,0.0014310596,0.0025005531,0.00039564236],"domain_scores_gemma":[0.9090524,0.07927283,0.0023092143,0.003231794,0.0052512255,0.00088247616],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.020621017,0.0012713367,0.0012824374,0.0023433855,0.0026049067,0.004120658,0.0037952866,0.0060385256,0.015172453],"category_scores_gemma":[0.10317267,0.00061392837,0.0015839,0.0023221625,0.010764401,0.013577947,0.003075016,0.010834218,0.0022059546],"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.000033684242,0.000010002899,0.0001715533,0.0001336052,0.000020136657,0.00012368982,0.00018119934,0.005009653,0.000048139955,0.96580327,0.01855034,0.009914706],"study_design_scores_gemma":[0.000016852555,0.00000646603,0.00008039867,0.000048908078,0.0000065500776,0.00003460087,0.00003267595,0.0057806526,0.000053723263,0.98386544,0.010063799,0.000009934174],"about_ca_topic_score_codex":0.003461581,"about_ca_topic_score_gemma":0.0017316319,"teacher_disagreement_score":0.020621017,"about_ca_system_score_codex":0.0029080522,"about_ca_system_score_gemma":0.0016107706,"threshold_uncertainty_score":0.10905564},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.04082978311332475,"score_gpt":0.33334147363280214,"score_spread":0.2925116905194774,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2260214588","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01030231,0.00013585697,0.9804684,0.00014458245,0.0001371401,0.0002190381,0.000080834376,0.0041073505,0.0044044093],"genre_scores_gemma":[0.11180659,0.00021183786,0.8782057,0.00017069979,0.00005146074,0.000121534606,0.0005192867,0.0010018514,0.007911014],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99877137,0.00030884784,0.00012056882,0.00021925334,0.0004749405,0.00010495109],"domain_scores_gemma":[0.9981395,0.000336462,0.00011640598,0.0005971459,0.00071754673,0.000093012146],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011959843,0.00083011546,0.0006708564,0.00091863767,0.00065876055,0.001376878,0.001161082,0.00066900987,0.0054859333],"category_scores_gemma":[0.0031206652,0.00044010632,0.0006935037,0.0006603682,0.0010575554,0.001747014,0.0014559701,0.0011739028,0.0024871577],"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.0002589413,0.00009084313,0.0014610329,0.00034225883,0.00004315606,0.00076583104,0.001440572,0.014652266,0.089346156,0.041268438,0.0075004757,0.8428301],"study_design_scores_gemma":[0.00013979131,0.0008905015,0.0020955973,0.00020755915,0.00013623957,0.0028031832,0.00093396136,0.46233898,0.2841959,0.04182678,0.20415153,0.00028012268],"about_ca_topic_score_codex":0.0020513195,"about_ca_topic_score_gemma":0.0028749986,"teacher_disagreement_score":0.0054859333,"about_ca_system_score_codex":0.00034540464,"about_ca_system_score_gemma":0.0011806621,"threshold_uncertainty_score":0.01835221},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.11854189777934346,"score_gpt":0.36838683067648526,"score_spread":0.2498449328971418,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2283584817","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015945503,0.00021524931,0.9763476,0.0000889261,0.000050406183,0.00021257446,0.00004818855,0.0013587729,0.0057327934],"genre_scores_gemma":[0.12382687,0.00013230726,0.8719978,0.00009111306,0.000023714623,0.00071034173,0.00011243903,0.0003690892,0.002736386],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986155,0.0007931648,0.0000861813,0.00011948886,0.0002948414,0.000090738715],"domain_scores_gemma":[0.99769044,0.001310229,0.00020883358,0.00020671242,0.0005255894,0.000058279285],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002341168,0.0011290987,0.0013492698,0.0010638483,0.0009903635,0.0011243038,0.001401471,0.0014678081,0.0050833016],"category_scores_gemma":[0.0062996135,0.0005807481,0.000617484,0.0011619775,0.00093494967,0.00096599146,0.0010852556,0.0017455826,0.0022004438],"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.0005487837,0.00049923453,0.0021139958,0.00069239014,0.00017165182,0.00031723926,0.0005233455,0.57738435,0.021580104,0.043892626,0.0045515923,0.34772468],"study_design_scores_gemma":[0.00007435304,0.0002154125,0.00032994183,0.000054952165,0.000033362165,0.000094094816,0.000037931077,0.97477776,0.013390641,0.0035373175,0.0074083908,0.000045856796],"about_ca_topic_score_codex":0.0023905288,"about_ca_topic_score_gemma":0.0027015347,"teacher_disagreement_score":0.0050833016,"about_ca_system_score_codex":0.000591608,"about_ca_system_score_gemma":0.0013345045,"threshold_uncertainty_score":0.017005324},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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)","score_opus":0.024651741574158233,"score_gpt":0.3437593539744871,"score_spread":0.31910761240032887,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2326337533","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.49398953,0.003962855,0.4899716,0.0002506907,0.00012996257,0.00013624768,0.00020504135,0.002273985,0.009080152],"genre_scores_gemma":[0.8106788,0.00093311124,0.18675916,0.00006237125,0.000043549455,0.000026511494,0.0002828722,0.00018811706,0.0010254596],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99837697,0.0005019704,0.00006300263,0.00020185526,0.0007528044,0.00010343477],"domain_scores_gemma":[0.99341923,0.0048905006,0.0004165163,0.00047764354,0.00068291964,0.00011318422],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018430831,0.00064810266,0.0004768685,0.00142935,0.0002934383,0.0006630642,0.0004979622,0.0006450649,0.0013204261],"category_scores_gemma":[0.012441003,0.00029635523,0.0003598313,0.00060009497,0.0004035446,0.0013243115,0.00055504806,0.00032575618,0.0003329837],"study_design_candidate":"bench_or_experimental","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.00254467,0.00018720054,0.004615985,0.00035273843,0.00016554803,0.00021619494,0.00025399734,0.09078167,0.20762077,0.0028340847,0.00089714804,0.6895301],"study_design_scores_gemma":[0.0000703814,0.0016990071,0.016826117,0.000073446994,0.00020377581,0.000907305,0.00018523801,0.7480183,0.22690442,0.0015056253,0.0035240895,0.000082202],"about_ca_topic_score_codex":0.0027983843,"about_ca_topic_score_gemma":0.0026622089,"teacher_disagreement_score":0.0027983843,"about_ca_system_score_codex":0.00034932283,"about_ca_system_score_gemma":0.00044927798,"threshold_uncertainty_score":0.009747267},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.030293859351419844,"score_gpt":0.3224488364877976,"score_spread":0.2921549771363777,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2404558852","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.025227249,0.00016127832,0.97070134,0.000060367347,0.000029547595,0.000044432654,0.00008478694,0.00043528044,0.0032556413],"genre_scores_gemma":[0.27323005,0.00049035513,0.72105354,0.00005143552,0.00005298785,0.00006873637,0.00036446768,0.00012375023,0.0045647183],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995567,0.000063883024,0.000016274354,0.00006292099,0.0002752032,0.000024870016],"domain_scores_gemma":[0.9995745,0.00011455891,0.000051847637,0.0001220474,0.00012593408,0.000011111731],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000377691,0.00039969612,0.00038811553,0.00080693286,0.00024204885,0.0004340672,0.0005033416,0.00036874114,0.0025584481],"category_scores_gemma":[0.0019333545,0.00034946692,0.00043377475,0.0008802501,0.00033362975,0.0010598843,0.00062912086,0.00043005703,0.00062949123],"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.0002170026,0.000059045084,0.0008592423,0.00033597043,0.00008199099,0.00031659397,0.00031461322,0.07954009,0.17051947,0.05447132,0.003769182,0.6895156],"study_design_scores_gemma":[0.00005566721,0.00021780176,0.003724852,0.00004711151,0.000042192165,0.0013278646,0.00012829047,0.8121841,0.13231906,0.03031503,0.019577531,0.00006047865],"about_ca_topic_score_codex":0.0011333877,"about_ca_topic_score_gemma":0.0012203604,"teacher_disagreement_score":0.0025584481,"about_ca_system_score_codex":0.0002278364,"about_ca_system_score_gemma":0.00034553374,"threshold_uncertainty_score":0.00855881},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.03532033562343716,"score_gpt":0.28173244622704896,"score_spread":0.2464121106036118,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2482994569","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04684394,0.0002487776,0.9431987,0.00042681737,0.00010017695,0.000033537577,0.00007054973,0.000090297486,0.008987258],"genre_scores_gemma":[0.8395788,0.000614798,0.14277132,0.00026825705,0.00022778538,0.000120458084,0.00012515509,0.000065973356,0.016227394],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998186,0.000043924498,0.000009218803,0.000033809538,0.00006421144,0.000030289508],"domain_scores_gemma":[0.9997725,0.00007348022,0.000042789856,0.000033423217,0.000041656564,0.000036100155],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047139564,0.00042008876,0.00041668274,0.00045409254,0.00036506116,0.00088630174,0.0011661674,0.00079177856,0.002341931],"category_scores_gemma":[0.0010779769,0.00016655285,0.00054036477,0.00037117553,0.0010413225,0.0017233151,0.0009589813,0.0011362009,0.00026096555],"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.00001928029,0.000025362178,0.00019887241,0.000037902762,0.000010838857,0.000118856944,0.00012840744,0.035808567,0.005588467,0.9512412,0.0004735772,0.006348644],"study_design_scores_gemma":[0.000010737478,0.00004388294,0.00012588744,0.000011928704,0.000009668068,0.00014359286,0.000051817617,0.77667975,0.0012382753,0.21893986,0.0027293079,0.000015316278],"about_ca_topic_score_codex":0.0009059639,"about_ca_topic_score_gemma":0.000594069,"teacher_disagreement_score":0.002341931,"about_ca_system_score_codex":0.00052707933,"about_ca_system_score_gemma":0.00048768605,"threshold_uncertainty_score":0.007834494},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.01855455023083028,"score_gpt":0.3387013832656849,"score_spread":0.3201468330348546,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W56834323","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0012752956,0.00079208316,0.98783445,0.0019421296,0.000091313574,0.00023299953,0.000084581654,0.0011540656,0.006593118],"genre_scores_gemma":[0.037672557,0.0009798664,0.95435286,0.0003626851,0.00008783394,0.00070015003,0.00040305493,0.00025211697,0.0051888074],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9949195,0.0021413008,0.00080819475,0.00063606066,0.0011428664,0.00035217087],"domain_scores_gemma":[0.9964057,0.0014671523,0.0002558831,0.000698925,0.0008095576,0.00036272896],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009626962,0.0013066778,0.00090390793,0.0029633585,0.0023880769,0.008011589,0.0041317306,0.0035498547,0.0063089514],"category_scores_gemma":[0.008195677,0.0016851921,0.0034083542,0.0021862618,0.0069849775,0.009656043,0.0046286704,0.0050816373,0.0020096686],"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.000020535004,0.000037908292,0.00017693781,0.00019448856,0.000033697725,0.00019290936,0.0011450354,0.0073531424,0.0012249798,0.9615982,0.003040877,0.024981251],"study_design_scores_gemma":[0.00006194391,0.00006858658,0.00019651969,0.00033034183,0.000078275916,0.00043464606,0.0006331126,0.091542594,0.0021529903,0.72973716,0.17470117,0.00006279925],"about_ca_topic_score_codex":0.010323221,"about_ca_topic_score_gemma":0.010676887,"teacher_disagreement_score":0.010323221,"about_ca_system_score_codex":0.004219934,"about_ca_system_score_gemma":0.0051930593,"threshold_uncertainty_score":0.050912917},"labels":[],"label_agreement":null}]}