{"meta":{"page":1,"per_page":50,"max_per_page":100,"total":3,"total_is_capped":false,"direct_labels_cover":0,"predictions_cover":3,"direct_label_status":"direct model label, unvalidated","prediction_status":"machine_predicted_unvalidated (Codex and Gemma teacher distillation)","score_status":"score_only:v0-immature-baseline (scores rank; they never assert a category)","snapshot":{"source":"OpenAlex, pinned release, all 482 partitions","release":"2026-06-24","frame_built":"2026-07-12","author_layer_release":"2026-06-26"},"query_hash":"007fa30c8afc","filters":{"venue":"International Journal of High Performance Systems Architecture"}},"results":[{"id":"W2100208842","doi":"10.1504/ijhpsa.2008.024207","title":"Genetic programming on GPUs for image processing","year":2008,"lang":"en","type":"article","venue":"International Journal of High Performance Systems Architecture","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":41,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Memorial University of Newfoundland","funders":"","keywords":"Computer science; Graphics; Genetic programming; Task (project management); Image processing; General-purpose computing on graphics processing units; Computer graphics; CUDA; Enhanced Data Rates for GSM Evolution; Noise (video); Image (mathematics); Artificial intelligence; Parallel computing; Computer graphics (images)","authors":[{"name":"Simon Harding","is_ca":true},{"name":"Wolfgang Banzhaf","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01007249681126036,"gpt":0.2481149584042075,"spread":0.2380424615929471,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003385969,0.0003376268,0.0004028405,0.0003817343,0.0004137555,0.0008030441,0.0009223436,0.0006969403,0.003953551],"category_scores_gemma":[0.001338538,0.0002671133,0.0004861794,0.000730511,0.0005883054,0.0004554815,0.0005903083,0.001402105,0.0008585921],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007648949,"about_ca_system_score_gemma":0.0006806763,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002831969,"about_ca_topic_score_gemma":0.00350767,"domain_scores_codex":[0.999775,0.00006482175,0.0000105057,0.00002898671,0.00009748294,0.00002322599],"domain_scores_gemma":[0.9997202,0.0001094958,0.00001653046,0.00005195271,0.0000806094,0.00002129266],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00012825,0.00009486797,0.001429943,0.0002429717,0.00009716633,0.0003401828,0.0002419792,0.4967374,0.03707523,0.2054142,0.01550603,0.2426918],"study_design_scores_gemma":[0.00003557092,0.00003691073,0.0003366456,0.00002913557,0.00001568715,0.00009069841,0.00002475941,0.9175705,0.005397921,0.05209468,0.02435333,0.00001422611],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03546848,0.001157216,0.9379631,0.0008154675,0.0002834864,0.00007581236,0.0001215786,0.00285572,0.02125911],"genre_scores_gemma":[0.2442312,0.00118132,0.7431207,0.0003067545,0.00006929116,0.0002343674,0.0002603106,0.0005523256,0.01004386],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003953551,"threshold_uncertainty_score":0.01322591,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2006129815","doi":"10.1504/ijhpsa.2008.024206","title":"Particle swarm optimisation for the design of two-connected networks with bounded rings","year":2008,"lang":"en","type":"article","venue":"International Journal of High Performance Systems Architecture","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Brock University","funders":"Natural Sciences and Engineering Research Council of Canada; Academy of Finland","keywords":"Computer science; Particle swarm optimization; Bounded function; Swarm behaviour; Distributed computing; Mathematical optimization; Topology (electrical circuits); Parallel computing; Algorithm; Artificial intelligence; Mathematics","authors":[{"name":"Earl Brendan. Foxwell","is_ca":true},{"name":"Beatrice Ombuki-Berman","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02344144785144605,"gpt":0.2599435457719732,"spread":0.2365020979205271,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001154984,0.0007499065,0.0008235572,0.0007124532,0.000523146,0.00102323,0.0009031851,0.001142444,0.00184342],"category_scores_gemma":[0.002639365,0.0005565107,0.0007245541,0.0004983594,0.0008986322,0.0007120197,0.0007781842,0.0007311194,0.000245656],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009123307,"about_ca_system_score_gemma":0.001084188,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002830426,"about_ca_topic_score_gemma":0.002563821,"domain_scores_codex":[0.9996378,0.0001541001,0.00001563841,0.00005414511,0.0001018614,0.00003645476],"domain_scores_gemma":[0.9991604,0.0005346418,0.0001048877,0.00004116409,0.0001135584,0.00004530107],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0000143228,0.000008807577,0.000102207,0.00002348275,0.000009400998,0.00002735637,0.00001630684,0.9906144,0.0003905996,0.004567917,0.0001146503,0.004110501],"study_design_scores_gemma":[0.000008622267,0.00001236371,0.00002201758,0.000003448892,0.000003224214,0.000004676994,0.000003981677,0.9977423,0.0001173438,0.001758014,0.000322363,0.000001693722],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02663073,0.0004075103,0.9674497,0.0001981493,0.00004304354,0.00009189026,0.00003282402,0.0001572278,0.004988852],"genre_scores_gemma":[0.6309332,0.0004913241,0.3619864,0.00008296181,0.00002718116,0.0004864779,0.0001007411,0.00008033958,0.005811376],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.002830426,"threshold_uncertainty_score":0.006619394,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2133323787","doi":"10.1504/ijhpsa.2011.040467","title":"A RISC architecture for 2DLNS-based signal processing","year":2011,"lang":"en","type":"article","venue":"International Journal of High Performance Systems Architecture","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Windsor","funders":"CMC Microsystems","keywords":"Computer science; Digital signal processing; Architecture; Computer architecture; Parallel computing; Computation; Signal processing; Representation (politics); Multiplication (music); Coprocessor; Reduced instruction set computing; Embedded system; Instruction set; Computer hardware; Algorithm","authors":[{"name":"Mahzad Azarmehr","is_ca":true},{"name":"Roberto Muscedere","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02146739439286149,"gpt":0.2709714346652626,"spread":0.2495040402724011,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002233523,0.0003311419,0.0002488443,0.0004908106,0.0003899844,0.0007480733,0.0007484041,0.000408306,0.008811046],"category_scores_gemma":[0.0006524707,0.0001809642,0.0002154529,0.0006381195,0.0002503998,0.0005063002,0.0003774947,0.0005164391,0.003894843],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006119346,"about_ca_system_score_gemma":0.0007352855,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0007825851,"about_ca_topic_score_gemma":0.001857226,"domain_scores_codex":[0.9997162,0.00004668349,0.00002098386,0.00004097563,0.000155969,0.00001906638],"domain_scores_gemma":[0.9997497,0.00005224919,0.00002035003,0.00005694163,0.0001065474,0.00001412812],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.000585888,0.0001389115,0.001928053,0.0007294681,0.00006346919,0.0007126729,0.000341049,0.04061447,0.2803121,0.09905407,0.03649183,0.5390282],"study_design_scores_gemma":[0.0001644349,0.0009988282,0.003657396,0.0001691903,0.00007297074,0.002129855,0.0001027681,0.4324842,0.1911495,0.01735107,0.3515912,0.0001284115],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03026453,0.0008308736,0.920014,0.0002985431,0.0005049394,0.0002731198,0.0004671868,0.009039727,0.03830705],"genre_scores_gemma":[0.2677024,0.0005458744,0.7048835,0.0003843584,0.0001861306,0.0004591519,0.001128677,0.0003068481,0.0244032],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.008811046,"threshold_uncertainty_score":0.02947593,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}