{"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04172446,0.00040309157,0.9570694,0.00005798068,0.00024591133,0.00036753208,0.0000019677614,0.00009317048,0.000036478254],"genre_scores_gemma":[0.7486515,0.000010059314,0.2510067,0.00013431828,0.00013158316,0.0000370102,0.0000150826945,0.000005869032,0.000007872917],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99904925,0.00008146716,0.00020042963,0.00033430735,0.00013881699,0.00019570523],"domain_scores_gemma":[0.9993419,0.00014989717,0.00010003735,0.00014414865,0.00013745102,0.00012654687],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043933056,0.00012482001,0.000106280684,0.00011538033,0.0002731914,0.00014043773,0.00016666173,0.00010925967,0.000005149872],"category_scores_gemma":[0.000036701837,0.00012251563,0.000033442866,0.00022802872,0.00005449172,0.0010155848,0.00006589856,0.00012913151,0.0000013257489],"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.00010807703,0.00025112735,0.00028004497,0.000085948384,0.000015444966,2.0940954e-7,0.00074787904,0.042279415,0.0063492865,0.026935978,0.000026793334,0.9229198],"study_design_scores_gemma":[0.00011930946,0.0003395064,0.002513175,0.0000103182265,0.000006873556,0.000017307835,0.000028725473,0.97006804,0.0063276305,0.020218106,0.00020359324,0.00014741537],"about_ca_topic_score_codex":0.000007744243,"about_ca_topic_score_gemma":0.0000039821625,"teacher_disagreement_score":0.9277886,"about_ca_system_score_codex":0.000027657034,"about_ca_system_score_gemma":0.000024389963,"threshold_uncertainty_score":0.49960423},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008285223,0.00037669676,0.98993325,0.00006419216,0.0007913525,0.00022494429,0.000025651505,0.00009608454,0.00020259262],"genre_scores_gemma":[0.4964353,0.0000012983302,0.50337857,0.00002140549,0.000076649565,0.000006974063,0.000037740716,0.0000058118126,0.000036229234],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99815977,0.000029641657,0.0006623243,0.0004127148,0.00041791805,0.000317645],"domain_scores_gemma":[0.9974328,0.0014587296,0.00031698155,0.00024427523,0.00045132494,0.00009586081],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005857817,0.0001572223,0.00024843717,0.00019485776,0.00027528967,0.000048707152,0.0007831282,0.00007056534,0.00001826436],"category_scores_gemma":[0.00017648088,0.00015736616,0.0001039005,0.0004463698,0.00009376313,0.00046218117,0.00029335942,0.00014461076,0.000013808559],"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.000046367393,0.0002606798,0.0024581996,0.00004982309,0.000031591113,0.000004792742,0.0015221918,0.70442975,0.00016487228,0.05598568,0.001629918,0.23341615],"study_design_scores_gemma":[0.00008695997,0.0001438308,0.003233389,0.00007145864,0.000005128103,0.00002058327,0.0003410083,0.9785797,0.0060313717,0.010549395,0.0007570047,0.00018019183],"about_ca_topic_score_codex":0.000021826341,"about_ca_topic_score_gemma":0.000002422498,"teacher_disagreement_score":0.4881501,"about_ca_system_score_codex":0.00006889078,"about_ca_system_score_gemma":0.000104961335,"threshold_uncertainty_score":0.64172053},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005125476,0.00005101873,0.9808574,0.012891043,0.00020303811,0.00044130688,0.00010410513,0.00017810392,0.00014854834],"genre_scores_gemma":[0.292348,0.000009328795,0.7071635,0.0003544211,0.000023111363,0.000011100311,0.00006290198,0.000009586303,0.000018035396],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981132,0.000036516136,0.00049503584,0.00055341946,0.00046902653,0.0003328065],"domain_scores_gemma":[0.9846897,0.008586766,0.00019319227,0.0062337257,0.00024892399,0.0000477024],"candidate_categories":["metaresearch","open_science"],"consensus_categories":["open_science"],"category_scores_codex":[0.0013262501,0.00015571769,0.00015681105,0.00015147934,0.00017251632,0.000143428,0.031257447,0.000074112206,0.00001531928],"category_scores_gemma":[0.027678682,0.00012136911,0.000052518157,0.0005416989,0.00016834712,0.001010063,0.022956436,0.00018024299,0.000008854794],"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.000068771165,0.00017526372,0.00010310913,0.00008346982,0.00008080457,0.000008760794,0.00062622514,0.022599477,0.00008863293,0.2786005,0.18646348,0.5111015],"study_design_scores_gemma":[0.000037989277,0.00005523268,0.00019836042,0.00005496883,0.0000030930612,0.000004732249,0.000026668895,0.6449152,0.004307476,0.34737295,0.0029261066,0.00009717341],"about_ca_topic_score_codex":0.000016806049,"about_ca_topic_score_gemma":0.0000086334385,"teacher_disagreement_score":0.62231576,"about_ca_system_score_codex":0.00004626221,"about_ca_system_score_gemma":0.0000971674,"threshold_uncertainty_score":0.9849457},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0053962893,0.00026876188,0.993334,0.0002640503,0.000107555854,0.00036767373,0.0000018909093,0.00015471567,0.00010505299],"genre_scores_gemma":[0.47717813,0.0000010894786,0.5226056,0.000113658105,0.000052520205,0.000023798992,0.0000011883475,0.0000060820557,0.0000179663],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99855417,0.000015461328,0.00033553835,0.000431333,0.00033206536,0.00033140212],"domain_scores_gemma":[0.9986148,0.00049133314,0.000085134445,0.00024734013,0.00039053976,0.00017084854],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024164228,0.00013948309,0.000108856155,0.0001585138,0.00026409453,0.00012310674,0.0007073323,0.000037550944,0.000009522638],"category_scores_gemma":[0.00013799389,0.00014646826,0.00003726394,0.0011620689,0.00005874566,0.00023240484,0.00017201784,0.000091676426,0.00013072448],"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.00000269475,0.000078999656,0.000031477004,0.000014074644,0.0000073729802,0.00000545827,0.00029048364,0.86460996,0.00005850394,0.03629244,0.00001901703,0.09858952],"study_design_scores_gemma":[0.000028218985,0.000051493746,0.0018282555,0.000050287123,0.0000056946046,0.0000872467,0.00006653079,0.95248234,0.0006963152,0.04397098,0.0004868583,0.00024576078],"about_ca_topic_score_codex":0.000016420154,"about_ca_topic_score_gemma":0.0000048557613,"teacher_disagreement_score":0.47178185,"about_ca_system_score_codex":0.00009694132,"about_ca_system_score_gemma":0.0002495577,"threshold_uncertainty_score":0.5972802},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.024964789,0.001811658,0.97268593,0.000032523436,0.000121694546,0.00026929544,0.000015842405,0.000037021255,0.00006121629],"genre_scores_gemma":[0.91165715,0.000020801306,0.08822457,0.000053156215,0.00001965109,0.0000016224849,0.00001441987,0.000005914589,0.0000026915639],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981585,0.00013523188,0.00059292145,0.00045583418,0.00035183367,0.00030566752],"domain_scores_gemma":[0.99788123,0.0012614257,0.00019470579,0.00035330188,0.00021157255,0.000097786506],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010731908,0.00014440446,0.00023981386,0.00015178103,0.00008400348,0.000102760736,0.00065051916,0.000057814577,0.0000057615603],"category_scores_gemma":[0.00014577151,0.00013659163,0.000020014008,0.0004202143,0.00021642295,0.00050281885,0.00032247487,0.00014130908,0.0000023674047],"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.0000013622555,0.000060263537,0.001971797,0.00016719302,0.000010817136,0.000015845268,0.000783884,0.9011846,0.00030211563,0.04074413,0.00001357832,0.054744396],"study_design_scores_gemma":[0.000094004354,0.00003108321,0.0021284218,0.0006175569,0.000003749692,0.000070525755,0.00059709995,0.9821421,0.00018779664,0.01395536,0.000021855889,0.00015044548],"about_ca_topic_score_codex":0.00017426419,"about_ca_topic_score_gemma":0.000019710003,"teacher_disagreement_score":0.8866924,"about_ca_system_score_codex":0.000066212626,"about_ca_system_score_gemma":0.00021737706,"threshold_uncertainty_score":0.5570045},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0007770294,0.000102054306,0.9909168,0.00083158433,0.0003997722,0.00008395558,7.4343666e-7,0.00012404945,0.006764039],"genre_scores_gemma":[0.8107264,0.0000059784666,0.18788806,0.0012454584,0.00009553996,0.0000042419574,0.000005151428,0.0000084186295,0.00002073905],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99800247,0.000074814925,0.0005268855,0.00052701705,0.00039759994,0.0004712318],"domain_scores_gemma":[0.9977874,0.0014756001,0.00006774337,0.00029621288,0.0002088087,0.00016422982],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010707045,0.00017695439,0.00016451479,0.0002145698,0.0001384891,0.00017297514,0.000756344,0.00010942077,0.000030262392],"category_scores_gemma":[0.00034612766,0.00018405521,0.000053737233,0.000661044,0.00009963451,0.00033277707,0.00014866218,0.00043963187,0.00008540141],"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.0000073358838,0.000059331047,0.00021518415,0.000004070911,0.0000020206287,0.00003523972,0.00012968194,0.38293263,0.0000037672835,0.536542,0.0000733908,0.079995334],"study_design_scores_gemma":[0.000037921905,0.00007239523,0.0021428058,0.0000937824,9.876147e-7,0.000019701973,0.000033348908,0.8317774,0.0001530378,0.16545312,0.00003568701,0.00017983146],"about_ca_topic_score_codex":0.000020060726,"about_ca_topic_score_gemma":0.000018850506,"teacher_disagreement_score":0.8099494,"about_ca_system_score_codex":0.000084624786,"about_ca_system_score_gemma":0.00007971516,"threshold_uncertainty_score":0.7505554},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007603152,0.00060930516,0.9897102,0.00067061593,0.0002881487,0.00022536275,9.677028e-7,0.0005336306,0.000358583],"genre_scores_gemma":[0.51790506,0.0000015677919,0.48124403,0.0006561927,0.000093773844,0.000007393063,0.000004902371,0.000006859005,0.00008020435],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984301,0.000039700044,0.00032852645,0.00047418865,0.00043144322,0.00029609582],"domain_scores_gemma":[0.99892396,0.00023721051,0.00009142002,0.0002959814,0.00031815277,0.00013325724],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00073004945,0.00016230943,0.00012973089,0.00026074212,0.00017468822,0.00021786195,0.00086552446,0.00006580619,0.000022353177],"category_scores_gemma":[0.0002054409,0.00016025461,0.00004778654,0.00080472755,0.000040665545,0.0004347894,0.00025458878,0.0001758162,0.00012016252],"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.000020234787,0.000099066005,0.00013142261,0.000028223774,0.000019090096,0.00006664228,0.0031921547,0.064880796,0.016025295,0.4068553,0.0014241005,0.5072577],"study_design_scores_gemma":[0.000070930255,0.00028421666,0.0004758093,0.00008770373,0.000005186661,0.00011144074,0.000060468803,0.6435819,0.22368205,0.13002884,0.0010175466,0.0005938501],"about_ca_topic_score_codex":0.000021210699,"about_ca_topic_score_gemma":0.000012743298,"teacher_disagreement_score":0.57870114,"about_ca_system_score_codex":0.00011462476,"about_ca_system_score_gemma":0.00008584237,"threshold_uncertainty_score":0.65349936},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0015692364,0.00007022234,0.99690855,0.0006596221,0.00009144006,0.00034738742,0.0000032803941,0.00003326639,0.0003169871],"genre_scores_gemma":[0.40409344,0.00003445451,0.5955049,0.00024341808,0.000031148727,0.0000071559925,0.000017245686,0.0000066784196,0.0000615445],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99769753,0.00018464238,0.00055005366,0.00032627984,0.00096228975,0.0002792299],"domain_scores_gemma":[0.99725765,0.0014489051,0.0000800086,0.00034925516,0.00079474115,0.00006942603],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019490515,0.00011622471,0.00013789407,0.0003846046,0.00008518037,0.00016527441,0.0010966394,0.00005800874,0.000045674427],"category_scores_gemma":[0.0007598399,0.00009243,0.000041723524,0.00202347,0.00012919531,0.00048645327,0.00017985259,0.00024833155,0.00002518904],"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.000009619754,0.00011079537,0.00036351773,0.000017238826,0.0000048639426,0.000011735989,0.0007396237,0.9263908,0.0000074028926,0.06216871,0.000075966585,0.010099687],"study_design_scores_gemma":[0.000055212036,0.000059501763,0.0025067101,0.000022030179,0.0000014525474,0.000022973154,0.000080055615,0.9931454,0.00080087647,0.0031422835,0.000072089715,0.00009140359],"about_ca_topic_score_codex":0.000029485818,"about_ca_topic_score_gemma":0.000006987616,"teacher_disagreement_score":0.4025242,"about_ca_system_score_codex":0.000046936177,"about_ca_system_score_gemma":0.00021080872,"threshold_uncertainty_score":0.37691858},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0026326792,0.000024523,0.9961726,0.000037177208,0.00042113932,0.00044781438,0.0000035223932,0.00008638756,0.00017415678],"genre_scores_gemma":[0.5486428,6.50882e-7,0.45120108,0.000091358546,0.000011295873,0.000013297302,0.000030357585,0.000005769673,0.0000033570007],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99868274,0.00008447564,0.0003412951,0.00034845993,0.00036566355,0.00017736948],"domain_scores_gemma":[0.99710363,0.0021256383,0.0001857433,0.0001824615,0.00034484878,0.000057660087],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008855195,0.00013412378,0.00013947344,0.00025823968,0.00011817209,0.000046075656,0.00026489014,0.00003780162,0.000005325568],"category_scores_gemma":[0.0002183123,0.00013524709,0.00007142611,0.0004607524,0.00004835975,0.00044490697,0.00003414696,0.00007452943,0.000015696778],"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.00006021101,0.00006485092,0.00020113157,0.000061360806,0.000004145541,7.005134e-7,0.00008367818,0.68545306,0.0007004357,0.008041927,0.000006606336,0.3053219],"study_design_scores_gemma":[0.00020319367,0.00019738618,0.013215088,0.00013489615,0.0000041068984,0.000002245214,0.000018787896,0.9167253,0.053175353,0.016185958,0.000015586047,0.00012211951],"about_ca_topic_score_codex":0.0000056511035,"about_ca_topic_score_gemma":0.0000012554473,"teacher_disagreement_score":0.54601014,"about_ca_system_score_codex":0.00012657637,"about_ca_system_score_gemma":0.00006654816,"threshold_uncertainty_score":0.5515216},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0036291971,0.00021957702,0.99402356,0.0011039628,0.0002660708,0.00010548755,0.000002512771,0.00013817915,0.0005114257],"genre_scores_gemma":[0.7358627,0.000017272363,0.26311097,0.0007770785,0.000033030716,0.0000022124314,0.000006917888,0.000006576209,0.00018326458],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988338,0.00005036854,0.00026494713,0.00040057325,0.0002523782,0.00019798095],"domain_scores_gemma":[0.9988537,0.000535272,0.00009275834,0.00023117587,0.0001723932,0.00011469329],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039037905,0.0001224165,0.00009849578,0.00013447356,0.00017320091,0.00016635215,0.0003197869,0.00003403965,0.00002148362],"category_scores_gemma":[0.00011968113,0.000116602554,0.000025903613,0.00034224958,0.00009406503,0.0005402883,0.00011863023,0.000153691,0.0001607359],"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.000039182447,0.00012525692,0.0013345579,0.000020843741,0.000011715573,0.00002554271,0.00045245176,0.016978022,0.0013066959,0.17879514,0.00095985306,0.7999507],"study_design_scores_gemma":[0.00012357412,0.00011150282,0.05295445,0.00007958863,0.000003666806,0.000044154796,0.000085391795,0.79809,0.02480417,0.11955671,0.0037936708,0.00035311392],"about_ca_topic_score_codex":0.000008864593,"about_ca_topic_score_gemma":0.0000019878353,"teacher_disagreement_score":0.7995976,"about_ca_system_score_codex":0.000039809507,"about_ca_system_score_gemma":0.00003008578,"threshold_uncertainty_score":0.4754914},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00032846304,0.00007311197,0.99433523,0.004555258,0.000030714324,0.00038975175,0.0000026188136,0.00008736208,0.0001974749],"genre_scores_gemma":[0.25892407,0.0000029091616,0.7391872,0.0014202603,0.00010669653,0.00002698306,0.000006123219,0.0000061593228,0.00031959888],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990846,0.000012690204,0.00022636961,0.00029454974,0.00019511116,0.00018671007],"domain_scores_gemma":[0.99905527,0.0004084623,0.00008568383,0.00023974641,0.00013398893,0.00007685699],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017936731,0.000117658165,0.000103055645,0.000033312448,0.00033016712,0.00021497453,0.000746143,0.000024375731,0.0000060910306],"category_scores_gemma":[0.000021466572,0.00007807962,0.00004275621,0.0003500213,0.000028729428,0.00026081337,0.00006407856,0.000104043655,0.0000274926],"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.0000031830407,0.000013527576,7.7336955e-7,0.0000014185697,0.0000053219173,4.787056e-7,0.00025974552,0.8133575,0.000042707932,0.119198725,0.0005071792,0.06660949],"study_design_scores_gemma":[0.00005281754,0.00004627019,0.000014571463,0.000018291446,0.0000049732867,0.000013977526,0.000013833729,0.945101,0.00034395783,0.05416756,0.0001110419,0.00011167344],"about_ca_topic_score_codex":0.000004759487,"about_ca_topic_score_gemma":0.0000013109673,"teacher_disagreement_score":0.25859562,"about_ca_system_score_codex":0.000020180627,"about_ca_system_score_gemma":0.00015280352,"threshold_uncertainty_score":0.31839943},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018824724,0.00300366,0.9758797,0.0005367231,0.0006321956,0.0004436093,0.000012761378,0.00063934125,0.000027272978],"genre_scores_gemma":[0.5142078,2.293722e-7,0.4852959,0.0002503327,0.00012678417,0.00004269331,0.000018279987,0.000008519217,0.00004948853],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99844855,0.000056956676,0.0003319596,0.0005124497,0.0003354645,0.00031460915],"domain_scores_gemma":[0.998742,0.0004278522,0.000111626774,0.00035768113,0.00026560976,0.000095217096],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022215418,0.000199398,0.00017562212,0.000193586,0.00014699553,0.0004928233,0.0013909352,0.000068329085,0.0000049116775],"category_scores_gemma":[0.00013121132,0.00017466626,0.00006075074,0.00040749458,0.000049063023,0.0003793347,0.00017269298,0.00020735212,0.000033770204],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021463671,0.00006049754,0.00003135792,0.000052488256,0.000010443588,0.000013546207,0.0013503429,0.16318537,0.0011395244,0.7171731,0.00043491626,0.11652696],"study_design_scores_gemma":[0.000034549124,0.00015069991,0.00015438006,0.00012187151,0.0000037260147,0.000068994545,0.000100132376,0.59096295,0.021683762,0.386256,0.00014531639,0.0003176142],"about_ca_topic_score_codex":0.00012165411,"about_ca_topic_score_gemma":0.000013311214,"teacher_disagreement_score":0.49538305,"about_ca_system_score_codex":0.00008822134,"about_ca_system_score_gemma":0.00005142755,"threshold_uncertainty_score":0.7122683},"labels":[],"label_agreement":null}]}