{"meta":{"query_hash":"26bb6e09cf85","filters":{"venue":"Journal of Algorithms & Computational Technology"},"cohort_total":4,"direct_labels_cover":0,"predictions_cover":4,"exported":4,"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/26bb6e09cf85","api":"https://metacan.xera.ac/api/v1/cohort?venue=Journal+of+Algorithms+%26+Computational+Technology"},"results":[{"id":"W2026243033","doi":"10.1260/1748-3018.9.2.143","title":"Quantum-Behaved Particle Swarm Optimization with Novel Adaptive Strategies","year":2015,"lang":"en","type":"article","venue":"Journal of Algorithms & Computational Technology","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":11,"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":"Particle swarm optimization; Benchmark (surveying); Multi-swarm optimization; Position (finance); Attractor; Metaheuristic; Mathematical optimization; Swarm behaviour; Computer science; Swarm intelligence; Global optimization; Mathematics; Algorithm","score_opus":0.05256136336976503,"score_gpt":0.3081965978010415,"score_spread":0.2556352344312765,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2026243033","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.021909136,0.0005200941,0.9729028,0.00015736293,0.000067742556,0.000046117002,0.000013400349,0.000121709476,0.004261649],"genre_scores_gemma":[0.79615366,0.0006445115,0.19965969,0.00018398414,0.000088231274,0.00022795926,0.000052193303,0.000041549953,0.002948122],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99967957,0.00010504562,0.00001897039,0.00004352519,0.0001282115,0.000024753004],"domain_scores_gemma":[0.99960965,0.00017132553,0.000059450125,0.00004174597,0.00009468951,0.0000231067],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007506605,0.0005547429,0.0006971466,0.00044227118,0.00033711345,0.0007559785,0.0010393636,0.00090407673,0.0007115788],"category_scores_gemma":[0.0015499147,0.0003119421,0.00059101003,0.0005322767,0.0007057778,0.0007516215,0.0007929142,0.0005742153,0.00018260968],"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.000042358974,0.000052251657,0.0007668483,0.0000752815,0.00006596491,0.00010810906,0.00008384135,0.9057981,0.0051927273,0.036270756,0.0010088033,0.050534904],"study_design_scores_gemma":[0.000007637468,0.000021122447,0.00006690095,0.000002705863,0.0000056390563,0.0000147841165,0.0000030364313,0.99712664,0.00020145408,0.0021193775,0.0004262573,0.00000441922],"about_ca_topic_score_codex":0.0014188213,"about_ca_topic_score_gemma":0.0011403733,"teacher_disagreement_score":0.0014188213,"about_ca_system_score_codex":0.0003629243,"about_ca_system_score_gemma":0.0004967204,"threshold_uncertainty_score":0.0039699078},"labels":[],"label_agreement":null},{"id":"W2037754626","doi":"10.1260/174830108788251773","title":"A Degree-Based Clustering Technique for VLSI Placement","year":2009,"lang":"en","type":"article","venue":"Journal of Algorithms & Computational Technology","topic":"VLSI and FPGA Design Techniques","field":"Engineering","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":"University of Calgary","funders":"","keywords":"Cluster analysis; Preprocessor; Degree (music); Computer science; Benchmark (surveying); Very-large-scale integration; IBM; Data pre-processing; Data mining; Algorithm; Artificial intelligence","score_opus":0.020368278343021715,"score_gpt":0.2692007815564009,"score_spread":0.2488325032133792,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2037754626","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.0025958333,0.0002765239,0.9954721,0.00008631177,0.00005084848,0.000044493598,0.00004054203,0.00027179817,0.0011615065],"genre_scores_gemma":[0.09089295,0.0007675288,0.9039704,0.00010944113,0.000096512034,0.00012601042,0.00026550112,0.0001726929,0.0035989203],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988777,0.00021383651,0.000062209736,0.00024122161,0.00053743675,0.00006766702],"domain_scores_gemma":[0.99897987,0.00029774004,0.000108263375,0.0002312453,0.00034386627,0.00003893005],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007554819,0.00089348527,0.0008281545,0.0019598186,0.0011161211,0.00083176716,0.0014343534,0.00094132894,0.0026613495],"category_scores_gemma":[0.0028132629,0.00054036477,0.0012435106,0.0028896458,0.00069109484,0.0011889514,0.0010654462,0.0012894874,0.0014819934],"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.00014432525,0.00007020897,0.00088669243,0.00047551564,0.00018729105,0.00012950366,0.00033599697,0.25002936,0.055755876,0.0705457,0.0076557784,0.61378384],"study_design_scores_gemma":[0.000055139473,0.00031623212,0.0017997557,0.00008115737,0.000118116615,0.00085478567,0.00017809564,0.8509164,0.03498391,0.05275753,0.057802007,0.00013686408],"about_ca_topic_score_codex":0.002888434,"about_ca_topic_score_gemma":0.0043754037,"teacher_disagreement_score":0.002888434,"about_ca_system_score_codex":0.0011791606,"about_ca_system_score_gemma":0.0011175589,"threshold_uncertainty_score":0.008903086},"labels":[],"label_agreement":null},{"id":"W4312743307","doi":"10.1177/17483026221130680","title":"Using data-mining techniques to improve combinatorial optimization algorithms","year":2022,"lang":"en","type":"article","venue":"Journal of Algorithms & Computational Technology","topic":"VLSI and FPGA Design Techniques","field":"Engineering","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":"University of British Columbia","funders":"","keywords":"Computer science; Heuristics; Cluster analysis; Simulated annealing; Algorithm; Granularity; Data mining; Machine learning","score_opus":0.0296336662235397,"score_gpt":0.2934519870529521,"score_spread":0.2638183208294124,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4312743307","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.010293136,0.0005838523,0.9850781,0.0006063277,0.000101556274,0.00012702806,0.00019780941,0.0013426407,0.0016696554],"genre_scores_gemma":[0.07451958,0.00041710574,0.92314243,0.00026871724,0.00007325325,0.00022515505,0.00053671096,0.00023663223,0.0005804937],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9967636,0.0011139538,0.0003303105,0.0006006834,0.0010423864,0.00014896556],"domain_scores_gemma":[0.9854779,0.008646113,0.0009793747,0.0021947878,0.0025514865,0.00015024691],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0056331307,0.002353254,0.0019179016,0.004108284,0.0011022063,0.0024881528,0.002841245,0.0018221153,0.002265113],"category_scores_gemma":[0.025981953,0.0013988927,0.0022774865,0.003470595,0.001002098,0.0039881202,0.0015688938,0.0035184799,0.001056168],"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.00018200222,0.00043774594,0.005880488,0.00043006052,0.0004302238,0.00011733578,0.00015761933,0.684197,0.0035393753,0.02227756,0.0033207114,0.27902982],"study_design_scores_gemma":[0.00004418815,0.00007350037,0.00030775502,0.000044258664,0.00004548929,0.00004180818,0.000037537455,0.9710744,0.0031863826,0.02224529,0.0028842667,0.000015022208],"about_ca_topic_score_codex":0.0033683057,"about_ca_topic_score_gemma":0.00493694,"teacher_disagreement_score":0.0056331307,"about_ca_system_score_codex":0.0014959394,"about_ca_system_score_gemma":0.0023032627,"threshold_uncertainty_score":0.029791176},"labels":[],"label_agreement":null},{"id":"W4399122124","doi":"10.1177/17483026241252407","title":"Inverse matrices with applications in public-key cryptography","year":2024,"lang":"en","type":"article","venue":"Journal of Algorithms & Computational Technology","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":2,"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 Victoria","funders":"","keywords":"Key (lock); Cryptography; Public-key cryptography; Inverse; Mathematics; Computer science; Theoretical computer science; Computer security; Encryption; Geometry","score_opus":0.007177399161255579,"score_gpt":0.21938210511347173,"score_spread":0.21220470595221613,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4399122124","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.011390389,0.016014665,0.90783495,0.00210762,0.0014227467,0.00008610886,0.00006607322,0.00036213858,0.06071529],"genre_scores_gemma":[0.38319921,0.03177873,0.55134463,0.0013340566,0.0040393146,0.00029818027,0.00019155176,0.00024123411,0.027573131],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991503,0.00028729494,0.000047637084,0.00012938105,0.0003148257,0.00007054197],"domain_scores_gemma":[0.9986972,0.0007185762,0.00011975544,0.00020066359,0.00020905508,0.00005472742],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007575831,0.0009637994,0.0005381664,0.0014600147,0.0008591339,0.0014543724,0.0005538165,0.0013874506,0.004030716],"category_scores_gemma":[0.0034646003,0.0003742622,0.0005887864,0.002030333,0.0022108636,0.0026527517,0.001458443,0.0029807081,0.0019379809],"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.00003583896,0.000043777593,0.00015609791,0.0001524351,0.000007435007,0.00015730826,0.00016176491,0.011971514,0.0031695997,0.9154489,0.0028080496,0.06588729],"study_design_scores_gemma":[0.000014577543,0.00007450286,0.00008970038,0.000082144936,0.000008580507,0.00046302672,0.000056221303,0.04749881,0.0035918122,0.91568816,0.032397337,0.000035125533],"about_ca_topic_score_codex":0.0003150462,"about_ca_topic_score_gemma":0.00027669474,"teacher_disagreement_score":0.004030716,"about_ca_system_score_codex":0.00056541635,"about_ca_system_score_gemma":0.0005887294,"threshold_uncertainty_score":0.013484061},"labels":[],"label_agreement":null}]}