{"meta":{"query_hash":"450b8843ce1e","filters":{"venue":"Connection Science"},"cohort_total":14,"direct_labels_cover":0,"predictions_cover":14,"exported":14,"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/450b8843ce1e","api":"https://metacan.xera.ac/api/v1/cohort?venue=Connection+Science"},"results":[{"id":"W1974586764","doi":"10.1080/09540090110052996","title":"Syntactic systematicity arising from semantic predictions in a Hebbian-competitive network","year":2001,"lang":"en","type":"article","venue":"Connection Science","topic":"Topic Modeling","field":"Computer Science","cited_by":25,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Hebbian theory; Computer science; Artificial intelligence; Natural language processing; Connectionism; Embedding; Competitive learning; Simple (philosophy); Leabra; Artificial neural network; Generalization error; Philosophy","score_opus":0.031078408995862356,"score_gpt":0.2704708189559582,"score_spread":0.23939240996009584,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1974586764","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.27691373,0.000052629333,0.71802133,0.00045736297,0.0012284097,0.000182669,5.135682e-7,0.0001625808,0.0029807382],"genre_scores_gemma":[0.9872749,0.000009942994,0.012289318,0.00018413448,0.00016738135,0.000021436806,3.9295122e-7,0.000004656298,0.000047845515],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979039,0.00012118394,0.00037927303,0.0006762397,0.0004910595,0.00042833303],"domain_scores_gemma":[0.99860847,0.00036365117,0.00014504603,0.0006208372,0.00014249947,0.0001194999],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012127626,0.00012209095,0.00020193803,0.00025886705,0.00047359645,0.0003958306,0.00078606815,0.00004851307,0.000023980961],"category_scores_gemma":[0.00047346,0.00012193376,0.000039274397,0.0023334667,0.00012912482,0.0015119261,0.0002164409,0.00019582167,0.00006143551],"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.00002476968,0.00036499082,0.21966818,0.00012651851,0.000048742775,0.00022887746,0.010454908,0.31904757,0.008357502,0.42470214,0.00017949617,0.016796285],"study_design_scores_gemma":[0.00017838772,0.000022980226,0.0377169,0.0003174629,0.000005645336,0.00007480818,0.000414662,0.9537381,0.0002215095,0.007015127,0.00013920882,0.00015524623],"about_ca_topic_score_codex":0.00063261256,"about_ca_topic_score_gemma":0.00044942,"teacher_disagreement_score":0.7103611,"about_ca_system_score_codex":0.00027556578,"about_ca_system_score_gemma":0.00018648853,"threshold_uncertainty_score":0.49723142},"labels":[],"label_agreement":null},{"id":"W1975585879","doi":"10.1080/09540091.2014.948385","title":"Global–local population memetic algorithm for solving the forward kinematics of parallel manipulators","year":2014,"lang":"en","type":"article","venue":"Connection Science","topic":"Robotic Mechanisms and Dynamics","field":"Engineering","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"","keywords":"Memetic algorithm; Crossover; Computer science; Population; Evolutionary algorithm; Local search (optimization); Kinematics; Evolutionary computation; Genetic algorithm; Computation; Mathematical optimization; Algorithm; Artificial intelligence; Mathematics; Machine learning","score_opus":0.012746942183165178,"score_gpt":0.2453584346619545,"score_spread":0.23261149247878932,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1975585879","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.01441439,0.000012077572,0.98426294,0.00003075346,0.0007578346,0.00017604572,0.0000019476602,0.00006434129,0.000279638],"genre_scores_gemma":[0.7962902,0.0000026730374,0.20362236,0.000020750216,0.000035971825,0.00001078509,0.0000016883832,0.0000059174117,0.000009652714],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99927413,0.0000074062273,0.00020798024,0.0001258028,0.00021776187,0.00016691376],"domain_scores_gemma":[0.9995419,0.00008166636,0.000055365595,0.0001889041,0.000088167064,0.000043995395],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00060899707,0.00007325427,0.00010920657,0.000048596652,0.00015873657,0.000037711627,0.00017938245,0.0000337688,0.000005646034],"category_scores_gemma":[0.00015642832,0.00005562142,0.000042207004,0.00036402018,0.00007810493,0.00013164946,0.000023108483,0.000029975885,0.0000020004734],"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":[5.980745e-7,0.000003367041,0.00008088403,0.000022125558,0.000002959027,2.3760345e-8,0.00003324138,0.87768394,0.0002205198,0.08381808,0.000020093805,0.038114164],"study_design_scores_gemma":[0.00010740197,0.000030487548,0.001734288,0.000012529591,0.000011173493,0.000003801094,0.00009633265,0.977519,0.00016262499,0.020225747,0.000028591176,0.00006803454],"about_ca_topic_score_codex":0.00002550534,"about_ca_topic_score_gemma":0.000019964906,"teacher_disagreement_score":0.7818758,"about_ca_system_score_codex":0.00007186688,"about_ca_system_score_gemma":0.000011809364,"threshold_uncertainty_score":0.22681756},"labels":[],"label_agreement":null},{"id":"W2023342037","doi":"10.1080/09540091.2011.571761","title":"Neural representations of compositional structures: representing and manipulating vector spaces with spiking neurons","year":2011,"lang":"en","type":"article","venue":"Connection Science","topic":"Neural dynamics and brain function","field":"Neuroscience","cited_by":34,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; Canada Research Chairs","keywords":"Computer science; Artificial neural network; Set (abstract data type); Representation (politics); Artificial intelligence; Stimulus (psychology); Focus (optics); Vector space; Theoretical computer science; Cognitive science; Cognitive psychology; Psychology; Mathematics","score_opus":0.07917511332784438,"score_gpt":0.2972848507964682,"score_spread":0.21810973746862383,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2023342037","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99448717,0.0000043018727,0.0022397977,0.00011954693,0.0003294725,0.00014147254,0.0000034653413,0.000052515315,0.0026222835],"genre_scores_gemma":[0.9988233,0.0000020187906,0.0009918207,0.000098860175,0.000034386427,0.000004876322,7.7428024e-7,0.0000072565254,0.00003670226],"study_design_codex":"bench_or_experimental","study_design_gemma":"observational","domain_scores_codex":[0.9987377,0.000054077133,0.00018554396,0.00048611115,0.0003467029,0.0001898606],"domain_scores_gemma":[0.99924636,0.00020359734,0.00019154405,0.0001903071,0.00010009291,0.00006810326],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018010348,0.00009138672,0.00009613614,0.00018003973,0.0005972269,0.00010680948,0.0001554486,0.000018090946,0.000033108343],"category_scores_gemma":[0.0004934089,0.000076091164,0.000022486403,0.0007284422,0.0005954514,0.0006621717,0.000097373246,0.000106932814,9.3259416e-7],"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.000030841387,0.000016778042,0.023632113,0.000009085826,0.0000012724387,0.000006351121,0.00033587136,0.0006239169,0.95095795,0.023591341,0.0000026563455,0.00079179043],"study_design_scores_gemma":[0.00030002228,0.00022230514,0.49073195,0.000029341794,0.000013035861,0.00035121056,0.0004881371,0.075442925,0.4301764,0.002051826,0.000011961985,0.00018087271],"about_ca_topic_score_codex":0.00010536436,"about_ca_topic_score_gemma":0.000015586604,"teacher_disagreement_score":0.5207816,"about_ca_system_score_codex":0.000015266362,"about_ca_system_score_gemma":0.00003072072,"threshold_uncertainty_score":0.45934469},"labels":[],"label_agreement":null},{"id":"W2097173997","doi":"10.1080/09540090802091966","title":"Flexible word meaning in embodied agents","year":2008,"lang":"en","type":"article","venue":"Connection Science","topic":"Language and cultural evolution","field":"Social Sciences","cited_by":49,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Artificial Intelligence in Medicine (Canada)","funders":"","keywords":"Computer science; Meaning (existential); GRASP; Embodied cognition; Word (group theory); Object (grammar); Artificial intelligence; Set (abstract data type); Situated; Natural language processing; Cognitive science; Linguistics; Psychology","score_opus":0.08089182453829412,"score_gpt":0.35316585847476006,"score_spread":0.27227403393646593,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2097173997","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.78291535,0.000043657026,0.00017654429,0.00032363704,0.00047875455,0.00009171133,1.8469261e-7,0.00008923221,0.21588093],"genre_scores_gemma":[0.99586093,0.000047355432,0.00011253885,0.00019366849,0.00010627661,0.0000062303143,4.4272076e-7,0.0000018366214,0.0036707025],"study_design_codex":"qualitative","study_design_gemma":"observational","domain_scores_codex":[0.9989544,0.000051536113,0.000104128005,0.00020792488,0.00041169956,0.0002703058],"domain_scores_gemma":[0.99966437,0.00002513431,0.00003990223,0.00008566642,0.000103037986,0.00008191806],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007292208,0.000045202014,0.000060064576,0.00011689971,0.0011901248,0.0000513203,0.00020818415,0.00003344862,0.00029127154],"category_scores_gemma":[0.00055359135,0.000040084553,0.00002099812,0.0014658162,0.000496563,0.0007787753,0.000028473514,0.0000683738,0.0001222914],"study_design_candidate":"observational","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.000058887195,0.00022700176,0.1165125,0.000011567659,0.000008545977,0.000102591126,0.44450092,0.00075365335,0.038037185,0.31274942,0.008441923,0.078595825],"study_design_scores_gemma":[0.0023748567,0.00017066128,0.5565177,0.00016862502,0.000016346317,0.00008433474,0.15686148,0.003437309,0.026684543,0.021429049,0.23080257,0.0014524859],"about_ca_topic_score_codex":0.0024168247,"about_ca_topic_score_gemma":0.0021954207,"teacher_disagreement_score":0.44000524,"about_ca_system_score_codex":0.00021830994,"about_ca_system_score_gemma":0.00020412756,"threshold_uncertainty_score":0.9153598},"labels":[],"label_agreement":null},{"id":"W2099141349","doi":"10.1080/09540090701528951","title":"A systematic comparison of flat and standard cascade-correlation using a student–teacher network approximation task","year":2007,"lang":"en","type":"article","venue":"Connection Science","topic":"Neural Networks and Applications","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"Natural Sciences and Engineering Research Council of Canada; McGill University","keywords":"Cascade; Computer science; Task (project management); Artificial intelligence; Connection (principal bundle); Layer (electronics); Algorithm; Mathematics; Geometry","score_opus":0.0323057393688994,"score_gpt":0.3358260682264963,"score_spread":0.3035203288575969,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2099141349","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.36472058,0.00017534196,0.63432723,0.000038279035,0.00022004271,0.00031308245,2.599611e-7,0.00004327305,0.00016187062],"genre_scores_gemma":[0.98420495,0.0000034795087,0.015669404,0.000026403115,0.00006152229,0.000009711439,5.258929e-7,0.00000389695,0.000020112331],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983992,0.000051786235,0.000465623,0.00034658512,0.00049378315,0.00024300459],"domain_scores_gemma":[0.99886495,0.00017246255,0.00035911633,0.00031442344,0.00020065747,0.00008837075],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020684877,0.00009521042,0.00021507488,0.00014412122,0.00044959947,0.00018241318,0.00036056794,0.00004382799,0.0000017937821],"category_scores_gemma":[0.000080333084,0.000084055086,0.000029037801,0.0015783508,0.00017224658,0.0007439059,0.00013602976,0.000103807804,0.0000024680112],"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.0000793036,0.0003805813,0.085123055,0.0023036355,0.00010232475,0.000006250674,0.023620114,0.21534166,0.22144029,0.39725804,0.00049242115,0.053852346],"study_design_scores_gemma":[0.00016636137,0.000059328482,0.0061023156,0.00029341975,0.000020237181,0.000023300161,0.00031708353,0.98793346,0.0037234784,0.0012132098,0.000026038328,0.00012178496],"about_ca_topic_score_codex":0.0000151991535,"about_ca_topic_score_gemma":0.000012500601,"teacher_disagreement_score":0.77259177,"about_ca_system_score_codex":0.000085127685,"about_ca_system_score_gemma":0.00004953813,"threshold_uncertainty_score":0.3458001},"labels":[],"label_agreement":null},{"id":"W2122080917","doi":"10.1080/09540091.2013.801934","title":"Computational models of location-invariant orthographic processing","year":2013,"lang":"en","type":"article","venue":"Connection Science","topic":"Reading and Literacy Development","field":"Psychology","cited_by":16,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Network topology; Artificial neural network; Topology (electrical circuits); Connectionism; Artificial intelligence; Coding (social sciences); Decoding methods; Algorithm; Theoretical computer science; Speech recognition; Mathematics","score_opus":0.03525270116472738,"score_gpt":0.3158921002005315,"score_spread":0.2806393990358041,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2122080917","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7153754,0.00008612773,0.26846254,0.00025274447,0.00044576795,0.00016206494,6.2124985e-7,0.000050852617,0.015163872],"genre_scores_gemma":[0.99520934,7.0641875e-7,0.0042249155,0.00012164323,0.000018321358,0.000037828242,0.0000019849977,0.000003405345,0.00038184866],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.99915105,0.000023893042,0.00021067582,0.00023479303,0.00023706771,0.00014251545],"domain_scores_gemma":[0.99906623,0.00005570046,0.00010739871,0.0001219103,0.00059352326,0.000055215314],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042482308,0.00005338496,0.00006991664,0.0002594018,0.00018276779,0.00006563467,0.00014477069,0.000023278528,0.00026519495],"category_scores_gemma":[0.00004926424,0.00004709535,0.000015821086,0.0012173539,0.00025580748,0.00048505559,0.000016802414,0.000047224614,0.000091488466],"study_design_candidate":"observational","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.000042593652,0.0004534814,0.0433494,0.000095583964,0.000044264514,0.0000028453915,0.035002634,0.11298113,0.006498054,0.5254809,0.0025454166,0.27350366],"study_design_scores_gemma":[0.0004924639,0.000076284785,0.5640807,0.00010680534,0.000008086571,0.00006224408,0.0021144,0.3861963,0.0005785334,0.045383982,0.00062675,0.00027348966],"about_ca_topic_score_codex":0.00010198486,"about_ca_topic_score_gemma":0.0000011221935,"teacher_disagreement_score":0.5207313,"about_ca_system_score_codex":0.000020126146,"about_ca_system_score_gemma":0.00016562107,"threshold_uncertainty_score":0.2903699},"labels":[],"label_agreement":null},{"id":"W2138491947","doi":"10.1080/09540090500140958","title":"Biologically plausible visual homing methods based on optical flow techniques","year":2005,"lang":"en","type":"article","venue":"Connection Science","topic":"Advanced Vision and Imaging","field":"Computer Science","cited_by":128,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Computer science; Homing (biology); Optical flow; Computer vision; Artificial intelligence; Snapshot (computer storage); Robot; Image (mathematics)","score_opus":0.03441657112114787,"score_gpt":0.41362497695960343,"score_spread":0.37920840583845555,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2138491947","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.0012243442,0.000009969912,0.98726434,0.0021697578,0.0002801799,0.000103491046,2.1006062e-7,0.00049733825,0.008450361],"genre_scores_gemma":[0.28866065,0.0000021894878,0.7082712,0.0029428275,0.00006523838,0.000009811108,1.6893179e-7,0.000003295823,0.000044581782],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99831367,0.000082644816,0.00021094196,0.0006557383,0.0003740284,0.00036297465],"domain_scores_gemma":[0.99889064,0.00034640057,0.00007011821,0.00032556753,0.00016542735,0.00020183218],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018210452,0.00012832369,0.00013368342,0.00033404786,0.0004738566,0.0002951569,0.00080566696,0.000046665165,0.00008616895],"category_scores_gemma":[0.0012689532,0.000101673664,0.000048872593,0.001312211,0.00030278097,0.0011401819,0.00022295071,0.00017856927,0.000080269965],"study_design_candidate":"design_other","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.0000056395324,0.000044173725,0.000041440424,8.931765e-7,3.9468253e-7,0.0000011302467,0.000022930291,0.001325651,0.10517304,0.008643154,0.00006191164,0.8846796],"study_design_scores_gemma":[0.0000872661,0.0001268359,0.0003708193,0.000014428854,6.0769804e-7,0.000008688661,0.00000832215,0.68383926,0.305241,0.00039309394,0.009795615,0.000114068884],"about_ca_topic_score_codex":0.0000010645456,"about_ca_topic_score_gemma":5.272048e-7,"teacher_disagreement_score":0.8845656,"about_ca_system_score_codex":0.0001243768,"about_ca_system_score_gemma":0.00017375333,"threshold_uncertainty_score":0.41461316},"labels":[],"label_agreement":null},{"id":"W2144702158","doi":"10.1080/09540091.2012.664121","title":"Strong systematicity through sensorimotor conceptual grounding: an unsupervised, developmental approach to connectionist sentence processing","year":2012,"lang":"en","type":"article","venue":"Connection Science","topic":"Language Development and Disorders","field":"Psychology","cited_by":30,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Connectionism; Computer science; Language acquisition; Noun; Natural language processing; Artificial intelligence; Sentence; Grammar; Verb; Semantics (computer science); Cognitive science; Psychology; Linguistics; Artificial neural network","score_opus":0.10785188853572673,"score_gpt":0.35463739784119014,"score_spread":0.2467855093054634,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2144702158","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.85587656,0.00010632999,0.06617812,0.00006242125,0.0020407967,0.0006552857,0.00000375735,0.00024364005,0.0748331],"genre_scores_gemma":[0.9880589,6.1991085e-7,0.010370829,0.00046512095,0.00024970775,0.000145112,0.000011702391,0.000017917775,0.00068005954],"study_design_codex":"qualitative","study_design_gemma":"qualitative","domain_scores_codex":[0.99732894,0.00014267348,0.0004081721,0.0006906601,0.00060525263,0.0008243052],"domain_scores_gemma":[0.99890167,0.0000676601,0.00014708827,0.00027196752,0.00024275854,0.00036887664],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012648866,0.00024339579,0.0002496393,0.00019940664,0.0012511744,0.00030675635,0.0004220171,0.00008817706,0.00032728113],"category_scores_gemma":[0.0002731715,0.00022177107,0.000040859475,0.0013664216,0.00058552844,0.0020897908,0.00009691307,0.00015250288,0.00034917603],"study_design_candidate":"qualitative","study_design_consensus":"qualitative","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.00028853814,0.002411024,0.1480476,0.00035675577,0.000121142715,0.0000118984335,0.52310187,0.00017334508,0.021727813,0.2867208,0.0017231609,0.015316037],"study_design_scores_gemma":[0.0018994627,0.00024329053,0.09739183,0.00014092412,0.000053609165,0.00066815206,0.8861686,0.0014590557,0.003970237,0.00010784441,0.0064117745,0.0014851954],"about_ca_topic_score_codex":0.00025199182,"about_ca_topic_score_gemma":0.000015672313,"teacher_disagreement_score":0.36306673,"about_ca_system_score_codex":0.0003719022,"about_ca_system_score_gemma":0.00022078973,"threshold_uncertainty_score":0.96231484},"labels":[],"label_agreement":null},{"id":"W2167061460","doi":"10.1080/09540090500138176","title":"Lost in time: rats are unable to return to a start location that varies","year":2005,"lang":"en","type":"article","venue":"Connection Science","topic":"Memory and Neural Mechanisms","field":"Neuroscience","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Path integration; Computer science; Task (project management); Reset (finance); Foraging; Radial arm maze; Simulation; Psychology; Neuroscience; Artificial intelligence; Biology; Working memory; Ecology","score_opus":0.10467774148628191,"score_gpt":0.3225494296110698,"score_spread":0.2178716881247879,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2167061460","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9905718,0.0000052076093,0.0025354237,0.0044743405,0.00051625475,0.00040748806,0.0000029333544,0.000072438954,0.0014141452],"genre_scores_gemma":[0.9897104,0.0000023536932,0.00031265817,0.006147411,0.00006517709,0.000025845713,2.0343894e-7,0.0000068129903,0.003729165],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99821234,0.00007742601,0.00016801376,0.0006545386,0.00052695244,0.00036074314],"domain_scores_gemma":[0.99917006,0.00013431144,0.000064703556,0.0003253013,0.00009473001,0.00021090735],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0007846467,0.0001104764,0.000117239884,0.00034752776,0.00035392004,0.00022131075,0.00046436174,0.000035209094,0.00029607248],"category_scores_gemma":[0.0020291568,0.000103595055,0.000015500327,0.0026768805,0.0001157815,0.0009599951,0.00012932296,0.00010763876,0.0020432654],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","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.000040275812,0.00003032756,0.00018863249,0.0000036209697,1.12452646e-7,0.0000045544493,0.00045026426,0.0011846514,0.9955704,0.000683678,0.0005170185,0.0013264702],"study_design_scores_gemma":[0.000105427476,0.00011243107,0.0013148274,0.00003690655,9.864058e-7,0.000017593375,0.00013241018,0.0028462978,0.9913647,0.00044075248,0.0034878815,0.00013976937],"about_ca_topic_score_codex":0.000007542417,"about_ca_topic_score_gemma":0.00008091369,"teacher_disagreement_score":0.0042056777,"about_ca_system_score_codex":0.00015270675,"about_ca_system_score_gemma":0.000095975876,"threshold_uncertainty_score":0.99873376},"labels":[],"label_agreement":null},{"id":"W3029409054","doi":"10.1080/09540091.2020.1762542","title":"Using machine learning techniques for DSP software performance prediction at source code level","year":2020,"lang":"en","type":"article","venue":"Connection Science","topic":"Software System Performance and Reliability","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":"Ericsson (Canada)","funders":"College of Science and Health; William Paterson University of New Jersey","keywords":"Computer science; Benchmark (surveying); Digital signal processing; Source code; Software; Weighting; Metric (unit); Cluster analysis; Code (set theory); Algorithm; Machine learning; Set (abstract data type); Artificial intelligence; Parallel computing; Computer hardware; Programming language","score_opus":0.09108481918103552,"score_gpt":0.29605943273421,"score_spread":0.20497461355317448,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3029409054","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.26934046,0.00004572609,0.7286504,0.0002719386,0.0004602968,0.0003298565,0.000008404334,0.00084724324,0.000045681852],"genre_scores_gemma":[0.91265804,0.000018840545,0.08656991,0.00033906286,0.00018276117,0.000045977784,0.000004021514,0.000012727335,0.00016868806],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99793965,0.000046102432,0.0003352526,0.0007496115,0.0005004969,0.0004288641],"domain_scores_gemma":[0.9987339,0.00012331663,0.00019490228,0.0003650738,0.000388925,0.00019389663],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0013480565,0.0001675144,0.00018853818,0.00014612185,0.0015614841,0.0002068397,0.0007905495,0.00008304479,0.000010668374],"category_scores_gemma":[0.00084126904,0.00014891707,0.000074568474,0.0012205222,0.0002450536,0.0018167921,0.00038555037,0.00018881375,0.000023231467],"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.00021000195,0.00011072093,0.5493734,0.0007485099,0.000029942721,0.000002538837,0.0070393104,0.037079584,0.197084,0.000647058,0.00058405066,0.20709088],"study_design_scores_gemma":[0.0002493357,0.00029332805,0.003687848,0.00004485947,0.000005993816,0.000044594566,0.00004178469,0.86604166,0.1129543,0.000033585646,0.016399417,0.0002032795],"about_ca_topic_score_codex":0.000026788248,"about_ca_topic_score_gemma":0.000005589747,"teacher_disagreement_score":0.8289621,"about_ca_system_score_codex":0.00030916685,"about_ca_system_score_gemma":0.00022211282,"threshold_uncertainty_score":0.99973834},"labels":[],"label_agreement":null},{"id":"W3217452736","doi":"10.1080/09540091.2021.2002266","title":"A conditional opposition-based particle swarm optimisation for feature selection","year":2021,"lang":"en","type":"article","venue":"Connection Science","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":22,"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":"Particle swarm optimization; Metaheuristic; Computer science; Feature selection; Swarm behaviour; Benchmark (surveying); Artificial intelligence; Feature (linguistics); Machine learning; Selection (genetic algorithm); Multi-swarm optimization; Convergence (economics); Mathematical optimization; Data mining; Mathematics","score_opus":0.0388511532403716,"score_gpt":0.3306135890364989,"score_spread":0.2917624357961273,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3217452736","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.004662625,0.000024929097,0.9889226,0.0050327517,0.00051569106,0.0002858036,0.000014312615,0.00017736538,0.00036393668],"genre_scores_gemma":[0.6515935,0.0000029287814,0.34674925,0.00076090934,0.0001036711,0.00012191727,0.000054733482,0.000007532745,0.0006055501],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99795204,0.00009804506,0.0002070317,0.00064569886,0.0007541533,0.0003429982],"domain_scores_gemma":[0.99700934,0.000344207,0.000100190955,0.0003308037,0.0020266348,0.00018884437],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010462116,0.00010593797,0.00011518513,0.00020015243,0.0008531093,0.00065236253,0.00043027083,0.00005592311,0.00010969941],"category_scores_gemma":[0.001464055,0.00011233649,0.00006220331,0.0025655369,0.00018437399,0.0010781704,0.000074680465,0.00011314184,0.000039790364],"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.00004186332,0.00046820505,0.0006647252,0.000050803865,0.000028742674,0.000013946693,0.00031667494,0.36057198,0.26016605,0.35070467,0.0058274274,0.021144927],"study_design_scores_gemma":[0.0004207398,0.000058345588,0.0008525904,0.0000050445697,0.0000038007906,0.000026585809,0.00001906386,0.7196536,0.27568898,0.0018349497,0.0013322539,0.00010400567],"about_ca_topic_score_codex":0.000004419789,"about_ca_topic_score_gemma":0.0000041561357,"teacher_disagreement_score":0.6469309,"about_ca_system_score_codex":0.0002117506,"about_ca_system_score_gemma":0.0012592014,"threshold_uncertainty_score":0.6561513},"labels":[],"label_agreement":null},{"id":"W4280509474","doi":"10.1080/09540091.2022.2032602","title":"A blockchain-based lightweight authentication and key agreement scheme for internet of vehicles","year":2022,"lang":"en","type":"article","venue":"Connection Science","topic":"Vehicular Ad Hoc Networks (VANETs)","field":"Engineering","cited_by":24,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Novelis (Canada)","funders":"","keywords":"Computer science; Authentication (law); Computer security; The Internet; Authentication protocol; Internet security; Key (lock); Lightweight Extensible Authentication Protocol; Data Authentication Algorithm; Computer network; Security analysis; Information security; Security service; World Wide Web","score_opus":0.012585248154848143,"score_gpt":0.22786738568543966,"score_spread":0.2152821375305915,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4280509474","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9585314,0.00018813506,0.04033514,0.00014880944,0.00031630407,0.00024350823,0.0000049973946,0.000070067894,0.00016165203],"genre_scores_gemma":[0.9979588,0.000001622556,0.0017955407,0.000040031005,0.00002317824,0.00008946584,0.0000029301293,0.000007790149,0.000080690974],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992507,0.000014812059,0.00015142879,0.00018702856,0.00023374608,0.00016225936],"domain_scores_gemma":[0.9996306,0.00005905898,0.00004493991,0.00014357334,0.000070102156,0.00005178319],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005688828,0.0000659367,0.00008134021,0.00014513922,0.00014874009,0.00002428259,0.00016026093,0.000015400366,0.000056916408],"category_scores_gemma":[0.000047283695,0.000070327835,0.000025953506,0.00039152845,0.00010658033,0.00003673333,0.000053738517,0.00006329605,0.0000020681787],"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.00002680697,0.000054199787,0.0010221365,0.00008114388,0.00002072716,8.514999e-7,0.0011570603,0.7076027,0.27477264,0.0092548765,0.0008468751,0.005160008],"study_design_scores_gemma":[0.0002483275,0.000072966206,0.00073951075,0.000010344134,0.0000067837404,0.000003577194,0.000077996076,0.9369504,0.05637508,0.00015156611,0.005286397,0.00007704112],"about_ca_topic_score_codex":0.0000064690557,"about_ca_topic_score_gemma":0.0000052845608,"teacher_disagreement_score":0.22934775,"about_ca_system_score_codex":0.000107010346,"about_ca_system_score_gemma":0.000036663525,"threshold_uncertainty_score":0.28678858},"labels":[],"label_agreement":null},{"id":"W4391578484","doi":"10.1080/09540091.2024.2306962","title":"AICOM-MP: an AI-based monkeypox detector for resource-constrained environments","year":2024,"lang":"en","type":"article","venue":"Connection Science","topic":"Poxvirus research and outbreaks","field":"Immunology and Microbiology","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Monkeypox; Computer science; Detector; Artificial intelligence; Telecommunications; Vaccinia; Chemistry","score_opus":0.027466003455839966,"score_gpt":0.308521640929578,"score_spread":0.2810556374737381,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4391578484","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.91859514,0.00148082,0.07220631,0.0015048296,0.002209748,0.00090534013,0.00019388532,0.0004249962,0.002478934],"genre_scores_gemma":[0.9973791,0.000004974494,0.00012640486,0.0004344857,0.000050544728,0.000065169916,0.000030827257,0.00001104761,0.0018974455],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99866384,0.00007721592,0.00015904283,0.0005175658,0.00009046157,0.0004918486],"domain_scores_gemma":[0.9993396,0.00024027466,0.000026448173,0.0002738397,0.000035770492,0.00008411272],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00076903636,0.00011597148,0.00011424173,0.00028815624,0.0005279124,0.00012028417,0.00034777692,0.00010708047,0.0004940107],"category_scores_gemma":[0.0003588742,0.00009973082,0.0000687002,0.00038452478,0.0009924317,0.000324009,0.000046958085,0.00020673488,0.00051222875],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","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.00009672176,0.000037292168,0.00009992447,0.000010444578,0.000012794725,0.0000027279018,0.000104559425,0.000034649616,0.9559427,0.000763281,0.0010220011,0.04187294],"study_design_scores_gemma":[0.0005936348,0.00035877177,0.00077815045,0.000019287636,0.0000092661385,0.000023869541,0.00011607137,0.0033701633,0.6226827,0.0002871891,0.37161982,0.00014107699],"about_ca_topic_score_codex":0.000028495093,"about_ca_topic_score_gemma":0.000017359389,"teacher_disagreement_score":0.3705978,"about_ca_system_score_codex":0.00010063961,"about_ca_system_score_gemma":0.0002776821,"threshold_uncertainty_score":0.65838355},"labels":[],"label_agreement":null},{"id":"W4405995766","doi":"10.1080/09540091.2024.2445249","title":"Towards enhanced assessment question classification: a study using machine learning, deep learning, and generative AI","year":2025,"lang":"en","type":"article","venue":"Connection Science","topic":"Topic Modeling","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Quest University Canada","funders":"","keywords":"Computer science; Artificial intelligence; Generative grammar; Machine learning; Deep learning","score_opus":0.041588579686941005,"score_gpt":0.37815509574483697,"score_spread":0.33656651605789595,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4405995766","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.28163552,0.0000730481,0.71581084,0.00065807655,0.00043589718,0.00020155031,6.957239e-8,0.00013143262,0.0010535631],"genre_scores_gemma":[0.9642012,0.000017325603,0.035045557,0.0001530865,0.00003620494,0.00002806717,5.1546584e-7,0.0000034712689,0.00051458186],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981341,0.00026733006,0.00022177106,0.00074661215,0.00041102976,0.00021915682],"domain_scores_gemma":[0.99908566,0.00005584081,0.00013394513,0.00027817526,0.00037208147,0.000074263306],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015262692,0.00012577277,0.00013971125,0.0003169206,0.0010340724,0.0005430522,0.0004011063,0.0000393997,0.000010088541],"category_scores_gemma":[0.0003548007,0.00012173396,0.000021176173,0.0012532815,0.00016148844,0.00088406535,0.0003005954,0.00030948242,0.0000027726378],"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.000015550337,0.0003409715,0.10834135,0.00003117918,0.00004164594,0.0000065670424,0.008470469,0.04387494,0.23313935,0.22672,0.000011531001,0.37900645],"study_design_scores_gemma":[0.00027072174,0.00013744178,0.019185804,0.000017410788,0.000007727737,0.0000055075147,0.00065444375,0.9733596,0.004915063,0.00082869927,0.0004939466,0.00012364026],"about_ca_topic_score_codex":0.00012619303,"about_ca_topic_score_gemma":0.00006163196,"teacher_disagreement_score":0.92948467,"about_ca_system_score_codex":0.00026901736,"about_ca_system_score_gemma":0.00034365,"threshold_uncertainty_score":0.7953353},"labels":[],"label_agreement":null}]}